./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-10-27 12:18:30,620 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2023-10-27 12:18:30,622 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2023-10-27 12:18:30,671 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2023-10-27 12:18:30,671 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2023-10-27 12:18:30,674 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2023-10-27 12:18:30,675 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2023-10-27 12:18:30,677 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2023-10-27 12:18:30,678 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2023-10-27 12:18:30,694 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2023-10-27 12:18:30,695 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2023-10-27 12:18:30,696 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2023-10-27 12:18:30,697 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2023-10-27 12:18:30,698 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2023-10-27 12:18:30,699 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2023-10-27 12:18:30,700 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2023-10-27 12:18:30,701 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2023-10-27 12:18:30,702 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2023-10-27 12:18:30,703 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2023-10-27 12:18:30,707 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2023-10-27 12:18:30,708 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2023-10-27 12:18:30,710 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2023-10-27 12:18:30,710 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2023-10-27 12:18:30,711 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2023-10-27 12:18:30,716 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2023-10-27 12:18:30,729 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2023-10-27 12:18:30,729 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2023-10-27 12:18:30,731 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2023-10-27 12:18:30,731 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2023-10-27 12:18:30,732 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2023-10-27 12:18:30,732 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2023-10-27 12:18:30,733 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2023-10-27 12:18:30,734 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2023-10-27 12:18:30,735 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2023-10-27 12:18:30,736 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2023-10-27 12:18:30,736 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2023-10-27 12:18:30,736 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2023-10-27 12:18:30,737 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2023-10-27 12:18:30,737 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2023-10-27 12:18:30,738 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2023-10-27 12:18:30,738 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2023-10-27 12:18:30,739 INFO  L101        SettingsManager]: Beginning loading settings from /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf
[2023-10-27 12:18:30,772 INFO  L113        SettingsManager]: Loading preferences was successful
[2023-10-27 12:18:30,772 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2023-10-27 12:18:30,773 INFO  L136        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2023-10-27 12:18:30,773 INFO  L138        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2023-10-27 12:18:30,773 INFO  L136        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2023-10-27 12:18:30,774 INFO  L138        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2023-10-27 12:18:30,774 INFO  L136        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2023-10-27 12:18:30,774 INFO  L138        SettingsManager]:  * Create parallel compositions if possible=false
[2023-10-27 12:18:30,774 INFO  L138        SettingsManager]:  * Use SBE=true
[2023-10-27 12:18:30,774 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2023-10-27 12:18:30,775 INFO  L138        SettingsManager]:  * sizeof long=4
[2023-10-27 12:18:30,775 INFO  L138        SettingsManager]:  * Check unreachability of error function in SV-COMP mode=false
[2023-10-27 12:18:30,775 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2023-10-27 12:18:30,776 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2023-10-27 12:18:30,776 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2023-10-27 12:18:30,776 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2023-10-27 12:18:30,776 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2023-10-27 12:18:30,776 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2023-10-27 12:18:30,776 INFO  L138        SettingsManager]:  * Check absence of data races in concurrent programs=true
[2023-10-27 12:18:30,776 INFO  L138        SettingsManager]:  * sizeof long double=12
[2023-10-27 12:18:30,777 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2023-10-27 12:18:30,777 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2023-10-27 12:18:30,777 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2023-10-27 12:18:30,777 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2023-10-27 12:18:30,777 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2023-10-27 12:18:30,777 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2023-10-27 12:18:30,778 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2023-10-27 12:18:30,778 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2023-10-27 12:18:30,781 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2023-10-27 12:18:30,781 INFO  L138        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2023-10-27 12:18:30,781 INFO  L138        SettingsManager]:  * Trace refinement strategy=CAMEL
[2023-10-27 12:18:30,781 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2023-10-27 12:18:30,782 INFO  L138        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2023-10-27 12:18:30,782 INFO  L138        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2023-10-27 12:18:30,782 INFO  L138        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2023-10-27 12:18:30,783 INFO  L138        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2023-10-27 12:18:30,783 INFO  L138        SettingsManager]:  * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC
[2023-10-27 12:18:30,783 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-10-27 12:18:31,153 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2023-10-27 12:18:31,176 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2023-10-27 12:18:31,178 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2023-10-27 12:18:31,179 INFO  L271        PluginConnector]: Initializing CDTParser...
[2023-10-27 12:18:31,179 INFO  L275        PluginConnector]: CDTParser initialized
[2023-10-27 12:18:31,181 INFO  L432   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-array-init.i
[2023-10-27 12:18:32,874 INFO  L500              CDTParser]: Created temporary CDT project at NULL
[2023-10-27 12:18:33,248 INFO  L351              CDTParser]: Found 1 translation units.
[2023-10-27 12:18:33,249 INFO  L172              CDTParser]: Scanning /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-array-init.i
[2023-10-27 12:18:33,266 INFO  L394              CDTParser]: About to delete temporary CDT project at /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data/b56d5f8ae/e11a448695004e0a9471e8b419d410cf/FLAG03ad4ffd6
[2023-10-27 12:18:33,288 INFO  L402              CDTParser]: Successfully deleted /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data/b56d5f8ae/e11a448695004e0a9471e8b419d410cf
[2023-10-27 12:18:33,290 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2023-10-27 12:18:33,292 INFO  L131        ToolchainWalker]: Walking toolchain with 6 elements.
[2023-10-27 12:18:33,296 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2023-10-27 12:18:33,296 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2023-10-27 12:18:33,298 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2023-10-27 12:18:33,299 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 12:18:33" (1/1) ...
[2023-10-27 12:18:33,303 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4409ec5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:18:33, skipping insertion in model container
[2023-10-27 12:18:33,304 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 12:18:33" (1/1) ...
[2023-10-27 12:18:33,318 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2023-10-27 12:18:33,388 INFO  L178         MainTranslator]: Built tables and reachable declarations
[2023-10-27 12:18:33,632 WARN  L611        FunctionHandler]: implicit declaration of function __builtin_bswap16
[2023-10-27 12:18:33,986 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2023-10-27 12:18:34,012 INFO  L203         MainTranslator]: Completed pre-run
[2023-10-27 12:18:34,032 WARN  L611        FunctionHandler]: implicit declaration of function __builtin_bswap16
[2023-10-27 12:18:34,091 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2023-10-27 12:18:34,174 INFO  L208         MainTranslator]: Completed translation
[2023-10-27 12:18:34,175 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:18:34 WrapperNode
[2023-10-27 12:18:34,175 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2023-10-27 12:18:34,176 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2023-10-27 12:18:34,176 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2023-10-27 12:18:34,176 INFO  L275        PluginConnector]: Boogie Procedure Inliner initialized
[2023-10-27 12:18:34,182 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:18:34" (1/1) ...
[2023-10-27 12:18:34,208 INFO  L185        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:18:34" (1/1) ...
[2023-10-27 12:18:34,256 INFO  L138                Inliner]: procedures = 266, calls = 27, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 112
[2023-10-27 12:18:34,257 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2023-10-27 12:18:34,273 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2023-10-27 12:18:34,273 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2023-10-27 12:18:34,274 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2023-10-27 12:18:34,281 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:18:34" (1/1) ...
[2023-10-27 12:18:34,285 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:18:34" (1/1) ...
[2023-10-27 12:18:34,289 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:18:34" (1/1) ...
[2023-10-27 12:18:34,299 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:18:34" (1/1) ...
[2023-10-27 12:18:34,308 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:18:34" (1/1) ...
[2023-10-27 12:18:34,329 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:18:34" (1/1) ...
[2023-10-27 12:18:34,338 INFO  L185        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:18:34" (1/1) ...
[2023-10-27 12:18:34,348 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:18:34" (1/1) ...
[2023-10-27 12:18:34,350 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2023-10-27 12:18:34,355 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2023-10-27 12:18:34,355 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2023-10-27 12:18:34,355 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2023-10-27 12:18:34,356 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:18:34" (1/1) ...
[2023-10-27 12:18:34,366 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2023-10-27 12:18:34,385 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-27 12:18:34,420 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-10-27 12:18:34,465 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-10-27 12:18:34,484 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2023-10-27 12:18:34,485 INFO  L130     BoogieDeclarations]: Found specification of procedure read~$Pointer$
[2023-10-27 12:18:34,485 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2023-10-27 12:18:34,489 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~$Pointer$
[2023-10-27 12:18:34,489 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int
[2023-10-27 12:18:34,489 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2023-10-27 12:18:34,489 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap
[2023-10-27 12:18:34,489 INFO  L130     BoogieDeclarations]: Found specification of procedure thread
[2023-10-27 12:18:34,489 INFO  L138     BoogieDeclarations]: Found implementation of procedure thread
[2023-10-27 12:18:34,489 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2023-10-27 12:18:34,490 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2023-10-27 12:18:34,491 WARN  L209             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement
[2023-10-27 12:18:34,754 INFO  L235             CfgBuilder]: Building ICFG
[2023-10-27 12:18:34,756 INFO  L261             CfgBuilder]: Building CFG for each procedure with an implementation
[2023-10-27 12:18:35,224 INFO  L276             CfgBuilder]: Performing block encoding
[2023-10-27 12:18:35,239 INFO  L295             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2023-10-27 12:18:35,241 INFO  L300             CfgBuilder]: Removed 2 assume(true) statements.
[2023-10-27 12:18:35,242 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 12:18:35 BoogieIcfgContainer
[2023-10-27 12:18:35,243 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2023-10-27 12:18:35,257 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2023-10-27 12:18:35,257 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2023-10-27 12:18:35,259 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2023-10-27 12:18:35,260 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.10 12:18:33" (1/3) ...
[2023-10-27 12:18:35,260 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6744bdbc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.10 12:18:35, skipping insertion in model container
[2023-10-27 12:18:35,260 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:18:34" (2/3) ...
[2023-10-27 12:18:35,261 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6744bdbc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.10 12:18:35, skipping insertion in model container
[2023-10-27 12:18:35,262 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 12:18:35" (3/3) ...
[2023-10-27 12:18:35,263 INFO  L112   eAbstractionObserver]: Analyzing ICFG per-thread-array-init.i
[2023-10-27 12:18:35,269 WARN  L145   ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2023-10-27 12:18:35,285 INFO  L203   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2023-10-27 12:18:35,285 INFO  L162   ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations.
[2023-10-27 12:18:35,285 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2023-10-27 12:18:35,390 INFO  L144    ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions.
[2023-10-27 12:18:35,437 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 136 places, 137 transitions, 282 flow
[2023-10-27 12:18:35,595 INFO  L130       PetriNetUnfolder]: 6/218 cut-off events.
[2023-10-27 12:18:35,600 INFO  L131       PetriNetUnfolder]: For 1/1 co-relation queries the response was YES.
[2023-10-27 12:18:35,604 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-10-27 12:18:35,612 INFO  L82        GeneralOperation]: Start removeDead. Operand has 136 places, 137 transitions, 282 flow
[2023-10-27 12:18:35,616 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 136 places, 137 transitions, 282 flow
[2023-10-27 12:18:35,618 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2023-10-27 12:18:35,639 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 136 places, 137 transitions, 282 flow
[2023-10-27 12:18:35,645 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 136 places, 137 transitions, 282 flow
[2023-10-27 12:18:35,645 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 136 places, 137 transitions, 282 flow
[2023-10-27 12:18:35,757 INFO  L130       PetriNetUnfolder]: 6/218 cut-off events.
[2023-10-27 12:18:35,760 INFO  L131       PetriNetUnfolder]: For 1/1 co-relation queries the response was YES.
[2023-10-27 12:18:35,761 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-10-27 12:18:35,763 INFO  L119        LiptonReduction]: Number of co-enabled transitions 2314
[2023-10-27 12:18:39,436 INFO  L134        LiptonReduction]: Checked pairs total: 10042
[2023-10-27 12:18:39,453 INFO  L136        LiptonReduction]: Total number of compositions: 83
[2023-10-27 12:18:39,471 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-10-27 12:18:39,495 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;@1acb3fdb, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2023-10-27 12:18:39,496 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 11 error locations.
[2023-10-27 12:18:39,502 INFO  L130       PetriNetUnfolder]: 0/14 cut-off events.
[2023-10-27 12:18:39,502 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2023-10-27 12:18:39,503 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:18:39,504 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1]
[2023-10-27 12:18:39,504 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-10-27 12:18:39,511 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:18:39,511 INFO  L85        PathProgramCache]: Analyzing trace with hash -382401433, now seen corresponding path program 1 times
[2023-10-27 12:18:39,520 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-27 12:18:39,521 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743444194]
[2023-10-27 12:18:39,521 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:18:39,521 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-27 12:18:39,751 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:18:40,501 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-27 12:18:40,501 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-27 12:18:40,502 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743444194]
[2023-10-27 12:18:40,502 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743444194] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-27 12:18:40,502 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-27 12:18:40,503 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-10-27 12:18:40,504 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928622343]
[2023-10-27 12:18:40,504 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-27 12:18:40,511 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-10-27 12:18:40,511 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-27 12:18:40,549 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-10-27 12:18:40,550 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-10-27 12:18:41,089 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 107 out of 220
[2023-10-27 12:18:41,092 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-10-27 12:18:41,092 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-27 12:18:41,093 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 220
[2023-10-27 12:18:41,093 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-27 12:18:41,299 INFO  L130       PetriNetUnfolder]: 57/287 cut-off events.
[2023-10-27 12:18:41,300 INFO  L131       PetriNetUnfolder]: For 4/4 co-relation queries the response was YES.
[2023-10-27 12:18:41,301 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-10-27 12:18:41,304 INFO  L137   encePairwiseOnDemand]: 203/220 looper letters, 40 selfloop transitions, 10 changer transitions 5/82 dead transitions.
[2023-10-27 12:18:41,304 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 82 transitions, 282 flow
[2023-10-27 12:18:41,305 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-10-27 12:18:41,307 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-10-27 12:18:41,318 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 700 transitions.
[2023-10-27 12:18:41,326 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5303030303030303
[2023-10-27 12:18:41,327 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 700 transitions.
[2023-10-27 12:18:41,327 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 700 transitions.
[2023-10-27 12:18:41,331 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-27 12:18:41,333 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 700 transitions.
[2023-10-27 12:18:41,354 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-10-27 12:18:41,361 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-10-27 12:18:41,362 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-10-27 12:18:41,364 INFO  L175             Difference]: Start difference. First operand has 66 places, 64 transitions, 136 flow. Second operand 6 states and 700 transitions.
[2023-10-27 12:18:41,364 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 82 transitions, 282 flow
[2023-10-27 12:18:41,367 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 82 transitions, 282 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-10-27 12:18:41,375 INFO  L231             Difference]: Finished difference. Result has 72 places, 65 transitions, 190 flow
[2023-10-27 12:18:41,376 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-10-27 12:18:41,379 INFO  L288   CegarLoopForPetriNet]: 66 programPoint places, 6 predicate places.
[2023-10-27 12:18:41,380 INFO  L495      AbstractCegarLoop]: Abstraction has has 72 places, 65 transitions, 190 flow
[2023-10-27 12:18:41,380 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-10-27 12:18:41,393 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:18:41,393 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2023-10-27 12:18:41,394 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2023-10-27 12:18:41,395 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-10-27 12:18:41,396 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:18:41,396 INFO  L85        PathProgramCache]: Analyzing trace with hash 1094831862, now seen corresponding path program 1 times
[2023-10-27 12:18:41,397 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-27 12:18:41,399 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959505849]
[2023-10-27 12:18:41,400 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:18:41,400 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-27 12:18:41,427 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:18:41,508 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-27 12:18:41,508 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-27 12:18:41,509 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959505849]
[2023-10-27 12:18:41,509 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959505849] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-27 12:18:41,510 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-27 12:18:41,513 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2023-10-27 12:18:41,513 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215016827]
[2023-10-27 12:18:41,513 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-27 12:18:41,514 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2023-10-27 12:18:41,514 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-27 12:18:41,515 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2023-10-27 12:18:41,515 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2023-10-27 12:18:41,598 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 126 out of 220
[2023-10-27 12:18:41,601 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-10-27 12:18:41,602 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-27 12:18:41,602 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 220
[2023-10-27 12:18:41,602 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-27 12:18:41,741 INFO  L130       PetriNetUnfolder]: 28/243 cut-off events.
[2023-10-27 12:18:41,741 INFO  L131       PetriNetUnfolder]: For 25/25 co-relation queries the response was YES.
[2023-10-27 12:18:41,744 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-10-27 12:18:41,745 INFO  L137   encePairwiseOnDemand]: 216/220 looper letters, 27 selfloop transitions, 3 changer transitions 1/75 dead transitions.
[2023-10-27 12:18:41,745 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 75 transitions, 276 flow
[2023-10-27 12:18:41,745 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2023-10-27 12:18:41,745 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2023-10-27 12:18:41,746 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 536 transitions.
[2023-10-27 12:18:41,747 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6090909090909091
[2023-10-27 12:18:41,752 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 536 transitions.
[2023-10-27 12:18:41,752 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 536 transitions.
[2023-10-27 12:18:41,753 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-27 12:18:41,753 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 536 transitions.
[2023-10-27 12:18:41,754 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-10-27 12:18:41,756 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-10-27 12:18:41,756 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-10-27 12:18:41,757 INFO  L175             Difference]: Start difference. First operand has 72 places, 65 transitions, 190 flow. Second operand 4 states and 536 transitions.
[2023-10-27 12:18:41,757 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 75 transitions, 276 flow
[2023-10-27 12:18:41,771 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 75 transitions, 266 flow, removed 3 selfloop flow, removed 1 redundant places.
[2023-10-27 12:18:41,772 INFO  L231             Difference]: Finished difference. Result has 76 places, 66 transitions, 196 flow
[2023-10-27 12:18:41,773 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-10-27 12:18:41,773 INFO  L288   CegarLoopForPetriNet]: 66 programPoint places, 10 predicate places.
[2023-10-27 12:18:41,774 INFO  L495      AbstractCegarLoop]: Abstraction has has 76 places, 66 transitions, 196 flow
[2023-10-27 12:18:41,774 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-10-27 12:18:41,774 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:18:41,774 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2023-10-27 12:18:41,775 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2023-10-27 12:18:41,775 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-10-27 12:18:41,777 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:18:41,777 INFO  L85        PathProgramCache]: Analyzing trace with hash 1103111380, now seen corresponding path program 1 times
[2023-10-27 12:18:41,777 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-27 12:18:41,778 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400323562]
[2023-10-27 12:18:41,778 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:18:41,779 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-27 12:18:41,807 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:18:42,109 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-27 12:18:42,110 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-27 12:18:42,110 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400323562]
[2023-10-27 12:18:42,110 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400323562] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-27 12:18:42,111 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-27 12:18:42,111 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-10-27 12:18:42,111 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947543596]
[2023-10-27 12:18:42,112 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-27 12:18:42,112 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-10-27 12:18:42,112 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-27 12:18:42,113 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-10-27 12:18:42,113 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-10-27 12:18:42,532 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 107 out of 220
[2023-10-27 12:18:42,533 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-10-27 12:18:42,533 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-27 12:18:42,533 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 220
[2023-10-27 12:18:42,533 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-27 12:18:42,677 INFO  L130       PetriNetUnfolder]: 58/260 cut-off events.
[2023-10-27 12:18:42,677 INFO  L131       PetriNetUnfolder]: For 15/15 co-relation queries the response was YES.
[2023-10-27 12:18:42,678 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-10-27 12:18:42,680 INFO  L137   encePairwiseOnDemand]: 207/220 looper letters, 40 selfloop transitions, 6 changer transitions 5/77 dead transitions.
[2023-10-27 12:18:42,680 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 77 transitions, 322 flow
[2023-10-27 12:18:42,681 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-10-27 12:18:42,681 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-10-27 12:18:42,686 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 696 transitions.
[2023-10-27 12:18:42,686 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5272727272727272
[2023-10-27 12:18:42,687 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 696 transitions.
[2023-10-27 12:18:42,687 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 696 transitions.
[2023-10-27 12:18:42,687 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-27 12:18:42,687 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 696 transitions.
[2023-10-27 12:18:42,689 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-10-27 12:18:42,691 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-10-27 12:18:42,692 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-10-27 12:18:42,692 INFO  L175             Difference]: Start difference. First operand has 76 places, 66 transitions, 196 flow. Second operand 6 states and 696 transitions.
[2023-10-27 12:18:42,692 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 77 transitions, 322 flow
[2023-10-27 12:18:42,705 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 77 transitions, 320 flow, removed 0 selfloop flow, removed 1 redundant places.
[2023-10-27 12:18:42,707 INFO  L231             Difference]: Finished difference. Result has 82 places, 63 transitions, 220 flow
[2023-10-27 12:18:42,707 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-10-27 12:18:42,722 INFO  L288   CegarLoopForPetriNet]: 66 programPoint places, 16 predicate places.
[2023-10-27 12:18:42,722 INFO  L495      AbstractCegarLoop]: Abstraction has has 82 places, 63 transitions, 220 flow
[2023-10-27 12:18:42,722 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-10-27 12:18:42,722 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:18:42,723 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-27 12:18:42,723 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2023-10-27 12:18:42,726 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-10-27 12:18:42,726 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:18:42,726 INFO  L85        PathProgramCache]: Analyzing trace with hash -1153489684, now seen corresponding path program 1 times
[2023-10-27 12:18:42,726 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-27 12:18:42,727 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996181941]
[2023-10-27 12:18:42,727 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:18:42,727 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-27 12:18:42,755 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:18:43,248 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-27 12:18:43,248 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-27 12:18:43,249 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996181941]
[2023-10-27 12:18:43,249 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996181941] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-27 12:18:43,249 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-27 12:18:43,249 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-10-27 12:18:43,249 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555173451]
[2023-10-27 12:18:43,250 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-27 12:18:43,250 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-10-27 12:18:43,250 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-27 12:18:43,251 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-10-27 12:18:43,252 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-10-27 12:18:43,593 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 87 out of 220
[2023-10-27 12:18:43,594 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-10-27 12:18:43,594 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-27 12:18:43,594 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 220
[2023-10-27 12:18:43,594 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-27 12:18:43,818 INFO  L130       PetriNetUnfolder]: 254/667 cut-off events.
[2023-10-27 12:18:43,833 INFO  L131       PetriNetUnfolder]: For 109/109 co-relation queries the response was YES.
[2023-10-27 12:18:43,837 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-10-27 12:18:43,839 INFO  L137   encePairwiseOnDemand]: 210/220 looper letters, 61 selfloop transitions, 22 changer transitions 0/91 dead transitions.
[2023-10-27 12:18:43,840 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 91 transitions, 442 flow
[2023-10-27 12:18:43,840 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-10-27 12:18:43,840 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-10-27 12:18:43,841 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 601 transitions.
[2023-10-27 12:18:43,842 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.4553030303030303
[2023-10-27 12:18:43,842 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 601 transitions.
[2023-10-27 12:18:43,842 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 601 transitions.
[2023-10-27 12:18:43,844 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-27 12:18:43,844 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 601 transitions.
[2023-10-27 12:18:43,845 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-10-27 12:18:43,848 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-10-27 12:18:43,849 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-10-27 12:18:43,849 INFO  L175             Difference]: Start difference. First operand has 82 places, 63 transitions, 220 flow. Second operand 6 states and 601 transitions.
[2023-10-27 12:18:43,849 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 91 transitions, 442 flow
[2023-10-27 12:18:43,852 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 91 transitions, 413 flow, removed 6 selfloop flow, removed 9 redundant places.
[2023-10-27 12:18:43,853 INFO  L231             Difference]: Finished difference. Result has 81 places, 83 transitions, 318 flow
[2023-10-27 12:18:43,853 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-10-27 12:18:43,855 INFO  L288   CegarLoopForPetriNet]: 66 programPoint places, 15 predicate places.
[2023-10-27 12:18:43,856 INFO  L495      AbstractCegarLoop]: Abstraction has has 81 places, 83 transitions, 318 flow
[2023-10-27 12:18:43,856 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-10-27 12:18:43,856 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:18:43,857 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-10-27 12:18:43,869 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2023-10-27 12:18:43,869 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-10-27 12:18:43,870 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:18:43,870 INFO  L85        PathProgramCache]: Analyzing trace with hash -116177611, now seen corresponding path program 1 times
[2023-10-27 12:18:43,870 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-27 12:18:43,870 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052515821]
[2023-10-27 12:18:43,870 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:18:43,871 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-27 12:18:43,908 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:18:44,406 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-27 12:18:44,406 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-27 12:18:44,407 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052515821]
[2023-10-27 12:18:44,407 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052515821] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-27 12:18:44,407 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-27 12:18:44,408 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-10-27 12:18:44,408 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252946851]
[2023-10-27 12:18:44,408 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-27 12:18:44,408 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-10-27 12:18:44,408 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-27 12:18:44,409 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-10-27 12:18:44,409 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-10-27 12:18:44,897 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 121 out of 220
[2023-10-27 12:18:44,898 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-10-27 12:18:44,898 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-27 12:18:44,898 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 220
[2023-10-27 12:18:44,898 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-27 12:18:45,217 INFO  L130       PetriNetUnfolder]: 161/521 cut-off events.
[2023-10-27 12:18:45,217 INFO  L131       PetriNetUnfolder]: For 233/237 co-relation queries the response was YES.
[2023-10-27 12:18:45,218 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-10-27 12:18:45,234 INFO  L137   encePairwiseOnDemand]: 210/220 looper letters, 83 selfloop transitions, 28 changer transitions 26/163 dead transitions.
[2023-10-27 12:18:45,235 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 163 transitions, 885 flow
[2023-10-27 12:18:45,235 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-10-27 12:18:45,235 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-10-27 12:18:45,237 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 832 transitions.
[2023-10-27 12:18:45,237 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6303030303030303
[2023-10-27 12:18:45,237 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 832 transitions.
[2023-10-27 12:18:45,238 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 832 transitions.
[2023-10-27 12:18:45,238 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-27 12:18:45,238 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 832 transitions.
[2023-10-27 12:18:45,240 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-10-27 12:18:45,241 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-10-27 12:18:45,242 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-10-27 12:18:45,242 INFO  L175             Difference]: Start difference. First operand has 81 places, 83 transitions, 318 flow. Second operand 6 states and 832 transitions.
[2023-10-27 12:18:45,242 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 163 transitions, 885 flow
[2023-10-27 12:18:45,245 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 163 transitions, 870 flow, removed 0 selfloop flow, removed 1 redundant places.
[2023-10-27 12:18:45,247 INFO  L231             Difference]: Finished difference. Result has 90 places, 96 transitions, 543 flow
[2023-10-27 12:18:45,248 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-10-27 12:18:45,249 INFO  L288   CegarLoopForPetriNet]: 66 programPoint places, 24 predicate places.
[2023-10-27 12:18:45,249 INFO  L495      AbstractCegarLoop]: Abstraction has has 90 places, 96 transitions, 543 flow
[2023-10-27 12:18:45,250 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-10-27 12:18:45,250 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:18:45,250 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-10-27 12:18:45,250 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2023-10-27 12:18:45,250 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-10-27 12:18:45,251 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:18:45,251 INFO  L85        PathProgramCache]: Analyzing trace with hash 2137239947, now seen corresponding path program 1 times
[2023-10-27 12:18:45,251 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-27 12:18:45,251 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985424419]
[2023-10-27 12:18:45,259 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:18:45,260 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-27 12:18:45,306 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:18:45,842 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2023-10-27 12:18:45,842 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-27 12:18:45,842 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985424419]
[2023-10-27 12:18:45,843 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985424419] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-27 12:18:45,843 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-27 12:18:45,843 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-10-27 12:18:45,843 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500842175]
[2023-10-27 12:18:45,843 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-27 12:18:45,844 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-10-27 12:18:45,844 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-27 12:18:45,845 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-10-27 12:18:45,848 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-10-27 12:18:46,517 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 117 out of 220
[2023-10-27 12:18:46,518 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-10-27 12:18:46,518 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-27 12:18:46,518 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 220
[2023-10-27 12:18:46,518 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-27 12:18:46,673 INFO  L130       PetriNetUnfolder]: 89/377 cut-off events.
[2023-10-27 12:18:46,673 INFO  L131       PetriNetUnfolder]: For 348/380 co-relation queries the response was YES.
[2023-10-27 12:18:46,674 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-10-27 12:18:46,675 INFO  L137   encePairwiseOnDemand]: 214/220 looper letters, 41 selfloop transitions, 0 changer transitions 21/103 dead transitions.
[2023-10-27 12:18:46,675 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 103 transitions, 681 flow
[2023-10-27 12:18:46,675 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-10-27 12:18:46,676 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-10-27 12:18:46,677 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 735 transitions.
[2023-10-27 12:18:46,677 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5568181818181818
[2023-10-27 12:18:46,678 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 735 transitions.
[2023-10-27 12:18:46,678 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 735 transitions.
[2023-10-27 12:18:46,678 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-27 12:18:46,678 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 735 transitions.
[2023-10-27 12:18:46,679 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-10-27 12:18:46,681 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-10-27 12:18:46,681 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-10-27 12:18:46,681 INFO  L175             Difference]: Start difference. First operand has 90 places, 96 transitions, 543 flow. Second operand 6 states and 735 transitions.
[2023-10-27 12:18:46,682 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 103 transitions, 681 flow
[2023-10-27 12:18:46,684 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 103 transitions, 657 flow, removed 12 selfloop flow, removed 0 redundant places.
[2023-10-27 12:18:46,691 INFO  L231             Difference]: Finished difference. Result has 84 places, 82 transitions, 486 flow
[2023-10-27 12:18:46,691 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-10-27 12:18:46,703 INFO  L288   CegarLoopForPetriNet]: 66 programPoint places, 18 predicate places.
[2023-10-27 12:18:46,704 INFO  L495      AbstractCegarLoop]: Abstraction has has 84 places, 82 transitions, 486 flow
[2023-10-27 12:18:46,704 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-10-27 12:18:46,704 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:18:46,704 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-10-27 12:18:46,704 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2023-10-27 12:18:46,705 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-10-27 12:18:46,705 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:18:46,705 INFO  L85        PathProgramCache]: Analyzing trace with hash -972606990, now seen corresponding path program 1 times
[2023-10-27 12:18:46,705 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-27 12:18:46,706 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098877627]
[2023-10-27 12:18:46,706 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:18:46,706 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-27 12:18:46,807 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:18:48,481 INFO  L134       CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-27 12:18:48,482 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-27 12:18:48,482 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098877627]
[2023-10-27 12:18:48,482 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098877627] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-27 12:18:48,482 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1822491734]
[2023-10-27 12:18:48,482 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:18:48,482 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-27 12:18:48,482 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-27 12:18:48,501 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-10-27 12:18:48,538 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-10-27 12:18:48,713 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:18:48,734 INFO  L263         TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 44 conjunts are in the unsatisfiable core
[2023-10-27 12:18:48,741 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-27 12:18:49,101 INFO  L321             Elim1Store]: treesize reduction 36, result has 23.4 percent of original size
[2023-10-27 12:18:49,102 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-10-27 12:18:49,664 INFO  L321             Elim1Store]: treesize reduction 36, result has 23.4 percent of original size
[2023-10-27 12:18:49,665 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-10-27 12:18:49,693 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:18:49,694 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-10-27 12:18:49,940 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-10-27 12:18:49,948 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-10-27 12:18:50,016 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-10-27 12:18:50,088 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-10-27 12:18:50,157 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-10-27 12:18:50,245 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-10-27 12:18:50,342 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:18:50,344 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:18:50,345 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:18:50,347 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:18:50,351 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-27 12:18:50,351 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-10-27 12:18:50,363 INFO  L134       CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-27 12:18:50,363 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-27 12:18:52,283 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-10-27 12:18:52,393 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-10-27 12:18:52,399 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-10-27 12:18:52,759 INFO  L134       CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-27 12:18:52,759 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1822491734] provided 0 perfect and 2 imperfect interpolant sequences
[2023-10-27 12:18:52,759 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-10-27 12:18:52,760 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 15] total 42
[2023-10-27 12:18:52,760 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436235730]
[2023-10-27 12:18:52,760 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-10-27 12:18:52,760 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 44 states
[2023-10-27 12:18:52,760 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-27 12:18:52,761 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants.
[2023-10-27 12:18:52,761 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=215, Invalid=1578, Unknown=17, NotChecked=82, Total=1892
[2023-10-27 12:18:53,755 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 48 out of 220
[2023-10-27 12:18:53,757 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-10-27 12:18:53,757 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-27 12:18:53,757 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 220
[2023-10-27 12:18:53,758 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-27 12:18:56,882 INFO  L130       PetriNetUnfolder]: 444/1028 cut-off events.
[2023-10-27 12:18:56,883 INFO  L131       PetriNetUnfolder]: For 1223/1223 co-relation queries the response was YES.
[2023-10-27 12:18:56,885 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-10-27 12:18:56,889 INFO  L137   encePairwiseOnDemand]: 205/220 looper letters, 203 selfloop transitions, 46 changer transitions 0/250 dead transitions.
[2023-10-27 12:18:56,901 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 250 transitions, 1918 flow
[2023-10-27 12:18:56,902 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. 
[2023-10-27 12:18:56,902 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 19 states.
[2023-10-27 12:18:56,904 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 1057 transitions.
[2023-10-27 12:18:56,905 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.2528708133971292
[2023-10-27 12:18:56,905 INFO  L72            ComplementDD]: Start complementDD. Operand 19 states and 1057 transitions.
[2023-10-27 12:18:56,905 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 19 states and 1057 transitions.
[2023-10-27 12:18:56,906 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-27 12:18:56,906 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 1057 transitions.
[2023-10-27 12:18:56,909 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-10-27 12:18:56,913 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-10-27 12:18:56,913 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-10-27 12:18:56,913 INFO  L175             Difference]: Start difference. First operand has 84 places, 82 transitions, 486 flow. Second operand 19 states and 1057 transitions.
[2023-10-27 12:18:56,914 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 250 transitions, 1918 flow
[2023-10-27 12:18:56,930 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 250 transitions, 1915 flow, removed 0 selfloop flow, removed 1 redundant places.
[2023-10-27 12:18:56,936 INFO  L231             Difference]: Finished difference. Result has 95 places, 122 transitions, 975 flow
[2023-10-27 12:18:56,936 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-10-27 12:18:56,936 INFO  L288   CegarLoopForPetriNet]: 66 programPoint places, 29 predicate places.
[2023-10-27 12:18:56,937 INFO  L495      AbstractCegarLoop]: Abstraction has has 95 places, 122 transitions, 975 flow
[2023-10-27 12:18:56,937 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-10-27 12:18:56,937 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:18:56,938 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-10-27 12:18:56,961 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0
[2023-10-27 12:18:57,158 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-10-27 12:18:57,158 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-10-27 12:18:57,159 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:18:57,159 INFO  L85        PathProgramCache]: Analyzing trace with hash 1574108551, now seen corresponding path program 1 times
[2023-10-27 12:18:57,159 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-27 12:18:57,159 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494829140]
[2023-10-27 12:18:57,159 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:18:57,159 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-27 12:18:57,255 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:18:59,270 INFO  L134       CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-27 12:18:59,271 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-27 12:18:59,271 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494829140]
[2023-10-27 12:18:59,271 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494829140] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-27 12:18:59,271 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1140825306]
[2023-10-27 12:18:59,271 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:18:59,271 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-27 12:18:59,271 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-27 12:18:59,294 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-10-27 12:18:59,347 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-10-27 12:18:59,486 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:18:59,488 INFO  L263         TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 60 conjunts are in the unsatisfiable core
[2023-10-27 12:18:59,491 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-27 12:18:59,786 INFO  L321             Elim1Store]: treesize reduction 36, result has 23.4 percent of original size
[2023-10-27 12:18:59,787 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-10-27 12:18:59,794 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:18:59,795 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-10-27 12:19:00,347 INFO  L321             Elim1Store]: treesize reduction 36, result has 23.4 percent of original size
[2023-10-27 12:19:00,348 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-10-27 12:19:00,358 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:19:00,359 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-10-27 12:19:00,587 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-10-27 12:19:00,663 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:19:00,664 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-10-27 12:19:00,748 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:19:00,749 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:19:00,750 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-10-27 12:19:00,854 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:19:00,855 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:19:00,856 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:19:00,857 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-10-27 12:19:01,081 INFO  L321             Elim1Store]: treesize reduction 11, result has 45.0 percent of original size
[2023-10-27 12:19:01,081 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-10-27 12:19:01,098 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-10-27 12:19:01,106 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-10-27 12:19:01,114 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-10-27 12:19:01,205 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:19:01,205 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-10-27 12:19:01,241 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:19:01,242 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-10-27 12:19:01,268 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:19:01,271 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-10-27 12:19:01,417 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:19:01,418 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:19:01,419 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:19:01,420 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:19:01,422 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:19:01,423 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:19:01,424 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:19:01,426 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-27 12:19:01,426 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-10-27 12:19:01,493 INFO  L134       CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-27 12:19:01,493 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-27 12:19:03,707 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-10-27 12:19:05,781 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-10-27 12:19:07,880 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-10-27 12:19:10,000 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-10-27 12:19:11,609 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-10-27 12:19:11,685 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-27 12:19:11,686 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-10-27 12:19:11,703 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-27 12:19:11,704 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-10-27 12:19:11,726 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-10-27 12:19:11,760 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-10-27 12:19:11,810 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-27 12:19:11,810 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-10-27 12:19:11,998 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-27 12:19:12,013 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-10-27 12:19:12,018 INFO  L173   IndexEqualityManager]: detected equality via solver
[2023-10-27 12:19:12,028 INFO  L321             Elim1Store]: treesize reduction 8, result has 33.3 percent of original size
[2023-10-27 12:19:12,030 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-10-27 12:19:12,039 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-10-27 12:19:12,063 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-10-27 12:19:12,101 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2023-10-27 12:19:12,101 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-10-27 12:19:12,113 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2023-10-27 12:19:12,114 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-10-27 12:19:12,823 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-10-27 12:19:12,919 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-10-27 12:19:12,922 INFO  L134       CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked.
[2023-10-27 12:19:12,926 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1140825306] provided 0 perfect and 2 imperfect interpolant sequences
[2023-10-27 12:19:12,926 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-10-27 12:19:12,926 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15, 16] total 47
[2023-10-27 12:19:12,926 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748713160]
[2023-10-27 12:19:12,926 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-10-27 12:19:12,928 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 49 states
[2023-10-27 12:19:12,928 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-27 12:19:12,928 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants.
[2023-10-27 12:19:12,929 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=215, Invalid=1519, Unknown=16, NotChecked=602, Total=2352
[2023-10-27 12:19:13,178 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 50 out of 220
[2023-10-27 12:19:13,180 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-10-27 12:19:13,180 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-27 12:19:13,180 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 220
[2023-10-27 12:19:13,180 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-27 12:19:40,670 WARN  L233               SmtUtils]: Spent 7.87s 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-10-27 12:19:47,055 INFO  L130       PetriNetUnfolder]: 466/1118 cut-off events.
[2023-10-27 12:19:47,056 INFO  L131       PetriNetUnfolder]: For 2119/2119 co-relation queries the response was YES.
[2023-10-27 12:19:47,058 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-10-27 12:19:47,063 INFO  L137   encePairwiseOnDemand]: 200/220 looper letters, 188 selfloop transitions, 56 changer transitions 0/245 dead transitions.
[2023-10-27 12:19:47,063 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 245 transitions, 2197 flow
[2023-10-27 12:19:47,064 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. 
[2023-10-27 12:19:47,064 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 25 states.
[2023-10-27 12:19:47,186 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 1402 transitions.
[2023-10-27 12:19:47,187 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.2549090909090909
[2023-10-27 12:19:47,187 INFO  L72            ComplementDD]: Start complementDD. Operand 25 states and 1402 transitions.
[2023-10-27 12:19:47,187 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 25 states and 1402 transitions.
[2023-10-27 12:19:47,187 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-27 12:19:47,187 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 25 states and 1402 transitions.
[2023-10-27 12:19:47,190 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-10-27 12:19:47,196 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-10-27 12:19:47,197 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-10-27 12:19:47,197 INFO  L175             Difference]: Start difference. First operand has 95 places, 122 transitions, 975 flow. Second operand 25 states and 1402 transitions.
[2023-10-27 12:19:47,197 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 245 transitions, 2197 flow
[2023-10-27 12:19:47,208 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 245 transitions, 2168 flow, removed 0 selfloop flow, removed 3 redundant places.
[2023-10-27 12:19:47,211 INFO  L231             Difference]: Finished difference. Result has 123 places, 163 transitions, 1496 flow
[2023-10-27 12:19:47,211 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-10-27 12:19:47,212 INFO  L288   CegarLoopForPetriNet]: 66 programPoint places, 57 predicate places.
[2023-10-27 12:19:47,213 INFO  L495      AbstractCegarLoop]: Abstraction has has 123 places, 163 transitions, 1496 flow
[2023-10-27 12:19:47,213 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-10-27 12:19:47,213 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:19:47,214 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-10-27 12:19:47,236 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0
[2023-10-27 12:19:47,418 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-10-27 12:19:47,418 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-10-27 12:19:47,418 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:19:47,418 INFO  L85        PathProgramCache]: Analyzing trace with hash -324057465, now seen corresponding path program 2 times
[2023-10-27 12:19:47,418 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-27 12:19:47,418 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250536718]
[2023-10-27 12:19:47,419 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:19:47,419 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-27 12:19:47,465 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:19:49,243 INFO  L134       CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-27 12:19:49,244 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-27 12:19:49,244 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250536718]
[2023-10-27 12:19:49,244 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250536718] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-27 12:19:49,244 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1453382909]
[2023-10-27 12:19:49,244 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2023-10-27 12:19:49,244 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-27 12:19:49,244 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-27 12:19:49,258 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-10-27 12:19:49,288 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-10-27 12:19:49,526 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2023-10-27 12:19:49,526 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2023-10-27 12:19:49,529 INFO  L263         TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 59 conjunts are in the unsatisfiable core
[2023-10-27 12:19:49,533 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-27 12:19:49,820 INFO  L321             Elim1Store]: treesize reduction 36, result has 23.4 percent of original size
[2023-10-27 12:19:49,820 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-10-27 12:19:49,827 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:19:49,828 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-10-27 12:19:50,446 INFO  L321             Elim1Store]: treesize reduction 36, result has 23.4 percent of original size
[2023-10-27 12:19:50,446 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-10-27 12:19:50,470 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:19:50,471 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-10-27 12:19:50,780 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-10-27 12:19:50,784 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-10-27 12:19:50,890 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-10-27 12:19:50,970 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:19:50,971 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-10-27 12:19:51,047 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:19:51,048 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:19:51,050 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-10-27 12:19:51,130 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:19:51,131 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:19:51,131 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:19:51,133 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-10-27 12:19:51,268 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:19:51,269 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:19:51,270 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:19:51,271 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:19:51,272 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:19:51,273 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:19:51,274 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:19:51,276 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-27 12:19:51,276 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-10-27 12:19:51,336 INFO  L134       CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-27 12:19:51,336 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-27 12:19:53,236 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (or (forall ((v_ArrVal_769 (Array Int Int))) (< (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_769) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) 1))) (forall ((v_ArrVal_768 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_768) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)))))) is different from false
[2023-10-27 12:19:53,289 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-10-27 12:19:53,332 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-10-27 12:19:53,337 INFO  L134       CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked.
[2023-10-27 12:19:53,337 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1453382909] provided 0 perfect and 2 imperfect interpolant sequences
[2023-10-27 12:19:53,337 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-10-27 12:19:53,337 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 15] total 44
[2023-10-27 12:19:53,338 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259183007]
[2023-10-27 12:19:53,338 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-10-27 12:19:53,339 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 46 states
[2023-10-27 12:19:53,339 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-27 12:19:53,339 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants.
[2023-10-27 12:19:53,340 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=1609, Unknown=7, NotChecked=252, Total=2070
[2023-10-27 12:19:53,558 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 50 out of 220
[2023-10-27 12:19:53,560 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-10-27 12:19:53,560 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-27 12:19:53,560 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 220
[2023-10-27 12:19:53,560 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-27 12:19:57,083 INFO  L130       PetriNetUnfolder]: 538/1273 cut-off events.
[2023-10-27 12:19:57,084 INFO  L131       PetriNetUnfolder]: For 4500/4500 co-relation queries the response was YES.
[2023-10-27 12:19:57,086 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-10-27 12:19:57,091 INFO  L137   encePairwiseOnDemand]: 200/220 looper letters, 282 selfloop transitions, 106 changer transitions 0/389 dead transitions.
[2023-10-27 12:19:57,091 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 389 transitions, 3888 flow
[2023-10-27 12:19:57,091 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. 
[2023-10-27 12:19:57,091 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 26 states.
[2023-10-27 12:19:57,103 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 1508 transitions.
[2023-10-27 12:19:57,104 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.2636363636363636
[2023-10-27 12:19:57,104 INFO  L72            ComplementDD]: Start complementDD. Operand 26 states and 1508 transitions.
[2023-10-27 12:19:57,104 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 26 states and 1508 transitions.
[2023-10-27 12:19:57,105 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-27 12:19:57,105 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 26 states and 1508 transitions.
[2023-10-27 12:19:57,107 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-10-27 12:19:57,120 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-10-27 12:19:57,121 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-10-27 12:19:57,121 INFO  L175             Difference]: Start difference. First operand has 123 places, 163 transitions, 1496 flow. Second operand 26 states and 1508 transitions.
[2023-10-27 12:19:57,121 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 389 transitions, 3888 flow
[2023-10-27 12:19:57,165 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 389 transitions, 3819 flow, removed 22 selfloop flow, removed 8 redundant places.
[2023-10-27 12:19:57,170 INFO  L231             Difference]: Finished difference. Result has 149 places, 234 transitions, 2434 flow
[2023-10-27 12:19:57,171 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-10-27 12:19:57,171 INFO  L288   CegarLoopForPetriNet]: 66 programPoint places, 83 predicate places.
[2023-10-27 12:19:57,171 INFO  L495      AbstractCegarLoop]: Abstraction has has 149 places, 234 transitions, 2434 flow
[2023-10-27 12:19:57,172 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-10-27 12:19:57,172 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:19:57,172 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-10-27 12:19:57,178 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0
[2023-10-27 12:19:57,376 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-10-27 12:19:57,377 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-10-27 12:19:57,377 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:19:57,377 INFO  L85        PathProgramCache]: Analyzing trace with hash 1088014417, now seen corresponding path program 3 times
[2023-10-27 12:19:57,378 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-27 12:19:57,378 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2470769]
[2023-10-27 12:19:57,378 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:19:57,378 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-27 12:19:57,439 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:19:58,703 INFO  L134       CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-27 12:19:58,703 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-27 12:19:58,703 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2470769]
[2023-10-27 12:19:58,703 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2470769] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-27 12:19:58,703 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [893173240]
[2023-10-27 12:19:58,703 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2023-10-27 12:19:58,704 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-27 12:19:58,704 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-27 12:19:58,714 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-10-27 12:19:58,749 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-10-27 12:19:58,982 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s)
[2023-10-27 12:19:58,982 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2023-10-27 12:19:58,984 INFO  L263         TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 45 conjunts are in the unsatisfiable core
[2023-10-27 12:19:58,988 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-27 12:19:59,176 INFO  L321             Elim1Store]: treesize reduction 36, result has 23.4 percent of original size
[2023-10-27 12:19:59,177 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-10-27 12:19:59,602 INFO  L321             Elim1Store]: treesize reduction 36, result has 23.4 percent of original size
[2023-10-27 12:19:59,602 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-10-27 12:19:59,612 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:19:59,614 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-10-27 12:19:59,801 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-10-27 12:19:59,805 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-10-27 12:19:59,884 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-10-27 12:19:59,946 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-10-27 12:20:00,010 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-10-27 12:20:00,098 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-10-27 12:20:00,195 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:20:00,196 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:20:00,198 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:20:00,199 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:20:00,201 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-27 12:20:00,201 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-10-27 12:20:00,208 INFO  L134       CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-27 12:20:00,209 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-27 12:20:03,745 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-10-27 12:20:03,765 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-10-27 12:20:03,859 INFO  L134       CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked.
[2023-10-27 12:20:03,859 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [893173240] provided 0 perfect and 2 imperfect interpolant sequences
[2023-10-27 12:20:03,860 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-10-27 12:20:03,860 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 15] total 40
[2023-10-27 12:20:03,860 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017106246]
[2023-10-27 12:20:03,860 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-10-27 12:20:03,860 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 42 states
[2023-10-27 12:20:03,860 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-27 12:20:03,860 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants.
[2023-10-27 12:20:03,861 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=1429, Unknown=12, NotChecked=78, Total=1722
[2023-10-27 12:20:04,938 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 50 out of 220
[2023-10-27 12:20:04,940 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-10-27 12:20:04,940 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-27 12:20:04,940 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 220
[2023-10-27 12:20:04,940 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-27 12:20:09,082 INFO  L130       PetriNetUnfolder]: 649/1538 cut-off events.
[2023-10-27 12:20:09,082 INFO  L131       PetriNetUnfolder]: For 9539/9539 co-relation queries the response was YES.
[2023-10-27 12:20:09,088 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 8146 conditions, 1538 events. 649/1538 cut-off events. For 9539/9539 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 8748 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-10-27 12:20:09,119 INFO  L137   encePairwiseOnDemand]: 201/220 looper letters, 291 selfloop transitions, 148 changer transitions 0/440 dead transitions.
[2023-10-27 12:20:09,119 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 440 transitions, 5114 flow
[2023-10-27 12:20:09,119 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. 
[2023-10-27 12:20:09,119 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 21 states.
[2023-10-27 12:20:09,125 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 1222 transitions.
[2023-10-27 12:20:09,127 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.2645021645021645
[2023-10-27 12:20:09,127 INFO  L72            ComplementDD]: Start complementDD. Operand 21 states and 1222 transitions.
[2023-10-27 12:20:09,128 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 21 states and 1222 transitions.
[2023-10-27 12:20:09,129 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-27 12:20:09,129 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 1222 transitions.
[2023-10-27 12:20:09,156 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-10-27 12:20:09,163 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-10-27 12:20:09,164 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-10-27 12:20:09,164 INFO  L175             Difference]: Start difference. First operand has 149 places, 234 transitions, 2434 flow. Second operand 21 states and 1222 transitions.
[2023-10-27 12:20:09,164 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 440 transitions, 5114 flow
[2023-10-27 12:20:09,237 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 440 transitions, 4973 flow, removed 29 selfloop flow, removed 11 redundant places.
[2023-10-27 12:20:09,262 INFO  L231             Difference]: Finished difference. Result has 171 places, 304 transitions, 3703 flow
[2023-10-27 12:20:09,263 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-10-27 12:20:09,264 INFO  L288   CegarLoopForPetriNet]: 66 programPoint places, 105 predicate places.
[2023-10-27 12:20:09,264 INFO  L495      AbstractCegarLoop]: Abstraction has has 171 places, 304 transitions, 3703 flow
[2023-10-27 12:20:09,264 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-10-27 12:20:09,264 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:20:09,264 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-10-27 12:20:09,274 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0
[2023-10-27 12:20:09,469 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-10-27 12:20:09,470 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-10-27 12:20:09,470 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:20:09,470 INFO  L85        PathProgramCache]: Analyzing trace with hash -189400963, now seen corresponding path program 4 times
[2023-10-27 12:20:09,470 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-27 12:20:09,470 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124004430]
[2023-10-27 12:20:09,470 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:20:09,471 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-27 12:20:09,570 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:20:12,180 INFO  L134       CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-27 12:20:12,181 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-27 12:20:12,181 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124004430]
[2023-10-27 12:20:12,181 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124004430] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-27 12:20:12,181 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1492136448]
[2023-10-27 12:20:12,181 INFO  L93    rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2023-10-27 12:20:12,181 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-27 12:20:12,181 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-27 12:20:12,185 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-10-27 12:20:12,224 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-10-27 12:20:12,772 INFO  L228   tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s)
[2023-10-27 12:20:12,772 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2023-10-27 12:20:12,785 INFO  L263         TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 65 conjunts are in the unsatisfiable core
[2023-10-27 12:20:12,789 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-27 12:20:13,069 INFO  L321             Elim1Store]: treesize reduction 36, result has 23.4 percent of original size
[2023-10-27 12:20:13,070 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-10-27 12:20:13,077 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:20:13,078 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-10-27 12:20:13,694 INFO  L321             Elim1Store]: treesize reduction 36, result has 23.4 percent of original size
[2023-10-27 12:20:13,695 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-10-27 12:20:13,705 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:20:13,705 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-10-27 12:20:14,008 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-10-27 12:20:14,100 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:20:14,100 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20
[2023-10-27 12:20:14,193 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:20:14,194 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:20:14,196 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-10-27 12:20:14,322 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:20:14,323 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:20:14,324 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:20:14,325 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-10-27 12:20:14,443 INFO  L321             Elim1Store]: treesize reduction 11, result has 45.0 percent of original size
[2023-10-27 12:20:14,443 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-10-27 12:20:14,450 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-27 12:20:14,450 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-10-27 12:20:14,461 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-10-27 12:20:14,470 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-10-27 12:20:14,594 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:20:14,595 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-10-27 12:20:14,628 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:20:14,629 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-10-27 12:20:14,658 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:20:14,659 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-10-27 12:20:14,760 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:20:14,762 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:20:14,763 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:20:14,764 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:20:14,765 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:20:14,766 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:20:14,767 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:20:14,770 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-27 12:20:14,775 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-10-27 12:20:14,822 INFO  L134       CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-27 12:20:14,822 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-27 12:20:20,000 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-10-27 12:20:31,046 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-27 12:20:31,047 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-10-27 12:20:31,063 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-27 12:20:31,063 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-10-27 12:20:31,074 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-10-27 12:20:31,150 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-10-27 12:20:31,188 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-27 12:20:31,188 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-10-27 12:20:31,327 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2023-10-27 12:20:31,328 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-10-27 12:20:31,335 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2023-10-27 12:20:31,335 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-10-27 12:20:31,343 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2023-10-27 12:20:31,344 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-10-27 12:20:32,741 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-10-27 12:20:32,833 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-10-27 12:20:32,837 INFO  L134       CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked.
[2023-10-27 12:20:32,837 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1492136448] provided 0 perfect and 2 imperfect interpolant sequences
[2023-10-27 12:20:32,837 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-10-27 12:20:32,837 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15, 16] total 47
[2023-10-27 12:20:32,837 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001988057]
[2023-10-27 12:20:32,837 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-10-27 12:20:32,838 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 49 states
[2023-10-27 12:20:32,838 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-27 12:20:32,838 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants.
[2023-10-27 12:20:32,839 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=229, Invalid=1813, Unknown=40, NotChecked=270, Total=2352
[2023-10-27 12:20:33,185 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 50 out of 220
[2023-10-27 12:20:33,187 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-10-27 12:20:33,187 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-27 12:20:33,187 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 220
[2023-10-27 12:20:33,187 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-27 12:20:46,381 WARN  L233               SmtUtils]: Spent 10.74s on a formula simplification. DAG size of input: 73 DAG size of output: 58 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)
[2023-10-27 12:20:48,724 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-10-27 12:20:50,740 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-10-27 12:20:52,754 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2023-10-27 12:20:57,315 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-10-27 12:20:59,323 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2023-10-27 12:21:01,330 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2023-10-27 12:21:03,337 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2023-10-27 12:21:05,204 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.78s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2023-10-27 12:21:07,221 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-10-27 12:21:11,533 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-10-27 12:21:13,541 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2023-10-27 12:21:15,555 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-10-27 12:21:17,836 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-10-27 12:21:19,843 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2023-10-27 12:21:21,848 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-10-27 12:21:23,855 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2023-10-27 12:21:25,960 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-10-27 12:21:28,177 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-10-27 12:21:30,193 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-10-27 12:21:32,427 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-10-27 12:21:34,518 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-10-27 12:21:36,523 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-10-27 12:21:38,840 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2023-10-27 12:21:40,853 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-10-27 12:21:42,868 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-10-27 12:21:44,872 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-10-27 12:21:46,880 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2023-10-27 12:21:49,252 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-10-27 12:21:50,706 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2023-10-27 12:21:52,770 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-10-27 12:21:54,776 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-10-27 12:21:58,099 INFO  L130       PetriNetUnfolder]: 676/1637 cut-off events.
[2023-10-27 12:21:58,099 INFO  L131       PetriNetUnfolder]: For 16397/16397 co-relation queries the response was YES.
[2023-10-27 12:21:58,104 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 9910 conditions, 1637 events. 676/1637 cut-off events. For 16397/16397 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 9582 event pairs, 165 based on Foata normal form. 16/1653 useless extension candidates. Maximal degree in co-relation 9852. Up to 1033 conditions per place. 
[2023-10-27 12:21:58,125 INFO  L137   encePairwiseOnDemand]: 196/220 looper letters, 288 selfloop transitions, 120 changer transitions 0/409 dead transitions.
[2023-10-27 12:21:58,134 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 409 transitions, 5299 flow
[2023-10-27 12:21:58,136 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. 
[2023-10-27 12:21:58,136 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 21 states.
[2023-10-27 12:21:58,138 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 1212 transitions.
[2023-10-27 12:21:58,139 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.2623376623376623
[2023-10-27 12:21:58,139 INFO  L72            ComplementDD]: Start complementDD. Operand 21 states and 1212 transitions.
[2023-10-27 12:21:58,139 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 21 states and 1212 transitions.
[2023-10-27 12:21:58,141 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-27 12:21:58,141 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 1212 transitions.
[2023-10-27 12:21:58,147 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 22 states, 21 states have (on average 57.714285714285715) internal successors, (1212), 21 states have internal predecessors, (1212), 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-10-27 12:21:58,151 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-10-27 12:21:58,166 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-10-27 12:21:58,166 INFO  L175             Difference]: Start difference. First operand has 171 places, 304 transitions, 3703 flow. Second operand 21 states and 1212 transitions.
[2023-10-27 12:21:58,166 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 409 transitions, 5299 flow
[2023-10-27 12:21:58,299 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 409 transitions, 5221 flow, removed 28 selfloop flow, removed 7 redundant places.
[2023-10-27 12:21:58,317 INFO  L231             Difference]: Finished difference. Result has 195 places, 339 transitions, 4559 flow
[2023-10-27 12:21:58,318 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=87, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=4559, PETRI_PLACES=195, PETRI_TRANSITIONS=339}
[2023-10-27 12:21:58,318 INFO  L288   CegarLoopForPetriNet]: 66 programPoint places, 129 predicate places.
[2023-10-27 12:21:58,318 INFO  L495      AbstractCegarLoop]: Abstraction has has 195 places, 339 transitions, 4559 flow
[2023-10-27 12:21:58,319 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-10-27 12:21:58,319 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:21:58,319 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-10-27 12:21:58,326 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0
[2023-10-27 12:21:58,523 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-10-27 12:21:58,524 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-10-27 12:21:58,524 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:21:58,524 INFO  L85        PathProgramCache]: Analyzing trace with hash 439464892, now seen corresponding path program 2 times
[2023-10-27 12:21:58,524 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-27 12:21:58,524 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063162936]
[2023-10-27 12:21:58,524 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:21:58,525 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-27 12:21:58,569 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:21:59,777 INFO  L134       CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-27 12:21:59,777 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-27 12:21:59,778 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063162936]
[2023-10-27 12:21:59,778 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063162936] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-27 12:21:59,778 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1850987029]
[2023-10-27 12:21:59,778 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2023-10-27 12:21:59,778 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-27 12:21:59,778 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-27 12:21:59,783 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-10-27 12:21:59,829 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-10-27 12:22:00,058 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2023-10-27 12:22:00,059 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2023-10-27 12:22:00,061 INFO  L263         TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 45 conjunts are in the unsatisfiable core
[2023-10-27 12:22:00,064 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-27 12:22:00,245 INFO  L321             Elim1Store]: treesize reduction 36, result has 23.4 percent of original size
[2023-10-27 12:22:00,245 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-10-27 12:22:00,688 INFO  L321             Elim1Store]: treesize reduction 36, result has 23.4 percent of original size
[2023-10-27 12:22:00,688 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-10-27 12:22:00,695 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:22:00,696 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-10-27 12:22:00,921 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-10-27 12:22:00,926 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-10-27 12:22:00,990 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-10-27 12:22:01,036 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-10-27 12:22:01,091 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-10-27 12:22:01,157 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-10-27 12:22:01,228 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:22:01,229 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:22:01,230 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:22:01,232 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:22:01,234 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-27 12:22:01,234 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-10-27 12:22:01,253 INFO  L134       CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-27 12:22:01,253 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-27 12:22:04,669 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-10-27 12:22:04,692 WARN  L837   $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1303 (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_1303) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)))) is different from false
[2023-10-27 12:22:04,713 WARN  L837   $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~mem8#1.base_48| Int)) (or (forall ((v_ArrVal_1303 (Array Int Int))) (not (= |c_ULTIMATE.start_main_~#is~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem8#1.base_48| v_ArrVal_1303) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)))) (not (<= |v_ULTIMATE.start_main_#t~mem8#1.base_48| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))))) is different from false
[2023-10-27 12:22:04,714 INFO  L134       CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked.
[2023-10-27 12:22:04,715 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1850987029] provided 0 perfect and 2 imperfect interpolant sequences
[2023-10-27 12:22:04,715 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-10-27 12:22:04,715 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 15] total 40
[2023-10-27 12:22:04,715 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958032003]
[2023-10-27 12:22:04,715 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-10-27 12:22:04,715 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 42 states
[2023-10-27 12:22:04,715 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-27 12:22:04,716 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants.
[2023-10-27 12:22:04,716 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=1363, Unknown=7, NotChecked=154, Total=1722
[2023-10-27 12:22:04,728 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 48 out of 220
[2023-10-27 12:22:04,729 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 339 transitions, 4559 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-10-27 12:22:04,729 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-27 12:22:04,729 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 220
[2023-10-27 12:22:04,729 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-27 12:22:08,121 INFO  L130       PetriNetUnfolder]: 708/1709 cut-off events.
[2023-10-27 12:22:08,121 INFO  L131       PetriNetUnfolder]: For 21602/21602 co-relation queries the response was YES.
[2023-10-27 12:22:08,132 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 11306 conditions, 1709 events. 708/1709 cut-off events. For 21602/21602 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 10186 event pairs, 61 based on Foata normal form. 10/1719 useless extension candidates. Maximal degree in co-relation 11237. Up to 630 conditions per place. 
[2023-10-27 12:22:08,149 INFO  L137   encePairwiseOnDemand]: 206/220 looper letters, 374 selfloop transitions, 113 changer transitions 0/488 dead transitions.
[2023-10-27 12:22:08,149 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 488 transitions, 7309 flow
[2023-10-27 12:22:08,149 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. 
[2023-10-27 12:22:08,150 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 16 states.
[2023-10-27 12:22:08,157 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 891 transitions.
[2023-10-27 12:22:08,173 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.253125
[2023-10-27 12:22:08,174 INFO  L72            ComplementDD]: Start complementDD. Operand 16 states and 891 transitions.
[2023-10-27 12:22:08,174 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 16 states and 891 transitions.
[2023-10-27 12:22:08,174 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-27 12:22:08,174 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 891 transitions.
[2023-10-27 12:22:08,176 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-10-27 12:22:08,178 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-10-27 12:22:08,178 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-10-27 12:22:08,179 INFO  L175             Difference]: Start difference. First operand has 195 places, 339 transitions, 4559 flow. Second operand 16 states and 891 transitions.
[2023-10-27 12:22:08,179 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 210 places, 488 transitions, 7309 flow
[2023-10-27 12:22:08,498 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 488 transitions, 7207 flow, removed 31 selfloop flow, removed 8 redundant places.
[2023-10-27 12:22:08,506 INFO  L231             Difference]: Finished difference. Result has 207 places, 371 transitions, 5210 flow
[2023-10-27 12:22:08,506 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=220, PETRI_DIFFERENCE_MINUEND_FLOW=4480, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=339, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=81, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=231, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=5210, PETRI_PLACES=207, PETRI_TRANSITIONS=371}
[2023-10-27 12:22:08,507 INFO  L288   CegarLoopForPetriNet]: 66 programPoint places, 141 predicate places.
[2023-10-27 12:22:08,507 INFO  L495      AbstractCegarLoop]: Abstraction has has 207 places, 371 transitions, 5210 flow
[2023-10-27 12:22:08,507 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-10-27 12:22:08,508 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:22:08,508 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-10-27 12:22:08,519 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0
[2023-10-27 12:22:08,712 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-10-27 12:22:08,713 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-10-27 12:22:08,714 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:22:08,714 INFO  L85        PathProgramCache]: Analyzing trace with hash -1739286685, now seen corresponding path program 5 times
[2023-10-27 12:22:08,715 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-27 12:22:08,715 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228556323]
[2023-10-27 12:22:08,715 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:22:08,716 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-27 12:22:08,778 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:22:12,274 INFO  L134       CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-27 12:22:12,274 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-27 12:22:12,274 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228556323]
[2023-10-27 12:22:12,274 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228556323] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-27 12:22:12,274 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1814831394]
[2023-10-27 12:22:12,275 INFO  L93    rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1
[2023-10-27 12:22:12,275 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-27 12:22:12,275 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-27 12:22:12,276 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-10-27 12:22:12,299 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-10-27 12:22:12,628 INFO  L228   tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2023-10-27 12:22:12,629 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2023-10-27 12:22:12,631 INFO  L263         TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 64 conjunts are in the unsatisfiable core
[2023-10-27 12:22:12,639 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-27 12:22:12,897 INFO  L321             Elim1Store]: treesize reduction 36, result has 23.4 percent of original size
[2023-10-27 12:22:12,897 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-10-27 12:22:12,907 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:22:12,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 18 treesize of output 20
[2023-10-27 12:22:13,428 INFO  L321             Elim1Store]: treesize reduction 36, result has 23.4 percent of original size
[2023-10-27 12:22:13,428 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-10-27 12:22:13,438 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:22:13,440 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-10-27 12:22:13,799 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-10-27 12:22:13,914 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:22:13,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 21 treesize of output 20
[2023-10-27 12:22:14,022 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:22:14,023 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:22:14,023 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-10-27 12:22:14,110 INFO  L321             Elim1Store]: treesize reduction 11, result has 45.0 percent of original size
[2023-10-27 12:22:14,111 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 32 treesize of output 34
[2023-10-27 12:22:14,124 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 10
[2023-10-27 12:22:14,128 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-10-27 12:22:14,138 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-10-27 12:22:14,239 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:22:14,240 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 32 treesize of output 30
[2023-10-27 12:22:14,273 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:22:14,274 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 32 treesize of output 30
[2023-10-27 12:22:14,295 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:22:14,296 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 32 treesize of output 30
[2023-10-27 12:22:14,379 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:22:14,380 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:22:14,381 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:22:14,382 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-10-27 12:22:14,486 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:22:14,487 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:22:14,488 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:22:14,490 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:22:14,492 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:22:14,496 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:22:14,497 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:22:14,499 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-27 12:22:14,499 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-10-27 12:22:14,571 INFO  L134       CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-27 12:22:14,571 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-27 12:22:14,911 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 3))) (and (forall ((v_ArrVal_1497 Int) (v_ArrVal_1493 (Array Int Int))) (= (select (select (let ((.cse0 (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1493))) (store .cse2 c_threadThread1of1ForFork0_~p~0.base (store (select .cse2 c_threadThread1of1ForFork0_~p~0.base) .cse3 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_1497))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) 0)) (forall ((v_ArrVal_1497 Int) (v_ArrVal_1493 (Array Int Int))) (= (select (select (let ((.cse4 (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1493))) (store .cse5 c_threadThread1of1ForFork0_~p~0.base (store (select .cse5 c_threadThread1of1ForFork0_~p~0.base) .cse3 0))))) (store .cse4 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse4 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_1497))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)) (forall ((v_ArrVal_1497 Int) (v_ArrVal_1493 (Array Int Int))) (= (select (select (let ((.cse6 (let ((.cse7 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1493))) (store .cse7 c_threadThread1of1ForFork0_~p~0.base (store (select .cse7 c_threadThread1of1ForFork0_~p~0.base) .cse3 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_1497))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)) (forall ((v_ArrVal_1497 Int) (v_ArrVal_1493 (Array Int Int))) (= (select (select (let ((.cse8 (let ((.cse9 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1493))) (store .cse9 c_threadThread1of1ForFork0_~p~0.base (store (select .cse9 c_threadThread1of1ForFork0_~p~0.base) .cse3 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_1497))) c_threadThread1of1ForFork0_~p~0.base) .cse3) 0)))) is different from false
[2023-10-27 12:22:15,011 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)) (.cse5 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (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_1497 Int) (v_ArrVal_1493 (Array Int Int))) (= (select (select (let ((.cse1 (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1493))) (store .cse4 c_threadThread1of1ForFork0_~p~0.base (store (select .cse4 c_threadThread1of1ForFork0_~p~0.base) .cse5 0))))) (store .cse1 .cse2 (store (select .cse1 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_49| .cse3) v_ArrVal_1497))) 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_1497 Int) (v_ArrVal_1493 (Array Int Int))) (= (select (select (let ((.cse6 (let ((.cse7 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1493))) (store .cse7 c_threadThread1of1ForFork0_~p~0.base (store (select .cse7 c_threadThread1of1ForFork0_~p~0.base) .cse5 0))))) (store .cse6 .cse2 (store (select .cse6 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_49| .cse3) v_ArrVal_1497))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) 0)))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_49| Int)) (or (forall ((v_ArrVal_1497 Int) (v_ArrVal_1493 (Array Int Int))) (= (select (select (let ((.cse8 (let ((.cse9 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1493))) (store .cse9 c_threadThread1of1ForFork0_~p~0.base (store (select .cse9 c_threadThread1of1ForFork0_~p~0.base) .cse5 0))))) (store .cse8 .cse2 (store (select .cse8 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_49| .cse3) v_ArrVal_1497))) c_threadThread1of1ForFork0_~p~0.base) .cse5) 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_1497 Int) (v_ArrVal_1493 (Array Int Int))) (= (select (select (let ((.cse10 (let ((.cse11 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1493))) (store .cse11 c_threadThread1of1ForFork0_~p~0.base (store (select .cse11 c_threadThread1of1ForFork0_~p~0.base) .cse5 0))))) (store .cse10 .cse2 (store (select .cse10 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_49| .cse3) v_ArrVal_1497))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)))))) is different from false
[2023-10-27 12:22:15,059 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse13 (+ c_threadThread1of1ForFork0_~p~0.offset 2))) (let ((.cse6 (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)) (.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) .cse13 0)))) (and (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_49| Int)) (or (forall ((v_ArrVal_1497 Int) (v_ArrVal_1493 (Array Int Int))) (= (select (select (let ((.cse0 (let ((.cse3 (store .cse5 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1493))) (store .cse3 c_threadThread1of1ForFork0_~p~0.base (store (select .cse3 c_threadThread1of1ForFork0_~p~0.base) .cse4 0))))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_49| .cse2) v_ArrVal_1497))) c_threadThread1of1ForFork0_~p~0.base) .cse4) 0)) (not (<= .cse6 |v_ULTIMATE.start_main_#t~mem8#1.offset_49|)))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_49| Int)) (or (not (<= .cse6 |v_ULTIMATE.start_main_#t~mem8#1.offset_49|)) (forall ((v_ArrVal_1497 Int) (v_ArrVal_1493 (Array Int Int))) (= (select (select (let ((.cse7 (let ((.cse8 (store .cse5 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1493))) (store .cse8 c_threadThread1of1ForFork0_~p~0.base (store (select .cse8 c_threadThread1of1ForFork0_~p~0.base) .cse4 0))))) (store .cse7 .cse1 (store (select .cse7 .cse1) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_49| .cse2) v_ArrVal_1497))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_49| Int)) (or (not (<= .cse6 |v_ULTIMATE.start_main_#t~mem8#1.offset_49|)) (forall ((v_ArrVal_1497 Int) (v_ArrVal_1493 (Array Int Int))) (= (select (select (let ((.cse9 (let ((.cse10 (store .cse5 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1493))) (store .cse10 c_threadThread1of1ForFork0_~p~0.base (store (select .cse10 c_threadThread1of1ForFork0_~p~0.base) .cse4 0))))) (store .cse9 .cse1 (store (select .cse9 .cse1) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_49| .cse2) v_ArrVal_1497))) 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 (<= .cse6 |v_ULTIMATE.start_main_#t~mem8#1.offset_49|)) (forall ((v_ArrVal_1497 Int) (v_ArrVal_1493 (Array Int Int))) (= (select (select (let ((.cse11 (let ((.cse12 (store .cse5 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1493))) (store .cse12 c_threadThread1of1ForFork0_~p~0.base (store (select .cse12 c_threadThread1of1ForFork0_~p~0.base) .cse4 0))))) (store .cse11 .cse1 (store (select .cse11 .cse1) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_49| .cse2) v_ArrVal_1497))) c_threadThread1of1ForFork0_~p~0.base) .cse13) 0))))))) is different from false
[2023-10-27 12:22:15,125 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse12 (+ c_threadThread1of1ForFork0_~p~0.offset 1)) (.cse7 (+ c_threadThread1of1ForFork0_~p~0.offset 2))) (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)) (.cse5 (+ c_threadThread1of1ForFork0_~p~0.offset 3)) (.cse6 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse12 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_1497 Int) (v_ArrVal_1493 (Array Int Int))) (= 0 (select (select (let ((.cse1 (let ((.cse4 (store .cse6 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1493))) (store .cse4 c_threadThread1of1ForFork0_~p~0.base (store (select .cse4 c_threadThread1of1ForFork0_~p~0.base) .cse5 0))))) (store .cse1 .cse2 (store (select .cse1 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_49| .cse3) v_ArrVal_1497))) c_threadThread1of1ForFork0_~p~0.base) .cse7))))) (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_1497 Int) (v_ArrVal_1493 (Array Int Int))) (= (select (select (let ((.cse8 (let ((.cse9 (store .cse6 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1493))) (store .cse9 c_threadThread1of1ForFork0_~p~0.base (store (select .cse9 c_threadThread1of1ForFork0_~p~0.base) .cse5 0))))) (store .cse8 .cse2 (store (select .cse8 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_49| .cse3) v_ArrVal_1497))) c_threadThread1of1ForFork0_~p~0.base) .cse5) 0)))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_49| Int)) (or (forall ((v_ArrVal_1497 Int) (v_ArrVal_1493 (Array Int Int))) (= (select (select (let ((.cse10 (let ((.cse11 (store .cse6 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1493))) (store .cse11 c_threadThread1of1ForFork0_~p~0.base (store (select .cse11 c_threadThread1of1ForFork0_~p~0.base) .cse5 0))))) (store .cse10 .cse2 (store (select .cse10 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_49| .cse3) v_ArrVal_1497))) c_threadThread1of1ForFork0_~p~0.base) .cse12) 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_1497 Int) (v_ArrVal_1493 (Array Int Int))) (= (select (select (let ((.cse13 (let ((.cse14 (store .cse6 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1493))) (store .cse14 c_threadThread1of1ForFork0_~p~0.base (store (select .cse14 c_threadThread1of1ForFork0_~p~0.base) .cse5 0))))) (store .cse13 .cse2 (store (select .cse13 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_49| .cse3) v_ArrVal_1497))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0))))))) is different from false
[2023-10-27 12:22:15,174 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-27 12:22:15,174 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 3 case distinctions, treesize of input 133 treesize of output 90
[2023-10-27 12:22:15,214 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-27 12:22:15,215 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 758 treesize of output 722
[2023-10-27 12:22:15,225 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 768 treesize of output 732
[2023-10-27 12:22:15,553 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-27 12:22:15,554 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 68 treesize of output 54
[2023-10-27 12:22:15,590 INFO  L321             Elim1Store]: treesize reduction 28, result has 3.4 percent of original size
[2023-10-27 12:22:15,590 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 133 treesize of output 1
[2023-10-27 12:22:15,607 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-27 12:22:15,607 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 133 treesize of output 90
[2023-10-27 12:22:15,611 INFO  L173   IndexEqualityManager]: detected equality via solver
[2023-10-27 12:22:15,637 INFO  L321             Elim1Store]: treesize reduction 8, result has 33.3 percent of original size
[2023-10-27 12:22:15,638 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 226 treesize of output 214
[2023-10-27 12:22:15,647 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 94
[2023-10-27 12:22:15,685 INFO  L321             Elim1Store]: treesize reduction 28, result has 3.4 percent of original size
[2023-10-27 12:22:15,686 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 131 treesize of output 1
[2023-10-27 12:22:20,597 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_ULTIMATE.start_main_#t~mem12#1.base_42| Int) (v_ArrVal_1481 (Array Int Int)) (v_ArrVal_1480 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1480))) (or (not (<= |v_ULTIMATE.start_main_#t~mem12#1.base_42| (select (select .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (forall ((v_ArrVal_1483 (Array Int Int))) (not (= (select (select (store .cse0 |v_ULTIMATE.start_main_#t~mem12#1.base_42| v_ArrVal_1483) |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|)))) (forall ((v_ArrVal_1482 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1481))) (< (select (select .cse1 |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) (+ (select (select (store .cse1 |v_ULTIMATE.start_main_#t~mem12#1.base_42| v_ArrVal_1482) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) 1)))))))) is different from false
[2023-10-27 12:22:20,671 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_1480 (Array Int Int))) (not (= |c_ULTIMATE.start_main_~#is~0#1.base| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1480) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)))) (forall ((|v_ULTIMATE.start_main_#t~mem12#1.base_42| Int) (v_ArrVal_1481 (Array Int Int)) (v_ArrVal_1480 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1480))) (or (not (<= |v_ULTIMATE.start_main_#t~mem12#1.base_42| (select (select .cse1 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (forall ((v_ArrVal_1483 (Array Int Int))) (not (= (select (select .cse1 |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) (select (select (store .cse1 |v_ULTIMATE.start_main_#t~mem12#1.base_42| v_ArrVal_1483) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)))) (forall ((v_ArrVal_1482 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1481))) (< (select (select .cse2 |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) (+ 1 (select (select (store .cse2 |v_ULTIMATE.start_main_#t~mem12#1.base_42| v_ArrVal_1482) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)))))))))) is different from false
[2023-10-27 12:22:20,673 INFO  L134       CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked.
[2023-10-27 12:22:20,674 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1814831394] provided 0 perfect and 2 imperfect interpolant sequences
[2023-10-27 12:22:20,674 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-10-27 12:22:20,674 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15, 16] total 47
[2023-10-27 12:22:20,674 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632790982]
[2023-10-27 12:22:20,674 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-10-27 12:22:20,674 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 49 states
[2023-10-27 12:22:20,674 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-27 12:22:20,675 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants.
[2023-10-27 12:22:20,675 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=1631, Unknown=10, NotChecked=522, Total=2352
[2023-10-27 12:22:20,697 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 50 out of 220
[2023-10-27 12:22:20,698 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 371 transitions, 5210 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-10-27 12:22:20,698 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-27 12:22:20,698 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 220
[2023-10-27 12:22:20,699 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-27 12:22:42,205 INFO  L130       PetriNetUnfolder]: 810/2068 cut-off events.
[2023-10-27 12:22:42,205 INFO  L131       PetriNetUnfolder]: For 31524/31524 co-relation queries the response was YES.
[2023-10-27 12:22:42,212 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 14120 conditions, 2068 events. 810/2068 cut-off events. For 31524/31524 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 13573 event pairs, 53 based on Foata normal form. 20/2088 useless extension candidates. Maximal degree in co-relation 14046. Up to 712 conditions per place. 
[2023-10-27 12:22:42,220 INFO  L137   encePairwiseOnDemand]: 195/220 looper letters, 364 selfloop transitions, 239 changer transitions 0/604 dead transitions.
[2023-10-27 12:22:42,220 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 604 transitions, 8966 flow
[2023-10-27 12:22:42,221 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. 
[2023-10-27 12:22:42,221 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 33 states.
[2023-10-27 12:22:42,228 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 1890 transitions.
[2023-10-27 12:22:42,229 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.2603305785123967
[2023-10-27 12:22:42,229 INFO  L72            ComplementDD]: Start complementDD. Operand 33 states and 1890 transitions.
[2023-10-27 12:22:42,229 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 33 states and 1890 transitions.
[2023-10-27 12:22:42,248 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-27 12:22:42,248 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 33 states and 1890 transitions.
[2023-10-27 12:22:42,250 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 34 states, 33 states have (on average 57.27272727272727) internal successors, (1890), 33 states have internal predecessors, (1890), 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-10-27 12:22:42,255 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 34 states, 34 states have (on average 220.0) internal successors, (7480), 34 states have internal predecessors, (7480), 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-10-27 12:22:42,255 INFO  L81            ComplementDD]: Finished complementDD. Result  has 34 states, 34 states have (on average 220.0) internal successors, (7480), 34 states have internal predecessors, (7480), 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-10-27 12:22:42,255 INFO  L175             Difference]: Start difference. First operand has 207 places, 371 transitions, 5210 flow. Second operand 33 states and 1890 transitions.
[2023-10-27 12:22:42,255 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 239 places, 604 transitions, 8966 flow
[2023-10-27 12:22:42,531 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 229 places, 604 transitions, 8695 flow, removed 40 selfloop flow, removed 10 redundant places.
[2023-10-27 12:22:42,540 INFO  L231             Difference]: Finished difference. Result has 241 places, 504 transitions, 7698 flow
[2023-10-27 12:22:42,540 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=220, PETRI_DIFFERENCE_MINUEND_FLOW=4988, PETRI_DIFFERENCE_MINUEND_PLACES=197, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=371, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=132, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=204, PETRI_DIFFERENCE_SUBTRAHEND_STATES=33, PETRI_FLOW=7698, PETRI_PLACES=241, PETRI_TRANSITIONS=504}
[2023-10-27 12:22:42,541 INFO  L288   CegarLoopForPetriNet]: 66 programPoint places, 175 predicate places.
[2023-10-27 12:22:42,541 INFO  L495      AbstractCegarLoop]: Abstraction has has 241 places, 504 transitions, 7698 flow
[2023-10-27 12:22:42,542 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-10-27 12:22:42,542 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:22:42,542 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-10-27 12:22:42,549 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0
[2023-10-27 12:22:42,748 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-10-27 12:22:42,748 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-10-27 12:22:42,749 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:22:42,749 INFO  L85        PathProgramCache]: Analyzing trace with hash -841088035, now seen corresponding path program 6 times
[2023-10-27 12:22:42,749 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-27 12:22:42,750 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479066894]
[2023-10-27 12:22:42,750 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:22:42,750 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-27 12:22:42,824 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:22:44,268 INFO  L134       CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-27 12:22:44,268 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-27 12:22:44,268 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479066894]
[2023-10-27 12:22:44,268 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479066894] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-27 12:22:44,268 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1789853150]
[2023-10-27 12:22:44,269 INFO  L93    rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE
[2023-10-27 12:22:44,269 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-27 12:22:44,269 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-27 12:22:44,270 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-10-27 12:22:44,295 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-10-27 12:22:44,450 INFO  L228   tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s)
[2023-10-27 12:22:44,450 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2023-10-27 12:22:44,452 INFO  L263         TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 49 conjunts are in the unsatisfiable core
[2023-10-27 12:22:44,455 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-27 12:22:44,628 INFO  L321             Elim1Store]: treesize reduction 36, result has 23.4 percent of original size
[2023-10-27 12:22:44,628 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-10-27 12:22:44,977 INFO  L321             Elim1Store]: treesize reduction 36, result has 23.4 percent of original size
[2023-10-27 12:22:44,978 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-10-27 12:22:45,002 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:22:45,003 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-10-27 12:22:45,328 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-10-27 12:22:45,419 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-10-27 12:22:45,518 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-10-27 12:22:45,638 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-10-27 12:22:45,644 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-10-27 12:22:45,660 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:22:45,661 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 32 treesize of output 30
[2023-10-27 12:22:45,773 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:22:45,773 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 32 treesize of output 30
[2023-10-27 12:22:45,801 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:22:45,803 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 32 treesize of output 30
[2023-10-27 12:22:45,832 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-10-27 12:22:45,937 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:22:45,937 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-10-27 12:22:46,076 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:22:46,078 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:22:46,079 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:22:46,080 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:22:46,082 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-27 12:22:46,082 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-10-27 12:22:46,104 INFO  L134       CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-27 12:22:46,104 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-27 12:22:46,322 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_1676 (Array Int Int)) (v_ArrVal_1677 Int)) (= (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1676))) (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_1676 (Array Int Int)) (v_ArrVal_1677 Int)) (= (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1676))) (store .cse2 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse2 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_1677))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 3)) 0)) (forall ((v_ArrVal_1676 (Array Int Int)) (v_ArrVal_1677 Int)) (= (select (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1676))) (store .cse3 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse3 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_1677))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) 0)) (forall ((v_ArrVal_1676 (Array Int Int)) (v_ArrVal_1677 Int)) (= (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1676))) (store .cse4 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse4 |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-10-27 12:22:46,350 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse3 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (let ((.cse1 (+ |c_ULTIMATE.start_main_#t~mem8#1.offset| (* |c_ULTIMATE.start_main_~i~1#1| 4))) (.cse2 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse3 0)))) (and (forall ((v_ArrVal_1676 (Array Int Int)) (v_ArrVal_1677 Int)) (= (select (select (let ((.cse0 (store .cse2 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1676))) (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) .cse3) 0)) (forall ((v_ArrVal_1676 (Array Int Int)) (v_ArrVal_1677 Int)) (= (select (select (let ((.cse4 (store .cse2 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1676))) (store .cse4 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse4 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_1677))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)) (forall ((v_ArrVal_1676 (Array Int Int)) (v_ArrVal_1677 Int)) (= (select (select (let ((.cse5 (store .cse2 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1676))) (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) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) 0)) (forall ((v_ArrVal_1676 (Array Int Int)) (v_ArrVal_1677 Int)) (= (select (select (let ((.cse6 (store .cse2 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1676))) (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) c_threadThread1of1ForFork0_~p~0.offset) 0))))) is different from false
[2023-10-27 12:22:46,376 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 3))) (and (forall ((v_ArrVal_1676 (Array Int Int)) (v_ArrVal_1673 (Array Int Int)) (v_ArrVal_1677 Int)) (= (select (select (let ((.cse0 (store (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1673))) (store .cse2 c_threadThread1of1ForFork0_~p~0.base (store (select .cse2 c_threadThread1of1ForFork0_~p~0.base) .cse3 0))) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1676))) (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_1676 (Array Int Int)) (v_ArrVal_1673 (Array Int Int)) (v_ArrVal_1677 Int)) (= 0 (select (select (let ((.cse4 (store (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1673))) (store .cse5 c_threadThread1of1ForFork0_~p~0.base (store (select .cse5 c_threadThread1of1ForFork0_~p~0.base) .cse3 0))) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1676))) (store .cse4 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse4 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_1677))) c_threadThread1of1ForFork0_~p~0.base) .cse3))) (forall ((v_ArrVal_1676 (Array Int Int)) (v_ArrVal_1673 (Array Int Int)) (v_ArrVal_1677 Int)) (= (select (select (let ((.cse6 (store (let ((.cse7 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1673))) (store .cse7 c_threadThread1of1ForFork0_~p~0.base (store (select .cse7 c_threadThread1of1ForFork0_~p~0.base) .cse3 0))) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1676))) (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) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) 0)) (forall ((v_ArrVal_1676 (Array Int Int)) (v_ArrVal_1673 (Array Int Int)) (v_ArrVal_1677 Int)) (= (select (select (let ((.cse8 (store (let ((.cse9 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1673))) (store .cse9 c_threadThread1of1ForFork0_~p~0.base (store (select .cse9 c_threadThread1of1ForFork0_~p~0.base) .cse3 0))) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1676))) (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) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)))) is different from false
[2023-10-27 12:22:46,485 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)) (.cse5 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (and (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_51| Int)) (or (not (<= .cse0 |v_ULTIMATE.start_main_#t~mem8#1.offset_51|)) (forall ((v_ArrVal_1676 (Array Int Int)) (v_ArrVal_1673 (Array Int Int)) (v_ArrVal_1677 Int)) (= (select (select (let ((.cse1 (store (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1673))) (store .cse4 c_threadThread1of1ForFork0_~p~0.base (store (select .cse4 c_threadThread1of1ForFork0_~p~0.base) .cse5 0))) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1676))) (store .cse1 .cse2 (store (select .cse1 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_51| .cse3) v_ArrVal_1677))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_51| Int)) (or (forall ((v_ArrVal_1676 (Array Int Int)) (v_ArrVal_1673 (Array Int Int)) (v_ArrVal_1677 Int)) (= (select (select (let ((.cse6 (store (let ((.cse7 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1673))) (store .cse7 c_threadThread1of1ForFork0_~p~0.base (store (select .cse7 c_threadThread1of1ForFork0_~p~0.base) .cse5 0))) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1676))) (store .cse6 .cse2 (store (select .cse6 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_51| .cse3) v_ArrVal_1677))) c_threadThread1of1ForFork0_~p~0.base) .cse5) 0)) (not (<= .cse0 |v_ULTIMATE.start_main_#t~mem8#1.offset_51|)))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_51| Int)) (or (not (<= .cse0 |v_ULTIMATE.start_main_#t~mem8#1.offset_51|)) (forall ((v_ArrVal_1676 (Array Int Int)) (v_ArrVal_1673 (Array Int Int)) (v_ArrVal_1677 Int)) (= (select (select (let ((.cse8 (store (let ((.cse9 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1673))) (store .cse9 c_threadThread1of1ForFork0_~p~0.base (store (select .cse9 c_threadThread1of1ForFork0_~p~0.base) .cse5 0))) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1676))) (store .cse8 .cse2 (store (select .cse8 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_51| .cse3) v_ArrVal_1677))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_51| Int)) (or (not (<= .cse0 |v_ULTIMATE.start_main_#t~mem8#1.offset_51|)) (forall ((v_ArrVal_1676 (Array Int Int)) (v_ArrVal_1673 (Array Int Int)) (v_ArrVal_1677 Int)) (= (select (select (let ((.cse10 (store (let ((.cse11 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1673))) (store .cse11 c_threadThread1of1ForFork0_~p~0.base (store (select .cse11 c_threadThread1of1ForFork0_~p~0.base) .cse5 0))) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1676))) (store .cse10 .cse2 (store (select .cse10 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_51| .cse3) v_ArrVal_1677))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) 0)))))) is different from false
[2023-10-27 12:22:51,095 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-27 12:22:51,096 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 3 case distinctions, treesize of input 139 treesize of output 96
[2023-10-27 12:22:51,126 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-27 12:22:51,126 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 8902 treesize of output 8724
[2023-10-27 12:22:51,442 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 10010 treesize of output 9250
[2023-10-27 12:22:51,483 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 9752 treesize of output 9656
[2023-10-27 12:22:54,382 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-27 12:22:54,383 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 50
[2023-10-27 12:22:54,404 INFO  L321             Elim1Store]: treesize reduction 28, result has 3.4 percent of original size
[2023-10-27 12:22:54,404 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 139 treesize of output 1
[2023-10-27 12:22:54,418 INFO  L321             Elim1Store]: treesize reduction 28, result has 3.4 percent of original size
[2023-10-27 12:22:54,418 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 137 treesize of output 1
[2023-10-27 12:22:54,426 INFO  L321             Elim1Store]: treesize reduction 28, result has 3.4 percent of original size
[2023-10-27 12:22:54,427 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 139 treesize of output 1
[2023-10-27 12:22:58,981 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-10-27 12:22:58,985 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-10-27 12:22:59,054 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1662 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1662) |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_1662 (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_1662) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))))) is different from false
[2023-10-27 12:22:59,114 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_ULTIMATE.start_main_#t~mem8#1.base_52| Int)) (or (not (<= |v_ULTIMATE.start_main_#t~mem8#1.base_52| .cse0)) (forall ((v_ArrVal_1662 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem8#1.base_52| v_ArrVal_1662) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) |c_ULTIMATE.start_main_~#is~0#1.base|))))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.base_52| Int)) (or (not (<= |v_ULTIMATE.start_main_#t~mem8#1.base_52| .cse0)) (forall ((v_ArrVal_1662 (Array Int Int))) (not (= |c_ULTIMATE.start_main_~#is~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem8#1.base_52| v_ArrVal_1662) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)))))))) is different from false
[2023-10-27 12:22:59,116 INFO  L134       CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked.
[2023-10-27 12:22:59,116 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1789853150] provided 0 perfect and 2 imperfect interpolant sequences
[2023-10-27 12:22:59,116 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-10-27 12:22:59,116 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15, 17] total 46
[2023-10-27 12:22:59,116 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934364288]
[2023-10-27 12:22:59,116 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-10-27 12:22:59,117 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 48 states
[2023-10-27 12:22:59,117 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-27 12:22:59,117 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants.
[2023-10-27 12:22:59,117 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=1537, Unknown=18, NotChecked=510, Total=2256
[2023-10-27 12:22:59,330 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 50 out of 220
[2023-10-27 12:22:59,332 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 241 places, 504 transitions, 7698 flow. Second operand  has 48 states, 48 states have (on average 52.333333333333336) internal successors, (2512), 48 states have internal predecessors, (2512), 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-10-27 12:22:59,332 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-27 12:22:59,332 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 220
[2023-10-27 12:22:59,332 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-27 12:23:05,028 INFO  L130       PetriNetUnfolder]: 815/2101 cut-off events.
[2023-10-27 12:23:05,029 INFO  L131       PetriNetUnfolder]: For 37618/37618 co-relation queries the response was YES.
[2023-10-27 12:23:05,036 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 15373 conditions, 2101 events. 815/2101 cut-off events. For 37618/37618 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 13924 event pairs, 161 based on Foata normal form. 32/2133 useless extension candidates. Maximal degree in co-relation 15288. Up to 1127 conditions per place. 
[2023-10-27 12:23:05,060 INFO  L137   encePairwiseOnDemand]: 196/220 looper letters, 428 selfloop transitions, 183 changer transitions 0/612 dead transitions.
[2023-10-27 12:23:05,060 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 263 places, 612 transitions, 9834 flow
[2023-10-27 12:23:05,061 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. 
[2023-10-27 12:23:05,061 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 23 states.
[2023-10-27 12:23:05,062 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 1334 transitions.
[2023-10-27 12:23:05,077 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.2636363636363636
[2023-10-27 12:23:05,078 INFO  L72            ComplementDD]: Start complementDD. Operand 23 states and 1334 transitions.
[2023-10-27 12:23:05,078 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 23 states and 1334 transitions.
[2023-10-27 12:23:05,078 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-27 12:23:05,078 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 23 states and 1334 transitions.
[2023-10-27 12:23:05,079 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 24 states, 23 states have (on average 58.0) internal successors, (1334), 23 states have internal predecessors, (1334), 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-10-27 12:23:05,082 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-10-27 12:23:05,083 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-10-27 12:23:05,083 INFO  L175             Difference]: Start difference. First operand has 241 places, 504 transitions, 7698 flow. Second operand 23 states and 1334 transitions.
[2023-10-27 12:23:05,083 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 263 places, 612 transitions, 9834 flow
[2023-10-27 12:23:05,411 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 254 places, 612 transitions, 9434 flow, removed 165 selfloop flow, removed 9 redundant places.
[2023-10-27 12:23:05,420 INFO  L231             Difference]: Finished difference. Result has 260 places, 525 transitions, 8337 flow
[2023-10-27 12:23:05,420 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=220, PETRI_DIFFERENCE_MINUEND_FLOW=7227, PETRI_DIFFERENCE_MINUEND_PLACES=232, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=499, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=158, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=323, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=8337, PETRI_PLACES=260, PETRI_TRANSITIONS=525}
[2023-10-27 12:23:05,421 INFO  L288   CegarLoopForPetriNet]: 66 programPoint places, 194 predicate places.
[2023-10-27 12:23:05,421 INFO  L495      AbstractCegarLoop]: Abstraction has has 260 places, 525 transitions, 8337 flow
[2023-10-27 12:23:05,422 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 48 states, 48 states have (on average 52.333333333333336) internal successors, (2512), 48 states have internal predecessors, (2512), 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-10-27 12:23:05,422 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:23:05,422 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-10-27 12:23:05,428 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0
[2023-10-27 12:23:05,626 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13
[2023-10-27 12:23:05,627 INFO  L420      AbstractCegarLoop]: === Iteration 15 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2023-10-27 12:23:05,627 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:23:05,628 INFO  L85        PathProgramCache]: Analyzing trace with hash 75581497, now seen corresponding path program 7 times
[2023-10-27 12:23:05,632 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-27 12:23:05,632 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202958693]
[2023-10-27 12:23:05,633 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:23:05,633 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-27 12:23:05,692 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:23:07,495 INFO  L134       CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-27 12:23:07,495 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-27 12:23:07,495 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202958693]
[2023-10-27 12:23:07,495 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202958693] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-27 12:23:07,496 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1609297558]
[2023-10-27 12:23:07,496 INFO  L93    rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY
[2023-10-27 12:23:07,496 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-27 12:23:07,496 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-27 12:23:07,497 INFO  L229       MonitoredProcess]: Starting monitored process 10 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-10-27 12:23:07,522 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process
[2023-10-27 12:23:07,671 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:23:07,673 INFO  L263         TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 57 conjunts are in the unsatisfiable core
[2023-10-27 12:23:07,676 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-27 12:23:07,888 INFO  L321             Elim1Store]: treesize reduction 36, result has 23.4 percent of original size
[2023-10-27 12:23:07,888 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-10-27 12:23:07,899 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:23:07,899 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-10-27 12:23:08,363 INFO  L321             Elim1Store]: treesize reduction 36, result has 23.4 percent of original size
[2023-10-27 12:23:08,363 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-10-27 12:23:08,373 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:23:08,373 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-10-27 12:23:08,579 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-10-27 12:23:08,584 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-10-27 12:23:08,630 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-10-27 12:23:08,688 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:23:08,688 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-10-27 12:23:08,743 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:23:08,744 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:23:08,744 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-10-27 12:23:08,816 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:23:08,817 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:23:08,818 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:23:08,819 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-10-27 12:23:08,891 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:23:08,892 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-10-27 12:23:08,921 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:23:08,921 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-10-27 12:23:08,937 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:23:08,937 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-10-27 12:23:09,048 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:23:09,050 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:23:09,052 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:23:09,054 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:23:09,055 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:23:09,055 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:23:09,056 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:23:09,058 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-27 12:23:09,058 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-10-27 12:23:09,108 INFO  L134       CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-27 12:23:09,108 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-27 12:23:09,308 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_1857 (Array Int Int)) (v_ArrVal_1859 Int)) (= (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1857))) (store .cse0 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse0 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_1859))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) 0)) (forall ((v_ArrVal_1857 (Array Int Int)) (v_ArrVal_1859 Int)) (= (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1857))) (store .cse2 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse2 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_1859))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)) (forall ((v_ArrVal_1857 (Array Int Int)) (v_ArrVal_1859 Int)) (= (select (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1857))) (store .cse3 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse3 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_1859))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 3)) 0)) (forall ((v_ArrVal_1857 (Array Int Int)) (v_ArrVal_1859 Int)) (= (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1857))) (store .cse4 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse4 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_1859))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)))) is different from false
[2023-10-27 12:23:12,721 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-27 12:23:12,721 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 71 treesize of output 64
[2023-10-27 12:23:12,730 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-27 12:23:12,730 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 340 treesize of output 324
[2023-10-27 12:23:12,736 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 342 treesize of output 326
[2023-10-27 12:23:12,751 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 190 treesize of output 182
[2023-10-27 12:23:12,885 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-27 12:23:12,886 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 110 treesize of output 92
[2023-10-27 12:23:12,922 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-27 12:23:12,923 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 73 treesize of output 66
[2023-10-27 12:23:12,927 INFO  L173   IndexEqualityManager]: detected equality via solver
[2023-10-27 12:23:12,938 INFO  L321             Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2023-10-27 12:23:12,938 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 116 treesize of output 106
[2023-10-27 12:23:12,947 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 53 treesize of output 49
[2023-10-27 12:23:12,954 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 134 treesize of output 108
[2023-10-27 12:23:12,989 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-27 12:23:12,989 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 73 treesize of output 66
[2023-10-27 12:23:12,993 INFO  L173   IndexEqualityManager]: detected equality via solver
[2023-10-27 12:23:13,006 INFO  L321             Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2023-10-27 12:23:13,006 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 116 treesize of output 106
[2023-10-27 12:23:13,014 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 53 treesize of output 49
[2023-10-27 12:23:13,022 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 134 treesize of output 108
[2023-10-27 12:23:13,056 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-27 12:23:13,056 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 73 treesize of output 66
[2023-10-27 12:23:13,060 INFO  L173   IndexEqualityManager]: detected equality via solver
[2023-10-27 12:23:13,071 INFO  L321             Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2023-10-27 12:23:13,071 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 116 treesize of output 106
[2023-10-27 12:23:13,078 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 53 treesize of output 49
[2023-10-27 12:23:13,085 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 134 treesize of output 108
[2023-10-27 12:23:14,335 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_1843 (Array Int Int))) (not (= |c_ULTIMATE.start_main_~#is~0#1.base| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1843) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)))) (forall ((v_ArrVal_1844 (Array Int Int)) (v_ArrVal_1843 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem12#1.base_46| Int)) (let ((.cse2 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1843))) (or (forall ((v_ArrVal_1845 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1844))) (< (select (select .cse1 |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) (+ (select (select (store .cse1 |v_ULTIMATE.start_main_#t~mem12#1.base_46| v_ArrVal_1845) |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_46| (select (select .cse2 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (forall ((v_ArrVal_1846 (Array Int Int))) (not (= (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_46| v_ArrVal_1846) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))))))))) is different from false
[2023-10-27 12:23:14,338 INFO  L134       CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked.
[2023-10-27 12:23:14,338 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1609297558] provided 0 perfect and 2 imperfect interpolant sequences
[2023-10-27 12:23:14,338 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-10-27 12:23:14,338 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15, 16] total 47
[2023-10-27 12:23:14,338 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577598762]
[2023-10-27 12:23:14,338 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-10-27 12:23:14,338 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 49 states
[2023-10-27 12:23:14,338 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-27 12:23:14,339 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants.
[2023-10-27 12:23:14,339 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=209, Invalid=1914, Unknown=47, NotChecked=182, Total=2352
[2023-10-27 12:23:16,021 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 50 out of 220
[2023-10-27 12:23:16,022 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 260 places, 525 transitions, 8337 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-10-27 12:23:16,022 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-27 12:23:16,022 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 220
[2023-10-27 12:23:16,022 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-27 12:23:22,438 INFO  L130       PetriNetUnfolder]: 1009/2523 cut-off events.
[2023-10-27 12:23:22,439 INFO  L131       PetriNetUnfolder]: For 44794/44794 co-relation queries the response was YES.
[2023-10-27 12:23:22,448 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 18704 conditions, 2523 events. 1009/2523 cut-off events. For 44794/44794 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 17171 event pairs, 158 based on Foata normal form. 25/2548 useless extension candidates. Maximal degree in co-relation 18616. Up to 980 conditions per place. 
[2023-10-27 12:23:22,473 INFO  L137   encePairwiseOnDemand]: 197/220 looper letters, 548 selfloop transitions, 255 changer transitions 0/804 dead transitions.
[2023-10-27 12:23:22,478 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 282 places, 804 transitions, 13307 flow
[2023-10-27 12:23:22,478 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. 
[2023-10-27 12:23:22,478 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 23 states.
[2023-10-27 12:23:22,481 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 1373 transitions.
[2023-10-27 12:23:22,487 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.27134387351778655
[2023-10-27 12:23:22,488 INFO  L72            ComplementDD]: Start complementDD. Operand 23 states and 1373 transitions.
[2023-10-27 12:23:22,488 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 23 states and 1373 transitions.
[2023-10-27 12:23:22,488 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-27 12:23:22,488 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 23 states and 1373 transitions.
[2023-10-27 12:23:22,490 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 24 states, 23 states have (on average 59.69565217391305) internal successors, (1373), 23 states have internal predecessors, (1373), 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-10-27 12:23:22,510 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-10-27 12:23:22,510 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-10-27 12:23:22,510 INFO  L175             Difference]: Start difference. First operand has 260 places, 525 transitions, 8337 flow. Second operand 23 states and 1373 transitions.
[2023-10-27 12:23:22,511 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 282 places, 804 transitions, 13307 flow
[2023-10-27 12:23:22,958 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 269 places, 804 transitions, 13139 flow, removed 35 selfloop flow, removed 13 redundant places.
[2023-10-27 12:23:22,971 INFO  L231             Difference]: Finished difference. Result has 281 places, 622 transitions, 10914 flow
[2023-10-27 12:23:22,971 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=220, PETRI_DIFFERENCE_MINUEND_FLOW=8216, PETRI_DIFFERENCE_MINUEND_PLACES=247, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=525, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=169, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=304, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=10914, PETRI_PLACES=281, PETRI_TRANSITIONS=622}
[2023-10-27 12:23:22,972 INFO  L288   CegarLoopForPetriNet]: 66 programPoint places, 215 predicate places.
[2023-10-27 12:23:22,972 INFO  L495      AbstractCegarLoop]: Abstraction has has 281 places, 622 transitions, 10914 flow
[2023-10-27 12:23:22,973 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-10-27 12:23:22,973 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:23:22,973 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-10-27 12:23:22,980 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0
[2023-10-27 12:23:23,178 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,10 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-27 12:23:23,178 INFO  L420      AbstractCegarLoop]: === Iteration 16 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2023-10-27 12:23:23,178 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:23:23,179 INFO  L85        PathProgramCache]: Analyzing trace with hash 1167116781, now seen corresponding path program 8 times
[2023-10-27 12:23:23,179 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-27 12:23:23,179 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162355869]
[2023-10-27 12:23:23,179 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:23:23,180 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-27 12:23:23,252 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:23:25,393 INFO  L134       CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-27 12:23:25,393 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-27 12:23:25,393 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162355869]
[2023-10-27 12:23:25,393 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162355869] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-27 12:23:25,393 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2088097046]
[2023-10-27 12:23:25,393 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2023-10-27 12:23:25,393 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-27 12:23:25,393 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-27 12:23:25,398 INFO  L229       MonitoredProcess]: Starting monitored process 11 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-10-27 12:23:25,436 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process
[2023-10-27 12:23:25,636 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2023-10-27 12:23:25,636 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2023-10-27 12:23:25,638 INFO  L263         TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 52 conjunts are in the unsatisfiable core
[2023-10-27 12:23:25,642 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-27 12:23:25,808 INFO  L321             Elim1Store]: treesize reduction 36, result has 23.4 percent of original size
[2023-10-27 12:23:25,808 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-10-27 12:23:26,167 INFO  L321             Elim1Store]: treesize reduction 36, result has 23.4 percent of original size
[2023-10-27 12:23:26,167 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-10-27 12:23:26,177 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:23:26,178 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-10-27 12:23:26,356 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-10-27 12:23:26,478 INFO  L321             Elim1Store]: treesize reduction 11, result has 45.0 percent of original size
[2023-10-27 12:23:26,479 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 14 treesize of output 20
[2023-10-27 12:23:26,483 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 5 treesize of output 3
[2023-10-27 12:23:26,488 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-10-27 12:23:26,493 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-10-27 12:23:26,558 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:23:26,558 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-10-27 12:23:26,574 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-10-27 12:23:26,641 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:23:26,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 23 treesize of output 23
[2023-10-27 12:23:26,654 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-10-27 12:23:26,736 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:23:26,737 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 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-10-27 12:23:26,760 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-10-27 12:23:26,975 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:23:26,976 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:23:26,978 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:23:26,979 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:23:26,980 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:23:26,981 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 70
[2023-10-27 12:23:27,114 INFO  L134       CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-27 12:23:27,114 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-27 12:23:29,230 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_#t~mem8#1.offset| (* |c_ULTIMATE.start_main_~i~1#1| 4))) (.cse3 (+ c_threadThread1of1ForFork0_~p~0.offset 3)) (.cse1 (+ 3 |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse7 (+ c_threadThread1of1ForFork0_~p~0.offset 2))) (and (forall ((v_ArrVal_2036 Int) (v_ArrVal_2033 (Array Int Int))) (let ((.cse0 (let ((.cse4 (let ((.cse5 (let ((.cse6 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2033))) (store .cse6 c_threadThread1of1ForFork0_~p~0.base (store (select .cse6 c_threadThread1of1ForFork0_~p~0.base) .cse7 0))))) (store .cse5 |c_ULTIMATE.start_main_~#is~0#1.base| (store (select .cse5 |c_ULTIMATE.start_main_~#is~0#1.base|) .cse1 v_ArrVal_2036))))) (store .cse4 c_threadThread1of1ForFork0_~p~0.base (store (select .cse4 c_threadThread1of1ForFork0_~p~0.base) .cse3 0))))) (or (not (= (select (select .cse0 |c_ULTIMATE.start_main_~#is~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_2040 Int)) (= (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse0 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse2 v_ArrVal_2040)) c_threadThread1of1ForFork0_~p~0.base) .cse3) 0))))) (forall ((v_ArrVal_2036 Int) (v_ArrVal_2033 (Array Int Int))) (let ((.cse8 (let ((.cse9 (let ((.cse10 (let ((.cse11 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2033))) (store .cse11 c_threadThread1of1ForFork0_~p~0.base (store (select .cse11 c_threadThread1of1ForFork0_~p~0.base) .cse7 0))))) (store .cse10 |c_ULTIMATE.start_main_~#is~0#1.base| (store (select .cse10 |c_ULTIMATE.start_main_~#is~0#1.base|) .cse1 v_ArrVal_2036))))) (store .cse9 c_threadThread1of1ForFork0_~p~0.base (store (select .cse9 c_threadThread1of1ForFork0_~p~0.base) .cse3 0))))) (or (forall ((v_ArrVal_2040 Int)) (= (select (select (store .cse8 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse8 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse2 v_ArrVal_2040)) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)) (not (= (select (select .cse8 |c_ULTIMATE.start_main_~#is~0#1.base|) .cse1) 0))))) (forall ((v_ArrVal_2036 Int) (v_ArrVal_2033 (Array Int Int))) (let ((.cse12 (let ((.cse13 (let ((.cse14 (let ((.cse15 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2033))) (store .cse15 c_threadThread1of1ForFork0_~p~0.base (store (select .cse15 c_threadThread1of1ForFork0_~p~0.base) .cse7 0))))) (store .cse14 |c_ULTIMATE.start_main_~#is~0#1.base| (store (select .cse14 |c_ULTIMATE.start_main_~#is~0#1.base|) .cse1 v_ArrVal_2036))))) (store .cse13 c_threadThread1of1ForFork0_~p~0.base (store (select .cse13 c_threadThread1of1ForFork0_~p~0.base) .cse3 0))))) (or (forall ((v_ArrVal_2040 Int)) (= (select (select (store .cse12 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse12 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse2 v_ArrVal_2040)) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)) (not (= (select (select .cse12 |c_ULTIMATE.start_main_~#is~0#1.base|) .cse1) 0))))) (forall ((v_ArrVal_2036 Int) (v_ArrVal_2033 (Array Int Int))) (let ((.cse16 (let ((.cse17 (let ((.cse18 (let ((.cse19 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2033))) (store .cse19 c_threadThread1of1ForFork0_~p~0.base (store (select .cse19 c_threadThread1of1ForFork0_~p~0.base) .cse7 0))))) (store .cse18 |c_ULTIMATE.start_main_~#is~0#1.base| (store (select .cse18 |c_ULTIMATE.start_main_~#is~0#1.base|) .cse1 v_ArrVal_2036))))) (store .cse17 c_threadThread1of1ForFork0_~p~0.base (store (select .cse17 c_threadThread1of1ForFork0_~p~0.base) .cse3 0))))) (or (forall ((v_ArrVal_2040 Int)) (= (select (select (store .cse16 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse16 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse2 v_ArrVal_2040)) c_threadThread1of1ForFork0_~p~0.base) .cse7) 0)) (not (= (select (select .cse16 |c_ULTIMATE.start_main_~#is~0#1.base|) .cse1) 0))))))) is different from false
[2023-10-27 12:23:29,357 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse14 (+ c_threadThread1of1ForFork0_~p~0.offset 1))) (let ((.cse1 (+ |c_ULTIMATE.start_main_#t~mem8#1.offset| (* |c_ULTIMATE.start_main_~i~1#1| 4))) (.cse4 (+ c_threadThread1of1ForFork0_~p~0.offset 3)) (.cse2 (+ 3 |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse7 (+ c_threadThread1of1ForFork0_~p~0.offset 2)) (.cse8 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse14 0)))) (and (forall ((v_ArrVal_2036 Int) (v_ArrVal_2033 (Array Int Int))) (let ((.cse0 (let ((.cse3 (let ((.cse5 (let ((.cse6 (store .cse8 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2033))) (store .cse6 c_threadThread1of1ForFork0_~p~0.base (store (select .cse6 c_threadThread1of1ForFork0_~p~0.base) .cse7 0))))) (store .cse5 |c_ULTIMATE.start_main_~#is~0#1.base| (store (select .cse5 |c_ULTIMATE.start_main_~#is~0#1.base|) .cse2 v_ArrVal_2036))))) (store .cse3 c_threadThread1of1ForFork0_~p~0.base (store (select .cse3 c_threadThread1of1ForFork0_~p~0.base) .cse4 0))))) (or (forall ((v_ArrVal_2040 Int)) (= (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse0 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_2040)) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)) (not (= (select (select .cse0 |c_ULTIMATE.start_main_~#is~0#1.base|) .cse2) 0))))) (forall ((v_ArrVal_2036 Int) (v_ArrVal_2033 (Array Int Int))) (let ((.cse9 (let ((.cse10 (let ((.cse11 (let ((.cse12 (store .cse8 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2033))) (store .cse12 c_threadThread1of1ForFork0_~p~0.base (store (select .cse12 c_threadThread1of1ForFork0_~p~0.base) .cse7 0))))) (store .cse11 |c_ULTIMATE.start_main_~#is~0#1.base| (store (select .cse11 |c_ULTIMATE.start_main_~#is~0#1.base|) .cse2 v_ArrVal_2036))))) (store .cse10 c_threadThread1of1ForFork0_~p~0.base (store (select .cse10 c_threadThread1of1ForFork0_~p~0.base) .cse4 0))))) (or (forall ((v_ArrVal_2040 Int)) (= (select (select (store .cse9 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse9 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_2040)) c_threadThread1of1ForFork0_~p~0.base) .cse4) 0)) (not (= (select (select .cse9 |c_ULTIMATE.start_main_~#is~0#1.base|) .cse2) 0))))) (forall ((v_ArrVal_2036 Int) (v_ArrVal_2033 (Array Int Int))) (let ((.cse13 (let ((.cse15 (let ((.cse16 (let ((.cse17 (store .cse8 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2033))) (store .cse17 c_threadThread1of1ForFork0_~p~0.base (store (select .cse17 c_threadThread1of1ForFork0_~p~0.base) .cse7 0))))) (store .cse16 |c_ULTIMATE.start_main_~#is~0#1.base| (store (select .cse16 |c_ULTIMATE.start_main_~#is~0#1.base|) .cse2 v_ArrVal_2036))))) (store .cse15 c_threadThread1of1ForFork0_~p~0.base (store (select .cse15 c_threadThread1of1ForFork0_~p~0.base) .cse4 0))))) (or (forall ((v_ArrVal_2040 Int)) (= (select (select (store .cse13 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse13 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_2040)) c_threadThread1of1ForFork0_~p~0.base) .cse14) 0)) (not (= (select (select .cse13 |c_ULTIMATE.start_main_~#is~0#1.base|) .cse2) 0))))) (forall ((v_ArrVal_2036 Int) (v_ArrVal_2033 (Array Int Int))) (let ((.cse18 (let ((.cse19 (let ((.cse20 (let ((.cse21 (store .cse8 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2033))) (store .cse21 c_threadThread1of1ForFork0_~p~0.base (store (select .cse21 c_threadThread1of1ForFork0_~p~0.base) .cse7 0))))) (store .cse20 |c_ULTIMATE.start_main_~#is~0#1.base| (store (select .cse20 |c_ULTIMATE.start_main_~#is~0#1.base|) .cse2 v_ArrVal_2036))))) (store .cse19 c_threadThread1of1ForFork0_~p~0.base (store (select .cse19 c_threadThread1of1ForFork0_~p~0.base) .cse4 0))))) (or (forall ((v_ArrVal_2040 Int)) (= (select (select (store .cse18 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse18 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_2040)) c_threadThread1of1ForFork0_~p~0.base) .cse7) 0)) (not (= (select (select .cse18 |c_ULTIMATE.start_main_~#is~0#1.base|) .cse2) 0)))))))) is different from false
[2023-10-27 12:23:29,534 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))) (.cse2 (+ c_threadThread1of1ForFork0_~p~0.offset 3)) (.cse3 (+ 3 |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse7 (+ c_threadThread1of1ForFork0_~p~0.offset 2)) (.cse9 (+ c_threadThread1of1ForFork0_~p~0.offset 1))) (and (forall ((v_ArrVal_2036 Int) (v_ArrVal_2033 (Array Int Int)) (v_ArrVal_2030 (Array Int Int))) (let ((.cse0 (let ((.cse4 (let ((.cse5 (let ((.cse6 (store (let ((.cse8 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2030))) (store .cse8 c_threadThread1of1ForFork0_~p~0.base (store (select .cse8 c_threadThread1of1ForFork0_~p~0.base) .cse9 0))) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2033))) (store .cse6 c_threadThread1of1ForFork0_~p~0.base (store (select .cse6 c_threadThread1of1ForFork0_~p~0.base) .cse7 0))))) (store .cse5 |c_ULTIMATE.start_main_~#is~0#1.base| (store (select .cse5 |c_ULTIMATE.start_main_~#is~0#1.base|) .cse3 v_ArrVal_2036))))) (store .cse4 c_threadThread1of1ForFork0_~p~0.base (store (select .cse4 c_threadThread1of1ForFork0_~p~0.base) .cse2 0))))) (or (forall ((v_ArrVal_2040 Int)) (= (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse0 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_2040)) c_threadThread1of1ForFork0_~p~0.base) .cse2) 0)) (not (= (select (select .cse0 |c_ULTIMATE.start_main_~#is~0#1.base|) .cse3) 0))))) (forall ((v_ArrVal_2036 Int) (v_ArrVal_2033 (Array Int Int)) (v_ArrVal_2030 (Array Int Int))) (let ((.cse10 (let ((.cse11 (let ((.cse12 (let ((.cse13 (store (let ((.cse14 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2030))) (store .cse14 c_threadThread1of1ForFork0_~p~0.base (store (select .cse14 c_threadThread1of1ForFork0_~p~0.base) .cse9 0))) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2033))) (store .cse13 c_threadThread1of1ForFork0_~p~0.base (store (select .cse13 c_threadThread1of1ForFork0_~p~0.base) .cse7 0))))) (store .cse12 |c_ULTIMATE.start_main_~#is~0#1.base| (store (select .cse12 |c_ULTIMATE.start_main_~#is~0#1.base|) .cse3 v_ArrVal_2036))))) (store .cse11 c_threadThread1of1ForFork0_~p~0.base (store (select .cse11 c_threadThread1of1ForFork0_~p~0.base) .cse2 0))))) (or (forall ((v_ArrVal_2040 Int)) (= (select (select (store .cse10 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse10 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_2040)) c_threadThread1of1ForFork0_~p~0.base) .cse7) 0)) (not (= (select (select .cse10 |c_ULTIMATE.start_main_~#is~0#1.base|) .cse3) 0))))) (forall ((v_ArrVal_2036 Int) (v_ArrVal_2033 (Array Int Int)) (v_ArrVal_2030 (Array Int Int))) (let ((.cse15 (let ((.cse16 (let ((.cse17 (let ((.cse18 (store (let ((.cse19 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2030))) (store .cse19 c_threadThread1of1ForFork0_~p~0.base (store (select .cse19 c_threadThread1of1ForFork0_~p~0.base) .cse9 0))) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2033))) (store .cse18 c_threadThread1of1ForFork0_~p~0.base (store (select .cse18 c_threadThread1of1ForFork0_~p~0.base) .cse7 0))))) (store .cse17 |c_ULTIMATE.start_main_~#is~0#1.base| (store (select .cse17 |c_ULTIMATE.start_main_~#is~0#1.base|) .cse3 v_ArrVal_2036))))) (store .cse16 c_threadThread1of1ForFork0_~p~0.base (store (select .cse16 c_threadThread1of1ForFork0_~p~0.base) .cse2 0))))) (or (forall ((v_ArrVal_2040 Int)) (= (select (select (store .cse15 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse15 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_2040)) c_threadThread1of1ForFork0_~p~0.base) .cse9) 0)) (not (= (select (select .cse15 |c_ULTIMATE.start_main_~#is~0#1.base|) .cse3) 0))))) (forall ((v_ArrVal_2036 Int) (v_ArrVal_2033 (Array Int Int)) (v_ArrVal_2030 (Array Int Int))) (let ((.cse20 (let ((.cse21 (let ((.cse22 (let ((.cse23 (store (let ((.cse24 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2030))) (store .cse24 c_threadThread1of1ForFork0_~p~0.base (store (select .cse24 c_threadThread1of1ForFork0_~p~0.base) .cse9 0))) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2033))) (store .cse23 c_threadThread1of1ForFork0_~p~0.base (store (select .cse23 c_threadThread1of1ForFork0_~p~0.base) .cse7 0))))) (store .cse22 |c_ULTIMATE.start_main_~#is~0#1.base| (store (select .cse22 |c_ULTIMATE.start_main_~#is~0#1.base|) .cse3 v_ArrVal_2036))))) (store .cse21 c_threadThread1of1ForFork0_~p~0.base (store (select .cse21 c_threadThread1of1ForFork0_~p~0.base) .cse2 0))))) (or (forall ((v_ArrVal_2040 Int)) (= (select (select (store .cse20 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse20 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_2040)) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)) (not (= (select (select .cse20 |c_ULTIMATE.start_main_~#is~0#1.base|) .cse3) 0))))))) is different from false
[2023-10-27 12:23:29,721 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)) (.cse6 (+ c_threadThread1of1ForFork0_~p~0.offset 3)) (.cse1 (+ 3 |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse4 (+ c_threadThread1of1ForFork0_~p~0.offset 2)) (.cse10 (+ c_threadThread1of1ForFork0_~p~0.offset 1)) (.cse11 (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_55| Int)) (or (forall ((v_ArrVal_2036 Int) (v_ArrVal_2033 (Array Int Int)) (v_ArrVal_2030 (Array Int Int))) (let ((.cse0 (let ((.cse5 (let ((.cse7 (let ((.cse8 (store (let ((.cse9 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2030))) (store .cse9 c_threadThread1of1ForFork0_~p~0.base (store (select .cse9 c_threadThread1of1ForFork0_~p~0.base) .cse10 0))) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2033))) (store .cse8 c_threadThread1of1ForFork0_~p~0.base (store (select .cse8 c_threadThread1of1ForFork0_~p~0.base) .cse4 0))))) (store .cse7 |c_ULTIMATE.start_main_~#is~0#1.base| (store (select .cse7 |c_ULTIMATE.start_main_~#is~0#1.base|) .cse1 v_ArrVal_2036))))) (store .cse5 c_threadThread1of1ForFork0_~p~0.base (store (select .cse5 c_threadThread1of1ForFork0_~p~0.base) .cse6 0))))) (or (not (= (select (select .cse0 |c_ULTIMATE.start_main_~#is~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_2040 Int)) (= (select (select (store .cse0 .cse2 (store (select .cse0 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_55| .cse3) v_ArrVal_2040)) c_threadThread1of1ForFork0_~p~0.base) .cse4) 0))))) (not (<= .cse11 |v_ULTIMATE.start_main_#t~mem8#1.offset_55|)))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_55| Int)) (or (forall ((v_ArrVal_2036 Int) (v_ArrVal_2033 (Array Int Int)) (v_ArrVal_2030 (Array Int Int))) (let ((.cse12 (let ((.cse13 (let ((.cse14 (let ((.cse15 (store (let ((.cse16 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2030))) (store .cse16 c_threadThread1of1ForFork0_~p~0.base (store (select .cse16 c_threadThread1of1ForFork0_~p~0.base) .cse10 0))) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2033))) (store .cse15 c_threadThread1of1ForFork0_~p~0.base (store (select .cse15 c_threadThread1of1ForFork0_~p~0.base) .cse4 0))))) (store .cse14 |c_ULTIMATE.start_main_~#is~0#1.base| (store (select .cse14 |c_ULTIMATE.start_main_~#is~0#1.base|) .cse1 v_ArrVal_2036))))) (store .cse13 c_threadThread1of1ForFork0_~p~0.base (store (select .cse13 c_threadThread1of1ForFork0_~p~0.base) .cse6 0))))) (or (forall ((v_ArrVal_2040 Int)) (= (select (select (store .cse12 .cse2 (store (select .cse12 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_55| .cse3) v_ArrVal_2040)) c_threadThread1of1ForFork0_~p~0.base) .cse6) 0)) (not (= (select (select .cse12 |c_ULTIMATE.start_main_~#is~0#1.base|) .cse1) 0))))) (not (<= .cse11 |v_ULTIMATE.start_main_#t~mem8#1.offset_55|)))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_55| Int)) (or (forall ((v_ArrVal_2036 Int) (v_ArrVal_2033 (Array Int Int)) (v_ArrVal_2030 (Array Int Int))) (let ((.cse17 (let ((.cse18 (let ((.cse19 (let ((.cse20 (store (let ((.cse21 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2030))) (store .cse21 c_threadThread1of1ForFork0_~p~0.base (store (select .cse21 c_threadThread1of1ForFork0_~p~0.base) .cse10 0))) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2033))) (store .cse20 c_threadThread1of1ForFork0_~p~0.base (store (select .cse20 c_threadThread1of1ForFork0_~p~0.base) .cse4 0))))) (store .cse19 |c_ULTIMATE.start_main_~#is~0#1.base| (store (select .cse19 |c_ULTIMATE.start_main_~#is~0#1.base|) .cse1 v_ArrVal_2036))))) (store .cse18 c_threadThread1of1ForFork0_~p~0.base (store (select .cse18 c_threadThread1of1ForFork0_~p~0.base) .cse6 0))))) (or (not (= (select (select .cse17 |c_ULTIMATE.start_main_~#is~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_2040 Int)) (= (select (select (store .cse17 .cse2 (store (select .cse17 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_55| .cse3) v_ArrVal_2040)) c_threadThread1of1ForFork0_~p~0.base) .cse10) 0))))) (not (<= .cse11 |v_ULTIMATE.start_main_#t~mem8#1.offset_55|)))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_55| Int)) (or (forall ((v_ArrVal_2036 Int) (v_ArrVal_2033 (Array Int Int)) (v_ArrVal_2030 (Array Int Int))) (let ((.cse22 (let ((.cse23 (let ((.cse24 (let ((.cse25 (store (let ((.cse26 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2030))) (store .cse26 c_threadThread1of1ForFork0_~p~0.base (store (select .cse26 c_threadThread1of1ForFork0_~p~0.base) .cse10 0))) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2033))) (store .cse25 c_threadThread1of1ForFork0_~p~0.base (store (select .cse25 c_threadThread1of1ForFork0_~p~0.base) .cse4 0))))) (store .cse24 |c_ULTIMATE.start_main_~#is~0#1.base| (store (select .cse24 |c_ULTIMATE.start_main_~#is~0#1.base|) .cse1 v_ArrVal_2036))))) (store .cse23 c_threadThread1of1ForFork0_~p~0.base (store (select .cse23 c_threadThread1of1ForFork0_~p~0.base) .cse6 0))))) (or (forall ((v_ArrVal_2040 Int)) (= (select (select (store .cse22 .cse2 (store (select .cse22 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_55| .cse3) v_ArrVal_2040)) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)) (not (= (select (select .cse22 |c_ULTIMATE.start_main_~#is~0#1.base|) .cse1) 0))))) (not (<= .cse11 |v_ULTIMATE.start_main_#t~mem8#1.offset_55|)))))) is different from false
[2023-10-27 12:23:31,950 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|)) (.cse4 (+ c_threadThread1of1ForFork0_~p~0.offset 3)) (.cse5 (+ 3 |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse9 (+ c_threadThread1of1ForFork0_~p~0.offset 2)) (.cse11 (+ c_threadThread1of1ForFork0_~p~0.offset 1)) (.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_82| Int)) (or (not (<= .cse0 |v_ULTIMATE.start_main_~i~1#1_82|)) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_55| Int)) (or (not (<= .cse1 |v_ULTIMATE.start_main_#t~mem8#1.offset_55|)) (forall ((v_ArrVal_2036 Int) (v_ArrVal_2033 (Array Int Int)) (v_ArrVal_2030 (Array Int Int))) (let ((.cse2 (let ((.cse6 (let ((.cse7 (let ((.cse8 (store (let ((.cse10 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2030))) (store .cse10 c_threadThread1of1ForFork0_~p~0.base (store (select .cse10 c_threadThread1of1ForFork0_~p~0.base) .cse11 0))) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2033))) (store .cse8 c_threadThread1of1ForFork0_~p~0.base (store (select .cse8 c_threadThread1of1ForFork0_~p~0.base) .cse9 0))))) (store .cse7 |c_ULTIMATE.start_main_~#is~0#1.base| (store (select .cse7 |c_ULTIMATE.start_main_~#is~0#1.base|) .cse5 v_ArrVal_2036))))) (store .cse6 c_threadThread1of1ForFork0_~p~0.base (store (select .cse6 c_threadThread1of1ForFork0_~p~0.base) .cse4 0))))) (or (forall ((v_ArrVal_2040 Int)) (= (select (select (store .cse2 .cse3 (store (select .cse2 .cse3) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_55| (* |v_ULTIMATE.start_main_~i~1#1_82| 4)) v_ArrVal_2040)) c_threadThread1of1ForFork0_~p~0.base) .cse4) 0)) (not (= (select (select .cse2 |c_ULTIMATE.start_main_~#is~0#1.base|) .cse5) 0))))))))) (forall ((|v_ULTIMATE.start_main_~i~1#1_82| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_55| Int)) (or (not (<= .cse1 |v_ULTIMATE.start_main_#t~mem8#1.offset_55|)) (forall ((v_ArrVal_2036 Int) (v_ArrVal_2033 (Array Int Int)) (v_ArrVal_2030 (Array Int Int))) (let ((.cse12 (let ((.cse13 (let ((.cse14 (let ((.cse15 (store (let ((.cse16 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2030))) (store .cse16 c_threadThread1of1ForFork0_~p~0.base (store (select .cse16 c_threadThread1of1ForFork0_~p~0.base) .cse11 0))) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2033))) (store .cse15 c_threadThread1of1ForFork0_~p~0.base (store (select .cse15 c_threadThread1of1ForFork0_~p~0.base) .cse9 0))))) (store .cse14 |c_ULTIMATE.start_main_~#is~0#1.base| (store (select .cse14 |c_ULTIMATE.start_main_~#is~0#1.base|) .cse5 v_ArrVal_2036))))) (store .cse13 c_threadThread1of1ForFork0_~p~0.base (store (select .cse13 c_threadThread1of1ForFork0_~p~0.base) .cse4 0))))) (or (forall ((v_ArrVal_2040 Int)) (= (select (select (store .cse12 .cse3 (store (select .cse12 .cse3) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_55| (* |v_ULTIMATE.start_main_~i~1#1_82| 4)) v_ArrVal_2040)) c_threadThread1of1ForFork0_~p~0.base) .cse11) 0)) (not (= (select (select .cse12 |c_ULTIMATE.start_main_~#is~0#1.base|) .cse5) 0))))))) (not (<= .cse0 |v_ULTIMATE.start_main_~i~1#1_82|)))) (forall ((|v_ULTIMATE.start_main_~i~1#1_82| Int)) (or (not (<= .cse0 |v_ULTIMATE.start_main_~i~1#1_82|)) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_55| Int)) (or (forall ((v_ArrVal_2036 Int) (v_ArrVal_2033 (Array Int Int)) (v_ArrVal_2030 (Array Int Int))) (let ((.cse17 (let ((.cse18 (let ((.cse19 (let ((.cse20 (store (let ((.cse21 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2030))) (store .cse21 c_threadThread1of1ForFork0_~p~0.base (store (select .cse21 c_threadThread1of1ForFork0_~p~0.base) .cse11 0))) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2033))) (store .cse20 c_threadThread1of1ForFork0_~p~0.base (store (select .cse20 c_threadThread1of1ForFork0_~p~0.base) .cse9 0))))) (store .cse19 |c_ULTIMATE.start_main_~#is~0#1.base| (store (select .cse19 |c_ULTIMATE.start_main_~#is~0#1.base|) .cse5 v_ArrVal_2036))))) (store .cse18 c_threadThread1of1ForFork0_~p~0.base (store (select .cse18 c_threadThread1of1ForFork0_~p~0.base) .cse4 0))))) (or (not (= (select (select .cse17 |c_ULTIMATE.start_main_~#is~0#1.base|) .cse5) 0)) (forall ((v_ArrVal_2040 Int)) (= (select (select (store .cse17 .cse3 (store (select .cse17 .cse3) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_55| (* |v_ULTIMATE.start_main_~i~1#1_82| 4)) v_ArrVal_2040)) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0))))) (not (<= .cse1 |v_ULTIMATE.start_main_#t~mem8#1.offset_55|)))))) (forall ((|v_ULTIMATE.start_main_~i~1#1_82| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_55| Int)) (or (forall ((v_ArrVal_2036 Int) (v_ArrVal_2033 (Array Int Int)) (v_ArrVal_2030 (Array Int Int))) (let ((.cse22 (let ((.cse23 (let ((.cse24 (let ((.cse25 (store (let ((.cse26 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2030))) (store .cse26 c_threadThread1of1ForFork0_~p~0.base (store (select .cse26 c_threadThread1of1ForFork0_~p~0.base) .cse11 0))) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2033))) (store .cse25 c_threadThread1of1ForFork0_~p~0.base (store (select .cse25 c_threadThread1of1ForFork0_~p~0.base) .cse9 0))))) (store .cse24 |c_ULTIMATE.start_main_~#is~0#1.base| (store (select .cse24 |c_ULTIMATE.start_main_~#is~0#1.base|) .cse5 v_ArrVal_2036))))) (store .cse23 c_threadThread1of1ForFork0_~p~0.base (store (select .cse23 c_threadThread1of1ForFork0_~p~0.base) .cse4 0))))) (or (forall ((v_ArrVal_2040 Int)) (= (select (select (store .cse22 .cse3 (store (select .cse22 .cse3) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_55| (* |v_ULTIMATE.start_main_~i~1#1_82| 4)) v_ArrVal_2040)) c_threadThread1of1ForFork0_~p~0.base) .cse9) 0)) (not (= (select (select .cse22 |c_ULTIMATE.start_main_~#is~0#1.base|) .cse5) 0))))) (not (<= .cse1 |v_ULTIMATE.start_main_#t~mem8#1.offset_55|)))) (not (<= .cse0 |v_ULTIMATE.start_main_~i~1#1_82|)))))) is different from false
[2023-10-27 12:23:32,037 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-27 12:23:32,038 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 1088 treesize of output 712
[2023-10-27 12:23:34,269 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-27 12:23:34,275 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 47105228 treesize of output 45729528
[2023-10-27 12:24:40,864 WARN  L233               SmtUtils]: Spent 1.11m on a formula simplification that was a NOOP. DAG size: 6276 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2023-10-27 12:24:41,736 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-27 12:24:41,741 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 59368206 treesize of output 58213480
[2023-10-27 12:28:44,795 WARN  L233               SmtUtils]: Spent 4.05m on a formula simplification. DAG size of input: 5148 DAG size of output: 5144 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2023-10-27 12:28:45,485 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-27 12:28:45,490 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58403379 treesize of output 58377629
[2023-10-27 12:32:55,614 WARN  L233               SmtUtils]: Spent 4.17m on a formula simplification. DAG size of input: 4819 DAG size of output: 4808 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
Killed by 15
