./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-array-init.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-array-init.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 ad5536c4fd6764a8366f8fc19f92d266221f7e9f3361bf9e76cf5d7ce6ce63b5
--- Real Ultimate output ---
This is Ultimate 0.2.2-dev-2329fc7
[2023-11-03 11:39:23,341 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2023-11-03 11:39:23,343 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2023-11-03 11:39:23,365 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2023-11-03 11:39:23,365 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2023-11-03 11:39:23,366 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2023-11-03 11:39:23,367 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2023-11-03 11:39:23,368 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2023-11-03 11:39:23,369 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2023-11-03 11:39:23,370 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2023-11-03 11:39:23,371 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2023-11-03 11:39:23,371 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2023-11-03 11:39:23,372 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2023-11-03 11:39:23,372 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2023-11-03 11:39:23,373 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2023-11-03 11:39:23,374 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2023-11-03 11:39:23,375 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2023-11-03 11:39:23,375 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2023-11-03 11:39:23,377 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2023-11-03 11:39:23,378 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2023-11-03 11:39:23,379 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2023-11-03 11:39:23,380 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2023-11-03 11:39:23,381 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2023-11-03 11:39:23,382 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2023-11-03 11:39:23,384 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2023-11-03 11:39:23,385 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2023-11-03 11:39:23,385 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2023-11-03 11:39:23,385 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2023-11-03 11:39:23,386 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2023-11-03 11:39:23,386 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2023-11-03 11:39:23,387 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2023-11-03 11:39:23,387 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2023-11-03 11:39:23,388 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2023-11-03 11:39:23,388 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2023-11-03 11:39:23,389 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2023-11-03 11:39:23,389 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2023-11-03 11:39:23,390 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2023-11-03 11:39:23,390 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2023-11-03 11:39:23,390 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2023-11-03 11:39:23,391 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2023-11-03 11:39:23,391 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2023-11-03 11:39:23,392 INFO  L101        SettingsManager]: Beginning loading settings from /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf
[2023-11-03 11:39:23,408 INFO  L113        SettingsManager]: Loading preferences was successful
[2023-11-03 11:39:23,408 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2023-11-03 11:39:23,408 INFO  L136        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2023-11-03 11:39:23,409 INFO  L138        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2023-11-03 11:39:23,409 INFO  L136        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2023-11-03 11:39:23,409 INFO  L138        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2023-11-03 11:39:23,410 INFO  L136        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2023-11-03 11:39:23,410 INFO  L138        SettingsManager]:  * Create parallel compositions if possible=false
[2023-11-03 11:39:23,410 INFO  L138        SettingsManager]:  * Use SBE=true
[2023-11-03 11:39:23,410 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2023-11-03 11:39:23,410 INFO  L138        SettingsManager]:  * sizeof long=4
[2023-11-03 11:39:23,411 INFO  L138        SettingsManager]:  * Check unreachability of error function in SV-COMP mode=false
[2023-11-03 11:39:23,411 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2023-11-03 11:39:23,411 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2023-11-03 11:39:23,411 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2023-11-03 11:39:23,411 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2023-11-03 11:39:23,411 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2023-11-03 11:39:23,411 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2023-11-03 11:39:23,411 INFO  L138        SettingsManager]:  * Check absence of data races in concurrent programs=true
[2023-11-03 11:39:23,411 INFO  L138        SettingsManager]:  * sizeof long double=12
[2023-11-03 11:39:23,412 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2023-11-03 11:39:23,412 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2023-11-03 11:39:23,412 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2023-11-03 11:39:23,412 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2023-11-03 11:39:23,412 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2023-11-03 11:39:23,412 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2023-11-03 11:39:23,412 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2023-11-03 11:39:23,412 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2023-11-03 11:39:23,412 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2023-11-03 11:39:23,412 INFO  L138        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2023-11-03 11:39:23,413 INFO  L138        SettingsManager]:  * Trace refinement strategy=CAMEL
[2023-11-03 11:39:23,413 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2023-11-03 11:39:23,413 INFO  L138        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2023-11-03 11:39:23,413 INFO  L138        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2023-11-03 11:39:23,413 INFO  L138        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2023-11-03 11:39:23,413 INFO  L138        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2023-11-03 11:39:23,413 INFO  L138        SettingsManager]:  * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC
[2023-11-03 11:39:23,413 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 -> ad5536c4fd6764a8366f8fc19f92d266221f7e9f3361bf9e76cf5d7ce6ce63b5
[2023-11-03 11:39:23,636 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2023-11-03 11:39:23,664 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2023-11-03 11:39:23,666 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2023-11-03 11:39:23,667 INFO  L271        PluginConnector]: Initializing CDTParser...
[2023-11-03 11:39:23,668 INFO  L275        PluginConnector]: CDTParser initialized
[2023-11-03 11:39:23,670 INFO  L432   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-array-init.i
[2023-11-03 11:39:24,701 INFO  L500              CDTParser]: Created temporary CDT project at NULL
[2023-11-03 11:39:24,885 INFO  L351              CDTParser]: Found 1 translation units.
[2023-11-03 11:39:24,885 INFO  L172              CDTParser]: Scanning /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-array-init.i
[2023-11-03 11:39:24,905 INFO  L394              CDTParser]: About to delete temporary CDT project at /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data/21f4c776a/ee238f301f1d493d84080bf28469fd32/FLAG9a6eb4061
[2023-11-03 11:39:24,917 INFO  L402              CDTParser]: Successfully deleted /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data/21f4c776a/ee238f301f1d493d84080bf28469fd32
[2023-11-03 11:39:24,920 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2023-11-03 11:39:24,921 INFO  L131        ToolchainWalker]: Walking toolchain with 6 elements.
[2023-11-03 11:39:24,923 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2023-11-03 11:39:24,923 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2023-11-03 11:39:24,926 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2023-11-03 11:39:24,927 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 11:39:24" (1/1) ...
[2023-11-03 11:39:24,927 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54f47440 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 11:39:24, skipping insertion in model container
[2023-11-03 11:39:24,928 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 11:39:24" (1/1) ...
[2023-11-03 11:39:24,933 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2023-11-03 11:39:24,973 INFO  L178         MainTranslator]: Built tables and reachable declarations
[2023-11-03 11:39:25,099 WARN  L611        FunctionHandler]: implicit declaration of function __builtin_bswap16
[2023-11-03 11:39:25,260 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2023-11-03 11:39:25,266 INFO  L203         MainTranslator]: Completed pre-run
[2023-11-03 11:39:25,276 WARN  L611        FunctionHandler]: implicit declaration of function __builtin_bswap16
[2023-11-03 11:39:25,300 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2023-11-03 11:39:25,338 INFO  L208         MainTranslator]: Completed translation
[2023-11-03 11:39:25,338 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 11:39:25 WrapperNode
[2023-11-03 11:39:25,339 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2023-11-03 11:39:25,340 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2023-11-03 11:39:25,340 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2023-11-03 11:39:25,340 INFO  L275        PluginConnector]: Boogie Procedure Inliner initialized
[2023-11-03 11:39:25,345 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 11:39:25" (1/1) ...
[2023-11-03 11:39:25,360 INFO  L185        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 11:39:25" (1/1) ...
[2023-11-03 11:39:25,381 INFO  L138                Inliner]: procedures = 266, calls = 27, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 112
[2023-11-03 11:39:25,382 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2023-11-03 11:39:25,382 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2023-11-03 11:39:25,382 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2023-11-03 11:39:25,383 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2023-11-03 11:39:25,391 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 11:39:25" (1/1) ...
[2023-11-03 11:39:25,391 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 11:39:25" (1/1) ...
[2023-11-03 11:39:25,395 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 11:39:25" (1/1) ...
[2023-11-03 11:39:25,395 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 11:39:25" (1/1) ...
[2023-11-03 11:39:25,405 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 11:39:25" (1/1) ...
[2023-11-03 11:39:25,407 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 11:39:25" (1/1) ...
[2023-11-03 11:39:25,409 INFO  L185        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 11:39:25" (1/1) ...
[2023-11-03 11:39:25,410 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 11:39:25" (1/1) ...
[2023-11-03 11:39:25,413 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2023-11-03 11:39:25,414 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2023-11-03 11:39:25,414 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2023-11-03 11:39:25,414 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2023-11-03 11:39:25,414 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 11:39:25" (1/1) ...
[2023-11-03 11:39:25,419 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2023-11-03 11:39:25,427 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-11-03 11:39:25,443 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)
[2023-11-03 11:39:25,446 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
[2023-11-03 11:39:25,473 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2023-11-03 11:39:25,473 INFO  L130     BoogieDeclarations]: Found specification of procedure read~$Pointer$
[2023-11-03 11:39:25,474 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2023-11-03 11:39:25,474 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~$Pointer$
[2023-11-03 11:39:25,475 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int
[2023-11-03 11:39:25,475 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2023-11-03 11:39:25,475 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap
[2023-11-03 11:39:25,476 INFO  L130     BoogieDeclarations]: Found specification of procedure thread
[2023-11-03 11:39:25,476 INFO  L138     BoogieDeclarations]: Found implementation of procedure thread
[2023-11-03 11:39:25,476 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2023-11-03 11:39:25,476 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2023-11-03 11:39:25,478 WARN  L209             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement
[2023-11-03 11:39:25,601 INFO  L235             CfgBuilder]: Building ICFG
[2023-11-03 11:39:25,603 INFO  L261             CfgBuilder]: Building CFG for each procedure with an implementation
[2023-11-03 11:39:25,869 INFO  L276             CfgBuilder]: Performing block encoding
[2023-11-03 11:39:25,876 INFO  L295             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2023-11-03 11:39:25,876 INFO  L300             CfgBuilder]: Removed 2 assume(true) statements.
[2023-11-03 11:39:25,878 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 11:39:25 BoogieIcfgContainer
[2023-11-03 11:39:25,878 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2023-11-03 11:39:25,880 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2023-11-03 11:39:25,880 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2023-11-03 11:39:25,883 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2023-11-03 11:39:25,883 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 11:39:24" (1/3) ...
[2023-11-03 11:39:25,883 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62870a23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 11:39:25, skipping insertion in model container
[2023-11-03 11:39:25,884 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 11:39:25" (2/3) ...
[2023-11-03 11:39:25,884 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62870a23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 11:39:25, skipping insertion in model container
[2023-11-03 11:39:25,884 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 11:39:25" (3/3) ...
[2023-11-03 11:39:25,885 INFO  L112   eAbstractionObserver]: Analyzing ICFG per-thread-array-init.i
[2023-11-03 11:39:25,892 WARN  L145   ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2023-11-03 11:39:25,900 INFO  L203   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2023-11-03 11:39:25,900 INFO  L162   ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations.
[2023-11-03 11:39:25,900 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2023-11-03 11:39:25,945 INFO  L144    ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions.
[2023-11-03 11:39:25,975 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 136 places, 137 transitions, 282 flow
[2023-11-03 11:39:26,036 INFO  L130       PetriNetUnfolder]: 6/218 cut-off events.
[2023-11-03 11:39:26,036 INFO  L131       PetriNetUnfolder]: For 1/1 co-relation queries the response was YES.
[2023-11-03 11:39:26,041 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 224 conditions, 218 events. 6/218 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 374 event pairs, 0 based on Foata normal form. 0/192 useless extension candidates. Maximal degree in co-relation 109. Up to 4 conditions per place. 
[2023-11-03 11:39:26,041 INFO  L82        GeneralOperation]: Start removeDead. Operand has 136 places, 137 transitions, 282 flow
[2023-11-03 11:39:26,046 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 136 places, 137 transitions, 282 flow
[2023-11-03 11:39:26,049 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2023-11-03 11:39:26,057 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 136 places, 137 transitions, 282 flow
[2023-11-03 11:39:26,060 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 136 places, 137 transitions, 282 flow
[2023-11-03 11:39:26,060 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 136 places, 137 transitions, 282 flow
[2023-11-03 11:39:26,098 INFO  L130       PetriNetUnfolder]: 6/218 cut-off events.
[2023-11-03 11:39:26,098 INFO  L131       PetriNetUnfolder]: For 1/1 co-relation queries the response was YES.
[2023-11-03 11:39:26,134 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 224 conditions, 218 events. 6/218 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 374 event pairs, 0 based on Foata normal form. 0/192 useless extension candidates. Maximal degree in co-relation 109. Up to 4 conditions per place. 
[2023-11-03 11:39:26,138 INFO  L119        LiptonReduction]: Number of co-enabled transitions 2314
[2023-11-03 11:39:28,891 INFO  L134        LiptonReduction]: Checked pairs total: 10042
[2023-11-03 11:39:28,891 INFO  L136        LiptonReduction]: Total number of compositions: 83
[2023-11-03 11:39:28,904 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-11-03 11:39:28,910 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;@7d81491c, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2023-11-03 11:39:28,910 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 11 error locations.
[2023-11-03 11:39:28,913 INFO  L130       PetriNetUnfolder]: 0/14 cut-off events.
[2023-11-03 11:39:28,914 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2023-11-03 11:39:28,914 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 11:39:28,914 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1]
[2023-11-03 11:39:28,915 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2023-11-03 11:39:28,919 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 11:39:28,919 INFO  L85        PathProgramCache]: Analyzing trace with hash -382401433, now seen corresponding path program 1 times
[2023-11-03 11:39:28,927 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 11:39:28,928 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238313248]
[2023-11-03 11:39:28,928 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 11:39:28,928 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 11:39:29,022 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 11:39:29,372 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 11:39:29,372 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 11:39:29,372 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238313248]
[2023-11-03 11:39:29,373 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238313248] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 11:39:29,373 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-03 11:39:29,373 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-11-03 11:39:29,375 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443559071]
[2023-11-03 11:39:29,375 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 11:39:29,381 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-11-03 11:39:29,382 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 11:39:29,396 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-11-03 11:39:29,398 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-11-03 11:39:29,892 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 107 out of 220
[2023-11-03 11:39:29,895 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 64 transitions, 136 flow. Second operand  has 6 states, 6 states have (on average 108.0) internal successors, (648), 6 states have internal predecessors, (648), 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)
[2023-11-03 11:39:29,895 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 11:39:29,895 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 220
[2023-11-03 11:39:29,896 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 11:39:30,079 INFO  L130       PetriNetUnfolder]: 57/287 cut-off events.
[2023-11-03 11:39:30,080 INFO  L131       PetriNetUnfolder]: For 4/4 co-relation queries the response was YES.
[2023-11-03 11:39:30,082 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 477 conditions, 287 events. 57/287 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1290 event pairs, 38 based on Foata normal form. 0/257 useless extension candidates. Maximal degree in co-relation 352. Up to 115 conditions per place. 
[2023-11-03 11:39:30,085 INFO  L137   encePairwiseOnDemand]: 203/220 looper letters, 40 selfloop transitions, 10 changer transitions 5/82 dead transitions.
[2023-11-03 11:39:30,085 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 82 transitions, 282 flow
[2023-11-03 11:39:30,087 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-11-03 11:39:30,090 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-11-03 11:39:30,101 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 700 transitions.
[2023-11-03 11:39:30,104 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5303030303030303
[2023-11-03 11:39:30,105 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 700 transitions.
[2023-11-03 11:39:30,105 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 700 transitions.
[2023-11-03 11:39:30,108 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 11:39:30,110 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 700 transitions.
[2023-11-03 11:39:30,115 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 116.66666666666667) internal successors, (700), 6 states have internal predecessors, (700), 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)
[2023-11-03 11:39:30,122 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 220.0) internal successors, (1540), 7 states have internal predecessors, (1540), 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)
[2023-11-03 11:39:30,123 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 220.0) internal successors, (1540), 7 states have internal predecessors, (1540), 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)
[2023-11-03 11:39:30,124 INFO  L175             Difference]: Start difference. First operand has 66 places, 64 transitions, 136 flow. Second operand 6 states and 700 transitions.
[2023-11-03 11:39:30,125 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 82 transitions, 282 flow
[2023-11-03 11:39:30,128 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 82 transitions, 282 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-11-03 11:39:30,130 INFO  L231             Difference]: Finished difference. Result has 72 places, 65 transitions, 190 flow
[2023-11-03 11:39:30,131 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=220, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=190, PETRI_PLACES=72, PETRI_TRANSITIONS=65}
[2023-11-03 11:39:30,134 INFO  L288   CegarLoopForPetriNet]: 66 programPoint places, 6 predicate places.
[2023-11-03 11:39:30,135 INFO  L495      AbstractCegarLoop]: Abstraction has has 72 places, 65 transitions, 190 flow
[2023-11-03 11:39:30,135 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 108.0) internal successors, (648), 6 states have internal predecessors, (648), 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)
[2023-11-03 11:39:30,135 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 11:39:30,136 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2023-11-03 11:39:30,136 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2023-11-03 11:39:30,136 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2023-11-03 11:39:30,137 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 11:39:30,137 INFO  L85        PathProgramCache]: Analyzing trace with hash 1094831862, now seen corresponding path program 1 times
[2023-11-03 11:39:30,137 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 11:39:30,137 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611717278]
[2023-11-03 11:39:30,138 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 11:39:30,138 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 11:39:30,154 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 11:39:30,192 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 11:39:30,192 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 11:39:30,192 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611717278]
[2023-11-03 11:39:30,193 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611717278] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 11:39:30,193 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-03 11:39:30,193 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2023-11-03 11:39:30,193 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813322975]
[2023-11-03 11:39:30,193 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 11:39:30,194 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2023-11-03 11:39:30,195 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 11:39:30,195 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2023-11-03 11:39:30,196 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2023-11-03 11:39:30,252 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 126 out of 220
[2023-11-03 11:39:30,253 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 65 transitions, 190 flow. Second operand  has 4 states, 4 states have (on average 126.75) internal successors, (507), 4 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)
[2023-11-03 11:39:30,253 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 11:39:30,253 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 220
[2023-11-03 11:39:30,253 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 11:39:30,351 INFO  L130       PetriNetUnfolder]: 28/243 cut-off events.
[2023-11-03 11:39:30,351 INFO  L131       PetriNetUnfolder]: For 25/25 co-relation queries the response was YES.
[2023-11-03 11:39:30,352 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 423 conditions, 243 events. 28/243 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 985 event pairs, 0 based on Foata normal form. 0/223 useless extension candidates. Maximal degree in co-relation 308. Up to 79 conditions per place. 
[2023-11-03 11:39:30,353 INFO  L137   encePairwiseOnDemand]: 216/220 looper letters, 27 selfloop transitions, 3 changer transitions 1/75 dead transitions.
[2023-11-03 11:39:30,353 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 75 transitions, 276 flow
[2023-11-03 11:39:30,355 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2023-11-03 11:39:30,355 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2023-11-03 11:39:30,357 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 536 transitions.
[2023-11-03 11:39:30,358 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6090909090909091
[2023-11-03 11:39:30,358 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 536 transitions.
[2023-11-03 11:39:30,358 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 536 transitions.
[2023-11-03 11:39:30,358 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 11:39:30,358 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 536 transitions.
[2023-11-03 11:39:30,360 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 5 states, 4 states have (on average 134.0) internal successors, (536), 4 states have internal predecessors, (536), 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)
[2023-11-03 11:39:30,362 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 5 states, 5 states have (on average 220.0) internal successors, (1100), 5 states have internal predecessors, (1100), 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)
[2023-11-03 11:39:30,362 INFO  L81            ComplementDD]: Finished complementDD. Result  has 5 states, 5 states have (on average 220.0) internal successors, (1100), 5 states have internal predecessors, (1100), 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)
[2023-11-03 11:39:30,362 INFO  L175             Difference]: Start difference. First operand has 72 places, 65 transitions, 190 flow. Second operand 4 states and 536 transitions.
[2023-11-03 11:39:30,362 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 75 transitions, 276 flow
[2023-11-03 11:39:30,364 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 75 transitions, 266 flow, removed 3 selfloop flow, removed 1 redundant places.
[2023-11-03 11:39:30,365 INFO  L231             Difference]: Finished difference. Result has 76 places, 66 transitions, 196 flow
[2023-11-03 11:39:30,366 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=220, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=196, PETRI_PLACES=76, PETRI_TRANSITIONS=66}
[2023-11-03 11:39:30,366 INFO  L288   CegarLoopForPetriNet]: 66 programPoint places, 10 predicate places.
[2023-11-03 11:39:30,367 INFO  L495      AbstractCegarLoop]: Abstraction has has 76 places, 66 transitions, 196 flow
[2023-11-03 11:39:30,367 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 126.75) internal successors, (507), 4 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)
[2023-11-03 11:39:30,367 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 11:39:30,367 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2023-11-03 11:39:30,367 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2023-11-03 11:39:30,368 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2023-11-03 11:39:30,368 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 11:39:30,368 INFO  L85        PathProgramCache]: Analyzing trace with hash 1103111380, now seen corresponding path program 1 times
[2023-11-03 11:39:30,368 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 11:39:30,369 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716584787]
[2023-11-03 11:39:30,369 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 11:39:30,369 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 11:39:30,381 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 11:39:30,521 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 11:39:30,522 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 11:39:30,522 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716584787]
[2023-11-03 11:39:30,522 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716584787] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 11:39:30,522 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-03 11:39:30,522 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-11-03 11:39:30,523 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513716195]
[2023-11-03 11:39:30,523 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 11:39:30,523 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-11-03 11:39:30,523 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 11:39:30,524 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-11-03 11:39:30,524 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-11-03 11:39:30,810 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 107 out of 220
[2023-11-03 11:39:30,811 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 66 transitions, 196 flow. Second operand  has 6 states, 6 states have (on average 108.16666666666667) internal successors, (649), 6 states have internal predecessors, (649), 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)
[2023-11-03 11:39:30,812 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 11:39:30,812 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 220
[2023-11-03 11:39:30,812 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 11:39:30,956 INFO  L130       PetriNetUnfolder]: 58/260 cut-off events.
[2023-11-03 11:39:30,957 INFO  L131       PetriNetUnfolder]: For 15/15 co-relation queries the response was YES.
[2023-11-03 11:39:30,958 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 535 conditions, 260 events. 58/260 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1139 event pairs, 36 based on Foata normal form. 0/249 useless extension candidates. Maximal degree in co-relation 404. Up to 111 conditions per place. 
[2023-11-03 11:39:30,960 INFO  L137   encePairwiseOnDemand]: 207/220 looper letters, 40 selfloop transitions, 6 changer transitions 5/77 dead transitions.
[2023-11-03 11:39:30,960 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 77 transitions, 322 flow
[2023-11-03 11:39:30,962 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-11-03 11:39:30,962 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-11-03 11:39:30,963 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 696 transitions.
[2023-11-03 11:39:30,964 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5272727272727272
[2023-11-03 11:39:30,964 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 696 transitions.
[2023-11-03 11:39:30,964 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 696 transitions.
[2023-11-03 11:39:30,965 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 11:39:30,965 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 696 transitions.
[2023-11-03 11:39:30,966 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 116.0) internal successors, (696), 6 states have internal predecessors, (696), 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)
[2023-11-03 11:39:30,968 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 220.0) internal successors, (1540), 7 states have internal predecessors, (1540), 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)
[2023-11-03 11:39:30,969 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 220.0) internal successors, (1540), 7 states have internal predecessors, (1540), 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)
[2023-11-03 11:39:30,969 INFO  L175             Difference]: Start difference. First operand has 76 places, 66 transitions, 196 flow. Second operand 6 states and 696 transitions.
[2023-11-03 11:39:30,969 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 77 transitions, 322 flow
[2023-11-03 11:39:30,971 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 77 transitions, 320 flow, removed 0 selfloop flow, removed 1 redundant places.
[2023-11-03 11:39:30,972 INFO  L231             Difference]: Finished difference. Result has 82 places, 63 transitions, 220 flow
[2023-11-03 11:39:30,972 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=220, PETRI_DIFFERENCE_MINUEND_FLOW=188, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=220, PETRI_PLACES=82, PETRI_TRANSITIONS=63}
[2023-11-03 11:39:30,973 INFO  L288   CegarLoopForPetriNet]: 66 programPoint places, 16 predicate places.
[2023-11-03 11:39:30,973 INFO  L495      AbstractCegarLoop]: Abstraction has has 82 places, 63 transitions, 220 flow
[2023-11-03 11:39:30,974 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 108.16666666666667) internal successors, (649), 6 states have internal predecessors, (649), 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)
[2023-11-03 11:39:30,974 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 11:39:30,974 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-03 11:39:30,974 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2023-11-03 11:39:30,974 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2023-11-03 11:39:30,975 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 11:39:30,975 INFO  L85        PathProgramCache]: Analyzing trace with hash -1153489684, now seen corresponding path program 1 times
[2023-11-03 11:39:30,975 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 11:39:30,975 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266659090]
[2023-11-03 11:39:30,975 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 11:39:30,975 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 11:39:30,999 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 11:39:31,168 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 11:39:31,168 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 11:39:31,169 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266659090]
[2023-11-03 11:39:31,169 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266659090] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 11:39:31,169 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-03 11:39:31,169 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-11-03 11:39:31,170 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901458800]
[2023-11-03 11:39:31,170 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 11:39:31,171 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-11-03 11:39:31,171 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 11:39:31,171 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-11-03 11:39:31,172 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-11-03 11:39:31,384 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 87 out of 220
[2023-11-03 11:39:31,385 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 63 transitions, 220 flow. Second operand  has 6 states, 6 states have (on average 88.83333333333333) internal successors, (533), 6 states have internal predecessors, (533), 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)
[2023-11-03 11:39:31,385 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 11:39:31,385 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 220
[2023-11-03 11:39:31,385 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 11:39:31,550 INFO  L130       PetriNetUnfolder]: 254/667 cut-off events.
[2023-11-03 11:39:31,550 INFO  L131       PetriNetUnfolder]: For 109/109 co-relation queries the response was YES.
[2023-11-03 11:39:31,552 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1555 conditions, 667 events. 254/667 cut-off events. For 109/109 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 3164 event pairs, 211 based on Foata normal form. 0/654 useless extension candidates. Maximal degree in co-relation 1402. Up to 560 conditions per place. 
[2023-11-03 11:39:31,555 INFO  L137   encePairwiseOnDemand]: 210/220 looper letters, 61 selfloop transitions, 22 changer transitions 0/91 dead transitions.
[2023-11-03 11:39:31,555 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 91 transitions, 442 flow
[2023-11-03 11:39:31,558 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-11-03 11:39:31,558 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-11-03 11:39:31,559 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 601 transitions.
[2023-11-03 11:39:31,560 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.4553030303030303
[2023-11-03 11:39:31,560 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 601 transitions.
[2023-11-03 11:39:31,560 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 601 transitions.
[2023-11-03 11:39:31,560 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 11:39:31,560 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 601 transitions.
[2023-11-03 11:39:31,562 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 100.16666666666667) internal successors, (601), 6 states have internal predecessors, (601), 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)
[2023-11-03 11:39:31,564 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 220.0) internal successors, (1540), 7 states have internal predecessors, (1540), 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)
[2023-11-03 11:39:31,565 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 220.0) internal successors, (1540), 7 states have internal predecessors, (1540), 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)
[2023-11-03 11:39:31,565 INFO  L175             Difference]: Start difference. First operand has 82 places, 63 transitions, 220 flow. Second operand 6 states and 601 transitions.
[2023-11-03 11:39:31,565 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 91 transitions, 442 flow
[2023-11-03 11:39:31,569 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 91 transitions, 413 flow, removed 6 selfloop flow, removed 9 redundant places.
[2023-11-03 11:39:31,571 INFO  L231             Difference]: Finished difference. Result has 81 places, 83 transitions, 318 flow
[2023-11-03 11:39:31,572 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=220, PETRI_DIFFERENCE_MINUEND_FLOW=191, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=318, PETRI_PLACES=81, PETRI_TRANSITIONS=83}
[2023-11-03 11:39:31,572 INFO  L288   CegarLoopForPetriNet]: 66 programPoint places, 15 predicate places.
[2023-11-03 11:39:31,572 INFO  L495      AbstractCegarLoop]: Abstraction has has 81 places, 83 transitions, 318 flow
[2023-11-03 11:39:31,573 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 88.83333333333333) internal successors, (533), 6 states have internal predecessors, (533), 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)
[2023-11-03 11:39:31,573 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 11:39:31,573 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, 1, 1, 1, 1, 1, 1, 1]
[2023-11-03 11:39:31,573 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2023-11-03 11:39:31,574 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2023-11-03 11:39:31,575 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 11:39:31,575 INFO  L85        PathProgramCache]: Analyzing trace with hash -116177611, now seen corresponding path program 1 times
[2023-11-03 11:39:31,575 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 11:39:31,575 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13455296]
[2023-11-03 11:39:31,575 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 11:39:31,576 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 11:39:31,612 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 11:39:31,810 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 11:39:31,811 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 11:39:31,811 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13455296]
[2023-11-03 11:39:31,811 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13455296] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 11:39:31,811 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-03 11:39:31,811 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-11-03 11:39:31,812 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310579576]
[2023-11-03 11:39:31,812 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 11:39:31,812 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-11-03 11:39:31,812 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 11:39:31,813 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-11-03 11:39:31,813 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-11-03 11:39:32,160 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 121 out of 220
[2023-11-03 11:39:32,162 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 83 transitions, 318 flow. Second operand  has 6 states, 6 states have (on average 124.0) internal successors, (744), 6 states have internal predecessors, (744), 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)
[2023-11-03 11:39:32,162 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 11:39:32,162 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 220
[2023-11-03 11:39:32,162 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 11:39:32,480 INFO  L130       PetriNetUnfolder]: 161/521 cut-off events.
[2023-11-03 11:39:32,480 INFO  L131       PetriNetUnfolder]: For 233/237 co-relation queries the response was YES.
[2023-11-03 11:39:32,482 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1351 conditions, 521 events. 161/521 cut-off events. For 233/237 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 2662 event pairs, 25 based on Foata normal form. 0/497 useless extension candidates. Maximal degree in co-relation 1224. Up to 202 conditions per place. 
[2023-11-03 11:39:32,485 INFO  L137   encePairwiseOnDemand]: 210/220 looper letters, 83 selfloop transitions, 28 changer transitions 26/163 dead transitions.
[2023-11-03 11:39:32,486 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 163 transitions, 885 flow
[2023-11-03 11:39:32,487 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-11-03 11:39:32,487 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-11-03 11:39:32,489 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 832 transitions.
[2023-11-03 11:39:32,490 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6303030303030303
[2023-11-03 11:39:32,490 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 832 transitions.
[2023-11-03 11:39:32,490 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 832 transitions.
[2023-11-03 11:39:32,491 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 11:39:32,491 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 832 transitions.
[2023-11-03 11:39:32,494 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 138.66666666666666) internal successors, (832), 6 states have internal predecessors, (832), 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)
[2023-11-03 11:39:32,496 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 220.0) internal successors, (1540), 7 states have internal predecessors, (1540), 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)
[2023-11-03 11:39:32,497 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 220.0) internal successors, (1540), 7 states have internal predecessors, (1540), 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)
[2023-11-03 11:39:32,497 INFO  L175             Difference]: Start difference. First operand has 81 places, 83 transitions, 318 flow. Second operand 6 states and 832 transitions.
[2023-11-03 11:39:32,497 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 163 transitions, 885 flow
[2023-11-03 11:39:32,528 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 163 transitions, 870 flow, removed 0 selfloop flow, removed 1 redundant places.
[2023-11-03 11:39:32,531 INFO  L231             Difference]: Finished difference. Result has 90 places, 96 transitions, 543 flow
[2023-11-03 11:39:32,531 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=220, PETRI_DIFFERENCE_MINUEND_FLOW=315, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=543, PETRI_PLACES=90, PETRI_TRANSITIONS=96}
[2023-11-03 11:39:32,532 INFO  L288   CegarLoopForPetriNet]: 66 programPoint places, 24 predicate places.
[2023-11-03 11:39:32,532 INFO  L495      AbstractCegarLoop]: Abstraction has has 90 places, 96 transitions, 543 flow
[2023-11-03 11:39:32,532 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 124.0) internal successors, (744), 6 states have internal predecessors, (744), 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)
[2023-11-03 11:39:32,532 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 11:39:32,533 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-03 11:39:32,533 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2023-11-03 11:39:32,533 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2023-11-03 11:39:32,533 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 11:39:32,533 INFO  L85        PathProgramCache]: Analyzing trace with hash 2137239947, now seen corresponding path program 1 times
[2023-11-03 11:39:32,534 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 11:39:32,534 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089414892]
[2023-11-03 11:39:32,534 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 11:39:32,534 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 11:39:32,564 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 11:39:32,783 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2023-11-03 11:39:32,783 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 11:39:32,783 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089414892]
[2023-11-03 11:39:32,783 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089414892] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 11:39:32,783 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-03 11:39:32,783 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-11-03 11:39:32,784 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237218871]
[2023-11-03 11:39:32,784 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 11:39:32,784 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-11-03 11:39:32,784 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 11:39:32,784 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-11-03 11:39:32,784 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-11-03 11:39:33,139 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 117 out of 220
[2023-11-03 11:39:33,140 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 96 transitions, 543 flow. Second operand  has 6 states, 6 states have (on average 120.33333333333333) internal successors, (722), 6 states have internal predecessors, (722), 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)
[2023-11-03 11:39:33,140 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 11:39:33,140 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 220
[2023-11-03 11:39:33,140 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 11:39:33,270 INFO  L130       PetriNetUnfolder]: 89/377 cut-off events.
[2023-11-03 11:39:33,270 INFO  L131       PetriNetUnfolder]: For 348/380 co-relation queries the response was YES.
[2023-11-03 11:39:33,271 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1115 conditions, 377 events. 89/377 cut-off events. For 348/380 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1824 event pairs, 24 based on Foata normal form. 8/380 useless extension candidates. Maximal degree in co-relation 992. Up to 171 conditions per place. 
[2023-11-03 11:39:33,272 INFO  L137   encePairwiseOnDemand]: 214/220 looper letters, 41 selfloop transitions, 0 changer transitions 21/103 dead transitions.
[2023-11-03 11:39:33,272 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 103 transitions, 681 flow
[2023-11-03 11:39:33,273 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-11-03 11:39:33,273 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-11-03 11:39:33,274 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 735 transitions.
[2023-11-03 11:39:33,275 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5568181818181818
[2023-11-03 11:39:33,275 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 735 transitions.
[2023-11-03 11:39:33,275 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 735 transitions.
[2023-11-03 11:39:33,275 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 11:39:33,275 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 735 transitions.
[2023-11-03 11:39:33,277 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 122.5) internal successors, (735), 6 states have internal predecessors, (735), 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)
[2023-11-03 11:39:33,279 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 220.0) internal successors, (1540), 7 states have internal predecessors, (1540), 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)
[2023-11-03 11:39:33,279 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 220.0) internal successors, (1540), 7 states have internal predecessors, (1540), 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)
[2023-11-03 11:39:33,279 INFO  L175             Difference]: Start difference. First operand has 90 places, 96 transitions, 543 flow. Second operand 6 states and 735 transitions.
[2023-11-03 11:39:33,279 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 103 transitions, 681 flow
[2023-11-03 11:39:33,282 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 103 transitions, 657 flow, removed 12 selfloop flow, removed 0 redundant places.
[2023-11-03 11:39:33,284 INFO  L231             Difference]: Finished difference. Result has 84 places, 82 transitions, 486 flow
[2023-11-03 11:39:33,284 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=220, PETRI_DIFFERENCE_MINUEND_FLOW=517, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=486, PETRI_PLACES=84, PETRI_TRANSITIONS=82}
[2023-11-03 11:39:33,285 INFO  L288   CegarLoopForPetriNet]: 66 programPoint places, 18 predicate places.
[2023-11-03 11:39:33,285 INFO  L495      AbstractCegarLoop]: Abstraction has has 84 places, 82 transitions, 486 flow
[2023-11-03 11:39:33,285 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 120.33333333333333) internal successors, (722), 6 states have internal predecessors, (722), 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)
[2023-11-03 11:39:33,285 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 11:39:33,285 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-03 11:39:33,285 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2023-11-03 11:39:33,286 INFO  L420      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2023-11-03 11:39:33,286 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 11:39:33,286 INFO  L85        PathProgramCache]: Analyzing trace with hash -972606990, now seen corresponding path program 1 times
[2023-11-03 11:39:33,286 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 11:39:33,286 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228832072]
[2023-11-03 11:39:33,286 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 11:39:33,287 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 11:39:33,337 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 11:39:34,128 INFO  L134       CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 11:39:34,128 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 11:39:34,128 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228832072]
[2023-11-03 11:39:34,129 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228832072] provided 0 perfect and 1 imperfect interpolant sequences
[2023-11-03 11:39:34,129 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [985299146]
[2023-11-03 11:39:34,129 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 11:39:34,129 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-03 11:39:34,129 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-11-03 11:39:34,133 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)
[2023-11-03 11:39:34,135 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
[2023-11-03 11:39:34,296 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 11:39:34,300 INFO  L263         TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 44 conjunts are in the unsatisfiable core
[2023-11-03 11:39:34,323 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-11-03 11:39:34,533 INFO  L321             Elim1Store]: treesize reduction 36, result has 23.4 percent of original size
[2023-11-03 11:39:34,534 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 49
[2023-11-03 11:39:34,918 INFO  L321             Elim1Store]: treesize reduction 36, result has 23.4 percent of original size
[2023-11-03 11:39:34,918 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 54
[2023-11-03 11:39:34,929 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 11:39:34,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 14 treesize of output 16
[2023-11-03 11:39:35,150 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 21 treesize of output 13
[2023-11-03 11:39:35,154 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 24 treesize of output 12
[2023-11-03 11:39:35,215 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11
[2023-11-03 11:39:35,262 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
[2023-11-03 11:39:35,314 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 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
[2023-11-03 11:39:35,379 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 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
[2023-11-03 11:39:35,452 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 11:39:35,454 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 11:39:35,455 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 11:39:35,457 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 11:39:35,461 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-03 11:39:35,461 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 59 treesize of output 67
[2023-11-03 11:39:35,475 INFO  L134       CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 11:39:35,475 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-11-03 11:39:36,763 WARN  L837   $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~mem12#1.base_30| Int)) (or (not (<= |v_ULTIMATE.start_main_#t~mem12#1.base_30| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (forall ((v_ArrVal_408 (Array Int Int))) (< |c_ULTIMATE.start_main_#t~mem10#1.offset| (+ (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_#t~mem12#1.base_30| v_ArrVal_408) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) 4))) (forall ((v_ArrVal_409 (Array Int Int))) (not (= |c_ULTIMATE.start_main_#t~mem10#1.base| (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem12#1.base_30| v_ArrVal_409) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)))))) is different from false
[2023-11-03 11:39:36,848 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 20 treesize of output 16
[2023-11-03 11:39:36,854 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 8
[2023-11-03 11:39:37,118 INFO  L134       CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 11:39:37,119 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [985299146] provided 0 perfect and 2 imperfect interpolant sequences
[2023-11-03 11:39:37,119 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-11-03 11:39:37,119 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 15] total 42
[2023-11-03 11:39:37,120 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137826108]
[2023-11-03 11:39:37,120 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-11-03 11:39:37,121 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 44 states
[2023-11-03 11:39:37,121 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 11:39:37,122 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants.
[2023-11-03 11:39:37,124 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=215, Invalid=1578, Unknown=17, NotChecked=82, Total=1892
[2023-11-03 11:39:37,881 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 48 out of 220
[2023-11-03 11:39:37,884 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 82 transitions, 486 flow. Second operand  has 44 states, 44 states have (on average 50.54545454545455) internal successors, (2224), 44 states have internal predecessors, (2224), 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)
[2023-11-03 11:39:37,884 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 11:39:37,884 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 220
[2023-11-03 11:39:37,884 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 11:39:40,438 INFO  L130       PetriNetUnfolder]: 444/1028 cut-off events.
[2023-11-03 11:39:40,438 INFO  L131       PetriNetUnfolder]: For 1223/1223 co-relation queries the response was YES.
[2023-11-03 11:39:40,440 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 3621 conditions, 1028 events. 444/1028 cut-off events. For 1223/1223 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 5028 event pairs, 10 based on Foata normal form. 0/1017 useless extension candidates. Maximal degree in co-relation 3601. Up to 240 conditions per place. 
[2023-11-03 11:39:40,444 INFO  L137   encePairwiseOnDemand]: 205/220 looper letters, 203 selfloop transitions, 46 changer transitions 0/250 dead transitions.
[2023-11-03 11:39:40,444 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 250 transitions, 1918 flow
[2023-11-03 11:39:40,445 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. 
[2023-11-03 11:39:40,445 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 19 states.
[2023-11-03 11:39:40,448 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 1057 transitions.
[2023-11-03 11:39:40,448 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.2528708133971292
[2023-11-03 11:39:40,449 INFO  L72            ComplementDD]: Start complementDD. Operand 19 states and 1057 transitions.
[2023-11-03 11:39:40,449 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 19 states and 1057 transitions.
[2023-11-03 11:39:40,449 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 11:39:40,449 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 1057 transitions.
[2023-11-03 11:39:40,451 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 20 states, 19 states have (on average 55.63157894736842) internal successors, (1057), 19 states have internal predecessors, (1057), 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)
[2023-11-03 11:39:40,455 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 20 states, 20 states have (on average 220.0) internal successors, (4400), 20 states have internal predecessors, (4400), 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)
[2023-11-03 11:39:40,455 INFO  L81            ComplementDD]: Finished complementDD. Result  has 20 states, 20 states have (on average 220.0) internal successors, (4400), 20 states have internal predecessors, (4400), 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)
[2023-11-03 11:39:40,455 INFO  L175             Difference]: Start difference. First operand has 84 places, 82 transitions, 486 flow. Second operand 19 states and 1057 transitions.
[2023-11-03 11:39:40,455 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 250 transitions, 1918 flow
[2023-11-03 11:39:40,461 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 250 transitions, 1915 flow, removed 0 selfloop flow, removed 1 redundant places.
[2023-11-03 11:39:40,464 INFO  L231             Difference]: Finished difference. Result has 95 places, 122 transitions, 975 flow
[2023-11-03 11:39:40,464 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=220, PETRI_DIFFERENCE_MINUEND_FLOW=484, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=975, PETRI_PLACES=95, PETRI_TRANSITIONS=122}
[2023-11-03 11:39:40,464 INFO  L288   CegarLoopForPetriNet]: 66 programPoint places, 29 predicate places.
[2023-11-03 11:39:40,464 INFO  L495      AbstractCegarLoop]: Abstraction has has 95 places, 122 transitions, 975 flow
[2023-11-03 11:39:40,465 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 44 states, 44 states have (on average 50.54545454545455) internal successors, (2224), 44 states have internal predecessors, (2224), 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)
[2023-11-03 11:39:40,465 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 11:39:40,465 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-03 11:39:40,476 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
[2023-11-03 11:39:40,666 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-03 11:39:40,667 INFO  L420      AbstractCegarLoop]: === Iteration 8 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2023-11-03 11:39:40,668 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 11:39:40,668 INFO  L85        PathProgramCache]: Analyzing trace with hash 1574108551, now seen corresponding path program 1 times
[2023-11-03 11:39:40,668 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 11:39:40,669 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671578196]
[2023-11-03 11:39:40,669 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 11:39:40,669 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 11:39:40,707 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 11:39:41,979 INFO  L134       CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 11:39:41,979 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 11:39:41,980 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671578196]
[2023-11-03 11:39:41,980 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671578196] provided 0 perfect and 1 imperfect interpolant sequences
[2023-11-03 11:39:41,980 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1590107256]
[2023-11-03 11:39:41,980 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 11:39:41,980 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-03 11:39:41,980 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-11-03 11:39:41,982 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)
[2023-11-03 11:39:41,984 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
[2023-11-03 11:39:42,104 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 11:39:42,107 INFO  L263         TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 60 conjunts are in the unsatisfiable core
[2023-11-03 11:39:42,115 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-11-03 11:39:42,340 INFO  L321             Elim1Store]: treesize reduction 36, result has 23.4 percent of original size
[2023-11-03 11:39:42,341 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 57
[2023-11-03 11:39:42,348 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 11:39:42,349 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
[2023-11-03 11:39:42,892 INFO  L321             Elim1Store]: treesize reduction 36, result has 23.4 percent of original size
[2023-11-03 11:39:42,893 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 54
[2023-11-03 11:39:42,907 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 11:39:42,908 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 21 treesize of output 21
[2023-11-03 11:39:43,087 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2023-11-03 11:39:43,153 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 11:39:43,154 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 21 treesize of output 20
[2023-11-03 11:39:43,220 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 11:39:43,221 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 11:39:43,222 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32
[2023-11-03 11:39:43,315 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 11:39:43,316 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 11:39:43,317 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 11:39:43,318 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44
[2023-11-03 11:39:43,491 INFO  L321             Elim1Store]: treesize reduction 11, result has 45.0 percent of original size
[2023-11-03 11:39:43,492 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 41
[2023-11-03 11:39:43,512 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 13
[2023-11-03 11:39:43,525 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 22 treesize of output 10
[2023-11-03 11:39:43,537 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 24 treesize of output 12
[2023-11-03 11:39:43,612 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 11:39:43,613 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 41 treesize of output 37
[2023-11-03 11:39:43,644 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 11:39:43,645 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 41 treesize of output 37
[2023-11-03 11:39:43,668 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 11:39:43,669 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 41 treesize of output 37
[2023-11-03 11:39:43,788 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 11:39:43,790 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 11:39:43,792 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 11:39:43,793 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 11:39:43,794 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 11:39:43,795 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 11:39:43,796 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 11:39:43,799 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-03 11:39:43,800 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 50 treesize of output 58
[2023-11-03 11:39:43,849 INFO  L134       CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 11:39:43,849 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-11-03 11:39:45,852 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse3 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (and (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_39| Int)) (or (not (<= .cse0 |v_ULTIMATE.start_main_#t~mem8#1.offset_39|)) (forall ((v_ArrVal_599 (Array Int Int)) (v_ArrVal_600 Int)) (= (select (select (let ((.cse1 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_599))) (store .cse1 .cse2 (store (select .cse1 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_39| .cse3) v_ArrVal_600))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_39| Int)) (or (not (<= .cse0 |v_ULTIMATE.start_main_#t~mem8#1.offset_39|)) (forall ((v_ArrVal_599 (Array Int Int)) (v_ArrVal_600 Int)) (= (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_599))) (store .cse4 .cse2 (store (select .cse4 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_39| .cse3) v_ArrVal_600))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 3)) 0)))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_39| Int)) (or (forall ((v_ArrVal_599 (Array Int Int)) (v_ArrVal_600 Int)) (= (select (select (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_599))) (store .cse5 .cse2 (store (select .cse5 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_39| .cse3) v_ArrVal_600))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) 0)) (not (<= .cse0 |v_ULTIMATE.start_main_#t~mem8#1.offset_39|)))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_39| Int)) (or (not (<= .cse0 |v_ULTIMATE.start_main_#t~mem8#1.offset_39|)) (forall ((v_ArrVal_599 (Array Int Int)) (v_ArrVal_600 Int)) (= (select (select (let ((.cse6 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_599))) (store .cse6 .cse2 (store (select .cse6 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_39| .cse3) v_ArrVal_600))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)))))) is different from false
[2023-11-03 11:39:47,921 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse0 (+ |c_ULTIMATE.start_main_~i~1#1| 1))) (and (forall ((|v_ULTIMATE.start_main_~i~1#1_66| Int)) (or (not (<= .cse0 |v_ULTIMATE.start_main_~i~1#1_66|)) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_39| Int)) (or (not (<= .cse1 |v_ULTIMATE.start_main_#t~mem8#1.offset_39|)) (forall ((v_ArrVal_599 (Array Int Int)) (v_ArrVal_600 Int)) (= (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_599))) (store .cse2 .cse3 (store (select .cse2 .cse3) (+ (* |v_ULTIMATE.start_main_~i~1#1_66| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_39|) v_ArrVal_600))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)))))) (forall ((|v_ULTIMATE.start_main_~i~1#1_66| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_39| Int)) (or (not (<= .cse1 |v_ULTIMATE.start_main_#t~mem8#1.offset_39|)) (forall ((v_ArrVal_599 (Array Int Int)) (v_ArrVal_600 Int)) (= (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_599))) (store .cse4 .cse3 (store (select .cse4 .cse3) (+ (* |v_ULTIMATE.start_main_~i~1#1_66| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_39|) v_ArrVal_600))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) 0)))) (not (<= .cse0 |v_ULTIMATE.start_main_~i~1#1_66|)))) (forall ((|v_ULTIMATE.start_main_~i~1#1_66| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_39| Int)) (or (not (<= .cse1 |v_ULTIMATE.start_main_#t~mem8#1.offset_39|)) (forall ((v_ArrVal_599 (Array Int Int)) (v_ArrVal_600 Int)) (= (select (select (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_599))) (store .cse5 .cse3 (store (select .cse5 .cse3) (+ (* |v_ULTIMATE.start_main_~i~1#1_66| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_39|) v_ArrVal_600))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 3)) 0)))) (not (<= .cse0 |v_ULTIMATE.start_main_~i~1#1_66|)))) (forall ((|v_ULTIMATE.start_main_~i~1#1_66| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_39| Int)) (or (forall ((v_ArrVal_599 (Array Int Int)) (v_ArrVal_600 Int)) (= (select (select (let ((.cse6 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_599))) (store .cse6 .cse3 (store (select .cse6 .cse3) (+ (* |v_ULTIMATE.start_main_~i~1#1_66| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_39|) v_ArrVal_600))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)) (not (<= .cse1 |v_ULTIMATE.start_main_#t~mem8#1.offset_39|)))) (not (<= .cse0 |v_ULTIMATE.start_main_~i~1#1_66|)))))) is different from false
[2023-11-03 11:39:49,995 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse4 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse3 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse4 0))) (.cse5 (+ |c_ULTIMATE.start_main_~i~1#1| 1))) (and (forall ((|v_ULTIMATE.start_main_~i~1#1_66| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_39| Int)) (or (not (<= .cse0 |v_ULTIMATE.start_main_#t~mem8#1.offset_39|)) (forall ((v_ArrVal_599 (Array Int Int)) (v_ArrVal_600 Int)) (= (select (select (let ((.cse1 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_599))) (store .cse1 .cse2 (store (select .cse1 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_66| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_39|) v_ArrVal_600))) c_threadThread1of1ForFork0_~p~0.base) .cse4) 0)))) (not (<= .cse5 |v_ULTIMATE.start_main_~i~1#1_66|)))) (forall ((|v_ULTIMATE.start_main_~i~1#1_66| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_39| Int)) (or (not (<= .cse0 |v_ULTIMATE.start_main_#t~mem8#1.offset_39|)) (forall ((v_ArrVal_599 (Array Int Int)) (v_ArrVal_600 Int)) (= (select (select (let ((.cse6 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_599))) (store .cse6 .cse2 (store (select .cse6 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_66| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_39|) v_ArrVal_600))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) 0)))) (not (<= .cse5 |v_ULTIMATE.start_main_~i~1#1_66|)))) (forall ((|v_ULTIMATE.start_main_~i~1#1_66| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_39| Int)) (or (not (<= .cse0 |v_ULTIMATE.start_main_#t~mem8#1.offset_39|)) (forall ((v_ArrVal_599 (Array Int Int)) (v_ArrVal_600 Int)) (= (select (select (let ((.cse7 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_599))) (store .cse7 .cse2 (store (select .cse7 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_66| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_39|) v_ArrVal_600))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)))) (not (<= .cse5 |v_ULTIMATE.start_main_~i~1#1_66|)))) (forall ((|v_ULTIMATE.start_main_~i~1#1_66| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_39| Int)) (or (not (<= .cse0 |v_ULTIMATE.start_main_#t~mem8#1.offset_39|)) (forall ((v_ArrVal_599 (Array Int Int)) (v_ArrVal_600 Int)) (= 0 (select (select (let ((.cse8 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_599))) (store .cse8 .cse2 (store (select .cse8 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_66| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_39|) v_ArrVal_600))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset))))) (not (<= .cse5 |v_ULTIMATE.start_main_~i~1#1_66|))))))) is different from false
[2023-11-03 11:39:52,113 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse9 (+ c_threadThread1of1ForFork0_~p~0.offset 2)) (.cse7 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse3 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse9 0) .cse7 0))) (.cse4 (+ |c_ULTIMATE.start_main_~i~1#1| 1))) (and (forall ((|v_ULTIMATE.start_main_~i~1#1_66| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_39| Int)) (or (not (<= .cse0 |v_ULTIMATE.start_main_#t~mem8#1.offset_39|)) (forall ((v_ArrVal_599 (Array Int Int)) (v_ArrVal_600 Int)) (= (select (select (let ((.cse1 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_599))) (store .cse1 .cse2 (store (select .cse1 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_66| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_39|) v_ArrVal_600))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)))) (not (<= .cse4 |v_ULTIMATE.start_main_~i~1#1_66|)))) (forall ((|v_ULTIMATE.start_main_~i~1#1_66| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_39| Int)) (or (not (<= .cse0 |v_ULTIMATE.start_main_#t~mem8#1.offset_39|)) (forall ((v_ArrVal_599 (Array Int Int)) (v_ArrVal_600 Int)) (= (select (select (let ((.cse5 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_599))) (store .cse5 .cse2 (store (select .cse5 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_66| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_39|) v_ArrVal_600))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)))) (not (<= .cse4 |v_ULTIMATE.start_main_~i~1#1_66|)))) (forall ((|v_ULTIMATE.start_main_~i~1#1_66| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_39| Int)) (or (forall ((v_ArrVal_599 (Array Int Int)) (v_ArrVal_600 Int)) (= (select (select (let ((.cse6 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_599))) (store .cse6 .cse2 (store (select .cse6 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_66| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_39|) v_ArrVal_600))) c_threadThread1of1ForFork0_~p~0.base) .cse7) 0)) (not (<= .cse0 |v_ULTIMATE.start_main_#t~mem8#1.offset_39|)))) (not (<= .cse4 |v_ULTIMATE.start_main_~i~1#1_66|)))) (forall ((|v_ULTIMATE.start_main_~i~1#1_66| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_39| Int)) (or (not (<= .cse0 |v_ULTIMATE.start_main_#t~mem8#1.offset_39|)) (forall ((v_ArrVal_599 (Array Int Int)) (v_ArrVal_600 Int)) (= (select (select (let ((.cse8 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_599))) (store .cse8 .cse2 (store (select .cse8 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_66| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_39|) v_ArrVal_600))) c_threadThread1of1ForFork0_~p~0.base) .cse9) 0)))) (not (<= .cse4 |v_ULTIMATE.start_main_~i~1#1_66|))))))) is different from false
[2023-11-03 11:39:53,720 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse8 (+ c_threadThread1of1ForFork0_~p~0.offset 1)) (.cse4 (+ c_threadThread1of1ForFork0_~p~0.offset 2)) (.cse10 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse3 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (store (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse8 0) .cse4 0) .cse10 0))) (.cse5 (+ |c_ULTIMATE.start_main_~i~1#1| 1))) (and (forall ((|v_ULTIMATE.start_main_~i~1#1_66| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_39| Int)) (or (not (<= .cse0 |v_ULTIMATE.start_main_#t~mem8#1.offset_39|)) (forall ((v_ArrVal_599 (Array Int Int)) (v_ArrVal_600 Int)) (= (select (select (let ((.cse1 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_599))) (store .cse1 .cse2 (store (select .cse1 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_66| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_39|) v_ArrVal_600))) c_threadThread1of1ForFork0_~p~0.base) .cse4) 0)))) (not (<= .cse5 |v_ULTIMATE.start_main_~i~1#1_66|)))) (forall ((|v_ULTIMATE.start_main_~i~1#1_66| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_39| Int)) (or (not (<= .cse0 |v_ULTIMATE.start_main_#t~mem8#1.offset_39|)) (forall ((v_ArrVal_599 (Array Int Int)) (v_ArrVal_600 Int)) (= (select (select (let ((.cse6 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_599))) (store .cse6 .cse2 (store (select .cse6 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_66| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_39|) v_ArrVal_600))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)))) (not (<= .cse5 |v_ULTIMATE.start_main_~i~1#1_66|)))) (forall ((|v_ULTIMATE.start_main_~i~1#1_66| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_39| Int)) (or (forall ((v_ArrVal_599 (Array Int Int)) (v_ArrVal_600 Int)) (= (select (select (let ((.cse7 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_599))) (store .cse7 .cse2 (store (select .cse7 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_66| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_39|) v_ArrVal_600))) c_threadThread1of1ForFork0_~p~0.base) .cse8) 0)) (not (<= .cse0 |v_ULTIMATE.start_main_#t~mem8#1.offset_39|)))) (not (<= .cse5 |v_ULTIMATE.start_main_~i~1#1_66|)))) (forall ((|v_ULTIMATE.start_main_~i~1#1_66| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_39| Int)) (or (not (<= .cse0 |v_ULTIMATE.start_main_#t~mem8#1.offset_39|)) (forall ((v_ArrVal_599 (Array Int Int)) (v_ArrVal_600 Int)) (= (select (select (let ((.cse9 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_599))) (store .cse9 .cse2 (store (select .cse9 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_66| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_39|) v_ArrVal_600))) c_threadThread1of1ForFork0_~p~0.base) .cse10) 0)))) (not (<= .cse5 |v_ULTIMATE.start_main_~i~1#1_66|))))))) is different from false
[2023-11-03 11:39:53,779 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-03 11:39:53,779 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 79 treesize of output 72
[2023-11-03 11:39:53,794 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-03 11:39:53,795 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 232 treesize of output 220
[2023-11-03 11:39:53,806 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 206 treesize of output 198
[2023-11-03 11:39:53,828 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 106 treesize of output 102
[2023-11-03 11:39:53,887 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-03 11:39:53,887 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 199 treesize of output 181
[2023-11-03 11:39:54,058 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-03 11:39:54,059 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 81 treesize of output 74
[2023-11-03 11:39:54,065 INFO  L173   IndexEqualityManager]: detected equality via solver
[2023-11-03 11:39:54,080 INFO  L321             Elim1Store]: treesize reduction 8, result has 33.3 percent of original size
[2023-11-03 11:39:54,081 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 144 treesize of output 130
[2023-11-03 11:39:54,092 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 65 treesize of output 61
[2023-11-03 11:39:54,103 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 158 treesize of output 132
[2023-11-03 11:39:54,142 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2023-11-03 11:39:54,143 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 81 treesize of output 1
[2023-11-03 11:39:54,154 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2023-11-03 11:39:54,154 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 81 treesize of output 1
[2023-11-03 11:39:54,766 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_585 (Array Int Int))) (not (= |c_ULTIMATE.start_main_~#is~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_585) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)))) (forall ((v_ArrVal_584 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem12#1.base_32| Int) (v_ArrVal_585 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_585))) (or (forall ((v_ArrVal_586 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_584))) (< (select (select .cse0 |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) (+ (select (select (store .cse0 |v_ULTIMATE.start_main_#t~mem12#1.base_32| v_ArrVal_586) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) 1)))) (not (<= |v_ULTIMATE.start_main_#t~mem12#1.base_32| (select (select .cse1 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (forall ((v_ArrVal_587 (Array Int Int))) (not (= (select (select (store .cse1 |v_ULTIMATE.start_main_#t~mem12#1.base_32| v_ArrVal_587) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) (select (select .cse1 |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)))))))) is different from false
[2023-11-03 11:39:54,863 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (and (forall ((v_ArrVal_585 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_585) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) |c_ULTIMATE.start_main_~#is~0#1.base|))) (forall ((v_ArrVal_584 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem12#1.base_32| Int) (v_ArrVal_585 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_585))) (or (forall ((v_ArrVal_587 (Array Int Int))) (not (= (select (select (store .cse1 |v_ULTIMATE.start_main_#t~mem12#1.base_32| v_ArrVal_587) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) (select (select .cse1 |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)))) (forall ((v_ArrVal_586 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_584))) (< (select (select .cse2 |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) (+ (select (select (store .cse2 |v_ULTIMATE.start_main_#t~mem12#1.base_32| v_ArrVal_586) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) 1)))) (not (<= |v_ULTIMATE.start_main_#t~mem12#1.base_32| (select (select .cse1 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)))))))) is different from false
[2023-11-03 11:39:54,867 INFO  L134       CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked.
[2023-11-03 11:39:54,867 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1590107256] provided 0 perfect and 2 imperfect interpolant sequences
[2023-11-03 11:39:54,867 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-11-03 11:39:54,867 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15, 16] total 47
[2023-11-03 11:39:54,867 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163777844]
[2023-11-03 11:39:54,868 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-11-03 11:39:54,868 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 49 states
[2023-11-03 11:39:54,868 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 11:39:54,869 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants.
[2023-11-03 11:39:54,870 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=215, Invalid=1519, Unknown=16, NotChecked=602, Total=2352
[2023-11-03 11:39:55,082 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 50 out of 220
[2023-11-03 11:39:55,085 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 122 transitions, 975 flow. Second operand  has 49 states, 49 states have (on average 52.30612244897959) internal successors, (2563), 49 states have internal predecessors, (2563), 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)
[2023-11-03 11:39:55,085 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 11:39:55,085 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 220
[2023-11-03 11:39:55,085 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 11:40:22,248 WARN  L233               SmtUtils]: Spent 7.91s on a formula simplification. DAG size of input: 86 DAG size of output: 40 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)
[2023-11-03 11:40:28,766 INFO  L130       PetriNetUnfolder]: 466/1118 cut-off events.
[2023-11-03 11:40:28,766 INFO  L131       PetriNetUnfolder]: For 2119/2119 co-relation queries the response was YES.
[2023-11-03 11:40:28,771 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 4444 conditions, 1118 events. 466/1118 cut-off events. For 2119/2119 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 5792 event pairs, 117 based on Foata normal form. 16/1123 useless extension candidates. Maximal degree in co-relation 4414. Up to 746 conditions per place. 
[2023-11-03 11:40:28,777 INFO  L137   encePairwiseOnDemand]: 200/220 looper letters, 188 selfloop transitions, 56 changer transitions 0/245 dead transitions.
[2023-11-03 11:40:28,777 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 245 transitions, 2197 flow
[2023-11-03 11:40:28,778 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. 
[2023-11-03 11:40:28,778 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 25 states.
[2023-11-03 11:40:28,781 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 1402 transitions.
[2023-11-03 11:40:28,782 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.2549090909090909
[2023-11-03 11:40:28,782 INFO  L72            ComplementDD]: Start complementDD. Operand 25 states and 1402 transitions.
[2023-11-03 11:40:28,782 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 25 states and 1402 transitions.
[2023-11-03 11:40:28,782 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 11:40:28,782 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 25 states and 1402 transitions.
[2023-11-03 11:40:28,785 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 26 states, 25 states have (on average 56.08) internal successors, (1402), 25 states have internal predecessors, (1402), 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)
[2023-11-03 11:40:28,789 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 26 states, 26 states have (on average 220.0) internal successors, (5720), 26 states have internal predecessors, (5720), 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)
[2023-11-03 11:40:28,790 INFO  L81            ComplementDD]: Finished complementDD. Result  has 26 states, 26 states have (on average 220.0) internal successors, (5720), 26 states have internal predecessors, (5720), 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)
[2023-11-03 11:40:28,790 INFO  L175             Difference]: Start difference. First operand has 95 places, 122 transitions, 975 flow. Second operand 25 states and 1402 transitions.
[2023-11-03 11:40:28,790 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 245 transitions, 2197 flow
[2023-11-03 11:40:28,800 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 245 transitions, 2168 flow, removed 0 selfloop flow, removed 3 redundant places.
[2023-11-03 11:40:28,803 INFO  L231             Difference]: Finished difference. Result has 123 places, 163 transitions, 1496 flow
[2023-11-03 11:40:28,803 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=220, PETRI_DIFFERENCE_MINUEND_FLOW=956, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=1496, PETRI_PLACES=123, PETRI_TRANSITIONS=163}
[2023-11-03 11:40:28,803 INFO  L288   CegarLoopForPetriNet]: 66 programPoint places, 57 predicate places.
[2023-11-03 11:40:28,804 INFO  L495      AbstractCegarLoop]: Abstraction has has 123 places, 163 transitions, 1496 flow
[2023-11-03 11:40:28,805 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 49 states, 49 states have (on average 52.30612244897959) internal successors, (2563), 49 states have internal predecessors, (2563), 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)
[2023-11-03 11:40:28,805 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 11:40:28,805 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-03 11:40:28,812 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0
[2023-11-03 11:40:29,005 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-03 11:40:29,006 INFO  L420      AbstractCegarLoop]: === Iteration 9 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2023-11-03 11:40:29,006 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 11:40:29,007 INFO  L85        PathProgramCache]: Analyzing trace with hash -324057465, now seen corresponding path program 2 times
[2023-11-03 11:40:29,007 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 11:40:29,007 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844477067]
[2023-11-03 11:40:29,007 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 11:40:29,007 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 11:40:29,037 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 11:40:30,173 INFO  L134       CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 11:40:30,173 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 11:40:30,173 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844477067]
[2023-11-03 11:40:30,173 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844477067] provided 0 perfect and 1 imperfect interpolant sequences
[2023-11-03 11:40:30,173 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1930250589]
[2023-11-03 11:40:30,173 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2023-11-03 11:40:30,174 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-03 11:40:30,174 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-11-03 11:40:30,175 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)
[2023-11-03 11:40:30,176 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
[2023-11-03 11:40:30,336 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2023-11-03 11:40:30,336 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2023-11-03 11:40:30,339 INFO  L263         TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 59 conjunts are in the unsatisfiable core
[2023-11-03 11:40:30,346 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-11-03 11:40:30,573 INFO  L321             Elim1Store]: treesize reduction 36, result has 23.4 percent of original size
[2023-11-03 11:40:30,573 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 57
[2023-11-03 11:40:30,583 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 11:40:30,583 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
[2023-11-03 11:40:31,052 INFO  L321             Elim1Store]: treesize reduction 36, result has 23.4 percent of original size
[2023-11-03 11:40:31,053 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 64 treesize of output 62
[2023-11-03 11:40:31,062 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 11:40:31,064 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 25 treesize of output 25
[2023-11-03 11:40:31,362 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 24 treesize of output 12
[2023-11-03 11:40:31,369 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 22 treesize of output 10
[2023-11-03 11:40:31,434 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2023-11-03 11:40:31,486 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 11:40:31,487 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 21 treesize of output 20
[2023-11-03 11:40:31,537 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 11:40:31,538 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 11:40:31,539 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32
[2023-11-03 11:40:31,594 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 11:40:31,595 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 11:40:31,595 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 11:40:31,596 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44
[2023-11-03 11:40:31,688 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 11:40:31,691 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 11:40:31,692 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 11:40:31,694 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 11:40:31,695 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 11:40:31,696 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 11:40:31,697 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 11:40:31,700 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-03 11:40:31,700 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 50 treesize of output 58
[2023-11-03 11:40:31,755 INFO  L134       CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 11:40:31,755 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-11-03 11:40:33,306 WARN  L837   $PredicateComparison]: unable to prove that (forall ((v_ArrVal_766 (Array Int Int)) (v_ArrVal_768 (Array Int Int)) (v_ArrVal_767 (Array Int Int)) (v_ArrVal_769 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_767))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (or (not (= (select (select (store .cse0 .cse1 v_ArrVal_768) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) (select (select .cse0 |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (let ((.cse2 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_766))) (< (select (select .cse2 |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) (+ (select (select (store .cse2 .cse1 v_ArrVal_769) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) 1))))))) is different from false
[2023-11-03 11:40:33,352 WARN  L837   $PredicateComparison]: unable to prove that (forall ((v_ArrVal_766 (Array Int Int)) (v_ArrVal_768 (Array Int Int)) (v_ArrVal_767 (Array Int Int)) (v_ArrVal_769 (Array Int Int))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_767))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (or (let ((.cse0 (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_766))) (< (select (select .cse0 |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) (+ (select (select (store .cse0 .cse1 v_ArrVal_769) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) 1))) (not (= (select (select (store .cse3 .cse1 v_ArrVal_768) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) (select (select .cse3 |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)))))))) is different from false
[2023-11-03 11:40:33,355 INFO  L134       CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked.
[2023-11-03 11:40:33,356 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1930250589] provided 0 perfect and 2 imperfect interpolant sequences
[2023-11-03 11:40:33,356 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-11-03 11:40:33,356 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 15] total 44
[2023-11-03 11:40:33,356 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245039220]
[2023-11-03 11:40:33,356 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-11-03 11:40:33,357 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 46 states
[2023-11-03 11:40:33,357 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 11:40:33,358 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants.
[2023-11-03 11:40:33,358 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=1672, Unknown=18, NotChecked=170, Total=2070
[2023-11-03 11:40:34,028 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 50 out of 220
[2023-11-03 11:40:34,031 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 163 transitions, 1496 flow. Second operand  has 46 states, 46 states have (on average 52.45652173913044) internal successors, (2413), 46 states have internal predecessors, (2413), 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)
[2023-11-03 11:40:34,031 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 11:40:34,031 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 220
[2023-11-03 11:40:34,031 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 11:40:37,540 INFO  L130       PetriNetUnfolder]: 538/1273 cut-off events.
[2023-11-03 11:40:37,540 INFO  L131       PetriNetUnfolder]: For 4500/4500 co-relation queries the response was YES.
[2023-11-03 11:40:37,546 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 5879 conditions, 1273 events. 538/1273 cut-off events. For 4500/4500 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 6804 event pairs, 16 based on Foata normal form. 20/1282 useless extension candidates. Maximal degree in co-relation 5844. Up to 210 conditions per place. 
[2023-11-03 11:40:37,553 INFO  L137   encePairwiseOnDemand]: 200/220 looper letters, 282 selfloop transitions, 106 changer transitions 0/389 dead transitions.
[2023-11-03 11:40:37,553 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 389 transitions, 3888 flow
[2023-11-03 11:40:37,553 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. 
[2023-11-03 11:40:37,553 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 26 states.
[2023-11-03 11:40:37,556 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 1508 transitions.
[2023-11-03 11:40:37,557 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.2636363636363636
[2023-11-03 11:40:37,557 INFO  L72            ComplementDD]: Start complementDD. Operand 26 states and 1508 transitions.
[2023-11-03 11:40:37,557 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 26 states and 1508 transitions.
[2023-11-03 11:40:37,558 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 11:40:37,558 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 26 states and 1508 transitions.
[2023-11-03 11:40:37,560 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 27 states, 26 states have (on average 58.0) internal successors, (1508), 26 states have internal predecessors, (1508), 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)
[2023-11-03 11:40:37,565 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 27 states, 27 states have (on average 220.0) internal successors, (5940), 27 states have internal predecessors, (5940), 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)
[2023-11-03 11:40:37,566 INFO  L81            ComplementDD]: Finished complementDD. Result  has 27 states, 27 states have (on average 220.0) internal successors, (5940), 27 states have internal predecessors, (5940), 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)
[2023-11-03 11:40:37,566 INFO  L175             Difference]: Start difference. First operand has 123 places, 163 transitions, 1496 flow. Second operand 26 states and 1508 transitions.
[2023-11-03 11:40:37,566 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 389 transitions, 3888 flow
[2023-11-03 11:40:37,582 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 389 transitions, 3819 flow, removed 22 selfloop flow, removed 8 redundant places.
[2023-11-03 11:40:37,586 INFO  L231             Difference]: Finished difference. Result has 149 places, 234 transitions, 2434 flow
[2023-11-03 11:40:37,586 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=220, PETRI_DIFFERENCE_MINUEND_FLOW=1446, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=2434, PETRI_PLACES=149, PETRI_TRANSITIONS=234}
[2023-11-03 11:40:37,587 INFO  L288   CegarLoopForPetriNet]: 66 programPoint places, 83 predicate places.
[2023-11-03 11:40:37,587 INFO  L495      AbstractCegarLoop]: Abstraction has has 149 places, 234 transitions, 2434 flow
[2023-11-03 11:40:37,588 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 46 states, 46 states have (on average 52.45652173913044) internal successors, (2413), 46 states have internal predecessors, (2413), 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)
[2023-11-03 11:40:37,588 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 11:40:37,588 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-03 11:40:37,599 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0
[2023-11-03 11:40:37,789 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-03 11:40:37,789 INFO  L420      AbstractCegarLoop]: === Iteration 10 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2023-11-03 11:40:37,790 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 11:40:37,790 INFO  L85        PathProgramCache]: Analyzing trace with hash 1088014417, now seen corresponding path program 3 times
[2023-11-03 11:40:37,790 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 11:40:37,790 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99618138]
[2023-11-03 11:40:37,790 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 11:40:37,791 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 11:40:37,821 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 11:40:38,508 INFO  L134       CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 11:40:38,508 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 11:40:38,508 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99618138]
[2023-11-03 11:40:38,508 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99618138] provided 0 perfect and 1 imperfect interpolant sequences
[2023-11-03 11:40:38,508 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1389865232]
[2023-11-03 11:40:38,509 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2023-11-03 11:40:38,509 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-03 11:40:38,509 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-11-03 11:40:38,510 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)
[2023-11-03 11:40:38,512 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
[2023-11-03 11:40:38,689 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s)
[2023-11-03 11:40:38,690 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2023-11-03 11:40:38,691 INFO  L263         TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 45 conjunts are in the unsatisfiable core
[2023-11-03 11:40:38,696 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-11-03 11:40:38,829 INFO  L321             Elim1Store]: treesize reduction 36, result has 23.4 percent of original size
[2023-11-03 11:40:38,830 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 49
[2023-11-03 11:40:39,140 INFO  L321             Elim1Store]: treesize reduction 36, result has 23.4 percent of original size
[2023-11-03 11:40:39,141 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 64 treesize of output 62
[2023-11-03 11:40:39,182 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 11:40:39,183 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
[2023-11-03 11:40:39,319 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 21 treesize of output 13
[2023-11-03 11:40:39,322 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 24 treesize of output 12
[2023-11-03 11:40:39,373 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2023-11-03 11:40:39,414 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 21 treesize of output 20
[2023-11-03 11:40:39,470 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32
[2023-11-03 11:40:39,526 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44
[2023-11-03 11:40:39,602 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 11:40:39,604 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 11:40:39,606 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 11:40:39,608 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 11:40:39,611 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-03 11:40:39,611 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 50 treesize of output 58
[2023-11-03 11:40:39,621 INFO  L134       CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 11:40:39,621 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-11-03 11:40:42,761 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 28 treesize of output 24
[2023-11-03 11:40:42,781 WARN  L837   $PredicateComparison]: unable to prove that (forall ((v_ArrVal_944 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_944) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) |c_ULTIMATE.start_main_~#is~0#1.base|))) is different from false
[2023-11-03 11:40:42,899 INFO  L134       CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked.
[2023-11-03 11:40:42,899 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1389865232] provided 0 perfect and 2 imperfect interpolant sequences
[2023-11-03 11:40:42,899 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-11-03 11:40:42,899 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 15] total 40
[2023-11-03 11:40:42,900 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452727938]
[2023-11-03 11:40:42,900 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-11-03 11:40:42,901 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 42 states
[2023-11-03 11:40:42,901 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 11:40:42,902 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants.
[2023-11-03 11:40:42,902 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=1432, Unknown=9, NotChecked=78, Total=1722
[2023-11-03 11:40:44,080 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 50 out of 220
[2023-11-03 11:40:44,082 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 234 transitions, 2434 flow. Second operand  has 42 states, 42 states have (on average 52.45238095238095) internal successors, (2203), 42 states have internal predecessors, (2203), 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)
[2023-11-03 11:40:44,082 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 11:40:44,082 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 220
[2023-11-03 11:40:44,082 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 11:40:48,110 INFO  L130       PetriNetUnfolder]: 649/1538 cut-off events.
[2023-11-03 11:40:48,110 INFO  L131       PetriNetUnfolder]: For 9578/9578 co-relation queries the response was YES.
[2023-11-03 11:40:48,118 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 8146 conditions, 1538 events. 649/1538 cut-off events. For 9578/9578 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 8754 event pairs, 27 based on Foata normal form. 21/1538 useless extension candidates. Maximal degree in co-relation 8101. Up to 454 conditions per place. 
[2023-11-03 11:40:48,126 INFO  L137   encePairwiseOnDemand]: 201/220 looper letters, 291 selfloop transitions, 148 changer transitions 0/440 dead transitions.
[2023-11-03 11:40:48,127 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 440 transitions, 5114 flow
[2023-11-03 11:40:48,127 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. 
[2023-11-03 11:40:48,127 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 21 states.
[2023-11-03 11:40:48,129 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 1222 transitions.
[2023-11-03 11:40:48,130 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.2645021645021645
[2023-11-03 11:40:48,130 INFO  L72            ComplementDD]: Start complementDD. Operand 21 states and 1222 transitions.
[2023-11-03 11:40:48,130 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 21 states and 1222 transitions.
[2023-11-03 11:40:48,131 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 11:40:48,131 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 1222 transitions.
[2023-11-03 11:40:48,133 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 22 states, 21 states have (on average 58.19047619047619) internal successors, (1222), 21 states have internal predecessors, (1222), 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)
[2023-11-03 11:40:48,137 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 22 states, 22 states have (on average 220.0) internal successors, (4840), 22 states have internal predecessors, (4840), 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)
[2023-11-03 11:40:48,137 INFO  L81            ComplementDD]: Finished complementDD. Result  has 22 states, 22 states have (on average 220.0) internal successors, (4840), 22 states have internal predecessors, (4840), 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)
[2023-11-03 11:40:48,137 INFO  L175             Difference]: Start difference. First operand has 149 places, 234 transitions, 2434 flow. Second operand 21 states and 1222 transitions.
[2023-11-03 11:40:48,137 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 440 transitions, 5114 flow
[2023-11-03 11:40:48,172 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 440 transitions, 4973 flow, removed 29 selfloop flow, removed 11 redundant places.
[2023-11-03 11:40:48,177 INFO  L231             Difference]: Finished difference. Result has 171 places, 304 transitions, 3703 flow
[2023-11-03 11:40:48,177 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=220, PETRI_DIFFERENCE_MINUEND_FLOW=2336, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=234, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=79, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=3703, PETRI_PLACES=171, PETRI_TRANSITIONS=304}
[2023-11-03 11:40:48,177 INFO  L288   CegarLoopForPetriNet]: 66 programPoint places, 105 predicate places.
[2023-11-03 11:40:48,178 INFO  L495      AbstractCegarLoop]: Abstraction has has 171 places, 304 transitions, 3703 flow
[2023-11-03 11:40:48,178 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 42 states, 42 states have (on average 52.45238095238095) internal successors, (2203), 42 states have internal predecessors, (2203), 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)
[2023-11-03 11:40:48,179 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 11:40:48,179 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-03 11:40:48,184 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0
[2023-11-03 11:40:48,379 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-03 11:40:48,380 INFO  L420      AbstractCegarLoop]: === Iteration 11 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2023-11-03 11:40:48,380 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 11:40:48,381 INFO  L85        PathProgramCache]: Analyzing trace with hash -189400963, now seen corresponding path program 4 times
[2023-11-03 11:40:48,381 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 11:40:48,381 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700573612]
[2023-11-03 11:40:48,381 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 11:40:48,381 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 11:40:48,419 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 11:40:50,187 INFO  L134       CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 11:40:50,187 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 11:40:50,187 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700573612]
[2023-11-03 11:40:50,188 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700573612] provided 0 perfect and 1 imperfect interpolant sequences
[2023-11-03 11:40:50,188 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [803586347]
[2023-11-03 11:40:50,188 INFO  L93    rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2023-11-03 11:40:50,188 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-03 11:40:50,188 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-11-03 11:40:50,189 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)
[2023-11-03 11:40:50,192 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
[2023-11-03 11:40:50,638 INFO  L228   tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s)
[2023-11-03 11:40:50,638 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2023-11-03 11:40:50,641 INFO  L263         TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 65 conjunts are in the unsatisfiable core
[2023-11-03 11:40:50,648 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-11-03 11:40:50,901 INFO  L321             Elim1Store]: treesize reduction 36, result has 23.4 percent of original size
[2023-11-03 11:40:50,902 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 57
[2023-11-03 11:40:50,913 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 11:40:50,914 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
[2023-11-03 11:40:51,470 INFO  L321             Elim1Store]: treesize reduction 36, result has 23.4 percent of original size
[2023-11-03 11:40:51,470 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 64 treesize of output 62
[2023-11-03 11:40:51,480 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 11:40:51,480 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 25 treesize of output 25
[2023-11-03 11:40:51,731 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2023-11-03 11:40:51,796 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 11:40:51,796 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 21 treesize of output 20
[2023-11-03 11:40:51,855 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 11:40:51,857 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 11:40:51,857 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32
[2023-11-03 11:40:51,941 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 11:40:51,942 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 11:40:51,944 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 11:40:51,945 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44
[2023-11-03 11:40:52,034 INFO  L321             Elim1Store]: treesize reduction 11, result has 45.0 percent of original size
[2023-11-03 11:40:52,034 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 41
[2023-11-03 11:40:52,041 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-03 11:40:52,041 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 27 treesize of output 13
[2023-11-03 11:40:52,053 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 22 treesize of output 10
[2023-11-03 11:40:52,064 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 24 treesize of output 12
[2023-11-03 11:40:52,143 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 11:40:52,143 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 41 treesize of output 37
[2023-11-03 11:40:52,184 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 11:40:52,185 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 41 treesize of output 37
[2023-11-03 11:40:52,215 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 11:40:52,216 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 41 treesize of output 37
[2023-11-03 11:40:52,327 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 11:40:52,329 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 11:40:52,330 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 11:40:52,332 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 11:40:52,333 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 11:40:52,334 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 11:40:52,335 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 11:40:52,338 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-03 11:40:52,338 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 50 treesize of output 58
[2023-11-03 11:40:52,402 INFO  L134       CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 11:40:52,402 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-11-03 11:40:52,595 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_#t~mem8#1.offset| (* |c_ULTIMATE.start_main_~i~1#1| 4)))) (and (forall ((v_ArrVal_1136 (Array Int Int)) (v_ArrVal_1138 Int)) (= (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1136))) (store .cse0 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse0 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_1138))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)) (forall ((v_ArrVal_1136 (Array Int Int)) (v_ArrVal_1138 Int)) (= (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1136))) (store .cse2 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse2 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_1138))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) 0)) (forall ((v_ArrVal_1136 (Array Int Int)) (v_ArrVal_1138 Int)) (= (select (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1136))) (store .cse3 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse3 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_1138))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 3)) 0)) (forall ((v_ArrVal_1136 (Array Int Int)) (v_ArrVal_1138 Int)) (= (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1136))) (store .cse4 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse4 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_1138))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)))) is different from false
[2023-11-03 11:40:52,664 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse3 (* |c_ULTIMATE.start_main_~i~1#1| 4)) (.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_45| Int)) (or (not (<= .cse0 |v_ULTIMATE.start_main_#t~mem8#1.offset_45|)) (forall ((v_ArrVal_1136 (Array Int Int)) (v_ArrVal_1138 Int)) (= (select (select (let ((.cse1 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1136))) (store .cse1 .cse2 (store (select .cse1 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_45| .cse3) v_ArrVal_1138))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) 0)))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_45| Int)) (or (forall ((v_ArrVal_1136 (Array Int Int)) (v_ArrVal_1138 Int)) (= (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1136))) (store .cse4 .cse2 (store (select .cse4 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_45| .cse3) v_ArrVal_1138))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)) (not (<= .cse0 |v_ULTIMATE.start_main_#t~mem8#1.offset_45|)))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_45| Int)) (or (forall ((v_ArrVal_1136 (Array Int Int)) (v_ArrVal_1138 Int)) (= (select (select (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1136))) (store .cse5 .cse2 (store (select .cse5 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_45| .cse3) v_ArrVal_1138))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)) (not (<= .cse0 |v_ULTIMATE.start_main_#t~mem8#1.offset_45|)))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_45| Int)) (or (forall ((v_ArrVal_1136 (Array Int Int)) (v_ArrVal_1138 Int)) (= (select (select (let ((.cse6 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1136))) (store .cse6 .cse2 (store (select .cse6 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_45| .cse3) v_ArrVal_1138))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 3)) 0)) (not (<= .cse0 |v_ULTIMATE.start_main_#t~mem8#1.offset_45|)))))) is different from false
[2023-11-03 11:40:52,718 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse7 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (let ((.cse4 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse2 (* |c_ULTIMATE.start_main_~i~1#1| 4)) (.cse3 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse7 0)))) (and (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_45| Int)) (or (forall ((v_ArrVal_1136 (Array Int Int)) (v_ArrVal_1138 Int)) (= (select (select (let ((.cse0 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1136))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_45| .cse2) v_ArrVal_1138))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)) (not (<= .cse4 |v_ULTIMATE.start_main_#t~mem8#1.offset_45|)))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_45| Int)) (or (forall ((v_ArrVal_1136 (Array Int Int)) (v_ArrVal_1138 Int)) (= (select (select (let ((.cse5 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1136))) (store .cse5 .cse1 (store (select .cse5 .cse1) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_45| .cse2) v_ArrVal_1138))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)) (not (<= .cse4 |v_ULTIMATE.start_main_#t~mem8#1.offset_45|)))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_45| Int)) (or (not (<= .cse4 |v_ULTIMATE.start_main_#t~mem8#1.offset_45|)) (forall ((v_ArrVal_1136 (Array Int Int)) (v_ArrVal_1138 Int)) (= (select (select (let ((.cse6 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1136))) (store .cse6 .cse1 (store (select .cse6 .cse1) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_45| .cse2) v_ArrVal_1138))) c_threadThread1of1ForFork0_~p~0.base) .cse7) 0)))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_45| Int)) (or (not (<= .cse4 |v_ULTIMATE.start_main_#t~mem8#1.offset_45|)) (forall ((v_ArrVal_1136 (Array Int Int)) (v_ArrVal_1138 Int)) (= (select (select (let ((.cse8 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1136))) (store .cse8 .cse1 (store (select .cse8 .cse1) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_45| .cse2) v_ArrVal_1138))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) 0))))))) is different from false
[2023-11-03 11:41:01,189 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-03 11:41:01,190 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 81 treesize of output 74
[2023-11-03 11:41:01,206 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-03 11:41:01,207 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 248 treesize of output 236
[2023-11-03 11:41:01,219 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 230 treesize of output 214
[2023-11-03 11:41:01,267 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 120 treesize of output 112
[2023-11-03 11:41:01,291 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-03 11:41:01,291 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 218 treesize of output 196
[2023-11-03 11:41:01,401 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2023-11-03 11:41:01,401 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 81 treesize of output 1
[2023-11-03 11:41:01,411 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2023-11-03 11:41:01,411 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 79 treesize of output 1
[2023-11-03 11:41:01,423 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2023-11-03 11:41:01,424 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 81 treesize of output 1
[2023-11-03 11:41:02,219 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1121 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1121) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) |c_ULTIMATE.start_main_~#is~0#1.base|))) (forall ((v_ArrVal_1122 (Array Int Int)) (v_ArrVal_1121 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1121))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (or (forall ((v_ArrVal_1123 (Array Int Int))) (not (= (select (select .cse0 |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) (select (select (store .cse0 .cse1 v_ArrVal_1123) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)))) (forall ((v_ArrVal_1124 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1122))) (< (select (select .cse2 |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) (+ (select (select (store .cse2 .cse1 v_ArrVal_1124) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) 1))))))))) is different from false
[2023-11-03 11:41:02,290 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (and (forall ((v_ArrVal_1121 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1121) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) |c_ULTIMATE.start_main_~#is~0#1.base|))) (forall ((v_ArrVal_1122 (Array Int Int)) (v_ArrVal_1121 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1121))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (or (forall ((v_ArrVal_1124 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1122))) (< (select (select .cse1 |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) (+ (select (select (store .cse1 .cse2 v_ArrVal_1124) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) 1)))) (forall ((v_ArrVal_1123 (Array Int Int))) (not (= (select (select (store .cse3 .cse2 v_ArrVal_1123) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) (select (select .cse3 |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)))))))))) is different from false
[2023-11-03 11:41:02,293 INFO  L134       CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked.
[2023-11-03 11:41:02,293 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [803586347] provided 0 perfect and 2 imperfect interpolant sequences
[2023-11-03 11:41:02,293 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-11-03 11:41:02,293 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15, 16] total 47
[2023-11-03 11:41:02,293 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794965098]
[2023-11-03 11:41:02,293 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-11-03 11:41:02,294 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 49 states
[2023-11-03 11:41:02,294 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 11:41:02,295 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants.
[2023-11-03 11:41:02,295 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=223, Invalid=1658, Unknown=31, NotChecked=440, Total=2352
[2023-11-03 11:41:02,465 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 50 out of 220
[2023-11-03 11:41:02,468 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 304 transitions, 3703 flow. Second operand  has 49 states, 49 states have (on average 52.30612244897959) internal successors, (2563), 49 states have internal predecessors, (2563), 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)
[2023-11-03 11:41:02,468 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 11:41:02,469 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 220
[2023-11-03 11:41:02,469 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 11:41:19,004 INFO  L130       PetriNetUnfolder]: 686/1657 cut-off events.
[2023-11-03 11:41:19,004 INFO  L131       PetriNetUnfolder]: For 16567/16567 co-relation queries the response was YES.
[2023-11-03 11:41:19,010 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 10017 conditions, 1657 events. 686/1657 cut-off events. For 16567/16567 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 9711 event pairs, 161 based on Foata normal form. 16/1673 useless extension candidates. Maximal degree in co-relation 9959. Up to 1035 conditions per place. 
[2023-11-03 11:41:19,018 INFO  L137   encePairwiseOnDemand]: 196/220 looper letters, 289 selfloop transitions, 130 changer transitions 0/420 dead transitions.
[2023-11-03 11:41:19,018 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 420 transitions, 5392 flow
[2023-11-03 11:41:19,019 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. 
[2023-11-03 11:41:19,019 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 23 states.
[2023-11-03 11:41:19,020 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 1322 transitions.
[2023-11-03 11:41:19,021 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.26126482213438734
[2023-11-03 11:41:19,021 INFO  L72            ComplementDD]: Start complementDD. Operand 23 states and 1322 transitions.
[2023-11-03 11:41:19,021 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 23 states and 1322 transitions.
[2023-11-03 11:41:19,021 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 11:41:19,021 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 23 states and 1322 transitions.
[2023-11-03 11:41:19,023 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 24 states, 23 states have (on average 57.47826086956522) internal successors, (1322), 23 states have internal predecessors, (1322), 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)
[2023-11-03 11:41:19,027 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 24 states, 24 states have (on average 220.0) internal successors, (5280), 24 states have internal predecessors, (5280), 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)
[2023-11-03 11:41:19,027 INFO  L81            ComplementDD]: Finished complementDD. Result  has 24 states, 24 states have (on average 220.0) internal successors, (5280), 24 states have internal predecessors, (5280), 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)
[2023-11-03 11:41:19,027 INFO  L175             Difference]: Start difference. First operand has 171 places, 304 transitions, 3703 flow. Second operand 23 states and 1322 transitions.
[2023-11-03 11:41:19,027 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 420 transitions, 5392 flow
[2023-11-03 11:41:19,085 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 420 transitions, 5312 flow, removed 29 selfloop flow, removed 7 redundant places.
[2023-11-03 11:41:19,091 INFO  L231             Difference]: Finished difference. Result has 198 places, 349 transitions, 4676 flow
[2023-11-03 11:41:19,091 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=220, PETRI_DIFFERENCE_MINUEND_FLOW=3625, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=304, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=88, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=4676, PETRI_PLACES=198, PETRI_TRANSITIONS=349}
[2023-11-03 11:41:19,091 INFO  L288   CegarLoopForPetriNet]: 66 programPoint places, 132 predicate places.
[2023-11-03 11:41:19,091 INFO  L495      AbstractCegarLoop]: Abstraction has has 198 places, 349 transitions, 4676 flow
[2023-11-03 11:41:19,092 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 49 states, 49 states have (on average 52.30612244897959) internal successors, (2563), 49 states have internal predecessors, (2563), 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)
[2023-11-03 11:41:19,092 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 11:41:19,092 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-03 11:41:19,103 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0
[2023-11-03 11:41:19,293 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,SelfDestructingSolverStorable10
[2023-11-03 11:41:19,294 INFO  L420      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2023-11-03 11:41:19,294 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 11:41:19,294 INFO  L85        PathProgramCache]: Analyzing trace with hash 439464892, now seen corresponding path program 2 times
[2023-11-03 11:41:19,295 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 11:41:19,295 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192501044]
[2023-11-03 11:41:19,295 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 11:41:19,295 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 11:41:19,323 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 11:41:20,031 INFO  L134       CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 11:41:20,032 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 11:41:20,032 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192501044]
[2023-11-03 11:41:20,032 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192501044] provided 0 perfect and 1 imperfect interpolant sequences
[2023-11-03 11:41:20,032 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1269142615]
[2023-11-03 11:41:20,032 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2023-11-03 11:41:20,032 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-03 11:41:20,033 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-11-03 11:41:20,034 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)
[2023-11-03 11:41:20,036 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
[2023-11-03 11:41:20,235 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2023-11-03 11:41:20,235 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2023-11-03 11:41:20,237 INFO  L263         TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 45 conjunts are in the unsatisfiable core
[2023-11-03 11:41:20,240 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-11-03 11:41:20,401 INFO  L321             Elim1Store]: treesize reduction 36, result has 23.4 percent of original size
[2023-11-03 11:41:20,401 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 49
[2023-11-03 11:41:20,712 INFO  L321             Elim1Store]: treesize reduction 36, result has 23.4 percent of original size
[2023-11-03 11:41:20,712 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 64 treesize of output 62
[2023-11-03 11:41:20,722 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 11:41:20,723 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
[2023-11-03 11:41:20,867 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 21 treesize of output 13
[2023-11-03 11:41:20,873 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 24 treesize of output 12
[2023-11-03 11:41:20,936 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11
[2023-11-03 11:41:20,981 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
[2023-11-03 11:41:21,030 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 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
[2023-11-03 11:41:21,096 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 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
[2023-11-03 11:41:21,176 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 11:41:21,177 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 11:41:21,178 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 11:41:21,180 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 11:41:21,182 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-03 11:41:21,182 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 59 treesize of output 67
[2023-11-03 11:41:21,193 INFO  L134       CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 11:41:21,194 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-11-03 11:41:24,508 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 28 treesize of output 24
[2023-11-03 11:41:24,731 INFO  L134       CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 11:41:24,732 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1269142615] provided 0 perfect and 2 imperfect interpolant sequences
[2023-11-03 11:41:24,732 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-11-03 11:41:24,732 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 15] total 40
[2023-11-03 11:41:24,732 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168300957]
[2023-11-03 11:41:24,732 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-11-03 11:41:24,733 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 42 states
[2023-11-03 11:41:24,733 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 11:41:24,734 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants.
[2023-11-03 11:41:24,734 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=206, Invalid=1497, Unknown=19, NotChecked=0, Total=1722
[2023-11-03 11:41:28,323 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2023-11-03 11:41:32,249 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2023-11-03 11:41:34,476 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2023-11-03 11:41:35,622 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 48 out of 220
[2023-11-03 11:41:35,625 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 349 transitions, 4676 flow. Second operand  has 42 states, 42 states have (on average 50.45238095238095) internal successors, (2119), 42 states have internal predecessors, (2119), 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)
[2023-11-03 11:41:35,625 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 11:41:35,625 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 220
[2023-11-03 11:41:35,625 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 11:41:38,929 INFO  L130       PetriNetUnfolder]: 718/1728 cut-off events.
[2023-11-03 11:41:38,929 INFO  L131       PetriNetUnfolder]: For 22009/22009 co-relation queries the response was YES.
[2023-11-03 11:41:38,939 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 11584 conditions, 1728 events. 718/1728 cut-off events. For 22009/22009 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 10285 event pairs, 59 based on Foata normal form. 10/1738 useless extension candidates. Maximal degree in co-relation 11514. Up to 630 conditions per place. 
[2023-11-03 11:41:38,948 INFO  L137   encePairwiseOnDemand]: 206/220 looper letters, 388 selfloop transitions, 114 changer transitions 0/503 dead transitions.
[2023-11-03 11:41:38,948 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 503 transitions, 7506 flow
[2023-11-03 11:41:38,949 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. 
[2023-11-03 11:41:38,949 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 16 states.
[2023-11-03 11:41:38,950 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 891 transitions.
[2023-11-03 11:41:38,950 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.253125
[2023-11-03 11:41:38,950 INFO  L72            ComplementDD]: Start complementDD. Operand 16 states and 891 transitions.
[2023-11-03 11:41:38,950 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 16 states and 891 transitions.
[2023-11-03 11:41:38,951 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 11:41:38,951 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 891 transitions.
[2023-11-03 11:41:38,952 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 17 states, 16 states have (on average 55.6875) internal successors, (891), 16 states have internal predecessors, (891), 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)
[2023-11-03 11:41:38,954 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 17 states, 17 states have (on average 220.0) internal successors, (3740), 17 states have internal predecessors, (3740), 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)
[2023-11-03 11:41:38,954 INFO  L81            ComplementDD]: Finished complementDD. Result  has 17 states, 17 states have (on average 220.0) internal successors, (3740), 17 states have internal predecessors, (3740), 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)
[2023-11-03 11:41:38,954 INFO  L175             Difference]: Start difference. First operand has 198 places, 349 transitions, 4676 flow. Second operand 16 states and 891 transitions.
[2023-11-03 11:41:38,954 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 213 places, 503 transitions, 7506 flow
[2023-11-03 11:41:39,038 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 503 transitions, 7376 flow, removed 44 selfloop flow, removed 8 redundant places.
[2023-11-03 11:41:39,045 INFO  L231             Difference]: Finished difference. Result has 210 places, 381 transitions, 5310 flow
[2023-11-03 11:41:39,045 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=220, PETRI_DIFFERENCE_MINUEND_FLOW=4578, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=349, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=82, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=240, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=5310, PETRI_PLACES=210, PETRI_TRANSITIONS=381}
[2023-11-03 11:41:39,046 INFO  L288   CegarLoopForPetriNet]: 66 programPoint places, 144 predicate places.
[2023-11-03 11:41:39,046 INFO  L495      AbstractCegarLoop]: Abstraction has has 210 places, 381 transitions, 5310 flow
[2023-11-03 11:41:39,046 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 42 states, 42 states have (on average 50.45238095238095) internal successors, (2119), 42 states have internal predecessors, (2119), 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)
[2023-11-03 11:41:39,047 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 11:41:39,047 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-03 11:41:39,055 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0
[2023-11-03 11:41:39,247 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,SelfDestructingSolverStorable11
[2023-11-03 11:41:39,248 INFO  L420      AbstractCegarLoop]: === Iteration 13 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2023-11-03 11:41:39,249 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 11:41:39,249 INFO  L85        PathProgramCache]: Analyzing trace with hash 395210955, now seen corresponding path program 5 times
[2023-11-03 11:41:39,249 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 11:41:39,249 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291219997]
[2023-11-03 11:41:39,249 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 11:41:39,250 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 11:41:39,279 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 11:41:40,620 INFO  L134       CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 11:41:40,620 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 11:41:40,620 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291219997]
[2023-11-03 11:41:40,620 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291219997] provided 0 perfect and 1 imperfect interpolant sequences
[2023-11-03 11:41:40,620 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [631465390]
[2023-11-03 11:41:40,620 INFO  L93    rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1
[2023-11-03 11:41:40,620 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-03 11:41:40,620 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-11-03 11:41:40,622 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)
[2023-11-03 11:41:40,624 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
[2023-11-03 11:41:40,891 INFO  L228   tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2023-11-03 11:41:40,891 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2023-11-03 11:41:40,894 INFO  L263         TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 50 conjunts are in the unsatisfiable core
[2023-11-03 11:41:40,905 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-11-03 11:41:41,114 INFO  L321             Elim1Store]: treesize reduction 36, result has 23.4 percent of original size
[2023-11-03 11:41:41,114 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 49
[2023-11-03 11:41:41,518 INFO  L321             Elim1Store]: treesize reduction 36, result has 23.4 percent of original size
[2023-11-03 11:41:41,518 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 64 treesize of output 62
[2023-11-03 11:41:41,528 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 11:41:41,530 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
[2023-11-03 11:41:41,770 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2023-11-03 11:41:41,842 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 21 treesize of output 20
[2023-11-03 11:41:41,908 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32
[2023-11-03 11:41:42,002 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44
[2023-11-03 11:41:42,096 INFO  L321             Elim1Store]: treesize reduction 11, result has 45.0 percent of original size
[2023-11-03 11:41:42,097 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 41
[2023-11-03 11:41:42,116 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 13
[2023-11-03 11:41:42,124 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 21 treesize of output 13
[2023-11-03 11:41:42,133 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 24 treesize of output 12
[2023-11-03 11:41:42,223 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 11:41:42,224 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 41 treesize of output 37
[2023-11-03 11:41:42,246 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 11:41:42,247 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 41 treesize of output 37
[2023-11-03 11:41:42,268 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 11:41:42,269 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 41 treesize of output 37
[2023-11-03 11:41:42,379 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 11:41:42,381 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 11:41:42,383 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 11:41:42,385 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 11:41:42,390 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-03 11:41:42,390 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 50 treesize of output 58
[2023-11-03 11:41:42,402 INFO  L134       CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 11:41:42,402 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-11-03 11:41:42,600 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_#t~mem8#1.offset| (* |c_ULTIMATE.start_main_~i~1#1| 4)))) (and (forall ((v_ArrVal_1496 Int) (v_ArrVal_1494 (Array Int Int))) (= (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1494))) (store .cse0 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse0 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_1496))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)) (forall ((v_ArrVal_1496 Int) (v_ArrVal_1494 (Array Int Int))) (= (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1494))) (store .cse2 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse2 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_1496))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)) (forall ((v_ArrVal_1496 Int) (v_ArrVal_1494 (Array Int Int))) (= (select (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1494))) (store .cse3 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse3 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_1496))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) 0)) (forall ((v_ArrVal_1496 Int) (v_ArrVal_1494 (Array Int Int))) (= (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1494))) (store .cse4 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse4 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_1496))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 3)) 0)))) is different from false
[2023-11-03 11:41:42,685 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse3 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (and (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_49| Int)) (or (not (<= .cse0 |v_ULTIMATE.start_main_#t~mem8#1.offset_49|)) (forall ((v_ArrVal_1496 Int) (v_ArrVal_1494 (Array Int Int))) (= (select (select (let ((.cse1 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1494))) (store .cse1 .cse2 (store (select .cse1 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_49| .cse3) v_ArrVal_1496))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_49| Int)) (or (forall ((v_ArrVal_1496 Int) (v_ArrVal_1494 (Array Int Int))) (= (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1494))) (store .cse4 .cse2 (store (select .cse4 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_49| .cse3) v_ArrVal_1496))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 3)) 0)) (not (<= .cse0 |v_ULTIMATE.start_main_#t~mem8#1.offset_49|)))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_49| Int)) (or (not (<= .cse0 |v_ULTIMATE.start_main_#t~mem8#1.offset_49|)) (forall ((v_ArrVal_1496 Int) (v_ArrVal_1494 (Array Int Int))) (= (select (select (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1494))) (store .cse5 .cse2 (store (select .cse5 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_49| .cse3) v_ArrVal_1496))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_49| Int)) (or (not (<= .cse0 |v_ULTIMATE.start_main_#t~mem8#1.offset_49|)) (forall ((v_ArrVal_1496 Int) (v_ArrVal_1494 (Array Int Int))) (= (select (select (let ((.cse6 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1494))) (store .cse6 .cse2 (store (select .cse6 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_49| .cse3) v_ArrVal_1496))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) 0)))))) is different from false
[2023-11-03 11:41:47,167 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse8 (+ c_threadThread1of1ForFork0_~p~0.offset 2)) (.cse6 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (let ((.cse4 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse2 (* |c_ULTIMATE.start_main_~i~1#1| 4)) (.cse3 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse8 0) .cse6 0)))) (and (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_49| Int)) (or (forall ((v_ArrVal_1496 Int) (v_ArrVal_1494 (Array Int Int))) (= (select (select (let ((.cse0 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1494))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_49| .cse2) v_ArrVal_1496))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)) (not (<= .cse4 |v_ULTIMATE.start_main_#t~mem8#1.offset_49|)))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_49| Int)) (or (forall ((v_ArrVal_1496 Int) (v_ArrVal_1494 (Array Int Int))) (= (select (select (let ((.cse5 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1494))) (store .cse5 .cse1 (store (select .cse5 .cse1) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_49| .cse2) v_ArrVal_1496))) c_threadThread1of1ForFork0_~p~0.base) .cse6) 0)) (not (<= .cse4 |v_ULTIMATE.start_main_#t~mem8#1.offset_49|)))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_49| Int)) (or (forall ((v_ArrVal_1496 Int) (v_ArrVal_1494 (Array Int Int))) (= (select (select (let ((.cse7 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1494))) (store .cse7 .cse1 (store (select .cse7 .cse1) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_49| .cse2) v_ArrVal_1496))) c_threadThread1of1ForFork0_~p~0.base) .cse8) 0)) (not (<= .cse4 |v_ULTIMATE.start_main_#t~mem8#1.offset_49|)))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_49| Int)) (or (not (<= .cse4 |v_ULTIMATE.start_main_#t~mem8#1.offset_49|)) (forall ((v_ArrVal_1496 Int) (v_ArrVal_1494 (Array Int Int))) (= (select (select (let ((.cse9 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1494))) (store .cse9 .cse1 (store (select .cse9 .cse1) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_49| .cse2) v_ArrVal_1496))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0))))))) is different from false
[2023-11-03 11:41:47,256 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse9 (+ c_threadThread1of1ForFork0_~p~0.offset 1)) (.cse5 (+ c_threadThread1of1ForFork0_~p~0.offset 2)) (.cse7 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse3 (* |c_ULTIMATE.start_main_~i~1#1| 4)) (.cse4 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (store (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse9 0) .cse5 0) .cse7 0)))) (and (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_49| Int)) (or (not (<= .cse0 |v_ULTIMATE.start_main_#t~mem8#1.offset_49|)) (forall ((v_ArrVal_1496 Int) (v_ArrVal_1494 (Array Int Int))) (= (select (select (let ((.cse1 (store .cse4 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1494))) (store .cse1 .cse2 (store (select .cse1 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_49| .cse3) v_ArrVal_1496))) c_threadThread1of1ForFork0_~p~0.base) .cse5) 0)))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_49| Int)) (or (forall ((v_ArrVal_1496 Int) (v_ArrVal_1494 (Array Int Int))) (= (select (select (let ((.cse6 (store .cse4 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1494))) (store .cse6 .cse2 (store (select .cse6 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_49| .cse3) v_ArrVal_1496))) c_threadThread1of1ForFork0_~p~0.base) .cse7) 0)) (not (<= .cse0 |v_ULTIMATE.start_main_#t~mem8#1.offset_49|)))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_49| Int)) (or (not (<= .cse0 |v_ULTIMATE.start_main_#t~mem8#1.offset_49|)) (forall ((v_ArrVal_1496 Int) (v_ArrVal_1494 (Array Int Int))) (= (select (select (let ((.cse8 (store .cse4 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1494))) (store .cse8 .cse2 (store (select .cse8 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_49| .cse3) v_ArrVal_1496))) c_threadThread1of1ForFork0_~p~0.base) .cse9) 0)))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_49| Int)) (or (not (<= .cse0 |v_ULTIMATE.start_main_#t~mem8#1.offset_49|)) (forall ((v_ArrVal_1496 Int) (v_ArrVal_1494 (Array Int Int))) (= (select (select (let ((.cse10 (store .cse4 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1494))) (store .cse10 .cse2 (store (select .cse10 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_49| .cse3) v_ArrVal_1496))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0))))))) is different from false
[2023-11-03 11:41:47,301 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-03 11:41:47,301 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 79 treesize of output 72
[2023-11-03 11:41:47,319 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-03 11:41:47,319 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 412 treesize of output 384
[2023-11-03 11:41:47,332 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 398 treesize of output 382
[2023-11-03 11:41:47,408 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 214 treesize of output 206
[2023-11-03 11:41:47,437 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-03 11:41:47,438 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 306 treesize of output 286
[2023-11-03 11:41:47,697 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-03 11:41:47,697 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 81 treesize of output 74
[2023-11-03 11:41:47,703 INFO  L173   IndexEqualityManager]: detected equality via solver
[2023-11-03 11:41:47,719 INFO  L321             Elim1Store]: treesize reduction 8, result has 33.3 percent of original size
[2023-11-03 11:41:47,720 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 144 treesize of output 130
[2023-11-03 11:41:47,731 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 65 treesize of output 61
[2023-11-03 11:41:47,743 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 158 treesize of output 132
[2023-11-03 11:41:47,786 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-03 11:41:47,787 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 81 treesize of output 74
[2023-11-03 11:41:47,793 INFO  L173   IndexEqualityManager]: detected equality via solver
[2023-11-03 11:41:47,809 INFO  L321             Elim1Store]: treesize reduction 8, result has 33.3 percent of original size
[2023-11-03 11:41:47,810 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 144 treesize of output 130
[2023-11-03 11:41:47,823 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 65 treesize of output 61
[2023-11-03 11:41:47,834 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 158 treesize of output 132
[2023-11-03 11:41:47,879 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2023-11-03 11:41:47,880 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 81 treesize of output 1
[2023-11-03 11:41:48,498 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 71 treesize of output 63
[2023-11-03 11:41:48,503 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 58 treesize of output 56
[2023-11-03 11:41:48,631 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1480 (Array Int Int))) (not (= |c_ULTIMATE.start_main_~#is~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1480) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)))) (forall ((v_ArrVal_1480 (Array Int Int))) (not (= |c_ULTIMATE.start_main_~#is~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1480) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))))) is different from false
[2023-11-03 11:41:48,761 INFO  L134       CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked.
[2023-11-03 11:41:48,761 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [631465390] provided 0 perfect and 2 imperfect interpolant sequences
[2023-11-03 11:41:48,761 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-11-03 11:41:48,761 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 16] total 45
[2023-11-03 11:41:48,762 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959363501]
[2023-11-03 11:41:48,762 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-11-03 11:41:48,762 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 47 states
[2023-11-03 11:41:48,763 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 11:41:48,763 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants.
[2023-11-03 11:41:48,764 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=1534, Unknown=15, NotChecked=420, Total=2162
[2023-11-03 11:41:48,766 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 50 out of 220
[2023-11-03 11:41:48,769 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 381 transitions, 5310 flow. Second operand  has 47 states, 47 states have (on average 52.38297872340426) internal successors, (2462), 47 states have internal predecessors, (2462), 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)
[2023-11-03 11:41:48,769 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 11:41:48,769 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 220
[2023-11-03 11:41:48,769 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 11:41:59,926 INFO  L130       PetriNetUnfolder]: 777/1916 cut-off events.
[2023-11-03 11:41:59,927 INFO  L131       PetriNetUnfolder]: For 27401/27401 co-relation queries the response was YES.
[2023-11-03 11:41:59,936 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 13153 conditions, 1916 events. 777/1916 cut-off events. For 27401/27401 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 11921 event pairs, 138 based on Foata normal form. 16/1932 useless extension candidates. Maximal degree in co-relation 13078. Up to 1145 conditions per place. 
[2023-11-03 11:41:59,944 INFO  L137   encePairwiseOnDemand]: 195/220 looper letters, 343 selfloop transitions, 163 changer transitions 0/507 dead transitions.
[2023-11-03 11:41:59,945 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 232 places, 507 transitions, 7672 flow
[2023-11-03 11:41:59,946 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. 
[2023-11-03 11:41:59,946 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 23 states.
[2023-11-03 11:41:59,947 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 1328 transitions.
[2023-11-03 11:41:59,947 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.2624505928853755
[2023-11-03 11:41:59,948 INFO  L72            ComplementDD]: Start complementDD. Operand 23 states and 1328 transitions.
[2023-11-03 11:41:59,948 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 23 states and 1328 transitions.
[2023-11-03 11:41:59,948 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 11:41:59,948 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 23 states and 1328 transitions.
[2023-11-03 11:41:59,950 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 24 states, 23 states have (on average 57.73913043478261) internal successors, (1328), 23 states have internal predecessors, (1328), 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)
[2023-11-03 11:41:59,953 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 24 states, 24 states have (on average 220.0) internal successors, (5280), 24 states have internal predecessors, (5280), 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)
[2023-11-03 11:41:59,953 INFO  L81            ComplementDD]: Finished complementDD. Result  has 24 states, 24 states have (on average 220.0) internal successors, (5280), 24 states have internal predecessors, (5280), 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)
[2023-11-03 11:41:59,954 INFO  L175             Difference]: Start difference. First operand has 210 places, 381 transitions, 5310 flow. Second operand 23 states and 1328 transitions.
[2023-11-03 11:41:59,954 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 232 places, 507 transitions, 7672 flow
[2023-11-03 11:42:00,087 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 222 places, 507 transitions, 7407 flow, removed 40 selfloop flow, removed 10 redundant places.
[2023-11-03 11:42:00,095 INFO  L231             Difference]: Finished difference. Result has 232 places, 433 transitions, 6518 flow
[2023-11-03 11:42:00,095 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=220, PETRI_DIFFERENCE_MINUEND_FLOW=5086, PETRI_DIFFERENCE_MINUEND_PLACES=200, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=381, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=113, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=233, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=6518, PETRI_PLACES=232, PETRI_TRANSITIONS=433}
[2023-11-03 11:42:00,095 INFO  L288   CegarLoopForPetriNet]: 66 programPoint places, 166 predicate places.
[2023-11-03 11:42:00,095 INFO  L495      AbstractCegarLoop]: Abstraction has has 232 places, 433 transitions, 6518 flow
[2023-11-03 11:42:00,096 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 47 states, 47 states have (on average 52.38297872340426) internal successors, (2462), 47 states have internal predecessors, (2462), 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)
[2023-11-03 11:42:00,096 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 11:42:00,096 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-03 11:42:00,105 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0
[2023-11-03 11:42:00,297 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,SelfDestructingSolverStorable12
[2023-11-03 11:42:00,297 INFO  L420      AbstractCegarLoop]: === Iteration 14 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2023-11-03 11:42:00,298 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 11:42:00,298 INFO  L85        PathProgramCache]: Analyzing trace with hash -105589831, now seen corresponding path program 6 times
[2023-11-03 11:42:00,299 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 11:42:00,299 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111259925]
[2023-11-03 11:42:00,299 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 11:42:00,299 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 11:42:00,337 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 11:42:02,021 INFO  L134       CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 11:42:02,021 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 11:42:02,021 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111259925]
[2023-11-03 11:42:02,021 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111259925] provided 0 perfect and 1 imperfect interpolant sequences
[2023-11-03 11:42:02,022 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1884690005]
[2023-11-03 11:42:02,022 INFO  L93    rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE
[2023-11-03 11:42:02,022 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-03 11:42:02,022 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-11-03 11:42:02,023 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)
[2023-11-03 11:42:02,025 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
[2023-11-03 11:42:02,252 INFO  L228   tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s)
[2023-11-03 11:42:02,253 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2023-11-03 11:42:02,257 INFO  L263         TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 59 conjunts are in the unsatisfiable core
[2023-11-03 11:42:02,263 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-11-03 11:42:02,571 INFO  L321             Elim1Store]: treesize reduction 36, result has 23.4 percent of original size
[2023-11-03 11:42:02,572 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 49
[2023-11-03 11:42:02,581 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 11:42:02,582 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 14 treesize of output 16
[2023-11-03 11:42:03,193 INFO  L321             Elim1Store]: treesize reduction 36, result has 23.4 percent of original size
[2023-11-03 11:42:03,194 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 64 treesize of output 62
[2023-11-03 11:42:03,207 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 11:42:03,208 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 25 treesize of output 25
[2023-11-03 11:42:03,495 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 22 treesize of output 10
[2023-11-03 11:42:03,506 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 24 treesize of output 12
[2023-11-03 11:42:03,566 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2023-11-03 11:42:03,641 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 11:42:03,642 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 14 treesize of output 16
[2023-11-03 11:42:03,667 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 11:42:03,667 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 21 treesize of output 20
[2023-11-03 11:42:03,740 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 11:42:03,741 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 23
[2023-11-03 11:42:03,760 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 11:42:03,761 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 23
[2023-11-03 11:42:03,854 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 11:42:03,855 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 11:42:03,856 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32
[2023-11-03 11:42:03,940 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 11:42:03,942 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 11:42:03,943 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 11:42:03,944 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44
[2023-11-03 11:42:04,060 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 11:42:04,062 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 11:42:04,064 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 11:42:04,065 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 11:42:04,066 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 11:42:04,067 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 11:42:04,068 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 11:42:04,070 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-03 11:42:04,070 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 50 treesize of output 58
[2023-11-03 11:42:04,155 INFO  L134       CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 11:42:04,155 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-11-03 11:42:04,734 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_#t~mem8#1.offset| (* |c_ULTIMATE.start_main_~i~1#1| 4))) (.cse3 (+ c_threadThread1of1ForFork0_~p~0.offset 2)) (.cse4 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (and (forall ((v_ArrVal_1671 (Array Int Int)) (v_ArrVal_1677 Int)) (= (select (select (let ((.cse0 (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1671))) (store .cse2 c_threadThread1of1ForFork0_~p~0.base (store (store (select .cse2 c_threadThread1of1ForFork0_~p~0.base) .cse3 0) .cse4 0))))) (store .cse0 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse0 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_1677))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)) (forall ((v_ArrVal_1671 (Array Int Int)) (v_ArrVal_1677 Int)) (= (select (select (let ((.cse5 (let ((.cse6 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1671))) (store .cse6 c_threadThread1of1ForFork0_~p~0.base (store (store (select .cse6 c_threadThread1of1ForFork0_~p~0.base) .cse3 0) .cse4 0))))) (store .cse5 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse5 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_1677))) c_threadThread1of1ForFork0_~p~0.base) .cse4) 0)) (forall ((v_ArrVal_1671 (Array Int Int)) (v_ArrVal_1677 Int)) (= (select (select (let ((.cse7 (let ((.cse8 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1671))) (store .cse8 c_threadThread1of1ForFork0_~p~0.base (store (store (select .cse8 c_threadThread1of1ForFork0_~p~0.base) .cse3 0) .cse4 0))))) (store .cse7 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse7 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_1677))) c_threadThread1of1ForFork0_~p~0.base) .cse3) 0)) (forall ((v_ArrVal_1671 (Array Int Int)) (v_ArrVal_1677 Int)) (= (select (select (let ((.cse9 (let ((.cse10 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1671))) (store .cse10 c_threadThread1of1ForFork0_~p~0.base (store (store (select .cse10 c_threadThread1of1ForFork0_~p~0.base) .cse3 0) .cse4 0))))) (store .cse9 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse9 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_1677))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)))) is different from false
[2023-11-03 11:42:04,819 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse10 (+ c_threadThread1of1ForFork0_~p~0.offset 1))) (let ((.cse1 (+ |c_ULTIMATE.start_main_#t~mem8#1.offset| (* |c_ULTIMATE.start_main_~i~1#1| 4))) (.cse3 (+ c_threadThread1of1ForFork0_~p~0.offset 2)) (.cse4 (+ c_threadThread1of1ForFork0_~p~0.offset 3)) (.cse5 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse10 0)))) (and (forall ((v_ArrVal_1671 (Array Int Int)) (v_ArrVal_1677 Int)) (= (select (select (let ((.cse0 (let ((.cse2 (store .cse5 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1671))) (store .cse2 c_threadThread1of1ForFork0_~p~0.base (store (store (select .cse2 c_threadThread1of1ForFork0_~p~0.base) .cse3 0) .cse4 0))))) (store .cse0 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse0 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_1677))) c_threadThread1of1ForFork0_~p~0.base) .cse4) 0)) (forall ((v_ArrVal_1671 (Array Int Int)) (v_ArrVal_1677 Int)) (= (select (select (let ((.cse6 (let ((.cse7 (store .cse5 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1671))) (store .cse7 c_threadThread1of1ForFork0_~p~0.base (store (store (select .cse7 c_threadThread1of1ForFork0_~p~0.base) .cse3 0) .cse4 0))))) (store .cse6 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse6 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_1677))) c_threadThread1of1ForFork0_~p~0.base) .cse3) 0)) (forall ((v_ArrVal_1671 (Array Int Int)) (v_ArrVal_1677 Int)) (= (select (select (let ((.cse8 (let ((.cse9 (store .cse5 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1671))) (store .cse9 c_threadThread1of1ForFork0_~p~0.base (store (store (select .cse9 c_threadThread1of1ForFork0_~p~0.base) .cse3 0) .cse4 0))))) (store .cse8 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse8 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_1677))) c_threadThread1of1ForFork0_~p~0.base) .cse10) 0)) (forall ((v_ArrVal_1671 (Array Int Int)) (v_ArrVal_1677 Int)) (= (select (select (let ((.cse11 (let ((.cse12 (store .cse5 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1671))) (store .cse12 c_threadThread1of1ForFork0_~p~0.base (store (store (select .cse12 c_threadThread1of1ForFork0_~p~0.base) .cse3 0) .cse4 0))))) (store .cse11 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse11 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_1677))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0))))) is different from false
[2023-11-03 11:42:04,882 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_#t~mem8#1.offset| (* |c_ULTIMATE.start_main_~i~1#1| 4))) (.cse3 (+ c_threadThread1of1ForFork0_~p~0.offset 2)) (.cse4 (+ c_threadThread1of1ForFork0_~p~0.offset 3)) (.cse6 (+ c_threadThread1of1ForFork0_~p~0.offset 1))) (and (forall ((v_ArrVal_1667 (Array Int Int)) (v_ArrVal_1671 (Array Int Int)) (v_ArrVal_1677 Int)) (= (select (select (let ((.cse0 (let ((.cse2 (store (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1667))) (store .cse5 c_threadThread1of1ForFork0_~p~0.base (store (select .cse5 c_threadThread1of1ForFork0_~p~0.base) .cse6 0))) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1671))) (store .cse2 c_threadThread1of1ForFork0_~p~0.base (store (store (select .cse2 c_threadThread1of1ForFork0_~p~0.base) .cse3 0) .cse4 0))))) (store .cse0 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse0 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_1677))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)) (forall ((v_ArrVal_1667 (Array Int Int)) (v_ArrVal_1671 (Array Int Int)) (v_ArrVal_1677 Int)) (= (select (select (let ((.cse7 (let ((.cse8 (store (let ((.cse9 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1667))) (store .cse9 c_threadThread1of1ForFork0_~p~0.base (store (select .cse9 c_threadThread1of1ForFork0_~p~0.base) .cse6 0))) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1671))) (store .cse8 c_threadThread1of1ForFork0_~p~0.base (store (store (select .cse8 c_threadThread1of1ForFork0_~p~0.base) .cse3 0) .cse4 0))))) (store .cse7 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse7 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_1677))) c_threadThread1of1ForFork0_~p~0.base) .cse3) 0)) (forall ((v_ArrVal_1667 (Array Int Int)) (v_ArrVal_1671 (Array Int Int)) (v_ArrVal_1677 Int)) (= (select (select (let ((.cse10 (let ((.cse11 (store (let ((.cse12 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1667))) (store .cse12 c_threadThread1of1ForFork0_~p~0.base (store (select .cse12 c_threadThread1of1ForFork0_~p~0.base) .cse6 0))) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1671))) (store .cse11 c_threadThread1of1ForFork0_~p~0.base (store (store (select .cse11 c_threadThread1of1ForFork0_~p~0.base) .cse3 0) .cse4 0))))) (store .cse10 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse10 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_1677))) c_threadThread1of1ForFork0_~p~0.base) .cse4) 0)) (forall ((v_ArrVal_1667 (Array Int Int)) (v_ArrVal_1671 (Array Int Int)) (v_ArrVal_1677 Int)) (= (select (select (let ((.cse13 (let ((.cse14 (store (let ((.cse15 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1667))) (store .cse15 c_threadThread1of1ForFork0_~p~0.base (store (select .cse15 c_threadThread1of1ForFork0_~p~0.base) .cse6 0))) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1671))) (store .cse14 c_threadThread1of1ForFork0_~p~0.base (store (store (select .cse14 c_threadThread1of1ForFork0_~p~0.base) .cse3 0) .cse4 0))))) (store .cse13 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse13 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_1677))) c_threadThread1of1ForFork0_~p~0.base) .cse6) 0)))) is different from false
[2023-11-03 11:42:04,912 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-03 11:42:04,912 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 1 case distinctions, treesize of input 191 treesize of output 136
[2023-11-03 11:42:04,952 INFO  L321             Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2023-11-03 11:42:04,952 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 7726 treesize of output 7656
[2023-11-03 11:42:05,047 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 1234 treesize of output 1232
[2023-11-03 11:42:18,313 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-03 11:42:18,315 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 1 case distinctions, treesize of input 189 treesize of output 134
[2023-11-03 11:42:18,403 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-03 11:42:18,405 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 186518 treesize of output 184544
[2023-11-03 11:42:18,937 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 207970 treesize of output 193330
[2023-11-03 11:42:19,581 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 197202 treesize of output 196542
[2023-11-03 11:42:34,804 WARN  L233               SmtUtils]: Spent 5.11s on a formula simplification. DAG size of input: 418 DAG size of output: 418 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2023-11-03 11:42:44,986 WARN  L233               SmtUtils]: Spent 5.10s on a formula simplification. DAG size of input: 409 DAG size of output: 409 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2023-11-03 11:43:02,317 WARN  L233               SmtUtils]: Spent 6.97s on a formula simplification. DAG size of input: 390 DAG size of output: 390 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2023-11-03 11:43:31,092 WARN  L233               SmtUtils]: Spent 5.05s on a formula simplification. DAG size of input: 364 DAG size of output: 364 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2023-11-03 11:44:15,761 WARN  L233               SmtUtils]: Spent 7.29s on a formula simplification. DAG size of input: 256 DAG size of output: 256 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2023-11-03 11:44:42,052 WARN  L233               SmtUtils]: Spent 6.88s on a formula simplification. DAG size of input: 232 DAG size of output: 232 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2023-11-03 11:44:49,079 WARN  L233               SmtUtils]: Spent 6.69s on a formula simplification. DAG size of input: 230 DAG size of output: 230 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2023-11-03 11:44:56,153 WARN  L233               SmtUtils]: Spent 6.71s on a formula simplification. DAG size of input: 230 DAG size of output: 230 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2023-11-03 11:45:07,524 WARN  L233               SmtUtils]: Spent 6.78s on a formula simplification. DAG size of input: 230 DAG size of output: 230 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2023-11-03 11:45:18,722 WARN  L233               SmtUtils]: Spent 6.80s on a formula simplification. DAG size of input: 230 DAG size of output: 230 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2023-11-03 11:45:46,864 WARN  L233               SmtUtils]: Spent 6.61s on a formula simplification. DAG size of input: 232 DAG size of output: 232 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2023-11-03 11:45:53,863 WARN  L233               SmtUtils]: Spent 6.65s on a formula simplification. DAG size of input: 230 DAG size of output: 230 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2023-11-03 11:46:00,964 WARN  L233               SmtUtils]: Spent 6.75s on a formula simplification. DAG size of input: 230 DAG size of output: 230 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2023-11-03 11:46:12,386 WARN  L233               SmtUtils]: Spent 6.77s on a formula simplification. DAG size of input: 230 DAG size of output: 230 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2023-11-03 11:46:23,494 WARN  L233               SmtUtils]: Spent 6.80s on a formula simplification. DAG size of input: 230 DAG size of output: 230 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2023-11-03 11:47:04,599 WARN  L233               SmtUtils]: Spent 7.30s on a formula simplification. DAG size of input: 256 DAG size of output: 256 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2023-11-03 11:47:30,366 WARN  L233               SmtUtils]: Spent 6.60s on a formula simplification. DAG size of input: 232 DAG size of output: 232 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2023-11-03 11:47:37,397 WARN  L233               SmtUtils]: Spent 6.68s on a formula simplification. DAG size of input: 230 DAG size of output: 230 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2023-11-03 11:47:44,525 WARN  L233               SmtUtils]: Spent 6.77s on a formula simplification. DAG size of input: 230 DAG size of output: 230 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2023-11-03 11:47:56,177 WARN  L233               SmtUtils]: Spent 6.87s on a formula simplification. DAG size of input: 230 DAG size of output: 230 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2023-11-03 11:48:07,292 WARN  L233               SmtUtils]: Spent 6.77s on a formula simplification. DAG size of input: 230 DAG size of output: 230 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2023-11-03 11:48:35,125 WARN  L233               SmtUtils]: Spent 6.56s on a formula simplification. DAG size of input: 232 DAG size of output: 232 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2023-11-03 11:48:42,118 WARN  L233               SmtUtils]: Spent 6.66s on a formula simplification. DAG size of input: 230 DAG size of output: 230 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2023-11-03 11:48:49,202 WARN  L233               SmtUtils]: Spent 6.74s on a formula simplification. DAG size of input: 230 DAG size of output: 230 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2023-11-03 11:49:00,684 WARN  L233               SmtUtils]: Spent 6.80s on a formula simplification. DAG size of input: 230 DAG size of output: 230 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2023-11-03 11:49:11,911 WARN  L233               SmtUtils]: Spent 6.82s on a formula simplification. DAG size of input: 230 DAG size of output: 230 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2023-11-03 11:49:29,561 WARN  L233               SmtUtils]: Spent 5.08s on a formula simplification. DAG size of input: 362 DAG size of output: 362 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2023-11-03 11:49:35,253 WARN  L233               SmtUtils]: Spent 5.06s on a formula simplification. DAG size of input: 360 DAG size of output: 360 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2023-11-03 11:49:54,658 WARN  L233               SmtUtils]: Spent 5.00s on a formula simplification. DAG size of input: 350 DAG size of output: 350 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2023-11-03 11:50:00,298 WARN  L233               SmtUtils]: Spent 5.02s on a formula simplification. DAG size of input: 348 DAG size of output: 348 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2023-11-03 11:50:39,517 WARN  L233               SmtUtils]: Spent 5.04s on a formula simplification. DAG size of input: 344 DAG size of output: 344 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2023-11-03 11:50:45,963 WARN  L233               SmtUtils]: Spent 5.11s on a formula simplification. DAG size of input: 342 DAG size of output: 342 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2023-11-03 11:50:55,333 WARN  L233               SmtUtils]: Spent 5.01s on a formula simplification. DAG size of input: 358 DAG size of output: 358 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2023-11-03 11:51:09,114 WARN  L233               SmtUtils]: Spent 5.00s on a formula simplification. DAG size of input: 356 DAG size of output: 356 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2023-11-03 11:52:11,546 WARN  L233               SmtUtils]: Spent 5.59s on a formula simplification. DAG size of input: 374 DAG size of output: 374 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2023-11-03 11:52:25,275 WARN  L233               SmtUtils]: Spent 5.59s on a formula simplification. DAG size of input: 371 DAG size of output: 371 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2023-11-03 11:52:32,192 WARN  L233               SmtUtils]: Spent 5.66s on a formula simplification. DAG size of input: 371 DAG size of output: 371 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2023-11-03 11:52:54,603 WARN  L233               SmtUtils]: Spent 5.03s on a formula simplification. DAG size of input: 364 DAG size of output: 364 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
Killed by 15
