./Ultimate.py --spec /mnt/goblint-svcomp/goblint-bench/bench/concrat/properties/no-data-race.prp --file /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-struct-tid.i --full-output --architecture 32bit


--------------------------------------------------------------------------------


Checking for data races
Using default analysis
Version 2329fc70
Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data -tc /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/config/AutomizerReach.xml -i /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-struct-tid.i -s /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) )

 --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash cfad0b2f92a7cfe2a62ca103d0ef6e2a604561400f9f39e859a6074e6dd658e5
--- Real Ultimate output ---
This is Ultimate 0.2.2-dev-2329fc7
[2024-02-28 18:25:07,058 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2024-02-28 18:25:07,059 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2024-02-28 18:25:07,081 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2024-02-28 18:25:07,081 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2024-02-28 18:25:07,082 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2024-02-28 18:25:07,083 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2024-02-28 18:25:07,084 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2024-02-28 18:25:07,085 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2024-02-28 18:25:07,086 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2024-02-28 18:25:07,086 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2024-02-28 18:25:07,087 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2024-02-28 18:25:07,088 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2024-02-28 18:25:07,088 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2024-02-28 18:25:07,089 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2024-02-28 18:25:07,090 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2024-02-28 18:25:07,091 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2024-02-28 18:25:07,091 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2024-02-28 18:25:07,093 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2024-02-28 18:25:07,094 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2024-02-28 18:25:07,095 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2024-02-28 18:25:07,096 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2024-02-28 18:25:07,096 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2024-02-28 18:25:07,097 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2024-02-28 18:25:07,100 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2024-02-28 18:25:07,100 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2024-02-28 18:25:07,100 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2024-02-28 18:25:07,101 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2024-02-28 18:25:07,101 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2024-02-28 18:25:07,102 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2024-02-28 18:25:07,102 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2024-02-28 18:25:07,103 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2024-02-28 18:25:07,103 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2024-02-28 18:25:07,104 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2024-02-28 18:25:07,104 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2024-02-28 18:25:07,104 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2024-02-28 18:25:07,105 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2024-02-28 18:25:07,105 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2024-02-28 18:25:07,105 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2024-02-28 18:25:07,106 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2024-02-28 18:25:07,106 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2024-02-28 18:25:07,107 INFO  L101        SettingsManager]: Beginning loading settings from /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf
[2024-02-28 18:25:07,124 INFO  L113        SettingsManager]: Loading preferences was successful
[2024-02-28 18:25:07,124 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2024-02-28 18:25:07,125 INFO  L136        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-02-28 18:25:07,125 INFO  L138        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-02-28 18:25:07,125 INFO  L136        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-02-28 18:25:07,125 INFO  L138        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-02-28 18:25:07,126 INFO  L136        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-02-28 18:25:07,126 INFO  L138        SettingsManager]:  * Create parallel compositions if possible=false
[2024-02-28 18:25:07,126 INFO  L138        SettingsManager]:  * Use SBE=true
[2024-02-28 18:25:07,126 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-02-28 18:25:07,126 INFO  L138        SettingsManager]:  * sizeof long=4
[2024-02-28 18:25:07,126 INFO  L138        SettingsManager]:  * Check unreachability of error function in SV-COMP mode=false
[2024-02-28 18:25:07,126 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2024-02-28 18:25:07,126 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2024-02-28 18:25:07,126 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2024-02-28 18:25:07,127 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2024-02-28 18:25:07,127 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-02-28 18:25:07,127 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2024-02-28 18:25:07,127 INFO  L138        SettingsManager]:  * Check absence of data races in concurrent programs=true
[2024-02-28 18:25:07,127 INFO  L138        SettingsManager]:  * sizeof long double=12
[2024-02-28 18:25:07,127 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2024-02-28 18:25:07,127 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2024-02-28 18:25:07,127 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2024-02-28 18:25:07,127 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-02-28 18:25:07,128 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-02-28 18:25:07,128 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2024-02-28 18:25:07,128 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2024-02-28 18:25:07,128 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-02-28 18:25:07,128 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2024-02-28 18:25:07,128 INFO  L138        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2024-02-28 18:25:07,128 INFO  L138        SettingsManager]:  * Trace refinement strategy=CAMEL
[2024-02-28 18:25:07,128 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-02-28 18:25:07,131 INFO  L138        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2024-02-28 18:25:07,131 INFO  L138        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2024-02-28 18:25:07,131 INFO  L138        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2024-02-28 18:25:07,131 INFO  L138        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2024-02-28 18:25:07,131 INFO  L138        SettingsManager]:  * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC
[2024-02-28 18:25:07,131 INFO  L138        SettingsManager]:  * Looper check in Petri net analysis=SEMANTIC
WARNING: An illegal reflective access operation has occurred
WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int)
WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1
WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations
WARNING: All illegal access operations will be denied in a future release
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) )


Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> cfad0b2f92a7cfe2a62ca103d0ef6e2a604561400f9f39e859a6074e6dd658e5
[2024-02-28 18:25:07,316 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-02-28 18:25:07,339 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-02-28 18:25:07,342 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-02-28 18:25:07,343 INFO  L271        PluginConnector]: Initializing CDTParser...
[2024-02-28 18:25:07,344 INFO  L275        PluginConnector]: CDTParser initialized
[2024-02-28 18:25:07,345 INFO  L432   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-struct-tid.i
[2024-02-28 18:25:08,387 INFO  L500              CDTParser]: Created temporary CDT project at NULL
[2024-02-28 18:25:08,623 INFO  L351              CDTParser]: Found 1 translation units.
[2024-02-28 18:25:08,624 INFO  L172              CDTParser]: Scanning /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-struct-tid.i
[2024-02-28 18:25:08,634 INFO  L394              CDTParser]: About to delete temporary CDT project at /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data/ecec344e1/75d5d39b5b15402e81152162e2493adf/FLAG7f0075725
[2024-02-28 18:25:08,644 INFO  L402              CDTParser]: Successfully deleted /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data/ecec344e1/75d5d39b5b15402e81152162e2493adf
[2024-02-28 18:25:08,646 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-02-28 18:25:08,647 INFO  L131        ToolchainWalker]: Walking toolchain with 6 elements.
[2024-02-28 18:25:08,648 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-02-28 18:25:08,648 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-02-28 18:25:08,651 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-02-28 18:25:08,652 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.02 06:25:08" (1/1) ...
[2024-02-28 18:25:08,652 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2585821b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 06:25:08, skipping insertion in model container
[2024-02-28 18:25:08,653 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.02 06:25:08" (1/1) ...
[2024-02-28 18:25:08,658 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2024-02-28 18:25:08,690 INFO  L178         MainTranslator]: Built tables and reachable declarations
[2024-02-28 18:25:08,804 WARN  L611        FunctionHandler]: implicit declaration of function __builtin_bswap16
[2024-02-28 18:25:08,930 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-02-28 18:25:08,937 INFO  L203         MainTranslator]: Completed pre-run
[2024-02-28 18:25:08,947 WARN  L611        FunctionHandler]: implicit declaration of function __builtin_bswap16
[2024-02-28 18:25:08,971 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-02-28 18:25:09,013 INFO  L208         MainTranslator]: Completed translation
[2024-02-28 18:25:09,013 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 06:25:09 WrapperNode
[2024-02-28 18:25:09,013 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-02-28 18:25:09,014 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-02-28 18:25:09,014 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-02-28 18:25:09,014 INFO  L275        PluginConnector]: Boogie Procedure Inliner initialized
[2024-02-28 18:25:09,019 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 06:25:09" (1/1) ...
[2024-02-28 18:25:09,045 INFO  L185        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 06:25:09" (1/1) ...
[2024-02-28 18:25:09,065 INFO  L138                Inliner]: procedures = 264, calls = 15, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 74
[2024-02-28 18:25:09,072 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-02-28 18:25:09,073 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-02-28 18:25:09,073 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2024-02-28 18:25:09,073 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2024-02-28 18:25:09,081 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 06:25:09" (1/1) ...
[2024-02-28 18:25:09,081 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 06:25:09" (1/1) ...
[2024-02-28 18:25:09,085 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 06:25:09" (1/1) ...
[2024-02-28 18:25:09,085 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 06:25:09" (1/1) ...
[2024-02-28 18:25:09,092 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 06:25:09" (1/1) ...
[2024-02-28 18:25:09,094 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 06:25:09" (1/1) ...
[2024-02-28 18:25:09,096 INFO  L185        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 06:25:09" (1/1) ...
[2024-02-28 18:25:09,097 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 06:25:09" (1/1) ...
[2024-02-28 18:25:09,099 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-02-28 18:25:09,100 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-02-28 18:25:09,100 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2024-02-28 18:25:09,100 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2024-02-28 18:25:09,101 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 06:25:09" (1/1) ...
[2024-02-28 18:25:09,106 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2024-02-28 18:25:09,115 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-02-28 18:25:09,129 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
[2024-02-28 18:25:09,134 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process
[2024-02-28 18:25:09,154 INFO  L130     BoogieDeclarations]: Found specification of procedure read~$Pointer$
[2024-02-28 18:25:09,155 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2024-02-28 18:25:09,155 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int
[2024-02-28 18:25:09,155 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2024-02-28 18:25:09,155 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap
[2024-02-28 18:25:09,155 INFO  L130     BoogieDeclarations]: Found specification of procedure write~$Pointer$
[2024-02-28 18:25:09,155 INFO  L130     BoogieDeclarations]: Found specification of procedure thread
[2024-02-28 18:25:09,155 INFO  L138     BoogieDeclarations]: Found implementation of procedure thread
[2024-02-28 18:25:09,155 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-02-28 18:25:09,155 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-02-28 18:25:09,157 WARN  L209             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement
[2024-02-28 18:25:09,290 INFO  L235             CfgBuilder]: Building ICFG
[2024-02-28 18:25:09,292 INFO  L261             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-02-28 18:25:09,469 INFO  L276             CfgBuilder]: Performing block encoding
[2024-02-28 18:25:09,476 INFO  L295             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-02-28 18:25:09,476 INFO  L300             CfgBuilder]: Removed 2 assume(true) statements.
[2024-02-28 18:25:09,478 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.02 06:25:09 BoogieIcfgContainer
[2024-02-28 18:25:09,478 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-02-28 18:25:09,479 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-02-28 18:25:09,479 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2024-02-28 18:25:09,482 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2024-02-28 18:25:09,482 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.02 06:25:08" (1/3) ...
[2024-02-28 18:25:09,482 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b01655a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.02 06:25:09, skipping insertion in model container
[2024-02-28 18:25:09,482 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 06:25:09" (2/3) ...
[2024-02-28 18:25:09,483 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b01655a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.02 06:25:09, skipping insertion in model container
[2024-02-28 18:25:09,483 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.02 06:25:09" (3/3) ...
[2024-02-28 18:25:09,484 INFO  L112   eAbstractionObserver]: Analyzing ICFG per-thread-struct-tid.i
[2024-02-28 18:25:09,490 WARN  L145   ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2024-02-28 18:25:09,498 INFO  L203   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-02-28 18:25:09,498 INFO  L162   ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations.
[2024-02-28 18:25:09,498 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2024-02-28 18:25:09,543 INFO  L144    ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions.
[2024-02-28 18:25:09,570 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 100 places, 101 transitions, 210 flow
[2024-02-28 18:25:09,614 INFO  L130       PetriNetUnfolder]: 6/142 cut-off events.
[2024-02-28 18:25:09,614 INFO  L131       PetriNetUnfolder]: For 1/1 co-relation queries the response was YES.
[2024-02-28 18:25:09,618 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 148 conditions, 142 events. 6/142 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 203 event pairs, 0 based on Foata normal form. 0/125 useless extension candidates. Maximal degree in co-relation 64. Up to 4 conditions per place. 
[2024-02-28 18:25:09,618 INFO  L82        GeneralOperation]: Start removeDead. Operand has 100 places, 101 transitions, 210 flow
[2024-02-28 18:25:09,621 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 100 places, 101 transitions, 210 flow
[2024-02-28 18:25:09,624 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2024-02-28 18:25:09,632 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 101 transitions, 210 flow
[2024-02-28 18:25:09,634 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 101 transitions, 210 flow
[2024-02-28 18:25:09,634 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 100 places, 101 transitions, 210 flow
[2024-02-28 18:25:09,719 INFO  L130       PetriNetUnfolder]: 6/142 cut-off events.
[2024-02-28 18:25:09,719 INFO  L131       PetriNetUnfolder]: For 1/1 co-relation queries the response was YES.
[2024-02-28 18:25:09,720 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 148 conditions, 142 events. 6/142 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 203 event pairs, 0 based on Foata normal form. 0/125 useless extension candidates. Maximal degree in co-relation 64. Up to 4 conditions per place. 
[2024-02-28 18:25:09,722 INFO  L119        LiptonReduction]: Number of co-enabled transitions 1410
[2024-02-28 18:25:11,509 INFO  L134        LiptonReduction]: Checked pairs total: 5574
[2024-02-28 18:25:11,509 INFO  L136        LiptonReduction]: Total number of compositions: 75
[2024-02-28 18:25:11,521 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-02-28 18:25:11,526 INFO  L357      AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@683c5bd1, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2024-02-28 18:25:11,526 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 7 error locations.
[2024-02-28 18:25:11,529 INFO  L130       PetriNetUnfolder]: 0/13 cut-off events.
[2024-02-28 18:25:11,529 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2024-02-28 18:25:11,529 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-02-28 18:25:11,530 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2024-02-28 18:25:11,530 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 4 more)] ===
[2024-02-28 18:25:11,534 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 18:25:11,534 INFO  L85        PathProgramCache]: Analyzing trace with hash -1050340217, now seen corresponding path program 1 times
[2024-02-28 18:25:11,540 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 18:25:11,541 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994502049]
[2024-02-28 18:25:11,541 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 18:25:11,541 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 18:25:11,629 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 18:25:11,910 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 18:25:11,910 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 18:25:11,911 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994502049]
[2024-02-28 18:25:11,911 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994502049] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 18:25:11,911 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 18:25:11,911 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-02-28 18:25:11,912 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144480669]
[2024-02-28 18:25:11,913 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 18:25:11,918 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-02-28 18:25:11,919 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 18:25:11,933 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-02-28 18:25:11,934 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-02-28 18:25:12,182 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 68 out of 176
[2024-02-28 18:25:12,185 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 38 transitions, 84 flow. Second operand  has 6 states, 6 states have (on average 69.16666666666667) internal successors, (415), 6 states have internal predecessors, (415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 18:25:12,185 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 18:25:12,185 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 176
[2024-02-28 18:25:12,186 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 18:25:12,404 INFO  L130       PetriNetUnfolder]: 135/363 cut-off events.
[2024-02-28 18:25:12,404 INFO  L131       PetriNetUnfolder]: For 1/1 co-relation queries the response was YES.
[2024-02-28 18:25:12,406 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 691 conditions, 363 events. 135/363 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1596 event pairs, 91 based on Foata normal form. 0/332 useless extension candidates. Maximal degree in co-relation 632. Up to 281 conditions per place. 
[2024-02-28 18:25:12,410 INFO  L137   encePairwiseOnDemand]: 165/176 looper letters, 37 selfloop transitions, 21 changer transitions 0/65 dead transitions.
[2024-02-28 18:25:12,410 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 65 transitions, 254 flow
[2024-02-28 18:25:12,412 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-02-28 18:25:12,415 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-02-28 18:25:12,423 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 468 transitions.
[2024-02-28 18:25:12,425 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.4431818181818182
[2024-02-28 18:25:12,426 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 468 transitions.
[2024-02-28 18:25:12,426 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 468 transitions.
[2024-02-28 18:25:12,428 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 18:25:12,430 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 468 transitions.
[2024-02-28 18:25:12,434 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 78.0) internal successors, (468), 6 states have internal predecessors, (468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 18:25:12,439 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 176.0) internal successors, (1232), 7 states have internal predecessors, (1232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 18:25:12,440 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 176.0) internal successors, (1232), 7 states have internal predecessors, (1232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 18:25:12,441 INFO  L175             Difference]: Start difference. First operand has 40 places, 38 transitions, 84 flow. Second operand 6 states and 468 transitions.
[2024-02-28 18:25:12,442 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 65 transitions, 254 flow
[2024-02-28 18:25:12,444 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 65 transitions, 254 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-02-28 18:25:12,446 INFO  L231             Difference]: Finished difference. Result has 48 places, 57 transitions, 206 flow
[2024-02-28 18:25:12,447 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=206, PETRI_PLACES=48, PETRI_TRANSITIONS=57}
[2024-02-28 18:25:12,451 INFO  L288   CegarLoopForPetriNet]: 40 programPoint places, 8 predicate places.
[2024-02-28 18:25:12,451 INFO  L495      AbstractCegarLoop]: Abstraction has has 48 places, 57 transitions, 206 flow
[2024-02-28 18:25:12,451 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 69.16666666666667) internal successors, (415), 6 states have internal predecessors, (415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 18:25:12,451 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-02-28 18:25:12,451 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 18:25:12,452 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-02-28 18:25:12,452 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 4 more)] ===
[2024-02-28 18:25:12,452 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 18:25:12,453 INFO  L85        PathProgramCache]: Analyzing trace with hash 647833824, now seen corresponding path program 1 times
[2024-02-28 18:25:12,453 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 18:25:12,453 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970508207]
[2024-02-28 18:25:12,453 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 18:25:12,453 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 18:25:12,463 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 18:25:12,501 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 18:25:12,502 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 18:25:12,502 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970508207]
[2024-02-28 18:25:12,502 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970508207] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 18:25:12,502 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 18:25:12,502 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-02-28 18:25:12,502 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218438871]
[2024-02-28 18:25:12,502 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 18:25:12,503 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-02-28 18:25:12,504 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 18:25:12,504 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-02-28 18:25:12,504 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-02-28 18:25:12,583 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 90 out of 176
[2024-02-28 18:25:12,584 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 57 transitions, 206 flow. Second operand  has 4 states, 4 states have (on average 90.75) internal successors, (363), 4 states have internal predecessors, (363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 18:25:12,584 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 18:25:12,584 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 176
[2024-02-28 18:25:12,584 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 18:25:12,668 INFO  L130       PetriNetUnfolder]: 55/234 cut-off events.
[2024-02-28 18:25:12,669 INFO  L131       PetriNetUnfolder]: For 28/36 co-relation queries the response was YES.
[2024-02-28 18:25:12,670 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 489 conditions, 234 events. 55/234 cut-off events. For 28/36 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 984 event pairs, 3 based on Foata normal form. 2/210 useless extension candidates. Maximal degree in co-relation 421. Up to 79 conditions per place. 
[2024-02-28 18:25:12,672 INFO  L137   encePairwiseOnDemand]: 172/176 looper letters, 25 selfloop transitions, 2 changer transitions 2/66 dead transitions.
[2024-02-28 18:25:12,672 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 66 transitions, 290 flow
[2024-02-28 18:25:12,673 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-02-28 18:25:12,673 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-02-28 18:25:12,676 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 385 transitions.
[2024-02-28 18:25:12,677 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.546875
[2024-02-28 18:25:12,678 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 385 transitions.
[2024-02-28 18:25:12,678 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 385 transitions.
[2024-02-28 18:25:12,678 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 18:25:12,679 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 385 transitions.
[2024-02-28 18:25:12,681 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 5 states, 4 states have (on average 96.25) internal successors, (385), 4 states have internal predecessors, (385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 18:25:12,683 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 5 states, 5 states have (on average 176.0) internal successors, (880), 5 states have internal predecessors, (880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 18:25:12,684 INFO  L81            ComplementDD]: Finished complementDD. Result  has 5 states, 5 states have (on average 176.0) internal successors, (880), 5 states have internal predecessors, (880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 18:25:12,684 INFO  L175             Difference]: Start difference. First operand has 48 places, 57 transitions, 206 flow. Second operand 4 states and 385 transitions.
[2024-02-28 18:25:12,684 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 66 transitions, 290 flow
[2024-02-28 18:25:12,687 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 66 transitions, 290 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-02-28 18:25:12,689 INFO  L231             Difference]: Finished difference. Result has 53 places, 57 transitions, 216 flow
[2024-02-28 18:25:12,689 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=216, PETRI_PLACES=53, PETRI_TRANSITIONS=57}
[2024-02-28 18:25:12,689 INFO  L288   CegarLoopForPetriNet]: 40 programPoint places, 13 predicate places.
[2024-02-28 18:25:12,689 INFO  L495      AbstractCegarLoop]: Abstraction has has 53 places, 57 transitions, 216 flow
[2024-02-28 18:25:12,690 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 90.75) internal successors, (363), 4 states have internal predecessors, (363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 18:25:12,690 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-02-28 18:25:12,690 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 18:25:12,690 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-02-28 18:25:12,690 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 4 more)] ===
[2024-02-28 18:25:12,691 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 18:25:12,691 INFO  L85        PathProgramCache]: Analyzing trace with hash -516340613, now seen corresponding path program 1 times
[2024-02-28 18:25:12,691 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 18:25:12,691 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718379446]
[2024-02-28 18:25:12,691 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 18:25:12,691 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 18:25:12,708 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 18:25:12,914 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 18:25:12,915 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 18:25:12,915 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718379446]
[2024-02-28 18:25:12,915 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718379446] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 18:25:12,915 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 18:25:12,915 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-02-28 18:25:12,916 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104052841]
[2024-02-28 18:25:12,916 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 18:25:12,916 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-02-28 18:25:12,916 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 18:25:12,917 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-02-28 18:25:12,917 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-02-28 18:25:13,069 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 71 out of 176
[2024-02-28 18:25:13,070 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 57 transitions, 216 flow. Second operand  has 6 states, 6 states have (on average 73.5) internal successors, (441), 6 states have internal predecessors, (441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 18:25:13,070 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 18:25:13,070 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 176
[2024-02-28 18:25:13,070 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 18:25:13,397 INFO  L130       PetriNetUnfolder]: 193/497 cut-off events.
[2024-02-28 18:25:13,397 INFO  L131       PetriNetUnfolder]: For 111/115 co-relation queries the response was YES.
[2024-02-28 18:25:13,400 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1266 conditions, 497 events. 193/497 cut-off events. For 111/115 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 2299 event pairs, 39 based on Foata normal form. 0/462 useless extension candidates. Maximal degree in co-relation 1182. Up to 339 conditions per place. 
[2024-02-28 18:25:13,403 INFO  L137   encePairwiseOnDemand]: 158/176 looper letters, 68 selfloop transitions, 57 changer transitions 5/137 dead transitions.
[2024-02-28 18:25:13,404 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 137 transitions, 714 flow
[2024-02-28 18:25:13,404 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-02-28 18:25:13,404 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-02-28 18:25:13,406 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 537 transitions.
[2024-02-28 18:25:13,407 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5085227272727273
[2024-02-28 18:25:13,407 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 537 transitions.
[2024-02-28 18:25:13,407 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 537 transitions.
[2024-02-28 18:25:13,408 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 18:25:13,408 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 537 transitions.
[2024-02-28 18:25:13,410 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 89.5) internal successors, (537), 6 states have internal predecessors, (537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 18:25:13,412 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 176.0) internal successors, (1232), 7 states have internal predecessors, (1232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 18:25:13,413 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 176.0) internal successors, (1232), 7 states have internal predecessors, (1232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 18:25:13,413 INFO  L175             Difference]: Start difference. First operand has 53 places, 57 transitions, 216 flow. Second operand 6 states and 537 transitions.
[2024-02-28 18:25:13,413 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 137 transitions, 714 flow
[2024-02-28 18:25:13,416 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 137 transitions, 692 flow, removed 5 selfloop flow, removed 3 redundant places.
[2024-02-28 18:25:13,418 INFO  L231             Difference]: Finished difference. Result has 58 places, 108 transitions, 562 flow
[2024-02-28 18:25:13,418 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=210, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=562, PETRI_PLACES=58, PETRI_TRANSITIONS=108}
[2024-02-28 18:25:13,418 INFO  L288   CegarLoopForPetriNet]: 40 programPoint places, 18 predicate places.
[2024-02-28 18:25:13,419 INFO  L495      AbstractCegarLoop]: Abstraction has has 58 places, 108 transitions, 562 flow
[2024-02-28 18:25:13,419 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 73.5) internal successors, (441), 6 states have internal predecessors, (441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 18:25:13,419 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-02-28 18:25:13,419 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 18:25:13,419 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-02-28 18:25:13,419 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 4 more)] ===
[2024-02-28 18:25:13,420 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 18:25:13,420 INFO  L85        PathProgramCache]: Analyzing trace with hash 1831922026, now seen corresponding path program 1 times
[2024-02-28 18:25:13,420 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 18:25:13,420 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062179788]
[2024-02-28 18:25:13,420 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 18:25:13,420 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 18:25:13,444 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 18:25:13,622 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-02-28 18:25:13,622 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 18:25:13,622 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062179788]
[2024-02-28 18:25:13,622 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062179788] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 18:25:13,622 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 18:25:13,623 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-02-28 18:25:13,623 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152653972]
[2024-02-28 18:25:13,623 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 18:25:13,623 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-02-28 18:25:13,623 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 18:25:13,624 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-02-28 18:25:13,624 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-02-28 18:25:13,801 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 72 out of 176
[2024-02-28 18:25:13,802 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 108 transitions, 562 flow. Second operand  has 6 states, 6 states have (on average 74.83333333333333) internal successors, (449), 6 states have internal predecessors, (449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 18:25:13,802 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 18:25:13,802 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 176
[2024-02-28 18:25:13,802 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 18:25:13,946 INFO  L130       PetriNetUnfolder]: 200/560 cut-off events.
[2024-02-28 18:25:13,946 INFO  L131       PetriNetUnfolder]: For 335/347 co-relation queries the response was YES.
[2024-02-28 18:25:13,948 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1821 conditions, 560 events. 200/560 cut-off events. For 335/347 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2835 event pairs, 43 based on Foata normal form. 1/539 useless extension candidates. Maximal degree in co-relation 1725. Up to 369 conditions per place. 
[2024-02-28 18:25:13,952 INFO  L137   encePairwiseOnDemand]: 165/176 looper letters, 87 selfloop transitions, 29 changer transitions 0/142 dead transitions.
[2024-02-28 18:25:13,952 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 142 transitions, 968 flow
[2024-02-28 18:25:13,959 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-02-28 18:25:13,959 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-02-28 18:25:13,960 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 489 transitions.
[2024-02-28 18:25:13,960 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.4630681818181818
[2024-02-28 18:25:13,960 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 489 transitions.
[2024-02-28 18:25:13,960 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 489 transitions.
[2024-02-28 18:25:13,961 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 18:25:13,961 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 489 transitions.
[2024-02-28 18:25:13,962 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 81.5) internal successors, (489), 6 states have internal predecessors, (489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 18:25:13,963 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 176.0) internal successors, (1232), 7 states have internal predecessors, (1232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 18:25:13,964 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 176.0) internal successors, (1232), 7 states have internal predecessors, (1232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 18:25:13,964 INFO  L175             Difference]: Start difference. First operand has 58 places, 108 transitions, 562 flow. Second operand 6 states and 489 transitions.
[2024-02-28 18:25:13,964 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 142 transitions, 968 flow
[2024-02-28 18:25:13,972 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 142 transitions, 932 flow, removed 18 selfloop flow, removed 0 redundant places.
[2024-02-28 18:25:13,974 INFO  L231             Difference]: Finished difference. Result has 67 places, 132 transitions, 808 flow
[2024-02-28 18:25:13,974 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=532, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=808, PETRI_PLACES=67, PETRI_TRANSITIONS=132}
[2024-02-28 18:25:13,975 INFO  L288   CegarLoopForPetriNet]: 40 programPoint places, 27 predicate places.
[2024-02-28 18:25:13,975 INFO  L495      AbstractCegarLoop]: Abstraction has has 67 places, 132 transitions, 808 flow
[2024-02-28 18:25:13,975 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 74.83333333333333) internal successors, (449), 6 states have internal predecessors, (449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 18:25:13,975 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-02-28 18:25:13,975 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1]
[2024-02-28 18:25:13,976 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-02-28 18:25:13,976 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 4 more)] ===
[2024-02-28 18:25:13,976 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 18:25:13,976 INFO  L85        PathProgramCache]: Analyzing trace with hash -2007496268, now seen corresponding path program 1 times
[2024-02-28 18:25:13,976 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 18:25:13,976 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825707912]
[2024-02-28 18:25:13,976 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 18:25:13,977 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 18:25:13,994 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-02-28 18:25:13,994 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-02-28 18:25:14,004 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-02-28 18:25:14,045 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-02-28 18:25:14,045 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2024-02-28 18:25:14,046 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining)
[2024-02-28 18:25:14,047 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (5 of 7 remaining)
[2024-02-28 18:25:14,048 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (4 of 7 remaining)
[2024-02-28 18:25:14,048 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (3 of 7 remaining)
[2024-02-28 18:25:14,048 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (2 of 7 remaining)
[2024-02-28 18:25:14,048 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 7 remaining)
[2024-02-28 18:25:14,048 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 7 remaining)
[2024-02-28 18:25:14,048 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-02-28 18:25:14,049 INFO  L445         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1]
[2024-02-28 18:25:14,050 WARN  L233   ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis
[2024-02-28 18:25:14,050 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances.
[2024-02-28 18:25:14,065 INFO  L144    ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions.
[2024-02-28 18:25:14,067 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 118 places, 118 transitions, 254 flow
[2024-02-28 18:25:14,085 INFO  L130       PetriNetUnfolder]: 11/257 cut-off events.
[2024-02-28 18:25:14,085 INFO  L131       PetriNetUnfolder]: For 6/6 co-relation queries the response was YES.
[2024-02-28 18:25:14,085 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 271 conditions, 257 events. 11/257 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 476 event pairs, 0 based on Foata normal form. 0/226 useless extension candidates. Maximal degree in co-relation 144. Up to 8 conditions per place. 
[2024-02-28 18:25:14,085 INFO  L82        GeneralOperation]: Start removeDead. Operand has 118 places, 118 transitions, 254 flow
[2024-02-28 18:25:14,086 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 118 places, 118 transitions, 254 flow
[2024-02-28 18:25:14,086 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2024-02-28 18:25:14,086 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 118 places, 118 transitions, 254 flow
[2024-02-28 18:25:14,087 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 118 places, 118 transitions, 254 flow
[2024-02-28 18:25:14,087 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 118 places, 118 transitions, 254 flow
[2024-02-28 18:25:14,101 INFO  L130       PetriNetUnfolder]: 11/257 cut-off events.
[2024-02-28 18:25:14,101 INFO  L131       PetriNetUnfolder]: For 6/6 co-relation queries the response was YES.
[2024-02-28 18:25:14,102 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 271 conditions, 257 events. 11/257 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 476 event pairs, 0 based on Foata normal form. 0/226 useless extension candidates. Maximal degree in co-relation 144. Up to 8 conditions per place. 
[2024-02-28 18:25:14,104 INFO  L119        LiptonReduction]: Number of co-enabled transitions 4200
[2024-02-28 18:25:15,548 INFO  L134        LiptonReduction]: Checked pairs total: 17458
[2024-02-28 18:25:15,549 INFO  L136        LiptonReduction]: Total number of compositions: 74
[2024-02-28 18:25:15,550 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-02-28 18:25:15,551 INFO  L357      AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@683c5bd1, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2024-02-28 18:25:15,551 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 8 error locations.
[2024-02-28 18:25:15,553 INFO  L130       PetriNetUnfolder]: 0/13 cut-off events.
[2024-02-28 18:25:15,553 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2024-02-28 18:25:15,553 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-02-28 18:25:15,553 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2024-02-28 18:25:15,553 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-02-28 18:25:15,553 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 18:25:15,553 INFO  L85        PathProgramCache]: Analyzing trace with hash 1843145426, now seen corresponding path program 1 times
[2024-02-28 18:25:15,554 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 18:25:15,554 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420360971]
[2024-02-28 18:25:15,554 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 18:25:15,554 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 18:25:15,565 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 18:25:15,680 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 18:25:15,680 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 18:25:15,680 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420360971]
[2024-02-28 18:25:15,680 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420360971] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 18:25:15,680 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 18:25:15,680 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-02-28 18:25:15,680 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846678786]
[2024-02-28 18:25:15,681 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 18:25:15,681 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-02-28 18:25:15,681 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 18:25:15,681 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-02-28 18:25:15,681 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-02-28 18:25:15,841 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 79 out of 192
[2024-02-28 18:25:15,841 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 54 transitions, 126 flow. Second operand  has 6 states, 6 states have (on average 80.16666666666667) internal successors, (481), 6 states have internal predecessors, (481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 18:25:15,842 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 18:25:15,842 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 192
[2024-02-28 18:25:15,842 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 18:25:16,362 INFO  L130       PetriNetUnfolder]: 2299/4146 cut-off events.
[2024-02-28 18:25:16,362 INFO  L131       PetriNetUnfolder]: For 58/58 co-relation queries the response was YES.
[2024-02-28 18:25:16,365 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 8058 conditions, 4146 events. 2299/4146 cut-off events. For 58/58 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 23085 event pairs, 1715 based on Foata normal form. 0/3930 useless extension candidates. Maximal degree in co-relation 1116. Up to 3508 conditions per place. 
[2024-02-28 18:25:16,376 INFO  L137   encePairwiseOnDemand]: 178/192 looper letters, 58 selfloop transitions, 37 changer transitions 0/106 dead transitions.
[2024-02-28 18:25:16,376 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 106 transitions, 420 flow
[2024-02-28 18:25:16,376 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-02-28 18:25:16,377 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-02-28 18:25:16,378 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 570 transitions.
[2024-02-28 18:25:16,378 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.4947916666666667
[2024-02-28 18:25:16,378 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 570 transitions.
[2024-02-28 18:25:16,378 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 570 transitions.
[2024-02-28 18:25:16,378 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 18:25:16,379 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 570 transitions.
[2024-02-28 18:25:16,380 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 95.0) internal successors, (570), 6 states have internal predecessors, (570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 18:25:16,381 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 192.0) internal successors, (1344), 7 states have internal predecessors, (1344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 18:25:16,381 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 192.0) internal successors, (1344), 7 states have internal predecessors, (1344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 18:25:16,381 INFO  L175             Difference]: Start difference. First operand has 57 places, 54 transitions, 126 flow. Second operand 6 states and 570 transitions.
[2024-02-28 18:25:16,382 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 106 transitions, 420 flow
[2024-02-28 18:25:16,382 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 106 transitions, 420 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-02-28 18:25:16,384 INFO  L231             Difference]: Finished difference. Result has 66 places, 90 transitions, 338 flow
[2024-02-28 18:25:16,384 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=338, PETRI_PLACES=66, PETRI_TRANSITIONS=90}
[2024-02-28 18:25:16,384 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, 9 predicate places.
[2024-02-28 18:25:16,384 INFO  L495      AbstractCegarLoop]: Abstraction has has 66 places, 90 transitions, 338 flow
[2024-02-28 18:25:16,385 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 80.16666666666667) internal successors, (481), 6 states have internal predecessors, (481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 18:25:16,385 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-02-28 18:25:16,385 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 18:25:16,385 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-02-28 18:25:16,385 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-02-28 18:25:16,385 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 18:25:16,385 INFO  L85        PathProgramCache]: Analyzing trace with hash 37653776, now seen corresponding path program 1 times
[2024-02-28 18:25:16,386 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 18:25:16,386 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815486558]
[2024-02-28 18:25:16,386 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 18:25:16,386 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 18:25:16,393 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 18:25:16,416 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 18:25:16,417 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 18:25:16,417 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815486558]
[2024-02-28 18:25:16,417 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815486558] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 18:25:16,417 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 18:25:16,417 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-02-28 18:25:16,417 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554600383]
[2024-02-28 18:25:16,417 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 18:25:16,417 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-02-28 18:25:16,418 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 18:25:16,418 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-02-28 18:25:16,418 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-02-28 18:25:16,485 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 104 out of 192
[2024-02-28 18:25:16,486 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 90 transitions, 338 flow. Second operand  has 4 states, 4 states have (on average 104.75) internal successors, (419), 4 states have internal predecessors, (419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 18:25:16,486 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 18:25:16,486 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 192
[2024-02-28 18:25:16,486 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 18:25:16,692 INFO  L130       PetriNetUnfolder]: 831/2045 cut-off events.
[2024-02-28 18:25:16,693 INFO  L131       PetriNetUnfolder]: For 351/391 co-relation queries the response was YES.
[2024-02-28 18:25:16,696 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 4465 conditions, 2045 events. 831/2045 cut-off events. For 351/391 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 13313 event pairs, 354 based on Foata normal form. 1/1904 useless extension candidates. Maximal degree in co-relation 2180. Up to 890 conditions per place. 
[2024-02-28 18:25:16,703 INFO  L137   encePairwiseOnDemand]: 188/192 looper letters, 31 selfloop transitions, 2 changer transitions 2/100 dead transitions.
[2024-02-28 18:25:16,703 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 100 transitions, 436 flow
[2024-02-28 18:25:16,703 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-02-28 18:25:16,704 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-02-28 18:25:16,704 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 447 transitions.
[2024-02-28 18:25:16,705 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.58203125
[2024-02-28 18:25:16,705 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 447 transitions.
[2024-02-28 18:25:16,705 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 447 transitions.
[2024-02-28 18:25:16,705 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 18:25:16,705 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 447 transitions.
[2024-02-28 18:25:16,706 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 5 states, 4 states have (on average 111.75) internal successors, (447), 4 states have internal predecessors, (447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 18:25:16,707 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 5 states, 5 states have (on average 192.0) internal successors, (960), 5 states have internal predecessors, (960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 18:25:16,708 INFO  L81            ComplementDD]: Finished complementDD. Result  has 5 states, 5 states have (on average 192.0) internal successors, (960), 5 states have internal predecessors, (960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 18:25:16,708 INFO  L175             Difference]: Start difference. First operand has 66 places, 90 transitions, 338 flow. Second operand 4 states and 447 transitions.
[2024-02-28 18:25:16,708 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 100 transitions, 436 flow
[2024-02-28 18:25:16,710 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 100 transitions, 436 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-02-28 18:25:16,711 INFO  L231             Difference]: Finished difference. Result has 71 places, 91 transitions, 352 flow
[2024-02-28 18:25:16,711 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=338, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=352, PETRI_PLACES=71, PETRI_TRANSITIONS=91}
[2024-02-28 18:25:16,712 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, 14 predicate places.
[2024-02-28 18:25:16,712 INFO  L495      AbstractCegarLoop]: Abstraction has has 71 places, 91 transitions, 352 flow
[2024-02-28 18:25:16,712 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 104.75) internal successors, (419), 4 states have internal predecessors, (419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 18:25:16,712 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-02-28 18:25:16,712 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 18:25:16,713 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2024-02-28 18:25:16,713 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-02-28 18:25:16,713 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 18:25:16,713 INFO  L85        PathProgramCache]: Analyzing trace with hash -1297270937, now seen corresponding path program 1 times
[2024-02-28 18:25:16,713 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 18:25:16,713 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556333397]
[2024-02-28 18:25:16,713 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 18:25:16,714 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 18:25:16,726 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 18:25:16,882 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 18:25:16,882 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 18:25:16,883 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556333397]
[2024-02-28 18:25:16,883 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556333397] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 18:25:16,883 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 18:25:16,883 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-02-28 18:25:16,883 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126253929]
[2024-02-28 18:25:16,883 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 18:25:16,884 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-02-28 18:25:16,884 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 18:25:16,884 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-02-28 18:25:16,884 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-02-28 18:25:16,983 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 82 out of 192
[2024-02-28 18:25:16,983 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 91 transitions, 352 flow. Second operand  has 6 states, 6 states have (on average 84.5) internal successors, (507), 6 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 18:25:16,983 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 18:25:16,983 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 192
[2024-02-28 18:25:16,984 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 18:25:17,720 INFO  L130       PetriNetUnfolder]: 3649/6392 cut-off events.
[2024-02-28 18:25:17,721 INFO  L131       PetriNetUnfolder]: For 1465/1507 co-relation queries the response was YES.
[2024-02-28 18:25:17,728 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 16449 conditions, 6392 events. 3649/6392 cut-off events. For 1465/1507 co-relation queries the response was YES. Maximal size of possible extension queue 213. Compared 38348 event pairs, 1337 based on Foata normal form. 0/6111 useless extension candidates. Maximal degree in co-relation 16362. Up to 4916 conditions per place. 
[2024-02-28 18:25:17,750 INFO  L137   encePairwiseOnDemand]: 166/192 looper letters, 131 selfloop transitions, 89 changer transitions 0/231 dead transitions.
[2024-02-28 18:25:17,751 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 231 transitions, 1222 flow
[2024-02-28 18:25:17,752 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-02-28 18:25:17,752 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-02-28 18:25:17,753 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 672 transitions.
[2024-02-28 18:25:17,753 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5833333333333334
[2024-02-28 18:25:17,753 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 672 transitions.
[2024-02-28 18:25:17,753 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 672 transitions.
[2024-02-28 18:25:17,754 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 18:25:17,754 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 672 transitions.
[2024-02-28 18:25:17,755 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 112.0) internal successors, (672), 6 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 18:25:17,756 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 192.0) internal successors, (1344), 7 states have internal predecessors, (1344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 18:25:17,757 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 192.0) internal successors, (1344), 7 states have internal predecessors, (1344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 18:25:17,757 INFO  L175             Difference]: Start difference. First operand has 71 places, 91 transitions, 352 flow. Second operand 6 states and 672 transitions.
[2024-02-28 18:25:17,757 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 231 transitions, 1222 flow
[2024-02-28 18:25:17,761 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 231 transitions, 1206 flow, removed 5 selfloop flow, removed 2 redundant places.
[2024-02-28 18:25:17,763 INFO  L231             Difference]: Finished difference. Result has 77 places, 175 transitions, 910 flow
[2024-02-28 18:25:17,763 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=348, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=910, PETRI_PLACES=77, PETRI_TRANSITIONS=175}
[2024-02-28 18:25:17,764 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, 20 predicate places.
[2024-02-28 18:25:17,764 INFO  L495      AbstractCegarLoop]: Abstraction has has 77 places, 175 transitions, 910 flow
[2024-02-28 18:25:17,764 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 84.5) internal successors, (507), 6 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 18:25:17,764 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-02-28 18:25:17,764 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 18:25:17,765 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2024-02-28 18:25:17,765 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-02-28 18:25:17,765 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 18:25:17,765 INFO  L85        PathProgramCache]: Analyzing trace with hash 490022662, now seen corresponding path program 1 times
[2024-02-28 18:25:17,765 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 18:25:17,765 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896618979]
[2024-02-28 18:25:17,765 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 18:25:17,765 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 18:25:17,775 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 18:25:17,962 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-02-28 18:25:17,962 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 18:25:17,962 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896618979]
[2024-02-28 18:25:17,962 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896618979] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 18:25:17,962 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 18:25:17,962 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-02-28 18:25:17,962 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107799973]
[2024-02-28 18:25:17,962 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 18:25:17,963 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-02-28 18:25:17,963 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 18:25:17,963 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-02-28 18:25:17,963 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-02-28 18:25:18,110 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 83 out of 192
[2024-02-28 18:25:18,111 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 175 transitions, 910 flow. Second operand  has 6 states, 6 states have (on average 85.83333333333333) internal successors, (515), 6 states have internal predecessors, (515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 18:25:18,111 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 18:25:18,111 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 192
[2024-02-28 18:25:18,111 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 18:25:18,852 INFO  L130       PetriNetUnfolder]: 4197/7805 cut-off events.
[2024-02-28 18:25:18,853 INFO  L131       PetriNetUnfolder]: For 6317/6605 co-relation queries the response was YES.
[2024-02-28 18:25:18,864 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 25509 conditions, 7805 events. 4197/7805 cut-off events. For 6317/6605 co-relation queries the response was YES. Maximal size of possible extension queue 249. Compared 51218 event pairs, 1254 based on Foata normal form. 11/7497 useless extension candidates. Maximal degree in co-relation 20095. Up to 5830 conditions per place. 
[2024-02-28 18:25:18,890 INFO  L137   encePairwiseOnDemand]: 172/192 looper letters, 160 selfloop transitions, 69 changer transitions 0/258 dead transitions.
[2024-02-28 18:25:18,890 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 258 transitions, 1801 flow
[2024-02-28 18:25:18,891 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-02-28 18:25:18,891 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-02-28 18:25:18,892 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 604 transitions.
[2024-02-28 18:25:18,892 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5243055555555556
[2024-02-28 18:25:18,892 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 604 transitions.
[2024-02-28 18:25:18,892 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 604 transitions.
[2024-02-28 18:25:18,893 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 18:25:18,893 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 604 transitions.
[2024-02-28 18:25:18,894 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 100.66666666666667) internal successors, (604), 6 states have internal predecessors, (604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 18:25:18,895 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 192.0) internal successors, (1344), 7 states have internal predecessors, (1344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 18:25:18,895 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 192.0) internal successors, (1344), 7 states have internal predecessors, (1344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 18:25:18,896 INFO  L175             Difference]: Start difference. First operand has 77 places, 175 transitions, 910 flow. Second operand 6 states and 604 transitions.
[2024-02-28 18:25:18,896 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 258 transitions, 1801 flow
[2024-02-28 18:25:18,931 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 258 transitions, 1701 flow, removed 50 selfloop flow, removed 0 redundant places.
[2024-02-28 18:25:18,933 INFO  L231             Difference]: Finished difference. Result has 87 places, 235 transitions, 1526 flow
[2024-02-28 18:25:18,934 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=848, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=175, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1526, PETRI_PLACES=87, PETRI_TRANSITIONS=235}
[2024-02-28 18:25:18,934 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, 30 predicate places.
[2024-02-28 18:25:18,934 INFO  L495      AbstractCegarLoop]: Abstraction has has 87 places, 235 transitions, 1526 flow
[2024-02-28 18:25:18,935 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 85.83333333333333) internal successors, (515), 6 states have internal predecessors, (515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 18:25:18,935 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-02-28 18:25:18,935 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 18:25:18,935 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2024-02-28 18:25:18,935 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-02-28 18:25:18,935 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 18:25:18,935 INFO  L85        PathProgramCache]: Analyzing trace with hash -1420041874, now seen corresponding path program 1 times
[2024-02-28 18:25:18,936 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 18:25:18,936 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575245029]
[2024-02-28 18:25:18,936 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 18:25:18,936 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 18:25:18,951 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 18:25:19,243 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 18:25:19,243 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 18:25:19,243 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575245029]
[2024-02-28 18:25:19,243 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575245029] provided 0 perfect and 1 imperfect interpolant sequences
[2024-02-28 18:25:19,243 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [720873068]
[2024-02-28 18:25:19,243 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 18:25:19,244 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-02-28 18:25:19,244 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-02-28 18:25:19,246 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-02-28 18:25:19,248 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2024-02-28 18:25:19,330 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 18:25:19,332 INFO  L263         TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 31 conjunts are in the unsatisfiable core
[2024-02-28 18:25:19,335 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-02-28 18:25:19,368 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2024-02-28 18:25:19,383 INFO  L321             Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2024-02-28 18:25:19,383 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11
[2024-02-28 18:25:19,406 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11
[2024-02-28 18:25:19,417 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27
[2024-02-28 18:25:19,435 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-02-28 18:25:19,436 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42
[2024-02-28 18:25:19,455 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-02-28 18:25:19,456 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57
[2024-02-28 18:25:19,495 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50
[2024-02-28 18:25:19,504 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 18:25:19,505 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2024-02-28 18:25:19,627 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 18:25:19,628 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [720873068] provided 0 perfect and 2 imperfect interpolant sequences
[2024-02-28 18:25:19,628 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-02-28 18:25:19,628 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 10
[2024-02-28 18:25:19,628 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247379432]
[2024-02-28 18:25:19,628 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-02-28 18:25:19,628 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 12 states
[2024-02-28 18:25:19,628 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 18:25:19,629 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2024-02-28 18:25:19,629 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132
[2024-02-28 18:25:20,099 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 75 out of 192
[2024-02-28 18:25:20,100 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 235 transitions, 1526 flow. Second operand  has 12 states, 12 states have (on average 76.66666666666667) internal successors, (920), 12 states have internal predecessors, (920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 18:25:20,100 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 18:25:20,100 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 192
[2024-02-28 18:25:20,100 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 18:25:21,512 INFO  L130       PetriNetUnfolder]: 4656/8478 cut-off events.
[2024-02-28 18:25:21,513 INFO  L131       PetriNetUnfolder]: For 12874/13089 co-relation queries the response was YES.
[2024-02-28 18:25:21,532 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 32369 conditions, 8478 events. 4656/8478 cut-off events. For 12874/13089 co-relation queries the response was YES. Maximal size of possible extension queue 270. Compared 54154 event pairs, 1418 based on Foata normal form. 0/8147 useless extension candidates. Maximal degree in co-relation 22476. Up to 6478 conditions per place. 
[2024-02-28 18:25:21,562 INFO  L137   encePairwiseOnDemand]: 172/192 looper letters, 329 selfloop transitions, 74 changer transitions 0/415 dead transitions.
[2024-02-28 18:25:21,563 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 415 transitions, 3510 flow
[2024-02-28 18:25:21,564 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2024-02-28 18:25:21,564 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-02-28 18:25:21,565 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 970 transitions.
[2024-02-28 18:25:21,566 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.45928030303030304
[2024-02-28 18:25:21,566 INFO  L72            ComplementDD]: Start complementDD. Operand 11 states and 970 transitions.
[2024-02-28 18:25:21,566 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 11 states and 970 transitions.
[2024-02-28 18:25:21,567 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 18:25:21,567 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 970 transitions.
[2024-02-28 18:25:21,569 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 12 states, 11 states have (on average 88.18181818181819) internal successors, (970), 11 states have internal predecessors, (970), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 18:25:21,571 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 12 states, 12 states have (on average 192.0) internal successors, (2304), 12 states have internal predecessors, (2304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 18:25:21,571 INFO  L81            ComplementDD]: Finished complementDD. Result  has 12 states, 12 states have (on average 192.0) internal successors, (2304), 12 states have internal predecessors, (2304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 18:25:21,572 INFO  L175             Difference]: Start difference. First operand has 87 places, 235 transitions, 1526 flow. Second operand 11 states and 970 transitions.
[2024-02-28 18:25:21,572 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 415 transitions, 3510 flow
[2024-02-28 18:25:21,632 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 415 transitions, 3274 flow, removed 118 selfloop flow, removed 0 redundant places.
[2024-02-28 18:25:21,636 INFO  L231             Difference]: Finished difference. Result has 104 places, 271 transitions, 1985 flow
[2024-02-28 18:25:21,636 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=1408, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=235, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=166, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1985, PETRI_PLACES=104, PETRI_TRANSITIONS=271}
[2024-02-28 18:25:21,637 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, 47 predicate places.
[2024-02-28 18:25:21,637 INFO  L495      AbstractCegarLoop]: Abstraction has has 104 places, 271 transitions, 1985 flow
[2024-02-28 18:25:21,637 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 12 states, 12 states have (on average 76.66666666666667) internal successors, (920), 12 states have internal predecessors, (920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 18:25:21,637 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-02-28 18:25:21,638 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 18:25:21,646 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0
[2024-02-28 18:25:21,838 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9
[2024-02-28 18:25:21,839 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-02-28 18:25:21,840 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 18:25:21,840 INFO  L85        PathProgramCache]: Analyzing trace with hash 668269293, now seen corresponding path program 1 times
[2024-02-28 18:25:21,841 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 18:25:21,841 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207391609]
[2024-02-28 18:25:21,841 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 18:25:21,842 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 18:25:21,888 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 18:25:22,159 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 18:25:22,160 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 18:25:22,160 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207391609]
[2024-02-28 18:25:22,160 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207391609] provided 0 perfect and 1 imperfect interpolant sequences
[2024-02-28 18:25:22,160 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [68457201]
[2024-02-28 18:25:22,161 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 18:25:22,161 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-02-28 18:25:22,161 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-02-28 18:25:22,162 INFO  L229       MonitoredProcess]: Starting monitored process 3 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-02-28 18:25:22,166 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2024-02-28 18:25:22,269 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 18:25:22,271 INFO  L263         TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 31 conjunts are in the unsatisfiable core
[2024-02-28 18:25:22,274 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-02-28 18:25:22,280 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2024-02-28 18:25:22,293 INFO  L321             Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2024-02-28 18:25:22,294 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11
[2024-02-28 18:25:22,314 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9
[2024-02-28 18:25:22,321 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22
[2024-02-28 18:25:22,337 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-02-28 18:25:22,337 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34
[2024-02-28 18:25:22,352 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-02-28 18:25:22,352 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 46
[2024-02-28 18:25:22,369 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39
[2024-02-28 18:25:22,377 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 18:25:22,377 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2024-02-28 18:25:22,396 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_456 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_456) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 6)))) (forall ((v_ArrVal_456 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_456) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 4)))) (forall ((v_ArrVal_456 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_456) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 5)))) (forall ((v_ArrVal_456 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_456) c_threadThread1of2ForFork0_~t~0.base) (+ 7 c_threadThread1of2ForFork0_~t~0.offset))))) is different from false
[2024-02-28 18:25:22,412 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ 7 c_threadThread1of2ForFork0_~t~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_456 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_456) c_threadThread1of2ForFork0_~t~0.base) .cse1))) (forall ((v_ArrVal_456 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_456) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 6)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_456 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_456) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 5)))) (forall ((v_ArrVal_456 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_456) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 4))))))) is different from false
[2024-02-28 18:25:22,433 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 6)) (.cse2 (+ 7 c_threadThread1of2ForFork0_~t~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_456 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_456) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 5)))) (forall ((v_ArrVal_456 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_456) c_threadThread1of2ForFork0_~t~0.base) .cse1) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_456 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_456) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 4)))) (forall ((v_ArrVal_456 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_456) c_threadThread1of2ForFork0_~t~0.base) .cse2)))))) is different from false
[2024-02-28 18:25:22,530 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked.
[2024-02-28 18:25:22,531 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [68457201] provided 0 perfect and 2 imperfect interpolant sequences
[2024-02-28 18:25:22,531 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-02-28 18:25:22,531 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 13
[2024-02-28 18:25:22,531 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256123107]
[2024-02-28 18:25:22,532 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-02-28 18:25:22,532 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 15 states
[2024-02-28 18:25:22,532 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 18:25:22,532 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants.
[2024-02-28 18:25:22,533 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=102, Unknown=3, NotChecked=66, Total=210
[2024-02-28 18:25:22,592 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 58 out of 192
[2024-02-28 18:25:22,594 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 271 transitions, 1985 flow. Second operand  has 15 states, 15 states have (on average 59.666666666666664) internal successors, (895), 15 states have internal predecessors, (895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 18:25:22,594 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 18:25:22,594 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 58 of 192
[2024-02-28 18:25:22,594 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 18:25:25,994 INFO  L130       PetriNetUnfolder]: 9089/15228 cut-off events.
[2024-02-28 18:25:25,994 INFO  L131       PetriNetUnfolder]: For 26270/26274 co-relation queries the response was YES.
[2024-02-28 18:25:26,027 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 61251 conditions, 15228 events. 9089/15228 cut-off events. For 26270/26274 co-relation queries the response was YES. Maximal size of possible extension queue 465. Compared 98016 event pairs, 1448 based on Foata normal form. 4/13846 useless extension candidates. Maximal degree in co-relation 48685. Up to 7856 conditions per place. 
[2024-02-28 18:25:26,077 INFO  L137   encePairwiseOnDemand]: 143/192 looper letters, 578 selfloop transitions, 532 changer transitions 9/1123 dead transitions.
[2024-02-28 18:25:26,077 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 1123 transitions, 9568 flow
[2024-02-28 18:25:26,078 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. 
[2024-02-28 18:25:26,078 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 19 states.
[2024-02-28 18:25:26,081 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 1636 transitions.
[2024-02-28 18:25:26,081 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.44846491228070173
[2024-02-28 18:25:26,082 INFO  L72            ComplementDD]: Start complementDD. Operand 19 states and 1636 transitions.
[2024-02-28 18:25:26,082 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 19 states and 1636 transitions.
[2024-02-28 18:25:26,082 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 18:25:26,082 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 1636 transitions.
[2024-02-28 18:25:26,085 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 20 states, 19 states have (on average 86.10526315789474) internal successors, (1636), 19 states have internal predecessors, (1636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 18:25:26,089 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 20 states, 20 states have (on average 192.0) internal successors, (3840), 20 states have internal predecessors, (3840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 18:25:26,089 INFO  L81            ComplementDD]: Finished complementDD. Result  has 20 states, 20 states have (on average 192.0) internal successors, (3840), 20 states have internal predecessors, (3840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 18:25:26,089 INFO  L175             Difference]: Start difference. First operand has 104 places, 271 transitions, 1985 flow. Second operand 19 states and 1636 transitions.
[2024-02-28 18:25:26,089 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 1123 transitions, 9568 flow
[2024-02-28 18:25:26,280 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 1123 transitions, 9556 flow, removed 4 selfloop flow, removed 2 redundant places.
[2024-02-28 18:25:26,377 INFO  L231             Difference]: Finished difference. Result has 131 places, 771 transitions, 7820 flow
[2024-02-28 18:25:26,377 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=1974, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=271, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=138, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=7820, PETRI_PLACES=131, PETRI_TRANSITIONS=771}
[2024-02-28 18:25:26,378 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, 74 predicate places.
[2024-02-28 18:25:26,378 INFO  L495      AbstractCegarLoop]: Abstraction has has 131 places, 771 transitions, 7820 flow
[2024-02-28 18:25:26,378 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 15 states, 15 states have (on average 59.666666666666664) internal successors, (895), 15 states have internal predecessors, (895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 18:25:26,378 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-02-28 18:25:26,378 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 18:25:26,384 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0
[2024-02-28 18:25:26,580 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,3 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-02-28 18:25:26,580 INFO  L420      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-02-28 18:25:26,581 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 18:25:26,581 INFO  L85        PathProgramCache]: Analyzing trace with hash -220900113, now seen corresponding path program 1 times
[2024-02-28 18:25:26,581 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 18:25:26,581 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848186951]
[2024-02-28 18:25:26,582 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 18:25:26,582 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 18:25:26,601 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 18:25:26,814 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 18:25:26,815 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 18:25:26,815 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848186951]
[2024-02-28 18:25:26,815 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848186951] provided 0 perfect and 1 imperfect interpolant sequences
[2024-02-28 18:25:26,815 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [476871434]
[2024-02-28 18:25:26,815 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 18:25:26,815 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-02-28 18:25:26,815 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-02-28 18:25:26,816 INFO  L229       MonitoredProcess]: Starting monitored process 4 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-02-28 18:25:26,817 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2024-02-28 18:25:26,898 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 18:25:26,899 INFO  L263         TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 31 conjunts are in the unsatisfiable core
[2024-02-28 18:25:26,902 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-02-28 18:25:26,906 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2024-02-28 18:25:26,915 INFO  L321             Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2024-02-28 18:25:26,915 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11
[2024-02-28 18:25:26,937 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11
[2024-02-28 18:25:26,945 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27
[2024-02-28 18:25:26,954 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-02-28 18:25:26,954 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42
[2024-02-28 18:25:26,970 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-02-28 18:25:26,970 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57
[2024-02-28 18:25:26,987 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50
[2024-02-28 18:25:26,995 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 18:25:26,995 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2024-02-28 18:25:27,096 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 18:25:27,097 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [476871434] provided 0 perfect and 2 imperfect interpolant sequences
[2024-02-28 18:25:27,097 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-02-28 18:25:27,097 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 10
[2024-02-28 18:25:27,097 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012435054]
[2024-02-28 18:25:27,097 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-02-28 18:25:27,097 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 12 states
[2024-02-28 18:25:27,098 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 18:25:27,098 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2024-02-28 18:25:27,098 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132
[2024-02-28 18:25:27,514 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 75 out of 192
[2024-02-28 18:25:27,515 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 771 transitions, 7820 flow. Second operand  has 12 states, 12 states have (on average 76.75) internal successors, (921), 12 states have internal predecessors, (921), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 18:25:27,515 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 18:25:27,515 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 192
[2024-02-28 18:25:27,515 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 18:25:30,485 INFO  L130       PetriNetUnfolder]: 8746/15150 cut-off events.
[2024-02-28 18:25:30,485 INFO  L131       PetriNetUnfolder]: For 62441/63984 co-relation queries the response was YES.
[2024-02-28 18:25:30,554 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 88265 conditions, 15150 events. 8746/15150 cut-off events. For 62441/63984 co-relation queries the response was YES. Maximal size of possible extension queue 526. Compared 104065 event pairs, 626 based on Foata normal form. 179/14802 useless extension candidates. Maximal degree in co-relation 86284. Up to 10299 conditions per place. 
[2024-02-28 18:25:30,630 INFO  L137   encePairwiseOnDemand]: 176/192 looper letters, 839 selfloop transitions, 358 changer transitions 2/1229 dead transitions.
[2024-02-28 18:25:30,630 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 1229 transitions, 15058 flow
[2024-02-28 18:25:30,631 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. 
[2024-02-28 18:25:30,631 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 12 states.
[2024-02-28 18:25:30,633 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1079 transitions.
[2024-02-28 18:25:30,633 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.4683159722222222
[2024-02-28 18:25:30,633 INFO  L72            ComplementDD]: Start complementDD. Operand 12 states and 1079 transitions.
[2024-02-28 18:25:30,634 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 12 states and 1079 transitions.
[2024-02-28 18:25:30,634 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 18:25:30,635 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1079 transitions.
[2024-02-28 18:25:30,637 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 13 states, 12 states have (on average 89.91666666666667) internal successors, (1079), 12 states have internal predecessors, (1079), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 18:25:30,639 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 13 states, 13 states have (on average 192.0) internal successors, (2496), 13 states have internal predecessors, (2496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 18:25:30,639 INFO  L81            ComplementDD]: Finished complementDD. Result  has 13 states, 13 states have (on average 192.0) internal successors, (2496), 13 states have internal predecessors, (2496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 18:25:30,640 INFO  L175             Difference]: Start difference. First operand has 131 places, 771 transitions, 7820 flow. Second operand 12 states and 1079 transitions.
[2024-02-28 18:25:30,640 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 1229 transitions, 15058 flow
[2024-02-28 18:25:31,866 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 1229 transitions, 14413 flow, removed 318 selfloop flow, removed 4 redundant places.
[2024-02-28 18:25:31,883 INFO  L231             Difference]: Finished difference. Result has 143 places, 1023 transitions, 11838 flow
[2024-02-28 18:25:31,883 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=7529, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=771, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=157, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=559, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=11838, PETRI_PLACES=143, PETRI_TRANSITIONS=1023}
[2024-02-28 18:25:31,884 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, 86 predicate places.
[2024-02-28 18:25:31,884 INFO  L495      AbstractCegarLoop]: Abstraction has has 143 places, 1023 transitions, 11838 flow
[2024-02-28 18:25:31,884 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 12 states, 12 states have (on average 76.75) internal successors, (921), 12 states have internal predecessors, (921), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 18:25:31,884 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-02-28 18:25:31,885 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 18:25:31,890 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0
[2024-02-28 18:25:32,090 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11
[2024-02-28 18:25:32,093 INFO  L420      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-02-28 18:25:32,094 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 18:25:32,094 INFO  L85        PathProgramCache]: Analyzing trace with hash -972504981, now seen corresponding path program 2 times
[2024-02-28 18:25:32,094 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 18:25:32,095 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590611495]
[2024-02-28 18:25:32,095 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 18:25:32,096 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 18:25:32,118 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 18:25:32,376 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 18:25:32,376 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 18:25:32,376 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590611495]
[2024-02-28 18:25:32,377 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590611495] provided 0 perfect and 1 imperfect interpolant sequences
[2024-02-28 18:25:32,377 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [762163560]
[2024-02-28 18:25:32,377 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2024-02-28 18:25:32,377 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-02-28 18:25:32,378 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-02-28 18:25:32,379 INFO  L229       MonitoredProcess]: Starting monitored process 5 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-02-28 18:25:32,382 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process
[2024-02-28 18:25:32,526 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2024-02-28 18:25:32,527 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-02-28 18:25:32,529 INFO  L263         TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 44 conjunts are in the unsatisfiable core
[2024-02-28 18:25:32,531 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-02-28 18:25:32,540 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2024-02-28 18:25:32,572 INFO  L321             Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2024-02-28 18:25:32,573 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11
[2024-02-28 18:25:32,713 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11
[2024-02-28 18:25:32,751 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27
[2024-02-28 18:25:32,797 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42
[2024-02-28 18:25:32,877 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 40
[2024-02-28 18:25:32,898 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 57
[2024-02-28 18:25:32,942 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50
[2024-02-28 18:25:32,971 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 18:25:32,971 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2024-02-28 18:25:33,105 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 18:25:33,105 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [762163560] provided 0 perfect and 2 imperfect interpolant sequences
[2024-02-28 18:25:33,105 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-02-28 18:25:33,105 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 9] total 20
[2024-02-28 18:25:33,106 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794817403]
[2024-02-28 18:25:33,106 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-02-28 18:25:33,106 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 22 states
[2024-02-28 18:25:33,106 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 18:25:33,107 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants.
[2024-02-28 18:25:33,107 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=385, Unknown=0, NotChecked=0, Total=462
[2024-02-28 18:25:34,104 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 75 out of 192
[2024-02-28 18:25:34,106 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 1023 transitions, 11838 flow. Second operand  has 22 states, 22 states have (on average 76.81818181818181) internal successors, (1690), 22 states have internal predecessors, (1690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 18:25:34,106 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 18:25:34,106 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 192
[2024-02-28 18:25:34,106 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 18:25:38,384 INFO  L130       PetriNetUnfolder]: 9057/15823 cut-off events.
[2024-02-28 18:25:38,384 INFO  L131       PetriNetUnfolder]: For 80875/82329 co-relation queries the response was YES.
[2024-02-28 18:25:38,444 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 95075 conditions, 15823 events. 9057/15823 cut-off events. For 80875/82329 co-relation queries the response was YES. Maximal size of possible extension queue 545. Compared 109257 event pairs, 657 based on Foata normal form. 152/15449 useless extension candidates. Maximal degree in co-relation 93109. Up to 11155 conditions per place. 
[2024-02-28 18:25:38,525 INFO  L137   encePairwiseOnDemand]: 171/192 looper letters, 1149 selfloop transitions, 376 changer transitions 16/1571 dead transitions.
[2024-02-28 18:25:38,526 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 1571 transitions, 20634 flow
[2024-02-28 18:25:38,526 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. 
[2024-02-28 18:25:38,526 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 21 states.
[2024-02-28 18:25:38,529 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 1834 transitions.
[2024-02-28 18:25:38,530 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.4548611111111111
[2024-02-28 18:25:38,530 INFO  L72            ComplementDD]: Start complementDD. Operand 21 states and 1834 transitions.
[2024-02-28 18:25:38,530 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 21 states and 1834 transitions.
[2024-02-28 18:25:38,531 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 18:25:38,531 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 1834 transitions.
[2024-02-28 18:25:38,534 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 22 states, 21 states have (on average 87.33333333333333) internal successors, (1834), 21 states have internal predecessors, (1834), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 18:25:38,537 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 22 states, 22 states have (on average 192.0) internal successors, (4224), 22 states have internal predecessors, (4224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 18:25:38,538 INFO  L81            ComplementDD]: Finished complementDD. Result  has 22 states, 22 states have (on average 192.0) internal successors, (4224), 22 states have internal predecessors, (4224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 18:25:38,538 INFO  L175             Difference]: Start difference. First operand has 143 places, 1023 transitions, 11838 flow. Second operand 21 states and 1834 transitions.
[2024-02-28 18:25:38,538 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 1571 transitions, 20634 flow
[2024-02-28 18:25:39,873 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 1571 transitions, 20199 flow, removed 205 selfloop flow, removed 5 redundant places.
[2024-02-28 18:25:39,892 INFO  L231             Difference]: Finished difference. Result has 166 places, 1174 transitions, 14603 flow
[2024-02-28 18:25:39,892 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=11423, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1023, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=225, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=732, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=14603, PETRI_PLACES=166, PETRI_TRANSITIONS=1174}
[2024-02-28 18:25:39,893 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, 109 predicate places.
[2024-02-28 18:25:39,893 INFO  L495      AbstractCegarLoop]: Abstraction has has 166 places, 1174 transitions, 14603 flow
[2024-02-28 18:25:39,893 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 22 states, 22 states have (on average 76.81818181818181) internal successors, (1690), 22 states have internal predecessors, (1690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 18:25:39,893 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-02-28 18:25:39,894 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 18:25:39,900 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0
[2024-02-28 18:25:40,094 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-02-28 18:25:40,095 INFO  L420      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-02-28 18:25:40,095 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 18:25:40,096 INFO  L85        PathProgramCache]: Analyzing trace with hash 2049850436, now seen corresponding path program 2 times
[2024-02-28 18:25:40,096 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 18:25:40,096 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242927523]
[2024-02-28 18:25:40,096 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 18:25:40,097 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 18:25:40,115 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 18:25:40,395 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 18:25:40,395 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 18:25:40,395 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242927523]
[2024-02-28 18:25:40,395 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242927523] provided 0 perfect and 1 imperfect interpolant sequences
[2024-02-28 18:25:40,396 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1152896844]
[2024-02-28 18:25:40,396 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2024-02-28 18:25:40,396 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-02-28 18:25:40,396 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-02-28 18:25:40,397 INFO  L229       MonitoredProcess]: Starting monitored process 6 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-02-28 18:25:40,401 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process
[2024-02-28 18:25:40,536 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2024-02-28 18:25:40,536 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-02-28 18:25:40,537 INFO  L263         TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 43 conjunts are in the unsatisfiable core
[2024-02-28 18:25:40,541 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-02-28 18:25:40,548 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2024-02-28 18:25:40,576 INFO  L321             Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2024-02-28 18:25:40,577 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11
[2024-02-28 18:25:40,722 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11
[2024-02-28 18:25:40,790 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27
[2024-02-28 18:25:40,835 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42
[2024-02-28 18:25:40,889 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 57
[2024-02-28 18:25:40,957 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50
[2024-02-28 18:25:41,002 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 18:25:41,002 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2024-02-28 18:25:41,027 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (and (forall ((v_ArrVal_784 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_784) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse0 |c_ULTIMATE.start_main_~ts~0#1.offset|)))) (forall ((v_ArrVal_784 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_784) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse0 |c_ULTIMATE.start_main_~ts~0#1.offset| 3)))) (forall ((v_ArrVal_784 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_784) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse0 |c_ULTIMATE.start_main_~ts~0#1.offset| 1)) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_784 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_784) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse0 |c_ULTIMATE.start_main_~ts~0#1.offset| 2)) |c_ULTIMATE.start_main_#t~nondet9#1|)))) is different from false
[2024-02-28 18:25:41,049 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse2 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse1 (+ .cse2 |c_ULTIMATE.start_main_~ts~0#1.offset| 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 |c_ULTIMATE.start_main_#t~nondet9#1|)))) (and (forall ((v_ArrVal_784 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_784) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1))) (forall ((v_ArrVal_784 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_784) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse2 |c_ULTIMATE.start_main_~ts~0#1.offset| 1)) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_784 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_784) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse2 |c_ULTIMATE.start_main_~ts~0#1.offset| 2)) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_784 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_784) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse2 |c_ULTIMATE.start_main_~ts~0#1.offset|)) |c_ULTIMATE.start_main_#t~nondet9#1|)))))) is different from false
[2024-02-28 18:25:41,128 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked.
[2024-02-28 18:25:41,128 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1152896844] provided 0 perfect and 2 imperfect interpolant sequences
[2024-02-28 18:25:41,128 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-02-28 18:25:41,129 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 9] total 21
[2024-02-28 18:25:41,129 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242329018]
[2024-02-28 18:25:41,129 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-02-28 18:25:41,129 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 23 states
[2024-02-28 18:25:41,129 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 18:25:41,130 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants.
[2024-02-28 18:25:41,130 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=349, Unknown=2, NotChecked=78, Total=506
[2024-02-28 18:25:41,280 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 53 out of 192
[2024-02-28 18:25:41,281 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 1174 transitions, 14603 flow. Second operand  has 23 states, 23 states have (on average 54.69565217391305) internal successors, (1258), 23 states have internal predecessors, (1258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 18:25:41,281 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 18:25:41,281 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 53 of 192
[2024-02-28 18:25:41,281 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 18:25:48,216 INFO  L130       PetriNetUnfolder]: 11708/19508 cut-off events.
[2024-02-28 18:25:48,216 INFO  L131       PetriNetUnfolder]: For 124723/124729 co-relation queries the response was YES.
[2024-02-28 18:25:48,290 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 127668 conditions, 19508 events. 11708/19508 cut-off events. For 124723/124729 co-relation queries the response was YES. Maximal size of possible extension queue 671. Compared 131180 event pairs, 698 based on Foata normal form. 1/18175 useless extension candidates. Maximal degree in co-relation 125380. Up to 13919 conditions per place. 
[2024-02-28 18:25:48,370 INFO  L137   encePairwiseOnDemand]: 167/192 looper letters, 1349 selfloop transitions, 732 changer transitions 2/2087 dead transitions.
[2024-02-28 18:25:48,370 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 2087 transitions, 29755 flow
[2024-02-28 18:25:48,371 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. 
[2024-02-28 18:25:48,371 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 23 states.
[2024-02-28 18:25:48,373 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 1530 transitions.
[2024-02-28 18:25:48,373 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.34646739130434784
[2024-02-28 18:25:48,373 INFO  L72            ComplementDD]: Start complementDD. Operand 23 states and 1530 transitions.
[2024-02-28 18:25:48,373 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 23 states and 1530 transitions.
[2024-02-28 18:25:48,374 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 18:25:48,374 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 23 states and 1530 transitions.
[2024-02-28 18:25:48,376 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 24 states, 23 states have (on average 66.52173913043478) internal successors, (1530), 23 states have internal predecessors, (1530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 18:25:48,380 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 24 states, 24 states have (on average 192.0) internal successors, (4608), 24 states have internal predecessors, (4608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 18:25:48,380 INFO  L81            ComplementDD]: Finished complementDD. Result  has 24 states, 24 states have (on average 192.0) internal successors, (4608), 24 states have internal predecessors, (4608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 18:25:48,381 INFO  L175             Difference]: Start difference. First operand has 166 places, 1174 transitions, 14603 flow. Second operand 23 states and 1530 transitions.
[2024-02-28 18:25:48,381 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 2087 transitions, 29755 flow
[2024-02-28 18:25:50,377 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 2087 transitions, 29052 flow, removed 136 selfloop flow, removed 7 redundant places.
[2024-02-28 18:25:50,403 INFO  L231             Difference]: Finished difference. Result has 195 places, 1597 transitions, 22944 flow
[2024-02-28 18:25:50,404 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=13955, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1174, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=407, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=717, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=22944, PETRI_PLACES=195, PETRI_TRANSITIONS=1597}
[2024-02-28 18:25:50,405 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, 138 predicate places.
[2024-02-28 18:25:50,405 INFO  L495      AbstractCegarLoop]: Abstraction has has 195 places, 1597 transitions, 22944 flow
[2024-02-28 18:25:50,405 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 23 states, 23 states have (on average 54.69565217391305) internal successors, (1258), 23 states have internal predecessors, (1258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 18:25:50,405 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-02-28 18:25:50,405 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 18:25:50,413 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0
[2024-02-28 18:25:50,606 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13
[2024-02-28 18:25:50,607 INFO  L420      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-02-28 18:25:50,607 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 18:25:50,608 INFO  L85        PathProgramCache]: Analyzing trace with hash -862277107, now seen corresponding path program 3 times
[2024-02-28 18:25:50,608 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 18:25:50,608 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342172931]
[2024-02-28 18:25:50,608 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 18:25:50,608 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 18:25:50,629 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 18:25:50,890 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 18:25:50,891 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 18:25:50,891 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342172931]
[2024-02-28 18:25:50,891 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342172931] provided 0 perfect and 1 imperfect interpolant sequences
[2024-02-28 18:25:50,891 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [403005183]
[2024-02-28 18:25:50,891 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2024-02-28 18:25:50,891 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-02-28 18:25:50,891 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-02-28 18:25:50,892 INFO  L229       MonitoredProcess]: Starting monitored process 7 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-02-28 18:25:50,893 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process
[2024-02-28 18:25:51,047 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s)
[2024-02-28 18:25:51,047 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-02-28 18:25:51,059 INFO  L263         TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 44 conjunts are in the unsatisfiable core
[2024-02-28 18:25:51,065 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-02-28 18:25:51,081 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2024-02-28 18:25:51,106 INFO  L321             Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2024-02-28 18:25:51,107 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11
[2024-02-28 18:25:51,213 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11
[2024-02-28 18:25:51,249 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27
[2024-02-28 18:25:51,334 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42
[2024-02-28 18:25:51,380 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 40
[2024-02-28 18:25:51,401 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 57
[2024-02-28 18:25:51,453 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50
[2024-02-28 18:25:51,491 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 18:25:51,491 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2024-02-28 18:25:51,511 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (and (forall ((v_ArrVal_895 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_895) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse0 |c_ULTIMATE.start_main_~ts~0#1.offset| 2)) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_895 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_895) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse0 |c_ULTIMATE.start_main_~ts~0#1.offset| 1)) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_895 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_895) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse0 |c_ULTIMATE.start_main_~ts~0#1.offset|)))) (forall ((v_ArrVal_895 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_895) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse0 |c_ULTIMATE.start_main_~ts~0#1.offset| 3)) |c_ULTIMATE.start_main_#t~nondet9#1|)))) is different from false
[2024-02-28 18:25:51,531 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse2 (+ .cse1 |c_ULTIMATE.start_main_~ts~0#1.offset| 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2 |c_ULTIMATE.start_main_#t~nondet9#1|)))) (and (forall ((v_ArrVal_895 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_895) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse1 |c_ULTIMATE.start_main_~ts~0#1.offset|)))) (forall ((v_ArrVal_895 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_895) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse1 |c_ULTIMATE.start_main_~ts~0#1.offset| 1)) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_895 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_895) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse1 |c_ULTIMATE.start_main_~ts~0#1.offset| 2)))) (forall ((v_ArrVal_895 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_895) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2))))))) is different from false
[2024-02-28 18:25:51,553 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse2 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse1 (+ .cse2 |c_ULTIMATE.start_main_~ts~0#1.offset| 3))) (and (forall ((v_ArrVal_892 (Array Int Int)) (v_ArrVal_895 (Array Int Int))) (= (select (select (store (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_892))) (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 |c_ULTIMATE.start_main_#t~nondet9#1|))) c_threadThread1of2ForFork0_~t~0.base v_ArrVal_895) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse2 |c_ULTIMATE.start_main_~ts~0#1.offset| 2)) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_892 (Array Int Int)) (v_ArrVal_895 (Array Int Int))) (= (select (select (store (let ((.cse3 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_892))) (store .cse3 |c_ULTIMATE.start_main_~ts~0#1.base| (store (select .cse3 |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 |c_ULTIMATE.start_main_#t~nondet9#1|))) c_threadThread1of2ForFork0_~t~0.base v_ArrVal_895) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse2 |c_ULTIMATE.start_main_~ts~0#1.offset| 1)) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_892 (Array Int Int)) (v_ArrVal_895 (Array Int Int))) (= (select (select (store (let ((.cse4 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_892))) (store .cse4 |c_ULTIMATE.start_main_~ts~0#1.base| (store (select .cse4 |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 |c_ULTIMATE.start_main_#t~nondet9#1|))) c_threadThread1of2ForFork0_~t~0.base v_ArrVal_895) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse2 |c_ULTIMATE.start_main_~ts~0#1.offset|)) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_892 (Array Int Int)) (v_ArrVal_895 (Array Int Int))) (= (select (select (store (let ((.cse5 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_892))) (store .cse5 |c_ULTIMATE.start_main_~ts~0#1.base| (store (select .cse5 |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 |c_ULTIMATE.start_main_#t~nondet9#1|))) c_threadThread1of2ForFork0_~t~0.base v_ArrVal_895) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1) |c_ULTIMATE.start_main_#t~nondet9#1|))))) is different from false
[2024-02-28 18:25:51,576 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse3 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse5 (+ .cse3 |c_ULTIMATE.start_main_~ts~0#1.offset| 2))) (let ((.cse1 (+ .cse3 |c_ULTIMATE.start_main_~ts~0#1.offset| 3)) (.cse2 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse5 |c_ULTIMATE.start_main_#t~nondet9#1|)))) (and (forall ((v_ArrVal_892 (Array Int Int)) (v_ArrVal_895 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store (let ((.cse0 (store .cse2 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_892))) (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 |c_ULTIMATE.start_main_#t~nondet9#1|))) c_threadThread1of2ForFork0_~t~0.base v_ArrVal_895) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse3 |c_ULTIMATE.start_main_~ts~0#1.offset| 1)))) (forall ((v_ArrVal_892 (Array Int Int)) (v_ArrVal_895 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store (let ((.cse4 (store .cse2 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_892))) (store .cse4 |c_ULTIMATE.start_main_~ts~0#1.base| (store (select .cse4 |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 |c_ULTIMATE.start_main_#t~nondet9#1|))) c_threadThread1of2ForFork0_~t~0.base v_ArrVal_895) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse5))) (forall ((v_ArrVal_892 (Array Int Int)) (v_ArrVal_895 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store (let ((.cse6 (store .cse2 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_892))) (store .cse6 |c_ULTIMATE.start_main_~ts~0#1.base| (store (select .cse6 |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 |c_ULTIMATE.start_main_#t~nondet9#1|))) c_threadThread1of2ForFork0_~t~0.base v_ArrVal_895) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1))) (forall ((v_ArrVal_892 (Array Int Int)) (v_ArrVal_895 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store (let ((.cse7 (store .cse2 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_892))) (store .cse7 |c_ULTIMATE.start_main_~ts~0#1.base| (store (select .cse7 |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 |c_ULTIMATE.start_main_#t~nondet9#1|))) c_threadThread1of2ForFork0_~t~0.base v_ArrVal_895) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse3 |c_ULTIMATE.start_main_~ts~0#1.offset|)))))))) is different from false
[2024-02-28 18:25:51,601 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse6 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse3 (+ .cse6 |c_ULTIMATE.start_main_~ts~0#1.offset| 2))) (let ((.cse1 (+ .cse6 |c_ULTIMATE.start_main_~ts~0#1.offset| 3)) (.cse2 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse3 |c_ULTIMATE.start_main_#t~nondet9#1|)))) (and (forall ((v_ArrVal_892 (Array Int Int)) (v_ArrVal_895 (Array Int Int))) (= (select (select (store (let ((.cse0 (store .cse2 |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_892))) (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 |c_ULTIMATE.start_main_#t~nondet9#1|))) |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_895) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse3) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_892 (Array Int Int)) (v_ArrVal_895 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store (let ((.cse4 (store .cse2 |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_892))) (store .cse4 |c_ULTIMATE.start_main_~ts~0#1.base| (store (select .cse4 |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 |c_ULTIMATE.start_main_#t~nondet9#1|))) |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_895) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1))) (forall ((v_ArrVal_892 (Array Int Int)) (v_ArrVal_895 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store (let ((.cse5 (store .cse2 |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_892))) (store .cse5 |c_ULTIMATE.start_main_~ts~0#1.base| (store (select .cse5 |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 |c_ULTIMATE.start_main_#t~nondet9#1|))) |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_895) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse6 |c_ULTIMATE.start_main_~ts~0#1.offset|)))) (forall ((v_ArrVal_892 (Array Int Int)) (v_ArrVal_895 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store (let ((.cse7 (store .cse2 |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_892))) (store .cse7 |c_ULTIMATE.start_main_~ts~0#1.base| (store (select .cse7 |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 |c_ULTIMATE.start_main_#t~nondet9#1|))) |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_895) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse6 |c_ULTIMATE.start_main_~ts~0#1.offset| 1)))))))) is different from false
[2024-02-28 18:25:51,678 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked.
[2024-02-28 18:25:51,678 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [403005183] provided 0 perfect and 2 imperfect interpolant sequences
[2024-02-28 18:25:51,678 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-02-28 18:25:51,678 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 25
[2024-02-28 18:25:51,678 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969589757]
[2024-02-28 18:25:51,678 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-02-28 18:25:51,679 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 27 states
[2024-02-28 18:25:51,679 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 18:25:51,679 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants.
[2024-02-28 18:25:51,679 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=393, Unknown=5, NotChecked=220, Total=702
[2024-02-28 18:25:51,827 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 53 out of 192
[2024-02-28 18:25:51,828 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 1597 transitions, 22944 flow. Second operand  has 27 states, 27 states have (on average 54.7037037037037) internal successors, (1477), 27 states have internal predecessors, (1477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 18:25:51,828 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 18:25:51,828 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 53 of 192
[2024-02-28 18:25:51,828 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 18:26:00,080 INFO  L130       PetriNetUnfolder]: 11553/19268 cut-off events.
[2024-02-28 18:26:00,080 INFO  L131       PetriNetUnfolder]: For 185351/185357 co-relation queries the response was YES.
[2024-02-28 18:26:00,160 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 139651 conditions, 19268 events. 11553/19268 cut-off events. For 185351/185357 co-relation queries the response was YES. Maximal size of possible extension queue 659. Compared 129405 event pairs, 697 based on Foata normal form. 118/18359 useless extension candidates. Maximal degree in co-relation 137316. Up to 14904 conditions per place. 
[2024-02-28 18:26:00,240 INFO  L137   encePairwiseOnDemand]: 166/192 looper letters, 1574 selfloop transitions, 601 changer transitions 2/2181 dead transitions.
[2024-02-28 18:26:00,240 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 2181 transitions, 34403 flow
[2024-02-28 18:26:00,241 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. 
[2024-02-28 18:26:00,241 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 25 states.
[2024-02-28 18:26:00,242 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 1635 transitions.
[2024-02-28 18:26:00,243 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.340625
[2024-02-28 18:26:00,243 INFO  L72            ComplementDD]: Start complementDD. Operand 25 states and 1635 transitions.
[2024-02-28 18:26:00,243 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 25 states and 1635 transitions.
[2024-02-28 18:26:00,244 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 18:26:00,244 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 25 states and 1635 transitions.
[2024-02-28 18:26:00,246 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 26 states, 25 states have (on average 65.4) internal successors, (1635), 25 states have internal predecessors, (1635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 18:26:00,250 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 26 states, 26 states have (on average 192.0) internal successors, (4992), 26 states have internal predecessors, (4992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 18:26:00,250 INFO  L81            ComplementDD]: Finished complementDD. Result  has 26 states, 26 states have (on average 192.0) internal successors, (4992), 26 states have internal predecessors, (4992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 18:26:00,250 INFO  L175             Difference]: Start difference. First operand has 195 places, 1597 transitions, 22944 flow. Second operand 25 states and 1635 transitions.
[2024-02-28 18:26:00,250 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 2181 transitions, 34403 flow
[2024-02-28 18:26:03,069 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 213 places, 2181 transitions, 31812 flow, removed 1089 selfloop flow, removed 6 redundant places.
[2024-02-28 18:26:03,099 INFO  L231             Difference]: Finished difference. Result has 223 places, 1767 transitions, 25279 flow
[2024-02-28 18:26:03,100 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=20484, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1588, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=462, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=25279, PETRI_PLACES=223, PETRI_TRANSITIONS=1767}
[2024-02-28 18:26:03,100 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, 166 predicate places.
[2024-02-28 18:26:03,101 INFO  L495      AbstractCegarLoop]: Abstraction has has 223 places, 1767 transitions, 25279 flow
[2024-02-28 18:26:03,102 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 27 states, 27 states have (on average 54.7037037037037) internal successors, (1477), 27 states have internal predecessors, (1477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 18:26:03,102 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-02-28 18:26:03,102 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 18:26:03,107 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0
[2024-02-28 18:26:03,302 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14
[2024-02-28 18:26:03,303 INFO  L420      AbstractCegarLoop]: === Iteration 11 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-02-28 18:26:03,304 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 18:26:03,305 INFO  L85        PathProgramCache]: Analyzing trace with hash 329382834, now seen corresponding path program 1 times
[2024-02-28 18:26:03,305 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 18:26:03,305 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614733323]
[2024-02-28 18:26:03,306 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 18:26:03,306 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 18:26:03,323 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 18:26:03,555 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 18:26:03,555 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 18:26:03,556 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614733323]
[2024-02-28 18:26:03,556 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614733323] provided 0 perfect and 1 imperfect interpolant sequences
[2024-02-28 18:26:03,556 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2103205119]
[2024-02-28 18:26:03,556 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 18:26:03,556 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-02-28 18:26:03,556 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-02-28 18:26:03,557 INFO  L229       MonitoredProcess]: Starting monitored process 8 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-02-28 18:26:03,558 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process
[2024-02-28 18:26:03,709 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 18:26:03,710 INFO  L263         TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 29 conjunts are in the unsatisfiable core
[2024-02-28 18:26:03,714 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-02-28 18:26:03,718 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2024-02-28 18:26:03,731 INFO  L321             Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2024-02-28 18:26:03,731 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11
[2024-02-28 18:26:03,758 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9
[2024-02-28 18:26:03,782 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22
[2024-02-28 18:26:03,795 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-02-28 18:26:03,796 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34
[2024-02-28 18:26:03,814 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-02-28 18:26:03,814 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 46
[2024-02-28 18:26:03,833 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39
[2024-02-28 18:26:03,842 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 18:26:03,842 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2024-02-28 18:26:03,863 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_985 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_985) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 6)))) (forall ((v_ArrVal_985 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_985) c_threadThread1of2ForFork0_~t~0.base) (+ 7 c_threadThread1of2ForFork0_~t~0.offset)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_985 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_985) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 4)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_985 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_985) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 5)) |c_threadThread1of2ForFork0_#t~nondet4|))) is different from false
[2024-02-28 18:26:03,970 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_threadThread1of2ForFork0_~t~0.offset 6)) (.cse1 (+ 7 c_threadThread1of2ForFork0_~t~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_985 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_985) c_threadThread1of2ForFork0_~t~0.base) .cse1) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_985 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_985) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 4)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_985 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_985) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 5)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_985 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_985) c_threadThread1of2ForFork0_~t~0.base) .cse2)))))) is different from false
[2024-02-28 18:26:03,992 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse3 (+ c_threadThread1of2ForFork0_~t~0.offset 5)) (.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 6)) (.cse2 (+ 7 c_threadThread1of2ForFork0_~t~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (store (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_985 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_985) c_threadThread1of2ForFork0_~t~0.base) .cse1) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_985 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_985) c_threadThread1of2ForFork0_~t~0.base) .cse2))) (forall ((v_ArrVal_985 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_985) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 4)))) (forall ((v_ArrVal_985 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_985) c_threadThread1of2ForFork0_~t~0.base) .cse3) |c_threadThread1of2ForFork0_#t~nondet4|))))) is different from false
[2024-02-28 18:26:04,060 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-02-28 18:26:04,060 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 53
[2024-02-28 18:26:04,070 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-02-28 18:26:04,071 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 86 treesize of output 32
[2024-02-28 18:26:04,085 INFO  L321             Elim1Store]: treesize reduction 40, result has 2.4 percent of original size
[2024-02-28 18:26:04,086 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 1
[2024-02-28 18:26:04,092 INFO  L321             Elim1Store]: treesize reduction 40, result has 2.4 percent of original size
[2024-02-28 18:26:04,093 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 1
[2024-02-28 18:26:04,102 INFO  L321             Elim1Store]: treesize reduction 40, result has 2.4 percent of original size
[2024-02-28 18:26:04,103 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 1
[2024-02-28 18:26:04,131 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked.
[2024-02-28 18:26:04,131 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [2103205119] provided 0 perfect and 2 imperfect interpolant sequences
[2024-02-28 18:26:04,131 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-02-28 18:26:04,131 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14
[2024-02-28 18:26:04,131 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660324970]
[2024-02-28 18:26:04,131 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-02-28 18:26:04,132 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 16 states
[2024-02-28 18:26:04,132 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 18:26:04,132 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants.
[2024-02-28 18:26:04,133 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=114, Unknown=9, NotChecked=72, Total=240
[2024-02-28 18:26:04,192 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 58 out of 192
[2024-02-28 18:26:04,194 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 223 places, 1767 transitions, 25279 flow. Second operand  has 16 states, 16 states have (on average 59.8125) internal successors, (957), 16 states have internal predecessors, (957), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 18:26:04,194 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 18:26:04,194 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 58 of 192
[2024-02-28 18:26:04,194 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 18:26:13,447 INFO  L130       PetriNetUnfolder]: 12234/20378 cut-off events.
[2024-02-28 18:26:13,447 INFO  L131       PetriNetUnfolder]: For 217902/217910 co-relation queries the response was YES.
[2024-02-28 18:26:13,553 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 156294 conditions, 20378 events. 12234/20378 cut-off events. For 217902/217910 co-relation queries the response was YES. Maximal size of possible extension queue 693. Compared 138964 event pairs, 1327 based on Foata normal form. 65/19384 useless extension candidates. Maximal degree in co-relation 153912. Up to 10079 conditions per place. 
[2024-02-28 18:26:13,652 INFO  L137   encePairwiseOnDemand]: 143/192 looper letters, 1019 selfloop transitions, 1404 changer transitions 10/2437 dead transitions.
[2024-02-28 18:26:13,652 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 2437 transitions, 38878 flow
[2024-02-28 18:26:13,653 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. 
[2024-02-28 18:26:13,653 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 18 states.
[2024-02-28 18:26:13,654 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1533 transitions.
[2024-02-28 18:26:13,654 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.4435763888888889
[2024-02-28 18:26:13,654 INFO  L72            ComplementDD]: Start complementDD. Operand 18 states and 1533 transitions.
[2024-02-28 18:26:13,655 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 18 states and 1533 transitions.
[2024-02-28 18:26:13,655 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 18:26:13,655 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 1533 transitions.
[2024-02-28 18:26:13,657 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 19 states, 18 states have (on average 85.16666666666667) internal successors, (1533), 18 states have internal predecessors, (1533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 18:26:13,659 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 19 states, 19 states have (on average 192.0) internal successors, (3648), 19 states have internal predecessors, (3648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 18:26:13,659 INFO  L81            ComplementDD]: Finished complementDD. Result  has 19 states, 19 states have (on average 192.0) internal successors, (3648), 19 states have internal predecessors, (3648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 18:26:13,659 INFO  L175             Difference]: Start difference. First operand has 223 places, 1767 transitions, 25279 flow. Second operand 18 states and 1533 transitions.
[2024-02-28 18:26:13,659 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 240 places, 2437 transitions, 38878 flow
[2024-02-28 18:26:17,128 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 232 places, 2437 transitions, 37334 flow, removed 671 selfloop flow, removed 8 redundant places.
[2024-02-28 18:26:17,160 INFO  L231             Difference]: Finished difference. Result has 236 places, 1973 transitions, 30792 flow
[2024-02-28 18:26:17,161 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=24133, PETRI_DIFFERENCE_MINUEND_PLACES=215, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1767, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1198, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=497, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=30792, PETRI_PLACES=236, PETRI_TRANSITIONS=1973}
[2024-02-28 18:26:17,162 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, 179 predicate places.
[2024-02-28 18:26:17,162 INFO  L495      AbstractCegarLoop]: Abstraction has has 236 places, 1973 transitions, 30792 flow
[2024-02-28 18:26:17,162 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 16 states, 16 states have (on average 59.8125) internal successors, (957), 16 states have internal predecessors, (957), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 18:26:17,162 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-02-28 18:26:17,162 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 18:26:17,169 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0
[2024-02-28 18:26:17,363 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15
[2024-02-28 18:26:17,363 INFO  L420      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-02-28 18:26:17,364 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 18:26:17,364 INFO  L85        PathProgramCache]: Analyzing trace with hash -1883145753, now seen corresponding path program 1 times
[2024-02-28 18:26:17,365 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 18:26:17,365 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51947580]
[2024-02-28 18:26:17,365 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 18:26:17,365 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 18:26:17,381 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 18:26:17,619 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 18:26:17,620 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 18:26:17,620 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51947580]
[2024-02-28 18:26:17,620 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51947580] provided 0 perfect and 1 imperfect interpolant sequences
[2024-02-28 18:26:17,620 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1761140676]
[2024-02-28 18:26:17,620 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 18:26:17,621 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-02-28 18:26:17,621 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-02-28 18:26:17,622 INFO  L229       MonitoredProcess]: Starting monitored process 9 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-02-28 18:26:17,623 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process
[2024-02-28 18:26:17,751 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 18:26:17,752 INFO  L263         TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 40 conjunts are in the unsatisfiable core
[2024-02-28 18:26:17,767 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-02-28 18:26:17,784 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2024-02-28 18:26:17,820 INFO  L321             Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2024-02-28 18:26:17,820 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11
[2024-02-28 18:26:17,932 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11
[2024-02-28 18:26:17,968 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27
[2024-02-28 18:26:18,018 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42
[2024-02-28 18:26:18,071 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 57
[2024-02-28 18:26:18,127 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50
[2024-02-28 18:26:18,171 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 18:26:18,171 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2024-02-28 18:26:18,426 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse1))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2 0) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse1) 0)))) (and (forall ((v_ArrVal_1079 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1079) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse1)) 0)) (forall ((v_ArrVal_1079 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1079) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_1079 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1079) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse1)) 0)))))) is different from false
[2024-02-28 18:26:18,450 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse2 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse2)) (.cse3 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse2))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 0) .cse3 0) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse2) 0)))) (and (forall ((v_ArrVal_1079 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1079) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1079 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1079) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse2)) 0)) (forall ((v_ArrVal_1079 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1079) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse3) 0)))))) is different from false
[2024-02-28 18:26:18,469 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-02-28 18:26:18,470 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 67
[2024-02-28 18:26:18,474 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-02-28 18:26:18,475 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 83 treesize of output 39
[2024-02-28 18:26:18,478 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 3
[2024-02-28 18:26:18,486 INFO  L321             Elim1Store]: treesize reduction 51, result has 1.9 percent of original size
[2024-02-28 18:26:18,486 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 1
[2024-02-28 18:26:18,493 INFO  L321             Elim1Store]: treesize reduction 51, result has 1.9 percent of original size
[2024-02-28 18:26:18,494 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 50 treesize of output 1
[2024-02-28 18:26:18,534 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 18:26:18,534 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1761140676] provided 0 perfect and 2 imperfect interpolant sequences
[2024-02-28 18:26:18,535 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-02-28 18:26:18,535 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 9] total 24
[2024-02-28 18:26:18,535 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029445350]
[2024-02-28 18:26:18,535 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-02-28 18:26:18,536 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 26 states
[2024-02-28 18:26:18,536 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 18:26:18,536 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants.
[2024-02-28 18:26:18,536 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=433, Unknown=19, NotChecked=90, Total=650
[2024-02-28 18:26:18,742 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 48 out of 192
[2024-02-28 18:26:18,744 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 236 places, 1973 transitions, 30792 flow. Second operand  has 26 states, 26 states have (on average 49.80769230769231) internal successors, (1295), 26 states have internal predecessors, (1295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 18:26:18,744 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 18:26:18,744 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 192
[2024-02-28 18:26:18,744 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 18:26:36,249 INFO  L130       PetriNetUnfolder]: 21940/36688 cut-off events.
[2024-02-28 18:26:36,249 INFO  L131       PetriNetUnfolder]: For 426823/426905 co-relation queries the response was YES.
[2024-02-28 18:26:36,547 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 300915 conditions, 36688 events. 21940/36688 cut-off events. For 426823/426905 co-relation queries the response was YES. Maximal size of possible extension queue 1165. Compared 277379 event pairs, 1049 based on Foata normal form. 352/34898 useless extension candidates. Maximal degree in co-relation 294677. Up to 15484 conditions per place. 
[2024-02-28 18:26:36,726 INFO  L137   encePairwiseOnDemand]: 161/192 looper letters, 2770 selfloop transitions, 1147 changer transitions 2/3923 dead transitions.
[2024-02-28 18:26:36,726 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 3923 transitions, 65680 flow
[2024-02-28 18:26:36,727 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. 
[2024-02-28 18:26:36,727 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 30 states.
[2024-02-28 18:26:36,729 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 1986 transitions.
[2024-02-28 18:26:36,729 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.34479166666666666
[2024-02-28 18:26:36,730 INFO  L72            ComplementDD]: Start complementDD. Operand 30 states and 1986 transitions.
[2024-02-28 18:26:36,730 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 30 states and 1986 transitions.
[2024-02-28 18:26:36,730 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 18:26:36,730 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 30 states and 1986 transitions.
[2024-02-28 18:26:36,732 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 31 states, 30 states have (on average 66.2) internal successors, (1986), 30 states have internal predecessors, (1986), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 18:26:36,736 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 31 states, 31 states have (on average 192.0) internal successors, (5952), 31 states have internal predecessors, (5952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 18:26:36,736 INFO  L81            ComplementDD]: Finished complementDD. Result  has 31 states, 31 states have (on average 192.0) internal successors, (5952), 31 states have internal predecessors, (5952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 18:26:36,736 INFO  L175             Difference]: Start difference. First operand has 236 places, 1973 transitions, 30792 flow. Second operand 30 states and 1986 transitions.
[2024-02-28 18:26:36,736 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 265 places, 3923 transitions, 65680 flow
[2024-02-28 18:26:52,257 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 255 places, 3923 transitions, 61915 flow, removed 686 selfloop flow, removed 10 redundant places.
[2024-02-28 18:26:52,303 INFO  L231             Difference]: Finished difference. Result has 277 places, 3020 transitions, 49672 flow
[2024-02-28 18:26:52,304 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=28910, PETRI_DIFFERENCE_MINUEND_PLACES=226, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1973, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=287, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1571, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=49672, PETRI_PLACES=277, PETRI_TRANSITIONS=3020}
[2024-02-28 18:26:52,305 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, 220 predicate places.
[2024-02-28 18:26:52,305 INFO  L495      AbstractCegarLoop]: Abstraction has has 277 places, 3020 transitions, 49672 flow
[2024-02-28 18:26:52,305 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 26 states, 26 states have (on average 49.80769230769231) internal successors, (1295), 26 states have internal predecessors, (1295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 18:26:52,305 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-02-28 18:26:52,305 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 18:26:52,310 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0
[2024-02-28 18:26:52,510 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16
[2024-02-28 18:26:52,510 INFO  L420      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-02-28 18:26:52,511 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 18:26:52,511 INFO  L85        PathProgramCache]: Analyzing trace with hash -201168629, now seen corresponding path program 2 times
[2024-02-28 18:26:52,511 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 18:26:52,512 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536809044]
[2024-02-28 18:26:52,512 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 18:26:52,512 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 18:26:52,528 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 18:26:52,796 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 18:26:52,796 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 18:26:52,796 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536809044]
[2024-02-28 18:26:52,796 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536809044] provided 0 perfect and 1 imperfect interpolant sequences
[2024-02-28 18:26:52,796 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [986752781]
[2024-02-28 18:26:52,797 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2024-02-28 18:26:52,797 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-02-28 18:26:52,797 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-02-28 18:26:52,798 INFO  L229       MonitoredProcess]: Starting monitored process 10 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-02-28 18:26:52,799 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process
[2024-02-28 18:26:52,930 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2024-02-28 18:26:52,930 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-02-28 18:26:52,932 INFO  L263         TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 34 conjunts are in the unsatisfiable core
[2024-02-28 18:26:52,936 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-02-28 18:26:52,941 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2024-02-28 18:26:52,968 INFO  L321             Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2024-02-28 18:26:52,968 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11
[2024-02-28 18:26:53,048 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11
[2024-02-28 18:26:53,104 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27
[2024-02-28 18:26:53,154 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42
[2024-02-28 18:26:53,245 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 40
[2024-02-28 18:26:53,258 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 57
[2024-02-28 18:26:53,316 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50
[2024-02-28 18:26:53,351 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 18:26:53,352 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2024-02-28 18:26:53,373 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (and (forall ((v_ArrVal_1174 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1174) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse0)) 0)) (forall ((v_ArrVal_1174 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1174) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse0)) 0)) (forall ((v_ArrVal_1174 (Array Int Int))) (= 0 (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1174) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse0)))) (forall ((v_ArrVal_1174 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1174) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse0)) 0)))) is different from false
[2024-02-28 18:26:53,491 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse3 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse3))) (and (forall ((v_ArrVal_1174 (Array Int Int)) (v_ArrVal_1171 (Array Int Int))) (= (select (select (store (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1171))) (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 0))) c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1174) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1174 (Array Int Int)) (v_ArrVal_1171 (Array Int Int))) (= (select (select (store (let ((.cse2 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1171))) (store .cse2 |c_ULTIMATE.start_main_~ts~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 0))) c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1174) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse3)) 0)) (forall ((v_ArrVal_1174 (Array Int Int)) (v_ArrVal_1171 (Array Int Int))) (= (select (select (store (let ((.cse4 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1171))) (store .cse4 |c_ULTIMATE.start_main_~ts~0#1.base| (store (select .cse4 |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 0))) c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1174) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse3)) 0)) (forall ((v_ArrVal_1174 (Array Int Int)) (v_ArrVal_1171 (Array Int Int))) (= (select (select (store (let ((.cse5 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1171))) (store .cse5 |c_ULTIMATE.start_main_~ts~0#1.base| (store (select .cse5 |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 0))) c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1174) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse3)) 0))))) is different from false
[2024-02-28 18:26:53,512 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse2 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse2))) (and (forall ((v_ArrVal_1174 (Array Int Int)) (v_ArrVal_1171 (Array Int Int))) (= (select (select (store (let ((.cse0 (store |c_#race| |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_1171))) (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 0))) |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_1174) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse2)) 0)) (forall ((v_ArrVal_1174 (Array Int Int)) (v_ArrVal_1171 (Array Int Int))) (= (select (select (store (let ((.cse3 (store |c_#race| |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_1171))) (store .cse3 |c_ULTIMATE.start_main_~ts~0#1.base| (store (select .cse3 |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 0))) |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_1174) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1174 (Array Int Int)) (v_ArrVal_1171 (Array Int Int))) (= (select (select (store (let ((.cse4 (store |c_#race| |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_1171))) (store .cse4 |c_ULTIMATE.start_main_~ts~0#1.base| (store (select .cse4 |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 0))) |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_1174) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse2)) 0)) (forall ((v_ArrVal_1174 (Array Int Int)) (v_ArrVal_1171 (Array Int Int))) (= (select (select (store (let ((.cse5 (store |c_#race| |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_1171))) (store .cse5 |c_ULTIMATE.start_main_~ts~0#1.base| (store (select .cse5 |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 0))) |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_1174) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse2)) 0))))) is different from false
[2024-02-28 18:26:53,598 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 18:26:53,599 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [986752781] provided 0 perfect and 2 imperfect interpolant sequences
[2024-02-28 18:26:53,599 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-02-28 18:26:53,599 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 24
[2024-02-28 18:26:53,599 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387527056]
[2024-02-28 18:26:53,599 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-02-28 18:26:53,599 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 26 states
[2024-02-28 18:26:53,599 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 18:26:53,600 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants.
[2024-02-28 18:26:53,600 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=416, Unknown=9, NotChecked=132, Total=650
[2024-02-28 18:26:53,642 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 55 out of 192
[2024-02-28 18:26:53,643 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 277 places, 3020 transitions, 49672 flow. Second operand  has 26 states, 26 states have (on average 56.80769230769231) internal successors, (1477), 26 states have internal predecessors, (1477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 18:26:53,643 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 18:26:53,643 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 192
[2024-02-28 18:26:53,643 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 18:27:19,756 INFO  L130       PetriNetUnfolder]: 25276/42687 cut-off events.
[2024-02-28 18:27:19,757 INFO  L131       PetriNetUnfolder]: For 780172/780244 co-relation queries the response was YES.
[2024-02-28 18:27:20,320 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 388629 conditions, 42687 events. 25276/42687 cut-off events. For 780172/780244 co-relation queries the response was YES. Maximal size of possible extension queue 1294. Compared 331992 event pairs, 1801 based on Foata normal form. 269/40371 useless extension candidates. Maximal degree in co-relation 382433. Up to 20482 conditions per place. 
[2024-02-28 18:27:20,554 INFO  L137   encePairwiseOnDemand]: 161/192 looper letters, 2885 selfloop transitions, 1072 changer transitions 0/3961 dead transitions.
[2024-02-28 18:27:20,554 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 302 places, 3961 transitions, 72942 flow
[2024-02-28 18:27:20,555 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. 
[2024-02-28 18:27:20,555 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 26 states.
[2024-02-28 18:27:20,557 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 1822 transitions.
[2024-02-28 18:27:20,557 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.36498397435897434
[2024-02-28 18:27:20,557 INFO  L72            ComplementDD]: Start complementDD. Operand 26 states and 1822 transitions.
[2024-02-28 18:27:20,557 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 26 states and 1822 transitions.
[2024-02-28 18:27:20,558 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 18:27:20,558 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 26 states and 1822 transitions.
[2024-02-28 18:27:20,560 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 27 states, 26 states have (on average 70.07692307692308) internal successors, (1822), 26 states have internal predecessors, (1822), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 18:27:20,563 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 27 states, 27 states have (on average 192.0) internal successors, (5184), 27 states have internal predecessors, (5184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 18:27:20,563 INFO  L81            ComplementDD]: Finished complementDD. Result  has 27 states, 27 states have (on average 192.0) internal successors, (5184), 27 states have internal predecessors, (5184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 18:27:20,564 INFO  L175             Difference]: Start difference. First operand has 277 places, 3020 transitions, 49672 flow. Second operand 26 states and 1822 transitions.
[2024-02-28 18:27:20,564 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 302 places, 3961 transitions, 72942 flow
[2024-02-28 18:27:48,142 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 299 places, 3961 transitions, 68771 flow, removed 2083 selfloop flow, removed 3 redundant places.
[2024-02-28 18:27:48,198 INFO  L231             Difference]: Finished difference. Result has 317 places, 3492 transitions, 58992 flow
[2024-02-28 18:27:48,200 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=46139, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=3020, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=621, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2174, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=58992, PETRI_PLACES=317, PETRI_TRANSITIONS=3492}
[2024-02-28 18:27:48,200 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, 260 predicate places.
[2024-02-28 18:27:48,201 INFO  L495      AbstractCegarLoop]: Abstraction has has 317 places, 3492 transitions, 58992 flow
[2024-02-28 18:27:48,201 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 26 states, 26 states have (on average 56.80769230769231) internal successors, (1477), 26 states have internal predecessors, (1477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 18:27:48,201 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-02-28 18:27:48,201 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 18:27:48,207 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0
[2024-02-28 18:27:48,405 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17
[2024-02-28 18:27:48,406 INFO  L420      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-02-28 18:27:48,407 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 18:27:48,407 INFO  L85        PathProgramCache]: Analyzing trace with hash -530869613, now seen corresponding path program 3 times
[2024-02-28 18:27:48,408 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 18:27:48,408 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54919083]
[2024-02-28 18:27:48,408 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 18:27:48,409 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 18:27:48,425 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 18:27:48,678 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 18:27:48,678 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 18:27:48,678 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54919083]
[2024-02-28 18:27:48,678 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54919083] provided 0 perfect and 1 imperfect interpolant sequences
[2024-02-28 18:27:48,678 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [428533475]
[2024-02-28 18:27:48,678 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2024-02-28 18:27:48,678 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-02-28 18:27:48,678 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-02-28 18:27:48,680 INFO  L229       MonitoredProcess]: Starting monitored process 11 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-02-28 18:27:48,680 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process
[2024-02-28 18:27:48,848 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s)
[2024-02-28 18:27:48,849 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-02-28 18:27:48,851 INFO  L263         TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 34 conjunts are in the unsatisfiable core
[2024-02-28 18:27:48,854 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-02-28 18:27:48,858 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2024-02-28 18:27:48,878 INFO  L321             Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2024-02-28 18:27:48,878 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11
[2024-02-28 18:27:48,975 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11
[2024-02-28 18:27:49,003 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27
[2024-02-28 18:27:49,051 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42
[2024-02-28 18:27:49,100 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 40
[2024-02-28 18:27:49,122 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 57
[2024-02-28 18:27:49,175 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50
[2024-02-28 18:27:49,212 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 18:27:49,213 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2024-02-28 18:27:49,234 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (and (forall ((v_ArrVal_1269 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1269) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse0)) 0)) (forall ((v_ArrVal_1269 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1269) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse0)) 0)) (forall ((v_ArrVal_1269 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1269) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse0)) 0)) (forall ((v_ArrVal_1269 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1269) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse0)) 0)))) is different from false
[2024-02-28 18:27:49,254 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse2 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse2))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 0)))) (and (forall ((v_ArrVal_1269 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1269) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1269 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1269) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse2)) 0)) (forall ((v_ArrVal_1269 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1269) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse2)) 0)) (forall ((v_ArrVal_1269 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1269) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse2)) 0)))))) is different from false
[2024-02-28 18:27:49,274 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse3 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse3))) (and (forall ((v_ArrVal_1269 (Array Int Int)) (v_ArrVal_1266 (Array Int Int))) (= (select (select (store (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1266))) (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 0))) c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1269) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1269 (Array Int Int)) (v_ArrVal_1266 (Array Int Int))) (= (select (select (store (let ((.cse2 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1266))) (store .cse2 |c_ULTIMATE.start_main_~ts~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 0))) c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1269) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse3)) 0)) (forall ((v_ArrVal_1269 (Array Int Int)) (v_ArrVal_1266 (Array Int Int))) (= (select (select (store (let ((.cse4 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1266))) (store .cse4 |c_ULTIMATE.start_main_~ts~0#1.base| (store (select .cse4 |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 0))) c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1269) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse3)) 0)) (forall ((v_ArrVal_1269 (Array Int Int)) (v_ArrVal_1266 (Array Int Int))) (= (select (select (store (let ((.cse5 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1266))) (store .cse5 |c_ULTIMATE.start_main_~ts~0#1.base| (store (select .cse5 |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 0))) c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1269) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse3)) 0))))) is different from false
[2024-02-28 18:27:49,360 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 18:27:49,360 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [428533475] provided 0 perfect and 2 imperfect interpolant sequences
[2024-02-28 18:27:49,360 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-02-28 18:27:49,360 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 23
[2024-02-28 18:27:49,360 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641481227]
[2024-02-28 18:27:49,360 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-02-28 18:27:49,361 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 25 states
[2024-02-28 18:27:49,361 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 18:27:49,361 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants.
[2024-02-28 18:27:49,361 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=378, Unknown=3, NotChecked=126, Total=600
[2024-02-28 18:27:49,505 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 55 out of 192
[2024-02-28 18:27:49,506 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 317 places, 3492 transitions, 58992 flow. Second operand  has 25 states, 25 states have (on average 56.84) internal successors, (1421), 25 states have internal predecessors, (1421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 18:27:49,506 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 18:27:49,506 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 192
[2024-02-28 18:27:49,506 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 18:28:19,901 INFO  L130       PetriNetUnfolder]: 26170/44205 cut-off events.
[2024-02-28 18:28:19,902 INFO  L131       PetriNetUnfolder]: For 1031411/1031425 co-relation queries the response was YES.
[2024-02-28 18:28:20,489 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 432566 conditions, 44205 events. 26170/44205 cut-off events. For 1031411/1031425 co-relation queries the response was YES. Maximal size of possible extension queue 1364. Compared 345770 event pairs, 1339 based on Foata normal form. 199/41763 useless extension candidates. Maximal degree in co-relation 426112. Up to 15717 conditions per place. 
[2024-02-28 18:28:20,729 INFO  L137   encePairwiseOnDemand]: 161/192 looper letters, 2780 selfloop transitions, 1750 changer transitions 2/4536 dead transitions.
[2024-02-28 18:28:20,730 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 341 places, 4536 transitions, 85690 flow
[2024-02-28 18:28:20,731 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. 
[2024-02-28 18:28:20,731 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 25 states.
[2024-02-28 18:28:20,732 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 1765 transitions.
[2024-02-28 18:28:20,733 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.36770833333333336
[2024-02-28 18:28:20,733 INFO  L72            ComplementDD]: Start complementDD. Operand 25 states and 1765 transitions.
[2024-02-28 18:28:20,733 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 25 states and 1765 transitions.
[2024-02-28 18:28:20,733 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 18:28:20,733 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 25 states and 1765 transitions.
[2024-02-28 18:28:20,735 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 26 states, 25 states have (on average 70.6) internal successors, (1765), 25 states have internal predecessors, (1765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 18:28:20,738 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 26 states, 26 states have (on average 192.0) internal successors, (4992), 26 states have internal predecessors, (4992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 18:28:20,738 INFO  L81            ComplementDD]: Finished complementDD. Result  has 26 states, 26 states have (on average 192.0) internal successors, (4992), 26 states have internal predecessors, (4992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 18:28:20,739 INFO  L175             Difference]: Start difference. First operand has 317 places, 3492 transitions, 58992 flow. Second operand 25 states and 1765 transitions.
[2024-02-28 18:28:20,739 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 341 places, 4536 transitions, 85690 flow
[2024-02-28 18:28:48,976 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 338 places, 4536 transitions, 83793 flow, removed 946 selfloop flow, removed 3 redundant places.
[2024-02-28 18:28:49,061 INFO  L231             Difference]: Finished difference. Result has 345 places, 3971 transitions, 71320 flow
[2024-02-28 18:28:49,063 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=57313, PETRI_DIFFERENCE_MINUEND_PLACES=314, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=3492, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1275, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=71320, PETRI_PLACES=345, PETRI_TRANSITIONS=3971}
[2024-02-28 18:28:49,063 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, 288 predicate places.
[2024-02-28 18:28:49,064 INFO  L495      AbstractCegarLoop]: Abstraction has has 345 places, 3971 transitions, 71320 flow
[2024-02-28 18:28:49,064 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 25 states, 25 states have (on average 56.84) internal successors, (1421), 25 states have internal predecessors, (1421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 18:28:49,064 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-02-28 18:28:49,064 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 18:28:49,072 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0
[2024-02-28 18:28:49,265 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-02-28 18:28:49,265 INFO  L420      AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-02-28 18:28:49,266 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 18:28:49,266 INFO  L85        PathProgramCache]: Analyzing trace with hash -85817847, now seen corresponding path program 1 times
[2024-02-28 18:28:49,266 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 18:28:49,267 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611194592]
[2024-02-28 18:28:49,267 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 18:28:49,267 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 18:28:49,289 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 18:28:49,557 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 18:28:49,558 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 18:28:49,558 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611194592]
[2024-02-28 18:28:49,558 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611194592] provided 0 perfect and 1 imperfect interpolant sequences
[2024-02-28 18:28:49,558 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [559655563]
[2024-02-28 18:28:49,558 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 18:28:49,558 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-02-28 18:28:49,558 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-02-28 18:28:49,559 INFO  L229       MonitoredProcess]: Starting monitored process 12 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-02-28 18:28:49,560 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process
[2024-02-28 18:28:49,709 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 18:28:49,711 INFO  L263         TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 31 conjunts are in the unsatisfiable core
[2024-02-28 18:28:49,715 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-02-28 18:28:49,720 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2024-02-28 18:28:49,749 INFO  L321             Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2024-02-28 18:28:49,750 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11
[2024-02-28 18:28:49,772 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11
[2024-02-28 18:28:49,781 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20
[2024-02-28 18:28:49,790 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27
[2024-02-28 18:28:49,803 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-02-28 18:28:49,804 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42
[2024-02-28 18:28:49,821 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-02-28 18:28:49,821 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57
[2024-02-28 18:28:49,837 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50
[2024-02-28 18:28:49,860 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50
[2024-02-28 18:28:49,873 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 18:28:49,873 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2024-02-28 18:28:49,900 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (and (forall ((v_ArrVal_1385 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1385) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse0 |c_ULTIMATE.start_main_~ts~0#1.offset|)) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_1385 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1385) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse0 |c_ULTIMATE.start_main_~ts~0#1.offset| 2)) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_1385 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1385) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse0 |c_ULTIMATE.start_main_~ts~0#1.offset| 1)) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_1385 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1385) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse0 |c_ULTIMATE.start_main_~ts~0#1.offset| 3)))))) is different from false
[2024-02-28 18:28:50,018 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse2 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse3 (+ .cse2 |c_ULTIMATE.start_main_~ts~0#1.offset| 2)) (.cse1 (+ .cse2 |c_ULTIMATE.start_main_~ts~0#1.offset| 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse3 |c_ULTIMATE.start_main_#t~nondet9#1|) .cse1 |c_ULTIMATE.start_main_#t~nondet9#1|)))) (and (forall ((v_ArrVal_1385 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1385) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_1385 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1385) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse2 |c_ULTIMATE.start_main_~ts~0#1.offset|)))) (forall ((v_ArrVal_1385 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1385) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse3) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_1385 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1385) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse2 |c_ULTIMATE.start_main_~ts~0#1.offset| 1)))))))) is different from false
[2024-02-28 18:28:50,034 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse3 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse2 (+ .cse3 |c_ULTIMATE.start_main_~ts~0#1.offset| 1)) (.cse4 (+ .cse3 |c_ULTIMATE.start_main_~ts~0#1.offset| 2)) (.cse1 (+ .cse3 |c_ULTIMATE.start_main_~ts~0#1.offset| 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2 |c_ULTIMATE.start_main_#t~nondet9#1|) .cse4 |c_ULTIMATE.start_main_#t~nondet9#1|) .cse1 |c_ULTIMATE.start_main_#t~nondet9#1|)))) (and (forall ((v_ArrVal_1385 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1385) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_1385 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1385) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2))) (forall ((v_ArrVal_1385 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1385) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse3 |c_ULTIMATE.start_main_~ts~0#1.offset|)) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_1385 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1385) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse4) |c_ULTIMATE.start_main_#t~nondet9#1|)))))) is different from false
[2024-02-28 18:28:50,095 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked.
[2024-02-28 18:28:50,095 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [559655563] provided 0 perfect and 2 imperfect interpolant sequences
[2024-02-28 18:28:50,095 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-02-28 18:28:50,096 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 10] total 14
[2024-02-28 18:28:50,096 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081295094]
[2024-02-28 18:28:50,096 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-02-28 18:28:50,096 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 16 states
[2024-02-28 18:28:50,096 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 18:28:50,096 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants.
[2024-02-28 18:28:50,096 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=118, Unknown=9, NotChecked=72, Total=240
[2024-02-28 18:28:50,205 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 53 out of 192
[2024-02-28 18:28:50,205 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 345 places, 3971 transitions, 71320 flow. Second operand  has 16 states, 16 states have (on average 54.75) internal successors, (876), 16 states have internal predecessors, (876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 18:28:50,205 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 18:28:50,206 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 53 of 192
[2024-02-28 18:28:50,206 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 18:29:21,837 INFO  L130       PetriNetUnfolder]: 26160/44175 cut-off events.
[2024-02-28 18:29:21,837 INFO  L131       PetriNetUnfolder]: For 1231998/1232042 co-relation queries the response was YES.
[2024-02-28 18:29:22,568 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 465723 conditions, 44175 events. 26160/44175 cut-off events. For 1231998/1232042 co-relation queries the response was YES. Maximal size of possible extension queue 1369. Compared 344462 event pairs, 3912 based on Foata normal form. 66/41604 useless extension candidates. Maximal degree in co-relation 461007. Up to 38536 conditions per place. 
[2024-02-28 18:29:22,872 INFO  L137   encePairwiseOnDemand]: 168/192 looper letters, 3174 selfloop transitions, 1041 changer transitions 0/4219 dead transitions.
[2024-02-28 18:29:22,873 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 356 places, 4219 transitions, 84045 flow
[2024-02-28 18:29:22,874 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. 
[2024-02-28 18:29:22,874 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 12 states.
[2024-02-28 18:29:22,875 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 819 transitions.
[2024-02-28 18:29:22,875 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.35546875
[2024-02-28 18:29:22,875 INFO  L72            ComplementDD]: Start complementDD. Operand 12 states and 819 transitions.
[2024-02-28 18:29:22,875 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 12 states and 819 transitions.
[2024-02-28 18:29:22,875 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 18:29:22,875 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 819 transitions.
[2024-02-28 18:29:22,876 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 13 states, 12 states have (on average 68.25) internal successors, (819), 12 states have internal predecessors, (819), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 18:29:22,878 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 13 states, 13 states have (on average 192.0) internal successors, (2496), 13 states have internal predecessors, (2496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 18:29:22,878 INFO  L81            ComplementDD]: Finished complementDD. Result  has 13 states, 13 states have (on average 192.0) internal successors, (2496), 13 states have internal predecessors, (2496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 18:29:22,878 INFO  L175             Difference]: Start difference. First operand has 345 places, 3971 transitions, 71320 flow. Second operand 12 states and 819 transitions.
[2024-02-28 18:29:22,878 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 356 places, 4219 transitions, 84045 flow
[2024-02-28 18:29:53,914 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 347 places, 4219 transitions, 82234 flow, removed 856 selfloop flow, removed 9 redundant places.
[2024-02-28 18:29:53,982 INFO  L231             Difference]: Finished difference. Result has 349 places, 4037 transitions, 72965 flow
[2024-02-28 18:29:53,984 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=69498, PETRI_DIFFERENCE_MINUEND_PLACES=336, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=3965, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=969, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2984, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=72965, PETRI_PLACES=349, PETRI_TRANSITIONS=4037}
[2024-02-28 18:29:53,984 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, 292 predicate places.
[2024-02-28 18:29:53,985 INFO  L495      AbstractCegarLoop]: Abstraction has has 349 places, 4037 transitions, 72965 flow
[2024-02-28 18:29:53,985 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 16 states, 16 states have (on average 54.75) internal successors, (876), 16 states have internal predecessors, (876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 18:29:53,985 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-02-28 18:29:53,985 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 18:29:53,991 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0
[2024-02-28 18:29:54,185 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-02-28 18:29:54,186 INFO  L420      AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-02-28 18:29:54,186 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 18:29:54,187 INFO  L85        PathProgramCache]: Analyzing trace with hash 92273895, now seen corresponding path program 4 times
[2024-02-28 18:29:54,187 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 18:29:54,187 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463270275]
[2024-02-28 18:29:54,187 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 18:29:54,187 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 18:29:54,203 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 18:29:54,444 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 18:29:54,445 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 18:29:54,445 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463270275]
[2024-02-28 18:29:54,445 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463270275] provided 0 perfect and 1 imperfect interpolant sequences
[2024-02-28 18:29:54,445 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [735842448]
[2024-02-28 18:29:54,445 INFO  L93    rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2024-02-28 18:29:54,445 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-02-28 18:29:54,445 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-02-28 18:29:54,446 INFO  L229       MonitoredProcess]: Starting monitored process 13 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-02-28 18:29:54,447 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process
[2024-02-28 18:29:54,662 INFO  L228   tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s)
[2024-02-28 18:29:54,662 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-02-28 18:29:54,664 INFO  L263         TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 30 conjunts are in the unsatisfiable core
[2024-02-28 18:29:54,668 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-02-28 18:29:54,677 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2024-02-28 18:29:54,686 INFO  L321             Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2024-02-28 18:29:54,686 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11
[2024-02-28 18:29:54,711 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11
[2024-02-28 18:29:54,719 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27
[2024-02-28 18:29:54,738 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30
[2024-02-28 18:29:54,751 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-02-28 18:29:54,751 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42
[2024-02-28 18:29:54,765 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-02-28 18:29:54,766 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57
[2024-02-28 18:29:54,784 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50
[2024-02-28 18:29:54,792 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 18:29:54,793 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2024-02-28 18:29:54,812 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (and (forall ((v_ArrVal_1480 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1480) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse0)) 0)) (forall ((v_ArrVal_1480 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1480) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse0)) 0)) (forall ((v_ArrVal_1480 (Array Int Int))) (= 0 (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1480) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse0)))) (forall ((v_ArrVal_1480 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1480) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse0)) 0)))) is different from false
[2024-02-28 18:29:54,921 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse1))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2 0) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse1) 0)))) (and (forall ((v_ArrVal_1480 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1480) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse1)) 0)) (forall ((v_ArrVal_1480 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1480) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_1480 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1480) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse1)) 0)))))) is different from false
[2024-02-28 18:29:54,938 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse3 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse3)) (.cse1 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse3))) (and (forall ((v_ArrVal_1475 (Array Int Int)) (v_ArrVal_1480 (Array Int Int))) (= (select (select (store (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1475))) (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (select .cse0 |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 0) .cse2 0))) c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1480) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse3)) 0)) (forall ((v_ArrVal_1475 (Array Int Int)) (v_ArrVal_1480 (Array Int Int))) (= 0 (select (select (store (let ((.cse4 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1475))) (store .cse4 |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (select .cse4 |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 0) .cse2 0))) c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1480) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse3)))) (forall ((v_ArrVal_1475 (Array Int Int)) (v_ArrVal_1480 (Array Int Int))) (= (select (select (store (let ((.cse5 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1475))) (store .cse5 |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (select .cse5 |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 0) .cse2 0))) c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1480) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1) 0))))) is different from false
[2024-02-28 18:29:54,953 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse3 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse3)) (.cse1 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse3))) (and (forall ((v_ArrVal_1475 (Array Int Int)) (v_ArrVal_1480 (Array Int Int))) (= (select (select (store (let ((.cse0 (store |c_#race| |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_1475))) (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (select .cse0 |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 0) .cse2 0))) |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_1480) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse3)) 0)) (forall ((v_ArrVal_1475 (Array Int Int)) (v_ArrVal_1480 (Array Int Int))) (= (select (select (store (let ((.cse4 (store |c_#race| |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_1475))) (store .cse4 |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (select .cse4 |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 0) .cse2 0))) |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_1480) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse3)) 0)) (forall ((v_ArrVal_1475 (Array Int Int)) (v_ArrVal_1480 (Array Int Int))) (= (select (select (store (let ((.cse5 (store |c_#race| |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_1475))) (store .cse5 |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (select .cse5 |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 0) .cse2 0))) |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_1480) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1) 0))))) is different from false
[2024-02-28 18:29:55,032 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 18:29:55,033 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [735842448] provided 0 perfect and 2 imperfect interpolant sequences
[2024-02-28 18:29:55,033 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-02-28 18:29:55,033 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 10] total 15
[2024-02-28 18:29:55,033 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16396840]
[2024-02-28 18:29:55,033 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-02-28 18:29:55,033 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 17 states
[2024-02-28 18:29:55,033 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 18:29:55,033 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants.
[2024-02-28 18:29:55,034 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=121, Unknown=10, NotChecked=100, Total=272
[2024-02-28 18:29:55,085 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 55 out of 192
[2024-02-28 18:29:55,086 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 349 places, 4037 transitions, 72965 flow. Second operand  has 17 states, 17 states have (on average 56.64705882352941) internal successors, (963), 17 states have internal predecessors, (963), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 18:29:55,086 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 18:29:55,086 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 192
[2024-02-28 18:29:55,086 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 18:30:33,392 INFO  L130       PetriNetUnfolder]: 29823/50776 cut-off events.
[2024-02-28 18:30:33,392 INFO  L131       PetriNetUnfolder]: For 1471610/1471630 co-relation queries the response was YES.
[2024-02-28 18:30:34,269 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 530969 conditions, 50776 events. 29823/50776 cut-off events. For 1471610/1471630 co-relation queries the response was YES. Maximal size of possible extension queue 1522. Compared 408296 event pairs, 2784 based on Foata normal form. 184/47868 useless extension candidates. Maximal degree in co-relation 525729. Up to 32484 conditions per place. 
[2024-02-28 18:30:34,608 INFO  L137   encePairwiseOnDemand]: 162/192 looper letters, 3395 selfloop transitions, 1642 changer transitions 0/5041 dead transitions.
[2024-02-28 18:30:34,608 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 372 places, 5041 transitions, 102378 flow
[2024-02-28 18:30:34,609 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. 
[2024-02-28 18:30:34,609 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 24 states.
[2024-02-28 18:30:34,610 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 1702 transitions.
[2024-02-28 18:30:34,611 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.3693576388888889
[2024-02-28 18:30:34,611 INFO  L72            ComplementDD]: Start complementDD. Operand 24 states and 1702 transitions.
[2024-02-28 18:30:34,611 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 24 states and 1702 transitions.
[2024-02-28 18:30:34,611 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 18:30:34,611 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 24 states and 1702 transitions.
[2024-02-28 18:30:34,613 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 25 states, 24 states have (on average 70.91666666666667) internal successors, (1702), 24 states have internal predecessors, (1702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 18:30:34,616 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 25 states, 25 states have (on average 192.0) internal successors, (4800), 25 states have internal predecessors, (4800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 18:30:34,616 INFO  L81            ComplementDD]: Finished complementDD. Result  has 25 states, 25 states have (on average 192.0) internal successors, (4800), 25 states have internal predecessors, (4800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 18:30:34,616 INFO  L175             Difference]: Start difference. First operand has 349 places, 4037 transitions, 72965 flow. Second operand 24 states and 1702 transitions.
[2024-02-28 18:30:34,617 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 372 places, 5041 transitions, 102378 flow
[2024-02-28 18:31:07,856 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 365 places, 5041 transitions, 100501 flow, removed 117 selfloop flow, removed 7 redundant places.
[2024-02-28 18:31:07,960 INFO  L231             Difference]: Finished difference. Result has 385 places, 4635 transitions, 91290 flow
[2024-02-28 18:31:07,962 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=71127, PETRI_DIFFERENCE_MINUEND_PLACES=342, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=4037, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1128, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2715, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=91290, PETRI_PLACES=385, PETRI_TRANSITIONS=4635}
[2024-02-28 18:31:07,963 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, 328 predicate places.
[2024-02-28 18:31:07,963 INFO  L495      AbstractCegarLoop]: Abstraction has has 385 places, 4635 transitions, 91290 flow
[2024-02-28 18:31:07,963 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 17 states, 17 states have (on average 56.64705882352941) internal successors, (963), 17 states have internal predecessors, (963), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 18:31:07,963 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-02-28 18:31:07,963 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 18:31:07,971 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0
[2024-02-28 18:31:08,164 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20
[2024-02-28 18:31:08,165 INFO  L420      AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-02-28 18:31:08,165 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 18:31:08,165 INFO  L85        PathProgramCache]: Analyzing trace with hash -1956895420, now seen corresponding path program 1 times
[2024-02-28 18:31:08,165 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 18:31:08,166 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692141381]
[2024-02-28 18:31:08,166 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 18:31:08,166 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 18:31:08,182 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 18:31:08,411 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 18:31:08,412 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 18:31:08,412 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692141381]
[2024-02-28 18:31:08,412 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692141381] provided 0 perfect and 1 imperfect interpolant sequences
[2024-02-28 18:31:08,412 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1606549874]
[2024-02-28 18:31:08,412 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 18:31:08,412 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-02-28 18:31:08,412 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-02-28 18:31:08,413 INFO  L229       MonitoredProcess]: Starting monitored process 14 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-02-28 18:31:08,415 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process
[2024-02-28 18:31:08,545 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 18:31:08,546 INFO  L263         TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 43 conjunts are in the unsatisfiable core
[2024-02-28 18:31:08,548 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-02-28 18:31:08,563 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2024-02-28 18:31:08,591 INFO  L321             Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2024-02-28 18:31:08,591 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11
[2024-02-28 18:31:08,694 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11
[2024-02-28 18:31:08,718 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27
[2024-02-28 18:31:08,759 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42
[2024-02-28 18:31:08,795 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 57
[2024-02-28 18:31:08,855 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50
[2024-02-28 18:31:08,895 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 18:31:08,895 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2024-02-28 18:31:08,921 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (and (forall ((v_ArrVal_1571 (Array Int Int))) (= 0 (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1571) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse0)))) (forall ((v_ArrVal_1571 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1571) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse0)) 0)) (forall ((v_ArrVal_1571 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1571) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse0)) 0)) (forall ((v_ArrVal_1571 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1571) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse0)) 0)))) is different from false
[2024-02-28 18:31:09,083 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse1))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2 0) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse1) 0)))) (and (forall ((v_ArrVal_1571 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1571) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse1)) 0)) (forall ((v_ArrVal_1571 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1571) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_1571 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1571) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse1)) 0)))))) is different from false
[2024-02-28 18:31:09,105 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse2 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse2)) (.cse3 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse2))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 0) .cse3 0) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse2) 0)))) (and (forall ((v_ArrVal_1571 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1571) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1571 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1571) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse2)) 0)) (forall ((v_ArrVal_1571 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1571) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse3) 0)))))) is different from false
[2024-02-28 18:31:09,126 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-02-28 18:31:09,126 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 67
[2024-02-28 18:31:09,131 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-02-28 18:31:09,132 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 83 treesize of output 39
[2024-02-28 18:31:09,135 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 3
[2024-02-28 18:31:09,145 INFO  L321             Elim1Store]: treesize reduction 51, result has 1.9 percent of original size
[2024-02-28 18:31:09,146 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 1
[2024-02-28 18:31:09,150 INFO  L321             Elim1Store]: treesize reduction 51, result has 1.9 percent of original size
[2024-02-28 18:31:09,150 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 50 treesize of output 1
[2024-02-28 18:31:09,186 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 18:31:09,186 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1606549874] provided 0 perfect and 2 imperfect interpolant sequences
[2024-02-28 18:31:09,186 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-02-28 18:31:09,187 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 9] total 24
[2024-02-28 18:31:09,187 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931549539]
[2024-02-28 18:31:09,187 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-02-28 18:31:09,187 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 26 states
[2024-02-28 18:31:09,187 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 18:31:09,187 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants.
[2024-02-28 18:31:09,188 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=404, Unknown=14, NotChecked=132, Total=650
[2024-02-28 18:31:09,388 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 48 out of 192
[2024-02-28 18:31:09,390 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 385 places, 4635 transitions, 91290 flow. Second operand  has 26 states, 26 states have (on average 49.73076923076923) internal successors, (1293), 26 states have internal predecessors, (1293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 18:31:09,390 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 18:31:09,390 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 192
[2024-02-28 18:31:09,391 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 18:31:57,561 INFO  L130       PetriNetUnfolder]: 30142/51413 cut-off events.
[2024-02-28 18:31:57,561 INFO  L131       PetriNetUnfolder]: For 1854577/1854615 co-relation queries the response was YES.
[2024-02-28 18:31:58,630 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 574702 conditions, 51413 events. 30142/51413 cut-off events. For 1854577/1854615 co-relation queries the response was YES. Maximal size of possible extension queue 1555. Compared 415600 event pairs, 2004 based on Foata normal form. 114/48419 useless extension candidates. Maximal degree in co-relation 568834. Up to 18452 conditions per place. 
[2024-02-28 18:31:58,943 INFO  L137   encePairwiseOnDemand]: 161/192 looper letters, 3219 selfloop transitions, 2253 changer transitions 4/5480 dead transitions.
[2024-02-28 18:31:58,943 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 418 places, 5480 transitions, 118395 flow
[2024-02-28 18:31:58,944 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. 
[2024-02-28 18:31:58,944 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 34 states.
[2024-02-28 18:31:58,946 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 2123 transitions.
[2024-02-28 18:31:58,947 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.3252144607843137
[2024-02-28 18:31:58,947 INFO  L72            ComplementDD]: Start complementDD. Operand 34 states and 2123 transitions.
[2024-02-28 18:31:58,947 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 34 states and 2123 transitions.
[2024-02-28 18:31:58,947 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 18:31:58,947 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 34 states and 2123 transitions.
[2024-02-28 18:31:58,950 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 35 states, 34 states have (on average 62.44117647058823) internal successors, (2123), 34 states have internal predecessors, (2123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 18:31:58,954 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 35 states, 35 states have (on average 192.0) internal successors, (6720), 35 states have internal predecessors, (6720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 18:31:58,955 INFO  L81            ComplementDD]: Finished complementDD. Result  has 35 states, 35 states have (on average 192.0) internal successors, (6720), 35 states have internal predecessors, (6720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 18:31:58,955 INFO  L175             Difference]: Start difference. First operand has 385 places, 4635 transitions, 91290 flow. Second operand 34 states and 2123 transitions.
[2024-02-28 18:31:58,955 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 418 places, 5480 transitions, 118395 flow
[2024-02-28 18:32:42,537 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 414 places, 5480 transitions, 115212 flow, removed 1585 selfloop flow, removed 4 redundant places.
[2024-02-28 18:32:42,621 INFO  L231             Difference]: Finished difference. Result has 422 places, 4840 transitions, 99613 flow
[2024-02-28 18:32:42,624 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=88151, PETRI_DIFFERENCE_MINUEND_PLACES=381, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=4620, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2041, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2521, PETRI_DIFFERENCE_SUBTRAHEND_STATES=34, PETRI_FLOW=99613, PETRI_PLACES=422, PETRI_TRANSITIONS=4840}
[2024-02-28 18:32:42,624 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, 365 predicate places.
[2024-02-28 18:32:42,624 INFO  L495      AbstractCegarLoop]: Abstraction has has 422 places, 4840 transitions, 99613 flow
[2024-02-28 18:32:42,624 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 26 states, 26 states have (on average 49.73076923076923) internal successors, (1293), 26 states have internal predecessors, (1293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 18:32:42,625 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-02-28 18:32:42,625 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 18:32:42,629 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0
[2024-02-28 18:32:42,829 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21
[2024-02-28 18:32:42,830 INFO  L420      AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-02-28 18:32:42,830 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 18:32:42,831 INFO  L85        PathProgramCache]: Analyzing trace with hash 736991051, now seen corresponding path program 5 times
[2024-02-28 18:32:42,831 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 18:32:42,831 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536432348]
[2024-02-28 18:32:42,831 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 18:32:42,831 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 18:32:42,851 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 18:32:43,073 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 18:32:43,074 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 18:32:43,074 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536432348]
[2024-02-28 18:32:43,074 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536432348] provided 0 perfect and 1 imperfect interpolant sequences
[2024-02-28 18:32:43,074 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [409950229]
[2024-02-28 18:32:43,074 INFO  L93    rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1
[2024-02-28 18:32:43,074 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-02-28 18:32:43,074 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-02-28 18:32:43,075 INFO  L229       MonitoredProcess]: Starting monitored process 15 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-02-28 18:32:43,077 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process
[2024-02-28 18:32:43,209 INFO  L228   tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2024-02-28 18:32:43,209 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-02-28 18:32:43,210 INFO  L263         TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 42 conjunts are in the unsatisfiable core
[2024-02-28 18:32:43,214 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-02-28 18:32:43,228 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2024-02-28 18:32:43,256 INFO  L321             Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2024-02-28 18:32:43,256 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11
[2024-02-28 18:32:43,346 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11
[2024-02-28 18:32:43,400 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20
[2024-02-28 18:32:43,415 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27
[2024-02-28 18:32:43,467 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42
[2024-02-28 18:32:43,511 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 57
[2024-02-28 18:32:43,564 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50
[2024-02-28 18:32:43,604 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 18:32:43,604 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2024-02-28 18:32:43,626 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (and (forall ((v_ArrVal_1666 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1666) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse0)) 0)) (forall ((v_ArrVal_1666 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1666) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse0)) 0)) (forall ((v_ArrVal_1666 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1666) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse0)) 0)) (forall ((v_ArrVal_1666 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1666) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse0)) 0)))) is different from false
[2024-02-28 18:32:43,770 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse2 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse2)) (.cse3 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse2))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 0) .cse3 0)))) (and (forall ((v_ArrVal_1666 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1666) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1666 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1666) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse2)) 0)) (forall ((v_ArrVal_1666 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1666) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse3) 0)) (forall ((v_ArrVal_1666 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1666) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse2)) 0)))))) is different from false
[2024-02-28 18:32:43,794 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse4 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse4)) (.cse3 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse4)) (.cse2 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse4))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 0) .cse3 0) .cse2 0)))) (and (forall ((v_ArrVal_1666 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1666) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1666 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1666) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_1666 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1666) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse3) 0)) (forall ((v_ArrVal_1666 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1666) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse4)) 0)))))) is different from false
[2024-02-28 18:32:43,888 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 18:32:43,888 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [409950229] provided 0 perfect and 2 imperfect interpolant sequences
[2024-02-28 18:32:43,889 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-02-28 18:32:43,889 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 24
[2024-02-28 18:32:43,889 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106858552]
[2024-02-28 18:32:43,889 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-02-28 18:32:43,889 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 26 states
[2024-02-28 18:32:43,890 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 18:32:43,890 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants.
[2024-02-28 18:32:43,890 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=414, Unknown=13, NotChecked=132, Total=650
[2024-02-28 18:32:44,047 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 48 out of 192
[2024-02-28 18:32:44,048 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 422 places, 4840 transitions, 99613 flow. Second operand  has 26 states, 26 states have (on average 49.80769230769231) internal successors, (1295), 26 states have internal predecessors, (1295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 18:32:44,048 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 18:32:44,048 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 192
[2024-02-28 18:32:44,048 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 18:33:41,540 INFO  L130       PetriNetUnfolder]: 33457/57317 cut-off events.
[2024-02-28 18:33:41,540 INFO  L131       PetriNetUnfolder]: For 2928608/2928634 co-relation queries the response was YES.
[2024-02-28 18:33:42,700 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 675531 conditions, 57317 events. 33457/57317 cut-off events. For 2928608/2928634 co-relation queries the response was YES. Maximal size of possible extension queue 1726. Compared 472331 event pairs, 2420 based on Foata normal form. 184/55469 useless extension candidates. Maximal degree in co-relation 669066. Up to 22990 conditions per place. 
[2024-02-28 18:33:43,077 INFO  L137   encePairwiseOnDemand]: 161/192 looper letters, 3860 selfloop transitions, 2116 changer transitions 0/5980 dead transitions.
[2024-02-28 18:33:43,077 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 446 places, 5980 transitions, 136763 flow
[2024-02-28 18:33:43,078 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. 
[2024-02-28 18:33:43,079 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 25 states.
[2024-02-28 18:33:43,080 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 1588 transitions.
[2024-02-28 18:33:43,080 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.3308333333333333
[2024-02-28 18:33:43,080 INFO  L72            ComplementDD]: Start complementDD. Operand 25 states and 1588 transitions.
[2024-02-28 18:33:43,080 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 25 states and 1588 transitions.
[2024-02-28 18:33:43,081 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 18:33:43,081 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 25 states and 1588 transitions.
[2024-02-28 18:33:43,083 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 26 states, 25 states have (on average 63.52) internal successors, (1588), 25 states have internal predecessors, (1588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 18:33:43,085 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 26 states, 26 states have (on average 192.0) internal successors, (4992), 26 states have internal predecessors, (4992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 18:33:43,086 INFO  L81            ComplementDD]: Finished complementDD. Result  has 26 states, 26 states have (on average 192.0) internal successors, (4992), 26 states have internal predecessors, (4992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 18:33:43,086 INFO  L175             Difference]: Start difference. First operand has 422 places, 4840 transitions, 99613 flow. Second operand 25 states and 1588 transitions.
[2024-02-28 18:33:43,086 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 446 places, 5980 transitions, 136763 flow
[2024-02-28 18:34:41,022 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 433 places, 5980 transitions, 134508 flow, removed 720 selfloop flow, removed 13 redundant places.
[2024-02-28 18:34:41,116 INFO  L231             Difference]: Finished difference. Result has 451 places, 5469 transitions, 123099 flow
[2024-02-28 18:34:41,119 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=97634, PETRI_DIFFERENCE_MINUEND_PLACES=409, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=4836, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1597, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=3013, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=123099, PETRI_PLACES=451, PETRI_TRANSITIONS=5469}
[2024-02-28 18:34:41,119 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, 394 predicate places.
[2024-02-28 18:34:41,119 INFO  L495      AbstractCegarLoop]: Abstraction has has 451 places, 5469 transitions, 123099 flow
[2024-02-28 18:34:41,120 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 26 states, 26 states have (on average 49.80769230769231) internal successors, (1295), 26 states have internal predecessors, (1295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 18:34:41,120 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-02-28 18:34:41,120 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 18:34:41,135 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0
[2024-02-28 18:34:41,320 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,15 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-02-28 18:34:41,321 INFO  L420      AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-02-28 18:34:41,322 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 18:34:41,322 INFO  L85        PathProgramCache]: Analyzing trace with hash -159175320, now seen corresponding path program 1 times
[2024-02-28 18:34:41,322 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 18:34:41,322 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974964004]
[2024-02-28 18:34:41,322 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 18:34:41,323 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 18:34:41,340 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 18:34:41,614 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 18:34:41,614 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 18:34:41,614 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974964004]
[2024-02-28 18:34:41,614 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974964004] provided 0 perfect and 1 imperfect interpolant sequences
[2024-02-28 18:34:41,614 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1147429861]
[2024-02-28 18:34:41,614 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 18:34:41,614 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-02-28 18:34:41,614 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-02-28 18:34:41,615 INFO  L229       MonitoredProcess]: Starting monitored process 16 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-02-28 18:34:41,617 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process
[2024-02-28 18:34:41,777 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 18:34:41,779 INFO  L263         TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 34 conjunts are in the unsatisfiable core
[2024-02-28 18:34:41,782 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-02-28 18:34:41,786 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2024-02-28 18:34:41,819 INFO  L321             Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2024-02-28 18:34:41,820 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11
[2024-02-28 18:34:41,837 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11
[2024-02-28 18:34:41,847 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20
[2024-02-28 18:34:41,855 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20
[2024-02-28 18:34:41,865 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20
[2024-02-28 18:34:41,875 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27
[2024-02-28 18:34:41,891 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-02-28 18:34:41,892 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42
[2024-02-28 18:34:41,906 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-02-28 18:34:41,906 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57
[2024-02-28 18:34:41,930 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50
[2024-02-28 18:34:41,940 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 18:34:41,940 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2024-02-28 18:34:41,960 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (and (forall ((v_ArrVal_1788 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1788) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse0 |c_ULTIMATE.start_main_~ts~0#1.offset| 3)))) (forall ((v_ArrVal_1788 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1788) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse0 |c_ULTIMATE.start_main_~ts~0#1.offset| 1)) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_1788 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1788) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse0 |c_ULTIMATE.start_main_~ts~0#1.offset|)) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_1788 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1788) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse0 |c_ULTIMATE.start_main_~ts~0#1.offset| 2)))))) is different from false
[2024-02-28 18:34:42,058 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse2 (+ .cse1 |c_ULTIMATE.start_main_~ts~0#1.offset| 2))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2 |c_ULTIMATE.start_main_#t~nondet9#1|) (+ .cse1 |c_ULTIMATE.start_main_~ts~0#1.offset| 3) |c_ULTIMATE.start_main_#t~nondet9#1|)))) (and (forall ((v_ArrVal_1788 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1788) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse1 |c_ULTIMATE.start_main_~ts~0#1.offset| 1)) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_1788 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1788) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_1788 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1788) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse1 |c_ULTIMATE.start_main_~ts~0#1.offset|)) |c_ULTIMATE.start_main_#t~nondet9#1|)))))) is different from false
[2024-02-28 18:34:42,069 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse3 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse2 (+ .cse3 |c_ULTIMATE.start_main_~ts~0#1.offset| 1)) (.cse1 (+ .cse3 |c_ULTIMATE.start_main_~ts~0#1.offset| 2))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2 |c_ULTIMATE.start_main_#t~nondet9#1|) .cse1 |c_ULTIMATE.start_main_#t~nondet9#1|) (+ .cse3 |c_ULTIMATE.start_main_~ts~0#1.offset| 3) |c_ULTIMATE.start_main_#t~nondet9#1|)))) (and (forall ((v_ArrVal_1788 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1788) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1))) (forall ((v_ArrVal_1788 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1788) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2))) (forall ((v_ArrVal_1788 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1788) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse3 |c_ULTIMATE.start_main_~ts~0#1.offset|)) |c_ULTIMATE.start_main_#t~nondet9#1|)))))) is different from false
[2024-02-28 18:34:42,139 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked.
[2024-02-28 18:34:42,139 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1147429861] provided 0 perfect and 2 imperfect interpolant sequences
[2024-02-28 18:34:42,139 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-02-28 18:34:42,139 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 10] total 14
[2024-02-28 18:34:42,139 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965123112]
[2024-02-28 18:34:42,139 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-02-28 18:34:42,140 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 16 states
[2024-02-28 18:34:42,140 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 18:34:42,140 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants.
[2024-02-28 18:34:42,140 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=118, Unknown=9, NotChecked=72, Total=240
[2024-02-28 18:34:42,230 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 53 out of 192
[2024-02-28 18:34:42,231 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 451 places, 5469 transitions, 123099 flow. Second operand  has 16 states, 16 states have (on average 54.75) internal successors, (876), 16 states have internal predecessors, (876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 18:34:42,231 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 18:34:42,231 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 53 of 192
[2024-02-28 18:34:42,231 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 18:35:43,348 INFO  L130       PetriNetUnfolder]: 33456/57201 cut-off events.
[2024-02-28 18:35:43,348 INFO  L131       PetriNetUnfolder]: For 3318944/3318972 co-relation queries the response was YES.
[2024-02-28 18:35:44,744 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 704513 conditions, 57201 events. 33456/57201 cut-off events. For 3318944/3318972 co-relation queries the response was YES. Maximal size of possible extension queue 1718. Compared 469188 event pairs, 5576 based on Foata normal form. 2/55170 useless extension candidates. Maximal degree in co-relation 703678. Up to 50485 conditions per place. 
[2024-02-28 18:35:45,115 INFO  L137   encePairwiseOnDemand]: 168/192 looper letters, 4522 selfloop transitions, 1107 changer transitions 0/5633 dead transitions.
[2024-02-28 18:35:45,115 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 462 places, 5633 transitions, 137877 flow
[2024-02-28 18:35:45,116 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. 
[2024-02-28 18:35:45,116 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 12 states.
[2024-02-28 18:35:45,116 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 816 transitions.
[2024-02-28 18:35:45,117 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.3541666666666667
[2024-02-28 18:35:45,117 INFO  L72            ComplementDD]: Start complementDD. Operand 12 states and 816 transitions.
[2024-02-28 18:35:45,117 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 12 states and 816 transitions.
[2024-02-28 18:35:45,117 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 18:35:45,117 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 816 transitions.
[2024-02-28 18:35:45,118 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 13 states, 12 states have (on average 68.0) internal successors, (816), 12 states have internal predecessors, (816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 18:35:45,119 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 13 states, 13 states have (on average 192.0) internal successors, (2496), 13 states have internal predecessors, (2496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 18:35:45,120 INFO  L81            ComplementDD]: Finished complementDD. Result  has 13 states, 13 states have (on average 192.0) internal successors, (2496), 13 states have internal predecessors, (2496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 18:35:45,120 INFO  L175             Difference]: Start difference. First operand has 451 places, 5469 transitions, 123099 flow. Second operand 12 states and 816 transitions.
[2024-02-28 18:35:45,120 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 462 places, 5633 transitions, 137877 flow
[2024-02-28 18:36:43,790 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 458 places, 5633 transitions, 133616 flow, removed 2125 selfloop flow, removed 4 redundant places.
[2024-02-28 18:36:43,884 INFO  L231             Difference]: Finished difference. Result has 460 places, 5470 transitions, 121337 flow
[2024-02-28 18:36:43,888 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=118838, PETRI_DIFFERENCE_MINUEND_PLACES=447, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=5469, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1106, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=4362, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=121337, PETRI_PLACES=460, PETRI_TRANSITIONS=5470}
[2024-02-28 18:36:43,888 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, 403 predicate places.
[2024-02-28 18:36:43,888 INFO  L495      AbstractCegarLoop]: Abstraction has has 460 places, 5470 transitions, 121337 flow
[2024-02-28 18:36:43,889 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 16 states, 16 states have (on average 54.75) internal successors, (876), 16 states have internal predecessors, (876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 18:36:43,889 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-02-28 18:36:43,889 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 18:36:43,893 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0
[2024-02-28 18:36:44,089 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,16 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-02-28 18:36:44,090 INFO  L420      AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-02-28 18:36:44,091 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 18:36:44,091 INFO  L85        PathProgramCache]: Analyzing trace with hash 818731398, now seen corresponding path program 1 times
[2024-02-28 18:36:44,091 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 18:36:44,092 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312412372]
[2024-02-28 18:36:44,092 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 18:36:44,092 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 18:36:44,113 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 18:36:44,402 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 18:36:44,403 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 18:36:44,403 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312412372]
[2024-02-28 18:36:44,403 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312412372] provided 0 perfect and 1 imperfect interpolant sequences
[2024-02-28 18:36:44,403 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1151928467]
[2024-02-28 18:36:44,403 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 18:36:44,403 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-02-28 18:36:44,403 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-02-28 18:36:44,405 INFO  L229       MonitoredProcess]: Starting monitored process 17 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-02-28 18:36:44,406 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process
[2024-02-28 18:36:44,582 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 18:36:44,583 INFO  L263         TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 43 conjunts are in the unsatisfiable core
[2024-02-28 18:36:44,587 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-02-28 18:36:44,598 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2024-02-28 18:36:44,629 INFO  L321             Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2024-02-28 18:36:44,629 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11
[2024-02-28 18:36:44,720 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11
[2024-02-28 18:36:44,757 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27
[2024-02-28 18:36:44,835 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30
[2024-02-28 18:36:44,855 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30
[2024-02-28 18:36:44,870 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30
[2024-02-28 18:36:44,887 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42
[2024-02-28 18:36:44,947 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 57
[2024-02-28 18:36:45,009 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50
[2024-02-28 18:36:45,057 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 18:36:45,057 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2024-02-28 18:36:45,079 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (and (forall ((v_ArrVal_1893 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1893) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse0)) 0)) (forall ((v_ArrVal_1893 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1893) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse0)) 0)) (forall ((v_ArrVal_1893 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1893) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse0)) 0)) (forall ((v_ArrVal_1893 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1893) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse0)) 0)))) is different from false
[2024-02-28 18:36:45,104 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse2 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse2))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 0)))) (and (forall ((v_ArrVal_1893 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1893) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1893 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1893) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse2)) 0)) (forall ((v_ArrVal_1893 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1893) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse2)) 0)) (forall ((v_ArrVal_1893 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1893) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse2)) 0)))))) is different from false
[2024-02-28 18:36:45,127 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse2 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse2)) (.cse3 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse2))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 0) .cse3 0)))) (and (forall ((v_ArrVal_1893 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1893) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1893 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1893) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse2)) 0)) (forall ((v_ArrVal_1893 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1893) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse2)) 0)) (forall ((v_ArrVal_1893 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1893) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse3) 0)))))) is different from false
[2024-02-28 18:36:45,173 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse3 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse3)) (.cse2 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse3))) (and (forall ((v_ArrVal_1888 (Array Int Int)) (v_ArrVal_1893 (Array Int Int))) (= (select (select (store (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1888))) (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (select .cse0 |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 0) .cse2 0))) c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1893) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse3)) 0)) (forall ((v_ArrVal_1888 (Array Int Int)) (v_ArrVal_1893 (Array Int Int))) (= (select (select (store (let ((.cse4 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1888))) (store .cse4 |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (select .cse4 |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 0) .cse2 0))) c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1893) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1888 (Array Int Int)) (v_ArrVal_1893 (Array Int Int))) (= (select (select (store (let ((.cse5 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1888))) (store .cse5 |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (select .cse5 |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 0) .cse2 0))) c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1893) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_1888 (Array Int Int)) (v_ArrVal_1893 (Array Int Int))) (= (select (select (store (let ((.cse6 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1888))) (store .cse6 |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (select .cse6 |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 0) .cse2 0))) c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1893) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse3)) 0))))) is different from false
[2024-02-28 18:36:45,238 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse3 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse3)) (.cse2 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse3))) (and (forall ((v_ArrVal_1888 (Array Int Int)) (v_ArrVal_1893 (Array Int Int))) (= (select (select (store (let ((.cse0 (store |c_#race| |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_1888))) (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (select .cse0 |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 0) .cse2 0))) |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_1893) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse3)) 0)) (forall ((v_ArrVal_1888 (Array Int Int)) (v_ArrVal_1893 (Array Int Int))) (= (select (select (store (let ((.cse4 (store |c_#race| |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_1888))) (store .cse4 |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (select .cse4 |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 0) .cse2 0))) |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_1893) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1888 (Array Int Int)) (v_ArrVal_1893 (Array Int Int))) (= (select (select (store (let ((.cse5 (store |c_#race| |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_1888))) (store .cse5 |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (select .cse5 |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 0) .cse2 0))) |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_1893) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse3)) 0)) (forall ((v_ArrVal_1888 (Array Int Int)) (v_ArrVal_1893 (Array Int Int))) (= 0 (select (select (store (let ((.cse6 (store |c_#race| |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_1888))) (store .cse6 |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (select .cse6 |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 0) .cse2 0))) |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_1893) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2)))))) is different from false
[2024-02-28 18:36:45,337 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 18:36:45,337 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1151928467] provided 0 perfect and 2 imperfect interpolant sequences
[2024-02-28 18:36:45,337 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-02-28 18:36:45,337 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 25
[2024-02-28 18:36:45,338 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104419893]
[2024-02-28 18:36:45,338 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-02-28 18:36:45,338 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 27 states
[2024-02-28 18:36:45,338 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 18:36:45,338 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants.
[2024-02-28 18:36:45,339 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=390, Unknown=5, NotChecked=220, Total=702
[2024-02-28 18:36:45,451 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 48 out of 192
[2024-02-28 18:36:45,452 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 460 places, 5470 transitions, 121337 flow. Second operand  has 27 states, 27 states have (on average 50.0) internal successors, (1350), 27 states have internal predecessors, (1350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 18:36:45,452 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 18:36:45,452 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 192
[2024-02-28 18:36:45,452 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 18:37:49,504 INFO  L130       PetriNetUnfolder]: 33432/57261 cut-off events.
[2024-02-28 18:37:49,504 INFO  L131       PetriNetUnfolder]: For 3329294/3329306 co-relation queries the response was YES.
[2024-02-28 18:37:50,802 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 699705 conditions, 57261 events. 33432/57261 cut-off events. For 3329294/3329306 co-relation queries the response was YES. Maximal size of possible extension queue 1722. Compared 472147 event pairs, 1957 based on Foata normal form. 28/55237 useless extension candidates. Maximal degree in co-relation 698904. Up to 26910 conditions per place. 
[2024-02-28 18:37:51,177 INFO  L137   encePairwiseOnDemand]: 162/192 looper letters, 4071 selfloop transitions, 1882 changer transitions 0/5957 dead transitions.
[2024-02-28 18:37:51,177 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 483 places, 5957 transitions, 142056 flow
[2024-02-28 18:37:51,179 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. 
[2024-02-28 18:37:51,179 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 24 states.
[2024-02-28 18:37:51,180 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 1539 transitions.
[2024-02-28 18:37:51,180 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.333984375
[2024-02-28 18:37:51,180 INFO  L72            ComplementDD]: Start complementDD. Operand 24 states and 1539 transitions.
[2024-02-28 18:37:51,180 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 24 states and 1539 transitions.
[2024-02-28 18:37:51,181 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 18:37:51,181 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 24 states and 1539 transitions.
[2024-02-28 18:37:51,182 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 25 states, 24 states have (on average 64.125) internal successors, (1539), 24 states have internal predecessors, (1539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 18:37:51,184 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 25 states, 25 states have (on average 192.0) internal successors, (4800), 25 states have internal predecessors, (4800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 18:37:51,185 INFO  L81            ComplementDD]: Finished complementDD. Result  has 25 states, 25 states have (on average 192.0) internal successors, (4800), 25 states have internal predecessors, (4800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 18:37:51,185 INFO  L175             Difference]: Start difference. First operand has 460 places, 5470 transitions, 121337 flow. Second operand 24 states and 1539 transitions.
[2024-02-28 18:37:51,185 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 483 places, 5957 transitions, 142056 flow
Killed by 15
