./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-25 14:55:53,218 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2023-10-25 14:55:53,233 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2023-10-25 14:55:53,284 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2023-10-25 14:55:53,285 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2023-10-25 14:55:53,286 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2023-10-25 14:55:53,287 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2023-10-25 14:55:53,288 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2023-10-25 14:55:53,289 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2023-10-25 14:55:53,290 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2023-10-25 14:55:53,291 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2023-10-25 14:55:53,292 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2023-10-25 14:55:53,292 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2023-10-25 14:55:53,293 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2023-10-25 14:55:53,294 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2023-10-25 14:55:53,295 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2023-10-25 14:55:53,314 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2023-10-25 14:55:53,318 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2023-10-25 14:55:53,320 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2023-10-25 14:55:53,326 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2023-10-25 14:55:53,328 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2023-10-25 14:55:53,331 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2023-10-25 14:55:53,332 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2023-10-25 14:55:53,333 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2023-10-25 14:55:53,336 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2023-10-25 14:55:53,336 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2023-10-25 14:55:53,337 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2023-10-25 14:55:53,338 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2023-10-25 14:55:53,338 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2023-10-25 14:55:53,338 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2023-10-25 14:55:53,339 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2023-10-25 14:55:53,340 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2023-10-25 14:55:53,341 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2023-10-25 14:55:53,341 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2023-10-25 14:55:53,343 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2023-10-25 14:55:53,343 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2023-10-25 14:55:53,344 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2023-10-25 14:55:53,344 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2023-10-25 14:55:53,344 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2023-10-25 14:55:53,345 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2023-10-25 14:55:53,357 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2023-10-25 14:55:53,358 INFO  L101        SettingsManager]: Beginning loading settings from /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf
[2023-10-25 14:55:53,398 INFO  L113        SettingsManager]: Loading preferences was successful
[2023-10-25 14:55:53,398 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2023-10-25 14:55:53,398 INFO  L136        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2023-10-25 14:55:53,398 INFO  L138        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2023-10-25 14:55:53,399 INFO  L136        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2023-10-25 14:55:53,399 INFO  L138        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2023-10-25 14:55:53,400 INFO  L136        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2023-10-25 14:55:53,400 INFO  L138        SettingsManager]:  * Create parallel compositions if possible=false
[2023-10-25 14:55:53,400 INFO  L138        SettingsManager]:  * Use SBE=true
[2023-10-25 14:55:53,400 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2023-10-25 14:55:53,401 INFO  L138        SettingsManager]:  * sizeof long=4
[2023-10-25 14:55:53,401 INFO  L138        SettingsManager]:  * Check unreachability of error function in SV-COMP mode=false
[2023-10-25 14:55:53,401 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2023-10-25 14:55:53,402 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2023-10-25 14:55:53,402 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2023-10-25 14:55:53,402 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2023-10-25 14:55:53,402 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2023-10-25 14:55:53,402 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2023-10-25 14:55:53,402 INFO  L138        SettingsManager]:  * Check absence of data races in concurrent programs=true
[2023-10-25 14:55:53,403 INFO  L138        SettingsManager]:  * sizeof long double=12
[2023-10-25 14:55:53,403 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2023-10-25 14:55:53,403 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2023-10-25 14:55:53,403 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2023-10-25 14:55:53,403 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2023-10-25 14:55:53,403 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2023-10-25 14:55:53,404 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2023-10-25 14:55:53,404 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2023-10-25 14:55:53,404 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2023-10-25 14:55:53,404 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2023-10-25 14:55:53,404 INFO  L138        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2023-10-25 14:55:53,404 INFO  L138        SettingsManager]:  * Trace refinement strategy=CAMEL
[2023-10-25 14:55:53,405 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2023-10-25 14:55:53,405 INFO  L138        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2023-10-25 14:55:53,405 INFO  L138        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2023-10-25 14:55:53,405 INFO  L138        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2023-10-25 14:55:53,405 INFO  L138        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2023-10-25 14:55:53,406 INFO  L138        SettingsManager]:  * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC
[2023-10-25 14:55:53,406 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-25 14:55:54,594 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2023-10-25 14:55:54,915 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2023-10-25 14:55:54,917 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2023-10-25 14:55:54,918 INFO  L271        PluginConnector]: Initializing CDTParser...
[2023-10-25 14:55:54,918 INFO  L275        PluginConnector]: CDTParser initialized
[2023-10-25 14:55:54,919 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-25 14:55:57,266 INFO  L500              CDTParser]: Created temporary CDT project at NULL
[2023-10-25 14:55:57,689 INFO  L351              CDTParser]: Found 1 translation units.
[2023-10-25 14:55:57,689 INFO  L172              CDTParser]: Scanning /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-array-init.i
[2023-10-25 14:55:57,711 INFO  L394              CDTParser]: About to delete temporary CDT project at /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data/cd6beffdd/1b9ad13d8ed945308b33998bd319780a/FLAG078356fb6
[2023-10-25 14:55:57,723 INFO  L402              CDTParser]: Successfully deleted /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data/cd6beffdd/1b9ad13d8ed945308b33998bd319780a
[2023-10-25 14:55:57,727 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2023-10-25 14:55:57,729 INFO  L131        ToolchainWalker]: Walking toolchain with 6 elements.
[2023-10-25 14:55:57,737 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2023-10-25 14:55:57,738 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2023-10-25 14:55:57,744 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2023-10-25 14:55:57,744 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 02:55:57" (1/1) ...
[2023-10-25 14:55:57,749 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c5d9df8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 02:55:57, skipping insertion in model container
[2023-10-25 14:55:57,749 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 02:55:57" (1/1) ...
[2023-10-25 14:55:57,771 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2023-10-25 14:55:57,850 INFO  L178         MainTranslator]: Built tables and reachable declarations
[2023-10-25 14:55:58,081 WARN  L611        FunctionHandler]: implicit declaration of function __builtin_bswap16
[2023-10-25 14:55:58,428 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2023-10-25 14:55:58,434 INFO  L203         MainTranslator]: Completed pre-run
[2023-10-25 14:55:58,457 WARN  L611        FunctionHandler]: implicit declaration of function __builtin_bswap16
[2023-10-25 14:55:58,520 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2023-10-25 14:55:58,613 INFO  L208         MainTranslator]: Completed translation
[2023-10-25 14:55:58,614 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 02:55:58 WrapperNode
[2023-10-25 14:55:58,614 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2023-10-25 14:55:58,615 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2023-10-25 14:55:58,615 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2023-10-25 14:55:58,615 INFO  L275        PluginConnector]: Boogie Procedure Inliner initialized
[2023-10-25 14:55:58,620 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 02:55:58" (1/1) ...
[2023-10-25 14:55:58,655 INFO  L185        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 02:55:58" (1/1) ...
[2023-10-25 14:55:58,702 INFO  L138                Inliner]: procedures = 266, calls = 27, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 112
[2023-10-25 14:55:58,703 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2023-10-25 14:55:58,703 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2023-10-25 14:55:58,703 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2023-10-25 14:55:58,719 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2023-10-25 14:55:58,727 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 02:55:58" (1/1) ...
[2023-10-25 14:55:58,739 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 02:55:58" (1/1) ...
[2023-10-25 14:55:58,742 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 02:55:58" (1/1) ...
[2023-10-25 14:55:58,742 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 02:55:58" (1/1) ...
[2023-10-25 14:55:58,751 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 02:55:58" (1/1) ...
[2023-10-25 14:55:58,769 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 02:55:58" (1/1) ...
[2023-10-25 14:55:58,772 INFO  L185        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 02:55:58" (1/1) ...
[2023-10-25 14:55:58,780 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 02:55:58" (1/1) ...
[2023-10-25 14:55:58,783 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2023-10-25 14:55:58,787 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2023-10-25 14:55:58,787 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2023-10-25 14:55:58,787 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2023-10-25 14:55:58,788 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 02:55:58" (1/1) ...
[2023-10-25 14:55:58,792 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2023-10-25 14:55:58,806 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-25 14:55:58,819 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-25 14:55:58,846 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-25 14:55:58,854 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2023-10-25 14:55:58,854 INFO  L130     BoogieDeclarations]: Found specification of procedure read~$Pointer$
[2023-10-25 14:55:58,854 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2023-10-25 14:55:58,854 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~$Pointer$
[2023-10-25 14:55:58,855 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int
[2023-10-25 14:55:58,855 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2023-10-25 14:55:58,855 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap
[2023-10-25 14:55:58,855 INFO  L130     BoogieDeclarations]: Found specification of procedure thread
[2023-10-25 14:55:58,855 INFO  L138     BoogieDeclarations]: Found implementation of procedure thread
[2023-10-25 14:55:58,855 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2023-10-25 14:55:58,855 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2023-10-25 14:55:58,857 WARN  L209             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement
[2023-10-25 14:55:59,303 INFO  L235             CfgBuilder]: Building ICFG
[2023-10-25 14:55:59,305 INFO  L261             CfgBuilder]: Building CFG for each procedure with an implementation
[2023-10-25 14:55:59,856 INFO  L276             CfgBuilder]: Performing block encoding
[2023-10-25 14:55:59,862 INFO  L295             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2023-10-25 14:55:59,885 INFO  L300             CfgBuilder]: Removed 2 assume(true) statements.
[2023-10-25 14:55:59,887 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 02:55:59 BoogieIcfgContainer
[2023-10-25 14:55:59,888 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2023-10-25 14:55:59,890 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2023-10-25 14:55:59,890 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2023-10-25 14:55:59,892 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2023-10-25 14:55:59,893 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.10 02:55:57" (1/3) ...
[2023-10-25 14:55:59,893 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@519d3966 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 02:55:59, skipping insertion in model container
[2023-10-25 14:55:59,893 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 02:55:58" (2/3) ...
[2023-10-25 14:55:59,894 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@519d3966 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 02:55:59, skipping insertion in model container
[2023-10-25 14:55:59,894 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 02:55:59" (3/3) ...
[2023-10-25 14:55:59,896 INFO  L112   eAbstractionObserver]: Analyzing ICFG per-thread-array-init.i
[2023-10-25 14:55:59,908 WARN  L145   ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2023-10-25 14:55:59,929 INFO  L203   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2023-10-25 14:55:59,929 INFO  L162   ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations.
[2023-10-25 14:55:59,929 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2023-10-25 14:56:00,059 INFO  L144    ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions.
[2023-10-25 14:56:00,105 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 136 places, 137 transitions, 282 flow
[2023-10-25 14:56:00,287 INFO  L130       PetriNetUnfolder]: 6/218 cut-off events.
[2023-10-25 14:56:00,287 INFO  L131       PetriNetUnfolder]: For 1/1 co-relation queries the response was YES.
[2023-10-25 14:56:00,291 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-25 14:56:00,291 INFO  L82        GeneralOperation]: Start removeDead. Operand has 136 places, 137 transitions, 282 flow
[2023-10-25 14:56:00,300 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 136 places, 137 transitions, 282 flow
[2023-10-25 14:56:00,304 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2023-10-25 14:56:00,334 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 136 places, 137 transitions, 282 flow
[2023-10-25 14:56:00,340 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 136 places, 137 transitions, 282 flow
[2023-10-25 14:56:00,341 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 136 places, 137 transitions, 282 flow
[2023-10-25 14:56:00,434 INFO  L130       PetriNetUnfolder]: 6/218 cut-off events.
[2023-10-25 14:56:00,434 INFO  L131       PetriNetUnfolder]: For 1/1 co-relation queries the response was YES.
[2023-10-25 14:56:00,435 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-25 14:56:00,438 INFO  L119        LiptonReduction]: Number of co-enabled transitions 2314
[2023-10-25 14:56:04,352 INFO  L134        LiptonReduction]: Checked pairs total: 10042
[2023-10-25 14:56:04,353 INFO  L136        LiptonReduction]: Total number of compositions: 83
[2023-10-25 14:56:04,372 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-10-25 14:56:04,395 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;@eb295ec, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2023-10-25 14:56:04,395 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 11 error locations.
[2023-10-25 14:56:04,398 INFO  L130       PetriNetUnfolder]: 0/14 cut-off events.
[2023-10-25 14:56:04,399 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2023-10-25 14:56:04,399 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 14:56:04,400 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1]
[2023-10-25 14:56:04,400 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-25 14:56:04,406 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 14:56:04,407 INFO  L85        PathProgramCache]: Analyzing trace with hash -382401433, now seen corresponding path program 1 times
[2023-10-25 14:56:04,419 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 14:56:04,420 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918807722]
[2023-10-25 14:56:04,420 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 14:56:04,420 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 14:56:04,625 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 14:56:05,369 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-25 14:56:05,370 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 14:56:05,371 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918807722]
[2023-10-25 14:56:05,371 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918807722] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-25 14:56:05,372 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-25 14:56:05,372 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-10-25 14:56:05,373 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493113041]
[2023-10-25 14:56:05,373 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-25 14:56:05,380 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-10-25 14:56:05,393 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 14:56:05,411 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-10-25 14:56:05,423 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-10-25 14:56:05,975 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 107 out of 220
[2023-10-25 14:56:05,980 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-25 14:56:05,980 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 14:56:05,980 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 220
[2023-10-25 14:56:05,981 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 14:56:06,153 INFO  L130       PetriNetUnfolder]: 57/287 cut-off events.
[2023-10-25 14:56:06,154 INFO  L131       PetriNetUnfolder]: For 4/4 co-relation queries the response was YES.
[2023-10-25 14:56:06,156 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-25 14:56:06,159 INFO  L137   encePairwiseOnDemand]: 203/220 looper letters, 40 selfloop transitions, 10 changer transitions 5/82 dead transitions.
[2023-10-25 14:56:06,159 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 82 transitions, 282 flow
[2023-10-25 14:56:06,160 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-10-25 14:56:06,163 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-10-25 14:56:06,183 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 700 transitions.
[2023-10-25 14:56:06,187 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5303030303030303
[2023-10-25 14:56:06,202 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 700 transitions.
[2023-10-25 14:56:06,202 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 700 transitions.
[2023-10-25 14:56:06,206 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 14:56:06,208 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 700 transitions.
[2023-10-25 14:56:06,213 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-25 14:56:06,219 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-25 14:56:06,220 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-25 14:56:06,221 INFO  L175             Difference]: Start difference. First operand has 66 places, 64 transitions, 136 flow. Second operand 6 states and 700 transitions.
[2023-10-25 14:56:06,222 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 82 transitions, 282 flow
[2023-10-25 14:56:06,228 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 82 transitions, 282 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-10-25 14:56:06,230 INFO  L231             Difference]: Finished difference. Result has 72 places, 65 transitions, 190 flow
[2023-10-25 14:56:06,246 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-25 14:56:06,249 INFO  L288   CegarLoopForPetriNet]: 66 programPoint places, 6 predicate places.
[2023-10-25 14:56:06,250 INFO  L495      AbstractCegarLoop]: Abstraction has has 72 places, 65 transitions, 190 flow
[2023-10-25 14:56:06,250 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-25 14:56:06,250 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 14:56:06,251 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2023-10-25 14:56:06,251 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2023-10-25 14:56:06,251 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-25 14:56:06,252 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 14:56:06,252 INFO  L85        PathProgramCache]: Analyzing trace with hash 1094831862, now seen corresponding path program 1 times
[2023-10-25 14:56:06,253 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 14:56:06,254 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817814201]
[2023-10-25 14:56:06,255 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 14:56:06,255 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 14:56:06,282 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 14:56:06,358 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-25 14:56:06,358 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 14:56:06,359 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817814201]
[2023-10-25 14:56:06,359 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817814201] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-25 14:56:06,359 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-25 14:56:06,362 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2023-10-25 14:56:06,363 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329820611]
[2023-10-25 14:56:06,363 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-25 14:56:06,366 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2023-10-25 14:56:06,366 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 14:56:06,367 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2023-10-25 14:56:06,367 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2023-10-25 14:56:06,449 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 126 out of 220
[2023-10-25 14:56:06,450 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-25 14:56:06,450 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 14:56:06,450 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 220
[2023-10-25 14:56:06,451 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 14:56:06,563 INFO  L130       PetriNetUnfolder]: 28/243 cut-off events.
[2023-10-25 14:56:06,564 INFO  L131       PetriNetUnfolder]: For 25/25 co-relation queries the response was YES.
[2023-10-25 14:56:06,566 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-25 14:56:06,567 INFO  L137   encePairwiseOnDemand]: 216/220 looper letters, 27 selfloop transitions, 3 changer transitions 1/75 dead transitions.
[2023-10-25 14:56:06,567 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 75 transitions, 276 flow
[2023-10-25 14:56:06,567 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2023-10-25 14:56:06,568 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2023-10-25 14:56:06,569 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 536 transitions.
[2023-10-25 14:56:06,576 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6090909090909091
[2023-10-25 14:56:06,577 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 536 transitions.
[2023-10-25 14:56:06,577 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 536 transitions.
[2023-10-25 14:56:06,577 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 14:56:06,578 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 536 transitions.
[2023-10-25 14:56:06,579 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-25 14:56:06,580 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-25 14:56:06,580 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-25 14:56:06,581 INFO  L175             Difference]: Start difference. First operand has 72 places, 65 transitions, 190 flow. Second operand 4 states and 536 transitions.
[2023-10-25 14:56:06,581 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 75 transitions, 276 flow
[2023-10-25 14:56:06,584 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 75 transitions, 266 flow, removed 3 selfloop flow, removed 1 redundant places.
[2023-10-25 14:56:06,585 INFO  L231             Difference]: Finished difference. Result has 76 places, 66 transitions, 196 flow
[2023-10-25 14:56:06,586 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-25 14:56:06,586 INFO  L288   CegarLoopForPetriNet]: 66 programPoint places, 10 predicate places.
[2023-10-25 14:56:06,589 INFO  L495      AbstractCegarLoop]: Abstraction has has 76 places, 66 transitions, 196 flow
[2023-10-25 14:56:06,590 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-25 14:56:06,590 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 14:56:06,590 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2023-10-25 14:56:06,590 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2023-10-25 14:56:06,591 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-25 14:56:06,591 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 14:56:06,591 INFO  L85        PathProgramCache]: Analyzing trace with hash 1103111380, now seen corresponding path program 1 times
[2023-10-25 14:56:06,591 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 14:56:06,592 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140812883]
[2023-10-25 14:56:06,592 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 14:56:06,592 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 14:56:06,627 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 14:56:06,924 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-25 14:56:06,925 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 14:56:06,925 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140812883]
[2023-10-25 14:56:06,925 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140812883] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-25 14:56:06,926 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-25 14:56:06,926 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-10-25 14:56:06,927 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813681908]
[2023-10-25 14:56:06,927 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-25 14:56:06,927 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-10-25 14:56:06,927 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 14:56:06,928 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-10-25 14:56:06,928 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-10-25 14:56:07,333 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 107 out of 220
[2023-10-25 14:56:07,334 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-25 14:56:07,334 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 14:56:07,334 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 220
[2023-10-25 14:56:07,334 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 14:56:07,466 INFO  L130       PetriNetUnfolder]: 58/260 cut-off events.
[2023-10-25 14:56:07,466 INFO  L131       PetriNetUnfolder]: For 15/15 co-relation queries the response was YES.
[2023-10-25 14:56:07,466 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-25 14:56:07,468 INFO  L137   encePairwiseOnDemand]: 207/220 looper letters, 40 selfloop transitions, 6 changer transitions 5/77 dead transitions.
[2023-10-25 14:56:07,468 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 77 transitions, 322 flow
[2023-10-25 14:56:07,469 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-10-25 14:56:07,469 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-10-25 14:56:07,470 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 696 transitions.
[2023-10-25 14:56:07,470 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5272727272727272
[2023-10-25 14:56:07,470 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 696 transitions.
[2023-10-25 14:56:07,470 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 696 transitions.
[2023-10-25 14:56:07,471 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 14:56:07,471 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 696 transitions.
[2023-10-25 14:56:07,472 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-25 14:56:07,474 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-25 14:56:07,479 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-25 14:56:07,479 INFO  L175             Difference]: Start difference. First operand has 76 places, 66 transitions, 196 flow. Second operand 6 states and 696 transitions.
[2023-10-25 14:56:07,479 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 77 transitions, 322 flow
[2023-10-25 14:56:07,483 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 77 transitions, 320 flow, removed 0 selfloop flow, removed 1 redundant places.
[2023-10-25 14:56:07,484 INFO  L231             Difference]: Finished difference. Result has 82 places, 63 transitions, 220 flow
[2023-10-25 14:56:07,484 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-25 14:56:07,498 INFO  L288   CegarLoopForPetriNet]: 66 programPoint places, 16 predicate places.
[2023-10-25 14:56:07,498 INFO  L495      AbstractCegarLoop]: Abstraction has has 82 places, 63 transitions, 220 flow
[2023-10-25 14:56:07,500 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-25 14:56:07,500 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 14:56:07,500 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-25 14:56:07,500 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2023-10-25 14:56:07,503 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-25 14:56:07,504 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 14:56:07,504 INFO  L85        PathProgramCache]: Analyzing trace with hash -1153489684, now seen corresponding path program 1 times
[2023-10-25 14:56:07,504 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 14:56:07,504 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242126766]
[2023-10-25 14:56:07,504 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 14:56:07,505 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 14:56:07,529 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 14:56:07,889 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-25 14:56:07,889 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 14:56:07,890 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242126766]
[2023-10-25 14:56:07,905 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242126766] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-25 14:56:07,905 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-25 14:56:07,906 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-10-25 14:56:07,906 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492921880]
[2023-10-25 14:56:07,906 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-25 14:56:07,907 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-10-25 14:56:07,907 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 14:56:07,908 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-10-25 14:56:07,908 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-10-25 14:56:08,244 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 87 out of 220
[2023-10-25 14:56:08,245 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-25 14:56:08,245 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 14:56:08,245 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 220
[2023-10-25 14:56:08,245 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 14:56:08,548 INFO  L130       PetriNetUnfolder]: 254/667 cut-off events.
[2023-10-25 14:56:08,549 INFO  L131       PetriNetUnfolder]: For 109/109 co-relation queries the response was YES.
[2023-10-25 14:56:08,553 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-25 14:56:08,554 INFO  L137   encePairwiseOnDemand]: 210/220 looper letters, 61 selfloop transitions, 22 changer transitions 0/91 dead transitions.
[2023-10-25 14:56:08,555 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 91 transitions, 442 flow
[2023-10-25 14:56:08,569 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-10-25 14:56:08,570 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-10-25 14:56:08,571 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 601 transitions.
[2023-10-25 14:56:08,571 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.4553030303030303
[2023-10-25 14:56:08,571 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 601 transitions.
[2023-10-25 14:56:08,571 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 601 transitions.
[2023-10-25 14:56:08,573 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 14:56:08,573 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 601 transitions.
[2023-10-25 14:56:08,574 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-25 14:56:08,577 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-25 14:56:08,578 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-25 14:56:08,578 INFO  L175             Difference]: Start difference. First operand has 82 places, 63 transitions, 220 flow. Second operand 6 states and 601 transitions.
[2023-10-25 14:56:08,578 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 91 transitions, 442 flow
[2023-10-25 14:56:08,582 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 91 transitions, 413 flow, removed 6 selfloop flow, removed 9 redundant places.
[2023-10-25 14:56:08,583 INFO  L231             Difference]: Finished difference. Result has 81 places, 83 transitions, 318 flow
[2023-10-25 14:56:08,583 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-25 14:56:08,585 INFO  L288   CegarLoopForPetriNet]: 66 programPoint places, 15 predicate places.
[2023-10-25 14:56:08,585 INFO  L495      AbstractCegarLoop]: Abstraction has has 81 places, 83 transitions, 318 flow
[2023-10-25 14:56:08,589 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-25 14:56:08,589 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 14:56:08,589 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-25 14:56:08,590 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2023-10-25 14:56:08,590 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-25 14:56:08,590 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 14:56:08,590 INFO  L85        PathProgramCache]: Analyzing trace with hash -116177611, now seen corresponding path program 1 times
[2023-10-25 14:56:08,590 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 14:56:08,591 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731349553]
[2023-10-25 14:56:08,591 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 14:56:08,591 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 14:56:08,631 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 14:56:09,111 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-25 14:56:09,112 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 14:56:09,112 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731349553]
[2023-10-25 14:56:09,112 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731349553] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-25 14:56:09,113 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-25 14:56:09,113 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-10-25 14:56:09,113 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957169218]
[2023-10-25 14:56:09,113 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-25 14:56:09,114 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-10-25 14:56:09,114 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 14:56:09,114 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-10-25 14:56:09,114 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-10-25 14:56:09,592 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 121 out of 220
[2023-10-25 14:56:09,592 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-25 14:56:09,592 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 14:56:09,593 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 220
[2023-10-25 14:56:09,593 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 14:56:09,905 INFO  L130       PetriNetUnfolder]: 161/521 cut-off events.
[2023-10-25 14:56:09,905 INFO  L131       PetriNetUnfolder]: For 233/237 co-relation queries the response was YES.
[2023-10-25 14:56:09,906 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-25 14:56:09,908 INFO  L137   encePairwiseOnDemand]: 210/220 looper letters, 83 selfloop transitions, 28 changer transitions 26/163 dead transitions.
[2023-10-25 14:56:09,908 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 163 transitions, 885 flow
[2023-10-25 14:56:09,909 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-10-25 14:56:09,909 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-10-25 14:56:09,910 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 832 transitions.
[2023-10-25 14:56:09,910 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6303030303030303
[2023-10-25 14:56:09,925 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 832 transitions.
[2023-10-25 14:56:09,925 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 832 transitions.
[2023-10-25 14:56:09,926 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 14:56:09,926 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 832 transitions.
[2023-10-25 14:56:09,928 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-25 14:56:09,929 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-25 14:56:09,929 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-25 14:56:09,930 INFO  L175             Difference]: Start difference. First operand has 81 places, 83 transitions, 318 flow. Second operand 6 states and 832 transitions.
[2023-10-25 14:56:09,930 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 163 transitions, 885 flow
[2023-10-25 14:56:09,932 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 163 transitions, 870 flow, removed 0 selfloop flow, removed 1 redundant places.
[2023-10-25 14:56:09,935 INFO  L231             Difference]: Finished difference. Result has 90 places, 96 transitions, 543 flow
[2023-10-25 14:56:09,935 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-25 14:56:09,938 INFO  L288   CegarLoopForPetriNet]: 66 programPoint places, 24 predicate places.
[2023-10-25 14:56:09,938 INFO  L495      AbstractCegarLoop]: Abstraction has has 90 places, 96 transitions, 543 flow
[2023-10-25 14:56:09,939 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-25 14:56:09,939 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 14:56:09,939 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-25 14:56:09,939 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2023-10-25 14:56:09,939 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-25 14:56:09,940 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 14:56:09,940 INFO  L85        PathProgramCache]: Analyzing trace with hash 2137239947, now seen corresponding path program 1 times
[2023-10-25 14:56:09,940 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 14:56:09,940 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84771920]
[2023-10-25 14:56:09,940 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 14:56:09,941 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 14:56:09,998 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 14:56:10,541 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-25 14:56:10,541 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 14:56:10,555 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84771920]
[2023-10-25 14:56:10,556 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84771920] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-25 14:56:10,556 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-25 14:56:10,556 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-10-25 14:56:10,556 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482303209]
[2023-10-25 14:56:10,556 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-25 14:56:10,557 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-10-25 14:56:10,557 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 14:56:10,558 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-10-25 14:56:10,561 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-10-25 14:56:11,169 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 117 out of 220
[2023-10-25 14:56:11,170 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-25 14:56:11,170 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 14:56:11,170 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 220
[2023-10-25 14:56:11,170 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 14:56:11,326 INFO  L130       PetriNetUnfolder]: 89/377 cut-off events.
[2023-10-25 14:56:11,327 INFO  L131       PetriNetUnfolder]: For 348/380 co-relation queries the response was YES.
[2023-10-25 14:56:11,328 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-25 14:56:11,329 INFO  L137   encePairwiseOnDemand]: 214/220 looper letters, 41 selfloop transitions, 0 changer transitions 21/103 dead transitions.
[2023-10-25 14:56:11,329 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 103 transitions, 681 flow
[2023-10-25 14:56:11,329 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-10-25 14:56:11,330 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-10-25 14:56:11,331 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 735 transitions.
[2023-10-25 14:56:11,332 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5568181818181818
[2023-10-25 14:56:11,332 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 735 transitions.
[2023-10-25 14:56:11,332 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 735 transitions.
[2023-10-25 14:56:11,333 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 14:56:11,333 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 735 transitions.
[2023-10-25 14:56:11,334 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-25 14:56:11,351 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-25 14:56:11,351 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-25 14:56:11,351 INFO  L175             Difference]: Start difference. First operand has 90 places, 96 transitions, 543 flow. Second operand 6 states and 735 transitions.
[2023-10-25 14:56:11,351 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 103 transitions, 681 flow
[2023-10-25 14:56:11,354 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 103 transitions, 657 flow, removed 12 selfloop flow, removed 0 redundant places.
[2023-10-25 14:56:11,357 INFO  L231             Difference]: Finished difference. Result has 84 places, 82 transitions, 486 flow
[2023-10-25 14:56:11,357 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-25 14:56:11,360 INFO  L288   CegarLoopForPetriNet]: 66 programPoint places, 18 predicate places.
[2023-10-25 14:56:11,360 INFO  L495      AbstractCegarLoop]: Abstraction has has 84 places, 82 transitions, 486 flow
[2023-10-25 14:56:11,360 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-25 14:56:11,360 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 14:56:11,361 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-25 14:56:11,361 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2023-10-25 14:56:11,361 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-25 14:56:11,361 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 14:56:11,361 INFO  L85        PathProgramCache]: Analyzing trace with hash -972606990, now seen corresponding path program 1 times
[2023-10-25 14:56:11,362 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 14:56:11,362 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990621520]
[2023-10-25 14:56:11,363 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 14:56:11,363 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 14:56:11,462 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 14:56:12,978 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-25 14:56:12,978 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 14:56:12,978 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990621520]
[2023-10-25 14:56:12,978 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990621520] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-25 14:56:12,978 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1255158033]
[2023-10-25 14:56:12,979 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 14:56:12,979 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-25 14:56:12,979 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-25 14:56:12,995 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-25 14:56:13,041 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-25 14:56:13,197 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 14:56:13,215 INFO  L263         TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 44 conjunts are in the unsatisfiable core
[2023-10-25 14:56:13,221 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-25 14:56:13,538 INFO  L321             Elim1Store]: treesize reduction 36, result has 23.4 percent of original size
[2023-10-25 14:56:13,539 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-25 14:56:14,057 INFO  L321             Elim1Store]: treesize reduction 36, result has 23.4 percent of original size
[2023-10-25 14:56:14,058 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-25 14:56:14,069 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 14:56:14,070 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-25 14:56:14,320 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-25 14:56:14,325 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-25 14:56:14,395 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-25 14:56:14,457 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-25 14:56:14,523 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-25 14:56:14,619 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-25 14:56:14,713 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 14:56:14,714 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 14:56:14,715 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 14:56:14,716 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 14:56:14,719 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-25 14:56:14,720 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-25 14:56:14,730 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-25 14:56:14,730 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-25 14:56:16,499 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-25 14:56:16,582 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-25 14:56:16,598 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-25 14:56:17,047 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-25 14:56:17,047 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1255158033] provided 0 perfect and 2 imperfect interpolant sequences
[2023-10-25 14:56:17,047 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-10-25 14:56:17,047 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 15] total 42
[2023-10-25 14:56:17,048 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177985781]
[2023-10-25 14:56:17,048 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-10-25 14:56:17,048 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 44 states
[2023-10-25 14:56:17,048 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 14:56:17,048 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants.
[2023-10-25 14:56:17,049 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=215, Invalid=1578, Unknown=17, NotChecked=82, Total=1892
[2023-10-25 14:56:17,990 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 48 out of 220
[2023-10-25 14:56:17,992 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-25 14:56:17,992 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 14:56:17,992 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 220
[2023-10-25 14:56:17,992 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 14:56:21,042 INFO  L130       PetriNetUnfolder]: 444/1028 cut-off events.
[2023-10-25 14:56:21,043 INFO  L131       PetriNetUnfolder]: For 1223/1223 co-relation queries the response was YES.
[2023-10-25 14:56:21,045 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-25 14:56:21,048 INFO  L137   encePairwiseOnDemand]: 205/220 looper letters, 203 selfloop transitions, 46 changer transitions 0/250 dead transitions.
[2023-10-25 14:56:21,048 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 250 transitions, 1918 flow
[2023-10-25 14:56:21,049 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. 
[2023-10-25 14:56:21,049 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 19 states.
[2023-10-25 14:56:21,052 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 1057 transitions.
[2023-10-25 14:56:21,052 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.2528708133971292
[2023-10-25 14:56:21,052 INFO  L72            ComplementDD]: Start complementDD. Operand 19 states and 1057 transitions.
[2023-10-25 14:56:21,053 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 19 states and 1057 transitions.
[2023-10-25 14:56:21,053 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 14:56:21,053 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 1057 transitions.
[2023-10-25 14:56:21,066 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-25 14:56:21,070 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-25 14:56:21,071 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-25 14:56:21,071 INFO  L175             Difference]: Start difference. First operand has 84 places, 82 transitions, 486 flow. Second operand 19 states and 1057 transitions.
[2023-10-25 14:56:21,071 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 250 transitions, 1918 flow
[2023-10-25 14:56:21,077 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 250 transitions, 1915 flow, removed 0 selfloop flow, removed 1 redundant places.
[2023-10-25 14:56:21,094 INFO  L231             Difference]: Finished difference. Result has 95 places, 122 transitions, 975 flow
[2023-10-25 14:56:21,094 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-25 14:56:21,095 INFO  L288   CegarLoopForPetriNet]: 66 programPoint places, 29 predicate places.
[2023-10-25 14:56:21,095 INFO  L495      AbstractCegarLoop]: Abstraction has has 95 places, 122 transitions, 975 flow
[2023-10-25 14:56:21,096 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-25 14:56:21,096 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 14:56:21,096 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-25 14:56:21,113 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0
[2023-10-25 14:56:21,300 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-25 14:56:21,301 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-25 14:56:21,301 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 14:56:21,301 INFO  L85        PathProgramCache]: Analyzing trace with hash 1574108551, now seen corresponding path program 1 times
[2023-10-25 14:56:21,301 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 14:56:21,301 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866228789]
[2023-10-25 14:56:21,301 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 14:56:21,302 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 14:56:21,448 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 14:56:23,427 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-25 14:56:23,427 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 14:56:23,427 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866228789]
[2023-10-25 14:56:23,427 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866228789] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-25 14:56:23,427 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [581792865]
[2023-10-25 14:56:23,427 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 14:56:23,427 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-25 14:56:23,427 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-25 14:56:23,430 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-25 14:56:23,485 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-25 14:56:23,635 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 14:56:23,637 INFO  L263         TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 60 conjunts are in the unsatisfiable core
[2023-10-25 14:56:23,650 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-25 14:56:23,890 INFO  L321             Elim1Store]: treesize reduction 36, result has 23.4 percent of original size
[2023-10-25 14:56:23,890 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-25 14:56:23,895 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 14:56:23,896 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-25 14:56:24,424 INFO  L321             Elim1Store]: treesize reduction 36, result has 23.4 percent of original size
[2023-10-25 14:56:24,424 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-25 14:56:24,435 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 14:56:24,436 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-25 14:56:24,654 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-25 14:56:24,732 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 14:56:24,733 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-25 14:56:24,815 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 14:56:24,816 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 14:56:24,818 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-25 14:56:24,933 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 14:56:24,934 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 14:56:24,949 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 14:56:24,951 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-25 14:56:25,147 INFO  L321             Elim1Store]: treesize reduction 11, result has 45.0 percent of original size
[2023-10-25 14:56:25,148 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-25 14:56:25,160 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-25 14:56:25,180 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-25 14:56:25,186 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-25 14:56:25,280 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 14:56:25,281 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-25 14:56:25,301 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 14:56:25,302 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-25 14:56:25,320 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 14:56:25,322 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-25 14:56:25,451 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 14:56:25,452 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 14:56:25,470 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 14:56:25,471 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 14:56:25,472 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 14:56:25,474 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 14:56:25,475 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 14:56:25,477 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-25 14:56:25,477 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-25 14:56:25,531 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-25 14:56:25,535 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-25 14:56:27,686 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-25 14:56:29,767 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-25 14:56:31,882 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-25 14:56:33,991 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-25 14:56:35,644 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-25 14:56:35,725 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-25 14:56:35,726 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-25 14:56:35,754 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-25 14:56:35,754 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-25 14:56:35,766 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-25 14:56:35,795 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-25 14:56:35,862 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-25 14:56:35,862 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-25 14:56:36,064 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-25 14:56:36,064 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-25 14:56:36,069 INFO  L173   IndexEqualityManager]: detected equality via solver
[2023-10-25 14:56:36,078 INFO  L321             Elim1Store]: treesize reduction 8, result has 33.3 percent of original size
[2023-10-25 14:56:36,081 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 144 treesize of output 130
[2023-10-25 14:56:36,092 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 61
[2023-10-25 14:56:36,118 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-25 14:56:36,162 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2023-10-25 14:56:36,165 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-25 14:56:36,173 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2023-10-25 14:56:36,173 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-25 14:56:36,888 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-25 14:56:36,997 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-25 14:56:36,999 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-25 14:56:37,000 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [581792865] provided 0 perfect and 2 imperfect interpolant sequences
[2023-10-25 14:56:37,000 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-10-25 14:56:37,000 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15, 16] total 47
[2023-10-25 14:56:37,000 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435340480]
[2023-10-25 14:56:37,000 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-10-25 14:56:37,001 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 49 states
[2023-10-25 14:56:37,002 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 14:56:37,002 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants.
[2023-10-25 14:56:37,003 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=215, Invalid=1519, Unknown=16, NotChecked=602, Total=2352
[2023-10-25 14:56:37,260 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 50 out of 220
[2023-10-25 14:56:37,262 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-25 14:56:37,262 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 14:56:37,262 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 220
[2023-10-25 14:56:37,263 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 14:57:03,955 WARN  L233               SmtUtils]: Spent 7.75s 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-25 14:57:09,680 INFO  L130       PetriNetUnfolder]: 466/1118 cut-off events.
[2023-10-25 14:57:09,680 INFO  L131       PetriNetUnfolder]: For 2119/2119 co-relation queries the response was YES.
[2023-10-25 14:57:09,682 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-25 14:57:09,692 INFO  L137   encePairwiseOnDemand]: 200/220 looper letters, 188 selfloop transitions, 56 changer transitions 0/245 dead transitions.
[2023-10-25 14:57:09,693 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 245 transitions, 2197 flow
[2023-10-25 14:57:09,693 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. 
[2023-10-25 14:57:09,693 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 25 states.
[2023-10-25 14:57:09,701 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 1402 transitions.
[2023-10-25 14:57:09,703 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.2549090909090909
[2023-10-25 14:57:09,704 INFO  L72            ComplementDD]: Start complementDD. Operand 25 states and 1402 transitions.
[2023-10-25 14:57:09,704 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 25 states and 1402 transitions.
[2023-10-25 14:57:09,704 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 14:57:09,704 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 25 states and 1402 transitions.
[2023-10-25 14:57:09,709 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-25 14:57:09,732 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-25 14:57:09,734 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-25 14:57:09,734 INFO  L175             Difference]: Start difference. First operand has 95 places, 122 transitions, 975 flow. Second operand 25 states and 1402 transitions.
[2023-10-25 14:57:09,734 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 245 transitions, 2197 flow
[2023-10-25 14:57:09,760 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 245 transitions, 2168 flow, removed 0 selfloop flow, removed 3 redundant places.
[2023-10-25 14:57:09,763 INFO  L231             Difference]: Finished difference. Result has 123 places, 163 transitions, 1496 flow
[2023-10-25 14:57:09,763 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-25 14:57:09,768 INFO  L288   CegarLoopForPetriNet]: 66 programPoint places, 57 predicate places.
[2023-10-25 14:57:09,769 INFO  L495      AbstractCegarLoop]: Abstraction has has 123 places, 163 transitions, 1496 flow
[2023-10-25 14:57:09,769 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-25 14:57:09,769 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 14:57:09,770 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-25 14:57:09,792 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0
[2023-10-25 14:57:09,973 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-25 14:57:09,974 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-25 14:57:09,975 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 14:57:09,975 INFO  L85        PathProgramCache]: Analyzing trace with hash -324057465, now seen corresponding path program 2 times
[2023-10-25 14:57:09,975 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 14:57:09,975 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971596566]
[2023-10-25 14:57:09,975 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 14:57:09,976 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 14:57:10,012 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 14:57:11,773 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-25 14:57:11,773 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 14:57:11,773 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971596566]
[2023-10-25 14:57:11,773 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971596566] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-25 14:57:11,774 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [72747630]
[2023-10-25 14:57:11,774 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2023-10-25 14:57:11,774 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-25 14:57:11,774 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-25 14:57:11,790 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-25 14:57:11,817 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2023-10-25 14:57:12,038 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2023-10-25 14:57:12,038 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2023-10-25 14:57:12,055 INFO  L263         TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 59 conjunts are in the unsatisfiable core
[2023-10-25 14:57:12,058 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-25 14:57:12,325 INFO  L321             Elim1Store]: treesize reduction 36, result has 23.4 percent of original size
[2023-10-25 14:57:12,325 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-25 14:57:12,332 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 14:57:12,332 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-25 14:57:12,923 INFO  L321             Elim1Store]: treesize reduction 36, result has 23.4 percent of original size
[2023-10-25 14:57:12,923 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-25 14:57:12,933 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 14:57:12,934 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-25 14:57:13,242 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-25 14:57:13,247 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-25 14:57:13,340 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-25 14:57:13,417 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 14:57:13,417 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20
[2023-10-25 14:57:13,489 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 14:57:13,490 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 14:57:13,492 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-25 14:57:13,567 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 14:57:13,568 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 14:57:13,569 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 14:57:13,570 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-25 14:57:13,679 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 14:57:13,680 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 14:57:13,681 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 14:57:13,682 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 14:57:13,698 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 14:57:13,699 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 14:57:13,700 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 14:57:13,702 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-25 14:57:13,702 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-25 14:57:13,763 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-25 14:57:13,763 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-25 14:57:15,432 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-25 14:57:15,717 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-25 14:57:15,718 INFO  L134       CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked.
[2023-10-25 14:57:15,718 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [72747630] provided 0 perfect and 2 imperfect interpolant sequences
[2023-10-25 14:57:15,719 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-10-25 14:57:15,719 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 15] total 44
[2023-10-25 14:57:15,719 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144782146]
[2023-10-25 14:57:15,719 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-10-25 14:57:15,720 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 46 states
[2023-10-25 14:57:15,721 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 14:57:15,721 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants.
[2023-10-25 14:57:15,722 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=204, Invalid=1671, Unknown=25, NotChecked=170, Total=2070
[2023-10-25 14:57:15,918 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 50 out of 220
[2023-10-25 14:57:15,920 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-25 14:57:15,920 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 14:57:15,920 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 220
[2023-10-25 14:57:15,920 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 14:57:19,539 INFO  L130       PetriNetUnfolder]: 538/1273 cut-off events.
[2023-10-25 14:57:19,539 INFO  L131       PetriNetUnfolder]: For 4500/4500 co-relation queries the response was YES.
[2023-10-25 14:57:19,543 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-25 14:57:19,559 INFO  L137   encePairwiseOnDemand]: 200/220 looper letters, 282 selfloop transitions, 106 changer transitions 0/389 dead transitions.
[2023-10-25 14:57:19,567 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 389 transitions, 3888 flow
[2023-10-25 14:57:19,568 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. 
[2023-10-25 14:57:19,568 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 26 states.
[2023-10-25 14:57:19,579 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 1508 transitions.
[2023-10-25 14:57:19,579 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.2636363636363636
[2023-10-25 14:57:19,580 INFO  L72            ComplementDD]: Start complementDD. Operand 26 states and 1508 transitions.
[2023-10-25 14:57:19,580 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 26 states and 1508 transitions.
[2023-10-25 14:57:19,580 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 14:57:19,581 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 26 states and 1508 transitions.
[2023-10-25 14:57:19,583 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-25 14:57:19,603 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-25 14:57:19,604 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-25 14:57:19,605 INFO  L175             Difference]: Start difference. First operand has 123 places, 163 transitions, 1496 flow. Second operand 26 states and 1508 transitions.
[2023-10-25 14:57:19,605 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 389 transitions, 3888 flow
[2023-10-25 14:57:19,640 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 389 transitions, 3819 flow, removed 22 selfloop flow, removed 8 redundant places.
[2023-10-25 14:57:19,644 INFO  L231             Difference]: Finished difference. Result has 149 places, 234 transitions, 2434 flow
[2023-10-25 14:57:19,644 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-25 14:57:19,645 INFO  L288   CegarLoopForPetriNet]: 66 programPoint places, 83 predicate places.
[2023-10-25 14:57:19,645 INFO  L495      AbstractCegarLoop]: Abstraction has has 149 places, 234 transitions, 2434 flow
[2023-10-25 14:57:19,646 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-25 14:57:19,646 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 14:57:19,646 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-25 14:57:19,654 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-25 14:57:19,850 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-25 14:57:19,851 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-25 14:57:19,851 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 14:57:19,852 INFO  L85        PathProgramCache]: Analyzing trace with hash 1088014417, now seen corresponding path program 3 times
[2023-10-25 14:57:19,852 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 14:57:19,852 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881246485]
[2023-10-25 14:57:19,853 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 14:57:19,853 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 14:57:19,922 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 14:57:21,150 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-25 14:57:21,150 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 14:57:21,150 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881246485]
[2023-10-25 14:57:21,150 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881246485] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-25 14:57:21,150 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [822161056]
[2023-10-25 14:57:21,150 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2023-10-25 14:57:21,150 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-25 14:57:21,150 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-25 14:57:21,151 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-25 14:57:21,197 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-25 14:57:21,415 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s)
[2023-10-25 14:57:21,415 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2023-10-25 14:57:21,424 INFO  L263         TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 45 conjunts are in the unsatisfiable core
[2023-10-25 14:57:21,430 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-25 14:57:21,603 INFO  L321             Elim1Store]: treesize reduction 36, result has 23.4 percent of original size
[2023-10-25 14:57:21,603 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-25 14:57:22,017 INFO  L321             Elim1Store]: treesize reduction 36, result has 23.4 percent of original size
[2023-10-25 14:57:22,017 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-25 14:57:22,025 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 14:57:22,026 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-25 14:57:22,217 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-25 14:57:22,220 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-25 14:57:22,302 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-25 14:57:22,358 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-25 14:57:22,416 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-25 14:57:22,510 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-25 14:57:22,610 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 14:57:22,612 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 14:57:22,613 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 14:57:22,614 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 14:57:22,616 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-25 14:57:22,616 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-25 14:57:22,624 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-25 14:57:22,625 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-25 14:57:26,347 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-25 14:57:26,492 WARN  L837   $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~mem8#1.base_44| Int)) (or (forall ((v_ArrVal_944 (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_44| v_ArrVal_944) |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_44| (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-25 14:57:26,494 INFO  L134       CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked.
[2023-10-25 14:57:26,494 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [822161056] provided 0 perfect and 2 imperfect interpolant sequences
[2023-10-25 14:57:26,494 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-10-25 14:57:26,494 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 15] total 40
[2023-10-25 14:57:26,494 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400830436]
[2023-10-25 14:57:26,494 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-10-25 14:57:26,495 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 42 states
[2023-10-25 14:57:26,495 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 14:57:26,495 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants.
[2023-10-25 14:57:26,495 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=200, Invalid=1431, Unknown=13, NotChecked=78, Total=1722
[2023-10-25 14:57:27,388 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 50 out of 220
[2023-10-25 14:57:27,390 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-25 14:57:27,390 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 14:57:27,390 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 220
[2023-10-25 14:57:27,390 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 14:57:32,645 INFO  L130       PetriNetUnfolder]: 649/1537 cut-off events.
[2023-10-25 14:57:32,646 INFO  L131       PetriNetUnfolder]: For 9602/9602 co-relation queries the response was YES.
[2023-10-25 14:57:32,650 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 8144 conditions, 1537 events. 649/1537 cut-off events. For 9602/9602 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 8732 event pairs, 27 based on Foata normal form. 21/1537 useless extension candidates. Maximal degree in co-relation 8099. Up to 454 conditions per place. 
[2023-10-25 14:57:32,664 INFO  L137   encePairwiseOnDemand]: 201/220 looper letters, 291 selfloop transitions, 148 changer transitions 0/440 dead transitions.
[2023-10-25 14:57:32,664 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 440 transitions, 5114 flow
[2023-10-25 14:57:32,664 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. 
[2023-10-25 14:57:32,664 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 21 states.
[2023-10-25 14:57:32,667 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 1222 transitions.
[2023-10-25 14:57:32,667 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.2645021645021645
[2023-10-25 14:57:32,667 INFO  L72            ComplementDD]: Start complementDD. Operand 21 states and 1222 transitions.
[2023-10-25 14:57:32,667 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 21 states and 1222 transitions.
[2023-10-25 14:57:32,686 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 14:57:32,686 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 1222 transitions.
[2023-10-25 14:57:32,688 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-25 14:57:32,691 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-25 14:57:32,696 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-25 14:57:32,697 INFO  L175             Difference]: Start difference. First operand has 149 places, 234 transitions, 2434 flow. Second operand 21 states and 1222 transitions.
[2023-10-25 14:57:32,697 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 440 transitions, 5114 flow
[2023-10-25 14:57:32,758 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 440 transitions, 4973 flow, removed 29 selfloop flow, removed 11 redundant places.
[2023-10-25 14:57:32,770 INFO  L231             Difference]: Finished difference. Result has 171 places, 304 transitions, 3703 flow
[2023-10-25 14:57:32,786 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-25 14:57:32,787 INFO  L288   CegarLoopForPetriNet]: 66 programPoint places, 105 predicate places.
[2023-10-25 14:57:32,787 INFO  L495      AbstractCegarLoop]: Abstraction has has 171 places, 304 transitions, 3703 flow
[2023-10-25 14:57:32,787 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-25 14:57:32,787 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 14:57:32,788 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-25 14:57:32,794 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-25 14:57:32,992 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-25 14:57:32,992 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-25 14:57:32,993 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 14:57:32,993 INFO  L85        PathProgramCache]: Analyzing trace with hash 256816393, now seen corresponding path program 4 times
[2023-10-25 14:57:32,993 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 14:57:32,993 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843964109]
[2023-10-25 14:57:32,993 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 14:57:32,993 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 14:57:33,071 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 14:57:35,684 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-25 14:57:35,684 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 14:57:35,684 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843964109]
[2023-10-25 14:57:35,684 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843964109] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-25 14:57:35,684 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [591395848]
[2023-10-25 14:57:35,684 INFO  L93    rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2023-10-25 14:57:35,684 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-25 14:57:35,684 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-25 14:57:35,698 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-25 14:57:35,737 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-25 14:57:36,361 INFO  L228   tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s)
[2023-10-25 14:57:36,362 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2023-10-25 14:57:36,378 INFO  L263         TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 50 conjunts are in the unsatisfiable core
[2023-10-25 14:57:36,382 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-25 14:57:36,572 INFO  L321             Elim1Store]: treesize reduction 36, result has 23.4 percent of original size
[2023-10-25 14:57:36,572 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 49
[2023-10-25 14:57:36,998 INFO  L321             Elim1Store]: treesize reduction 36, result has 23.4 percent of original size
[2023-10-25 14:57:36,998 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-25 14:57:37,007 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 14:57:37,008 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-25 14:57:37,233 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-25 14:57:37,388 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-25 14:57:37,466 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-25 14:57:37,579 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-25 14:57:37,680 INFO  L321             Elim1Store]: treesize reduction 11, result has 45.0 percent of original size
[2023-10-25 14:57:37,681 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-25 14:57:37,686 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-25 14:57:37,687 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-25 14:57:37,698 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-25 14:57:37,704 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-25 14:57:37,787 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 14:57:37,788 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-25 14:57:37,824 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 14:57:37,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 41 treesize of output 37
[2023-10-25 14:57:37,857 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 14:57:37,858 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-25 14:57:37,974 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 14:57:37,975 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 14:57:37,976 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 14:57:37,977 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 14:57:37,979 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-25 14:57:37,980 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-25 14:57:37,997 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-25 14:57:37,998 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-25 14:57:38,275 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_1135 (Array Int Int)) (v_ArrVal_1137 Int)) (= (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1135))) (store .cse0 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse0 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_1137))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)) (forall ((v_ArrVal_1135 (Array Int Int)) (v_ArrVal_1137 Int)) (= (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1135))) (store .cse2 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse2 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_1137))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 3)) 0)) (forall ((v_ArrVal_1135 (Array Int Int)) (v_ArrVal_1137 Int)) (= (select (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1135))) (store .cse3 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse3 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_1137))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) 0)) (forall ((v_ArrVal_1135 (Array Int Int)) (v_ArrVal_1137 Int)) (= 0 (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1135))) (store .cse4 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse4 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_1137))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset))))) is different from false
[2023-10-25 14:57:38,475 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_1135 (Array Int Int)) (v_ArrVal_1137 Int)) (= (select (select (let ((.cse1 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1135))) (store .cse1 .cse2 (store (select .cse1 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_45| .cse3) v_ArrVal_1137))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)))) (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_1135 (Array Int Int)) (v_ArrVal_1137 Int)) (= (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1135))) (store .cse4 .cse2 (store (select .cse4 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_45| .cse3) v_ArrVal_1137))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_45| Int)) (or (forall ((v_ArrVal_1135 (Array Int Int)) (v_ArrVal_1137 Int)) (= (select (select (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1135))) (store .cse5 .cse2 (store (select .cse5 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_45| .cse3) v_ArrVal_1137))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 3)) 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_1135 (Array Int Int)) (v_ArrVal_1137 Int)) (= (select (select (let ((.cse6 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1135))) (store .cse6 .cse2 (store (select .cse6 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_45| .cse3) v_ArrVal_1137))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) 0)) (not (<= .cse0 |v_ULTIMATE.start_main_#t~mem8#1.offset_45|)))))) is different from false
[2023-10-25 14:57:38,550 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse8 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse2 (* |c_ULTIMATE.start_main_~i~1#1| 4)) (.cse3 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse8 0))) (.cse4 (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 (forall ((v_ArrVal_1135 (Array Int Int)) (v_ArrVal_1137 Int)) (= (select (select (let ((.cse0 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1135))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_45| .cse2) v_ArrVal_1137))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)) (not (<= .cse4 |v_ULTIMATE.start_main_#t~mem8#1.offset_45|)))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_45| Int)) (or (forall ((v_ArrVal_1135 (Array Int Int)) (v_ArrVal_1137 Int)) (= (select (select (let ((.cse5 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1135))) (store .cse5 .cse1 (store (select .cse5 .cse1) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_45| .cse2) v_ArrVal_1137))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) 0)) (not (<= .cse4 |v_ULTIMATE.start_main_#t~mem8#1.offset_45|)))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_45| Int)) (or (forall ((v_ArrVal_1135 (Array Int Int)) (v_ArrVal_1137 Int)) (= (select (select (let ((.cse6 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1135))) (store .cse6 .cse1 (store (select .cse6 .cse1) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_45| .cse2) v_ArrVal_1137))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)) (not (<= .cse4 |v_ULTIMATE.start_main_#t~mem8#1.offset_45|)))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_45| Int)) (or (forall ((v_ArrVal_1135 (Array Int Int)) (v_ArrVal_1137 Int)) (= (select (select (let ((.cse7 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1135))) (store .cse7 .cse1 (store (select .cse7 .cse1) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_45| .cse2) v_ArrVal_1137))) c_threadThread1of1ForFork0_~p~0.base) .cse8) 0)) (not (<= .cse4 |v_ULTIMATE.start_main_#t~mem8#1.offset_45|))))))) is different from false
[2023-10-25 14:57:38,622 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse7 (+ c_threadThread1of1ForFork0_~p~0.offset 2)) (.cse4 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse2 (* |c_ULTIMATE.start_main_~i~1#1| 4)) (.cse3 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse7 0) .cse4 0))) (.cse5 (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 (forall ((v_ArrVal_1135 (Array Int Int)) (v_ArrVal_1137 Int)) (= (select (select (let ((.cse0 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1135))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_45| .cse2) v_ArrVal_1137))) c_threadThread1of1ForFork0_~p~0.base) .cse4) 0)) (not (<= .cse5 |v_ULTIMATE.start_main_#t~mem8#1.offset_45|)))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_45| Int)) (or (forall ((v_ArrVal_1135 (Array Int Int)) (v_ArrVal_1137 Int)) (= (select (select (let ((.cse6 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1135))) (store .cse6 .cse1 (store (select .cse6 .cse1) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_45| .cse2) v_ArrVal_1137))) c_threadThread1of1ForFork0_~p~0.base) .cse7) 0)) (not (<= .cse5 |v_ULTIMATE.start_main_#t~mem8#1.offset_45|)))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_45| Int)) (or (not (<= .cse5 |v_ULTIMATE.start_main_#t~mem8#1.offset_45|)) (forall ((v_ArrVal_1135 (Array Int Int)) (v_ArrVal_1137 Int)) (= (select (select (let ((.cse8 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1135))) (store .cse8 .cse1 (store (select .cse8 .cse1) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_45| .cse2) v_ArrVal_1137))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_45| Int)) (or (forall ((v_ArrVal_1135 (Array Int Int)) (v_ArrVal_1137 Int)) (= (select (select (let ((.cse9 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1135))) (store .cse9 .cse1 (store (select .cse9 .cse1) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_45| .cse2) v_ArrVal_1137))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)) (not (<= .cse5 |v_ULTIMATE.start_main_#t~mem8#1.offset_45|))))))) is different from false
[2023-10-25 14:57:43,226 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse10 (+ c_threadThread1of1ForFork0_~p~0.offset 1)) (.cse8 (+ c_threadThread1of1ForFork0_~p~0.offset 2)) (.cse3 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (let ((.cse5 (+ |c_ULTIMATE.start_main_~i~1#1| 1)) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse2 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (store (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse10 0) .cse8 0) .cse3 0))) (.cse4 (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_~i~1#1_72| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_45| Int)) (or (forall ((v_ArrVal_1135 (Array Int Int)) (v_ArrVal_1137 Int)) (= (select (select (let ((.cse0 (store .cse2 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1135))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_45| (* |v_ULTIMATE.start_main_~i~1#1_72| 4)) v_ArrVal_1137))) c_threadThread1of1ForFork0_~p~0.base) .cse3) 0)) (not (<= .cse4 |v_ULTIMATE.start_main_#t~mem8#1.offset_45|)))) (not (<= .cse5 |v_ULTIMATE.start_main_~i~1#1_72|)))) (forall ((|v_ULTIMATE.start_main_~i~1#1_72| Int)) (or (not (<= .cse5 |v_ULTIMATE.start_main_~i~1#1_72|)) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_45| Int)) (or (not (<= .cse4 |v_ULTIMATE.start_main_#t~mem8#1.offset_45|)) (forall ((v_ArrVal_1135 (Array Int Int)) (v_ArrVal_1137 Int)) (= (select (select (let ((.cse6 (store .cse2 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1135))) (store .cse6 .cse1 (store (select .cse6 .cse1) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_45| (* |v_ULTIMATE.start_main_~i~1#1_72| 4)) v_ArrVal_1137))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)))))) (forall ((|v_ULTIMATE.start_main_~i~1#1_72| Int)) (or (not (<= .cse5 |v_ULTIMATE.start_main_~i~1#1_72|)) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_45| Int)) (or (forall ((v_ArrVal_1135 (Array Int Int)) (v_ArrVal_1137 Int)) (= (select (select (let ((.cse7 (store .cse2 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1135))) (store .cse7 .cse1 (store (select .cse7 .cse1) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_45| (* |v_ULTIMATE.start_main_~i~1#1_72| 4)) v_ArrVal_1137))) c_threadThread1of1ForFork0_~p~0.base) .cse8) 0)) (not (<= .cse4 |v_ULTIMATE.start_main_#t~mem8#1.offset_45|)))))) (forall ((|v_ULTIMATE.start_main_~i~1#1_72| Int)) (or (not (<= .cse5 |v_ULTIMATE.start_main_~i~1#1_72|)) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_45| Int)) (or (forall ((v_ArrVal_1135 (Array Int Int)) (v_ArrVal_1137 Int)) (= (select (select (let ((.cse9 (store .cse2 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1135))) (store .cse9 .cse1 (store (select .cse9 .cse1) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_45| (* |v_ULTIMATE.start_main_~i~1#1_72| 4)) v_ArrVal_1137))) c_threadThread1of1ForFork0_~p~0.base) .cse10) 0)) (not (<= .cse4 |v_ULTIMATE.start_main_#t~mem8#1.offset_45|))))))))) is different from false
[2023-10-25 14:57:43,286 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-25 14:57:43,287 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-25 14:57:43,301 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-25 14:57:43,301 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-25 14:57:43,318 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-25 14:57:43,339 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-25 14:57:43,395 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-25 14:57:43,396 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-25 14:57:43,522 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-25 14:57:43,523 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-25 14:57:43,528 INFO  L173   IndexEqualityManager]: detected equality via solver
[2023-10-25 14:57:43,537 INFO  L321             Elim1Store]: treesize reduction 8, result has 33.3 percent of original size
[2023-10-25 14:57:43,538 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-25 14:57:43,547 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-25 14:57:43,566 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-25 14:57:43,609 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-25 14:57:43,610 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-25 14:57:43,615 INFO  L173   IndexEqualityManager]: detected equality via solver
[2023-10-25 14:57:43,638 INFO  L321             Elim1Store]: treesize reduction 8, result has 33.3 percent of original size
[2023-10-25 14:57:43,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 144 treesize of output 130
[2023-10-25 14:57:43,646 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-25 14:57:43,653 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-25 14:57:43,708 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-25 14:57:43,709 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-25 14:57:43,713 INFO  L173   IndexEqualityManager]: detected equality via solver
[2023-10-25 14:57:43,736 INFO  L321             Elim1Store]: treesize reduction 8, result has 33.3 percent of original size
[2023-10-25 14:57:43,737 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-25 14:57:43,745 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-25 14:57:43,752 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-25 14:57:46,251 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-25 14:57:46,256 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-25 14:57:46,397 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_1121 (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_1121) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))))) is different from false
[2023-10-25 14:57:46,419 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_1121 (Array Int Int))) (not (= |c_ULTIMATE.start_main_~#is~0#1.base| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1121) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)))))) is different from false
[2023-10-25 14:57:46,434 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-25 14:57:46,434 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [591395848] provided 0 perfect and 2 imperfect interpolant sequences
[2023-10-25 14:57:46,434 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-10-25 14:57:46,434 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15, 16] total 46
[2023-10-25 14:57:46,435 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973180509]
[2023-10-25 14:57:46,435 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-10-25 14:57:46,435 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 48 states
[2023-10-25 14:57:46,435 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 14:57:46,435 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants.
[2023-10-25 14:57:46,436 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=1459, Unknown=21, NotChecked=588, Total=2256
[2023-10-25 14:57:48,811 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-25 14:57:50,560 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2023-10-25 14:57:59,008 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2023-10-25 14:58:01,195 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-25 14:58:03,104 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2023-10-25 14:58:05,125 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2023-10-25 14:58:07,462 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-25 14:58:10,501 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 50 out of 220
[2023-10-25 14:58:10,502 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 304 transitions, 3703 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-25 14:58:10,502 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 14:58:10,502 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 220
[2023-10-25 14:58:10,502 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 14:58:23,161 INFO  L130       PetriNetUnfolder]: 724/1763 cut-off events.
[2023-10-25 14:58:23,161 INFO  L131       PetriNetUnfolder]: For 17669/17669 co-relation queries the response was YES.
[2023-10-25 14:58:23,174 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 10639 conditions, 1763 events. 724/1763 cut-off events. For 17669/17669 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 10613 event pairs, 140 based on Foata normal form. 16/1779 useless extension candidates. Maximal degree in co-relation 10581. Up to 1044 conditions per place. 
[2023-10-25 14:58:23,182 INFO  L137   encePairwiseOnDemand]: 195/220 looper letters, 305 selfloop transitions, 155 changer transitions 0/461 dead transitions.
[2023-10-25 14:58:23,183 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 461 transitions, 5899 flow
[2023-10-25 14:58:23,184 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. 
[2023-10-25 14:58:23,184 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 28 states.
[2023-10-25 14:58:23,191 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 1606 transitions.
[2023-10-25 14:58:23,191 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.26071428571428573
[2023-10-25 14:58:23,192 INFO  L72            ComplementDD]: Start complementDD. Operand 28 states and 1606 transitions.
[2023-10-25 14:58:23,192 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 28 states and 1606 transitions.
[2023-10-25 14:58:23,195 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 14:58:23,195 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 28 states and 1606 transitions.
[2023-10-25 14:58:23,202 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 29 states, 28 states have (on average 57.357142857142854) internal successors, (1606), 28 states have internal predecessors, (1606), 0 states have call successors, (0), 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-25 14:58:23,208 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 29 states, 29 states have (on average 220.0) internal successors, (6380), 29 states have internal predecessors, (6380), 0 states have call successors, (0), 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-25 14:58:23,209 INFO  L81            ComplementDD]: Finished complementDD. Result  has 29 states, 29 states have (on average 220.0) internal successors, (6380), 29 states have internal predecessors, (6380), 0 states have call successors, (0), 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-25 14:58:23,209 INFO  L175             Difference]: Start difference. First operand has 171 places, 304 transitions, 3703 flow. Second operand 28 states and 1606 transitions.
[2023-10-25 14:58:23,209 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 461 transitions, 5899 flow
[2023-10-25 14:58:23,459 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 461 transitions, 5821 flow, removed 28 selfloop flow, removed 7 redundant places.
[2023-10-25 14:58:23,466 INFO  L231             Difference]: Finished difference. Result has 202 places, 372 transitions, 5089 flow
[2023-10-25 14:58:23,466 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=92, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=180, PETRI_DIFFERENCE_SUBTRAHEND_STATES=28, PETRI_FLOW=5089, PETRI_PLACES=202, PETRI_TRANSITIONS=372}
[2023-10-25 14:58:23,466 INFO  L288   CegarLoopForPetriNet]: 66 programPoint places, 136 predicate places.
[2023-10-25 14:58:23,466 INFO  L495      AbstractCegarLoop]: Abstraction has has 202 places, 372 transitions, 5089 flow
[2023-10-25 14:58:23,470 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-25 14:58:23,470 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 14:58:23,470 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-25 14:58:23,478 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-25 14:58:23,676 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-25 14:58:23,677 INFO  L420      AbstractCegarLoop]: === Iteration 12 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2023-10-25 14:58:23,677 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 14:58:23,678 INFO  L85        PathProgramCache]: Analyzing trace with hash -908669383, now seen corresponding path program 5 times
[2023-10-25 14:58:23,678 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 14:58:23,678 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338523281]
[2023-10-25 14:58:23,679 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 14:58:23,682 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 14:58:23,729 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 14:58:25,178 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-25 14:58:25,178 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 14:58:25,179 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338523281]
[2023-10-25 14:58:25,179 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338523281] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-25 14:58:25,179 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1497311844]
[2023-10-25 14:58:25,179 INFO  L93    rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1
[2023-10-25 14:58:25,179 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-25 14:58:25,179 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-25 14:58:25,180 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-25 14:58:25,221 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-25 14:58:25,479 INFO  L228   tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2023-10-25 14:58:25,479 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2023-10-25 14:58:25,481 INFO  L263         TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 61 conjunts are in the unsatisfiable core
[2023-10-25 14:58:25,486 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-25 14:58:25,701 INFO  L321             Elim1Store]: treesize reduction 11, result has 45.0 percent of original size
[2023-10-25 14:58:25,701 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 21 treesize of output 25
[2023-10-25 14:58:25,705 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 11 treesize of output 7
[2023-10-25 14:58:25,740 INFO  L321             Elim1Store]: treesize reduction 36, result has 23.4 percent of original size
[2023-10-25 14:58:25,740 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-25 14:58:26,228 INFO  L321             Elim1Store]: treesize reduction 36, result has 23.4 percent of original size
[2023-10-25 14:58:26,229 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-25 14:58:26,236 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 14:58:26,237 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-25 14:58:26,492 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-25 14:58:26,507 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-25 14:58:26,507 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 51 treesize of output 39
[2023-10-25 14:58:26,583 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-25 14:58:26,659 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 14:58:26,660 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-25 14:58:26,723 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 14:58:26,724 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 14:58:26,725 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-25 14:58:26,790 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 14:58:26,791 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 14:58:26,793 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 14:58:26,797 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-25 14:58:26,891 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 14:58:26,892 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 14:58:26,893 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 14:58:26,894 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 14:58:26,895 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 14:58:26,896 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 14:58:26,896 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 14:58:26,898 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-25 14:58:26,898 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-25 14:58:26,952 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-25 14:58:26,952 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-25 14:58:28,658 WARN  L837   $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1305 (Array Int Int)) (v_ArrVal_1304 (Array Int Int)) (v_ArrVal_1303 (Array Int Int)) (v_ArrVal_1302 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1302))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (or (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1303))) (< (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_1304) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) 1))) (not (= (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_1305) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))))))) is different from false
[2023-10-25 14:58:28,732 WARN  L837   $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1305 (Array Int Int)) (v_ArrVal_1304 (Array Int Int)) (v_ArrVal_1303 (Array Int Int)) (v_ArrVal_1302 (Array Int Int))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (let ((.cse0 (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_1302))) (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 .cse0 |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) (select (select (store .cse0 .cse1 v_ArrVal_1305) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (let ((.cse2 (store |c_#memory_$Pointer$.offset| .cse3 v_ArrVal_1303))) (< (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_1304) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) 1)))))))) is different from false
[2023-10-25 14:58:28,735 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-25 14:58:28,735 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1497311844] provided 0 perfect and 2 imperfect interpolant sequences
[2023-10-25 14:58:28,735 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-10-25 14:58:28,735 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 15] total 44
[2023-10-25 14:58:28,735 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344711139]
[2023-10-25 14:58:28,735 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-10-25 14:58:28,736 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 46 states
[2023-10-25 14:58:28,736 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 14:58:28,736 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants.
[2023-10-25 14:58:28,736 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=1671, Unknown=19, NotChecked=170, Total=2070
[2023-10-25 14:58:29,590 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 50 out of 220
[2023-10-25 14:58:29,591 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 372 transitions, 5089 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-25 14:58:29,591 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 14:58:29,591 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 220
[2023-10-25 14:58:29,591 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 14:58:36,027 INFO  L130       PetriNetUnfolder]: 911/2151 cut-off events.
[2023-10-25 14:58:36,028 INFO  L131       PetriNetUnfolder]: For 32311/32311 co-relation queries the response was YES.
[2023-10-25 14:58:36,034 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 14513 conditions, 2151 events. 911/2151 cut-off events. For 32311/32311 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 13384 event pairs, 57 based on Foata normal form. 21/2172 useless extension candidates. Maximal degree in co-relation 14444. Up to 490 conditions per place. 
[2023-10-25 14:58:36,052 INFO  L137   encePairwiseOnDemand]: 200/220 looper letters, 418 selfloop transitions, 200 changer transitions 0/619 dead transitions.
[2023-10-25 14:58:36,052 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 619 transitions, 8913 flow
[2023-10-25 14:58:36,053 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. 
[2023-10-25 14:58:36,053 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 24 states.
[2023-10-25 14:58:36,067 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 1417 transitions.
[2023-10-25 14:58:36,069 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.2683712121212121
[2023-10-25 14:58:36,069 INFO  L72            ComplementDD]: Start complementDD. Operand 24 states and 1417 transitions.
[2023-10-25 14:58:36,069 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 24 states and 1417 transitions.
[2023-10-25 14:58:36,070 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 14:58:36,070 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 24 states and 1417 transitions.
[2023-10-25 14:58:36,071 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 25 states, 24 states have (on average 59.041666666666664) internal successors, (1417), 24 states have internal predecessors, (1417), 0 states have call successors, (0), 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-25 14:58:36,075 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 25 states, 25 states have (on average 220.0) internal successors, (5500), 25 states have internal predecessors, (5500), 0 states have call successors, (0), 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-25 14:58:36,075 INFO  L81            ComplementDD]: Finished complementDD. Result  has 25 states, 25 states have (on average 220.0) internal successors, (5500), 25 states have internal predecessors, (5500), 0 states have call successors, (0), 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-25 14:58:36,075 INFO  L175             Difference]: Start difference. First operand has 202 places, 372 transitions, 5089 flow. Second operand 24 states and 1417 transitions.
[2023-10-25 14:58:36,076 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 619 transitions, 8913 flow
[2023-10-25 14:58:36,305 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 211 places, 619 transitions, 8687 flow, removed 70 selfloop flow, removed 14 redundant places.
[2023-10-25 14:58:36,314 INFO  L231             Difference]: Finished difference. Result has 221 places, 435 transitions, 6391 flow
[2023-10-25 14:58:36,314 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=220, PETRI_DIFFERENCE_MINUEND_FLOW=4895, PETRI_DIFFERENCE_MINUEND_PLACES=188, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=372, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=142, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=194, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=6391, PETRI_PLACES=221, PETRI_TRANSITIONS=435}
[2023-10-25 14:58:36,315 INFO  L288   CegarLoopForPetriNet]: 66 programPoint places, 155 predicate places.
[2023-10-25 14:58:36,315 INFO  L495      AbstractCegarLoop]: Abstraction has has 221 places, 435 transitions, 6391 flow
[2023-10-25 14:58:36,316 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-25 14:58:36,316 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 14:58:36,316 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-25 14:58:36,323 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-25 14:58:36,521 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-25 14:58:36,521 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-25 14:58:36,522 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 14:58:36,522 INFO  L85        PathProgramCache]: Analyzing trace with hash 1305511343, now seen corresponding path program 6 times
[2023-10-25 14:58:36,523 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 14:58:36,523 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128559323]
[2023-10-25 14:58:36,523 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 14:58:36,524 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 14:58:36,595 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 14:58:37,969 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-25 14:58:37,970 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 14:58:37,970 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128559323]
[2023-10-25 14:58:37,970 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128559323] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-25 14:58:37,970 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [461642563]
[2023-10-25 14:58:37,970 INFO  L93    rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE
[2023-10-25 14:58:37,970 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-25 14:58:37,970 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-25 14:58:37,971 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-25 14:58:37,997 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-25 14:58:38,146 INFO  L228   tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s)
[2023-10-25 14:58:38,146 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2023-10-25 14:58:38,148 INFO  L263         TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 61 conjunts are in the unsatisfiable core
[2023-10-25 14:58:38,158 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-25 14:58:38,428 INFO  L321             Elim1Store]: treesize reduction 36, result has 23.4 percent of original size
[2023-10-25 14:58:38,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 3 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 57
[2023-10-25 14:58:38,450 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 14:58:38,451 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-25 14:58:38,948 INFO  L321             Elim1Store]: treesize reduction 36, result has 23.4 percent of original size
[2023-10-25 14:58:38,948 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-25 14:58:38,965 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 14:58:38,965 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-25 14:58:39,348 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-25 14:58:39,440 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-25 14:58:39,470 INFO  L321             Elim1Store]: treesize reduction 11, result has 45.0 percent of original size
[2023-10-25 14:58:39,470 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-25 14:58:39,477 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-25 14:58:39,481 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-25 14:58:39,559 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 14:58:39,559 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-25 14:58:39,575 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 14:58:39,576 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-25 14:58:39,642 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 14:58:39,643 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-25 14:58:39,688 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 14:58:39,689 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 14:58:39,690 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-25 14:58:39,801 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 14:58:39,802 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-25 14:58:39,887 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 14:58:39,888 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 14:58:39,889 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 14:58:39,889 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-25 14:58:40,029 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 14:58:40,030 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 14:58:40,032 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 14:58:40,033 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 14:58:40,034 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 14:58:40,047 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 14:58:40,048 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 14:58:40,050 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-25 14:58:40,051 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-25 14:58:40,116 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-25 14:58:40,116 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-25 14:58:40,419 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-25 14:58:41,103 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))) (.cse5 (+ c_threadThread1of1ForFork0_~p~0.offset 2)) (.cse3 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (and (forall ((v_ArrVal_1497 Int) (v_ArrVal_1493 (Array Int Int)) (v_ArrVal_1490 (Array Int Int))) (= (select (select (let ((.cse0 (let ((.cse2 (store (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1490))) (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_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) .cse5) 0)) (forall ((v_ArrVal_1497 Int) (v_ArrVal_1493 (Array Int Int)) (v_ArrVal_1490 (Array Int Int))) (= (select (select (let ((.cse6 (let ((.cse7 (store (let ((.cse8 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1490))) (store .cse8 c_threadThread1of1ForFork0_~p~0.base (store (select .cse8 c_threadThread1of1ForFork0_~p~0.base) .cse5 0))) |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 1)) 0)) (forall ((v_ArrVal_1497 Int) (v_ArrVal_1493 (Array Int Int)) (v_ArrVal_1490 (Array Int Int))) (= (select (select (let ((.cse9 (let ((.cse10 (store (let ((.cse11 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1490))) (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_1493))) (store .cse10 c_threadThread1of1ForFork0_~p~0.base (store (select .cse10 c_threadThread1of1ForFork0_~p~0.base) .cse3 0))))) (store .cse9 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse9 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_1497))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)) (forall ((v_ArrVal_1497 Int) (v_ArrVal_1493 (Array Int Int)) (v_ArrVal_1490 (Array Int Int))) (= (select (select (let ((.cse12 (let ((.cse13 (store (let ((.cse14 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1490))) (store .cse14 c_threadThread1of1ForFork0_~p~0.base (store (select .cse14 c_threadThread1of1ForFork0_~p~0.base) .cse5 0))) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1493))) (store .cse13 c_threadThread1of1ForFork0_~p~0.base (store (select .cse13 c_threadThread1of1ForFork0_~p~0.base) .cse3 0))))) (store .cse12 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse12 |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-25 14:58:41,137 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse16 (+ c_threadThread1of1ForFork0_~p~0.offset 1))) (let ((.cse1 (+ |c_ULTIMATE.start_main_#t~mem8#1.offset| (* |c_ULTIMATE.start_main_~i~1#1| 4))) (.cse3 (+ c_threadThread1of1ForFork0_~p~0.offset 3)) (.cse5 (+ c_threadThread1of1ForFork0_~p~0.offset 2)) (.cse6 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse16 0)))) (and (forall ((v_ArrVal_1497 Int) (v_ArrVal_1493 (Array Int Int)) (v_ArrVal_1490 (Array Int Int))) (= 0 (select (select (let ((.cse0 (let ((.cse2 (store (let ((.cse4 (store .cse6 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1490))) (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_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) .cse3))) (forall ((v_ArrVal_1497 Int) (v_ArrVal_1493 (Array Int Int)) (v_ArrVal_1490 (Array Int Int))) (= (select (select (let ((.cse7 (let ((.cse8 (store (let ((.cse9 (store .cse6 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1490))) (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_1493))) (store .cse8 c_threadThread1of1ForFork0_~p~0.base (store (select .cse8 c_threadThread1of1ForFork0_~p~0.base) .cse3 0))))) (store .cse7 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse7 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_1497))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)) (forall ((v_ArrVal_1497 Int) (v_ArrVal_1493 (Array Int Int)) (v_ArrVal_1490 (Array Int Int))) (= (select (select (let ((.cse10 (let ((.cse11 (store (let ((.cse12 (store .cse6 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1490))) (store .cse12 c_threadThread1of1ForFork0_~p~0.base (store (select .cse12 c_threadThread1of1ForFork0_~p~0.base) .cse5 0))) |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) .cse3 0))))) (store .cse10 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse10 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_1497))) c_threadThread1of1ForFork0_~p~0.base) .cse5) 0)) (forall ((v_ArrVal_1497 Int) (v_ArrVal_1493 (Array Int Int)) (v_ArrVal_1490 (Array Int Int))) (= (select (select (let ((.cse13 (let ((.cse14 (store (let ((.cse15 (store .cse6 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1490))) (store .cse15 c_threadThread1of1ForFork0_~p~0.base (store (select .cse15 c_threadThread1of1ForFork0_~p~0.base) .cse5 0))) |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) .cse3 0))))) (store .cse13 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse13 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_1497))) c_threadThread1of1ForFork0_~p~0.base) .cse16) 0))))) is different from false
[2023-10-25 14:58:41,183 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))) (.cse5 (+ c_threadThread1of1ForFork0_~p~0.offset 2)) (.cse7 (+ c_threadThread1of1ForFork0_~p~0.offset 1)) (.cse3 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (and (forall ((v_ArrVal_1497 Int) (v_ArrVal_1487 (Array Int Int)) (v_ArrVal_1493 (Array Int Int)) (v_ArrVal_1490 (Array Int Int))) (= (select (select (let ((.cse0 (let ((.cse2 (store (let ((.cse4 (store (let ((.cse6 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1487))) (store .cse6 c_threadThread1of1ForFork0_~p~0.base (store (select .cse6 c_threadThread1of1ForFork0_~p~0.base) .cse7 0))) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1490))) (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_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) .cse5) 0)) (forall ((v_ArrVal_1497 Int) (v_ArrVal_1487 (Array Int Int)) (v_ArrVal_1493 (Array Int Int)) (v_ArrVal_1490 (Array Int Int))) (= (select (select (let ((.cse8 (let ((.cse9 (store (let ((.cse10 (store (let ((.cse11 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1487))) (store .cse11 c_threadThread1of1ForFork0_~p~0.base (store (select .cse11 c_threadThread1of1ForFork0_~p~0.base) .cse7 0))) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1490))) (store .cse10 c_threadThread1of1ForFork0_~p~0.base (store (select .cse10 c_threadThread1of1ForFork0_~p~0.base) .cse5 0))) |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) .cse7) 0)) (forall ((v_ArrVal_1497 Int) (v_ArrVal_1487 (Array Int Int)) (v_ArrVal_1493 (Array Int Int)) (v_ArrVal_1490 (Array Int Int))) (= (select (select (let ((.cse12 (let ((.cse13 (store (let ((.cse14 (store (let ((.cse15 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1487))) (store .cse15 c_threadThread1of1ForFork0_~p~0.base (store (select .cse15 c_threadThread1of1ForFork0_~p~0.base) .cse7 0))) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1490))) (store .cse14 c_threadThread1of1ForFork0_~p~0.base (store (select .cse14 c_threadThread1of1ForFork0_~p~0.base) .cse5 0))) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1493))) (store .cse13 c_threadThread1of1ForFork0_~p~0.base (store (select .cse13 c_threadThread1of1ForFork0_~p~0.base) .cse3 0))))) (store .cse12 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse12 |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_1487 (Array Int Int)) (v_ArrVal_1493 (Array Int Int)) (v_ArrVal_1490 (Array Int Int))) (= (select (select (let ((.cse16 (let ((.cse17 (store (let ((.cse18 (store (let ((.cse19 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1487))) (store .cse19 c_threadThread1of1ForFork0_~p~0.base (store (select .cse19 c_threadThread1of1ForFork0_~p~0.base) .cse7 0))) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1490))) (store .cse18 c_threadThread1of1ForFork0_~p~0.base (store (select .cse18 c_threadThread1of1ForFork0_~p~0.base) .cse5 0))) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1493))) (store .cse17 c_threadThread1of1ForFork0_~p~0.base (store (select .cse17 c_threadThread1of1ForFork0_~p~0.base) .cse3 0))))) (store .cse16 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse16 |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-25 14:58:41,236 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)) (.cse5 (+ c_threadThread1of1ForFork0_~p~0.offset 3)) (.cse7 (+ c_threadThread1of1ForFork0_~p~0.offset 2)) (.cse9 (+ c_threadThread1of1ForFork0_~p~0.offset 1)) (.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_50| Int)) (or (not (<= .cse0 |v_ULTIMATE.start_main_#t~mem8#1.offset_50|)) (forall ((v_ArrVal_1497 Int) (v_ArrVal_1487 (Array Int Int)) (v_ArrVal_1493 (Array Int Int)) (v_ArrVal_1490 (Array Int Int))) (= (select (select (let ((.cse1 (let ((.cse4 (store (let ((.cse6 (store (let ((.cse8 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1487))) (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_1490))) (store .cse6 c_threadThread1of1ForFork0_~p~0.base (store (select .cse6 c_threadThread1of1ForFork0_~p~0.base) .cse7 0))) |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_50| .cse3) v_ArrVal_1497))) c_threadThread1of1ForFork0_~p~0.base) .cse9) 0)))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_50| Int)) (or (forall ((v_ArrVal_1497 Int) (v_ArrVal_1487 (Array Int Int)) (v_ArrVal_1493 (Array Int Int)) (v_ArrVal_1490 (Array Int Int))) (= (select (select (let ((.cse10 (let ((.cse11 (store (let ((.cse12 (store (let ((.cse13 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1487))) (store .cse13 c_threadThread1of1ForFork0_~p~0.base (store (select .cse13 c_threadThread1of1ForFork0_~p~0.base) .cse9 0))) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1490))) (store .cse12 c_threadThread1of1ForFork0_~p~0.base (store (select .cse12 c_threadThread1of1ForFork0_~p~0.base) .cse7 0))) |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_50| .cse3) v_ArrVal_1497))) c_threadThread1of1ForFork0_~p~0.base) .cse7) 0)) (not (<= .cse0 |v_ULTIMATE.start_main_#t~mem8#1.offset_50|)))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_50| Int)) (or (forall ((v_ArrVal_1497 Int) (v_ArrVal_1487 (Array Int Int)) (v_ArrVal_1493 (Array Int Int)) (v_ArrVal_1490 (Array Int Int))) (= (select (select (let ((.cse14 (let ((.cse15 (store (let ((.cse16 (store (let ((.cse17 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1487))) (store .cse17 c_threadThread1of1ForFork0_~p~0.base (store (select .cse17 c_threadThread1of1ForFork0_~p~0.base) .cse9 0))) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1490))) (store .cse16 c_threadThread1of1ForFork0_~p~0.base (store (select .cse16 c_threadThread1of1ForFork0_~p~0.base) .cse7 0))) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1493))) (store .cse15 c_threadThread1of1ForFork0_~p~0.base (store (select .cse15 c_threadThread1of1ForFork0_~p~0.base) .cse5 0))))) (store .cse14 .cse2 (store (select .cse14 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_50| .cse3) v_ArrVal_1497))) c_threadThread1of1ForFork0_~p~0.base) .cse5) 0)) (not (<= .cse0 |v_ULTIMATE.start_main_#t~mem8#1.offset_50|)))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_50| Int)) (or (forall ((v_ArrVal_1497 Int) (v_ArrVal_1487 (Array Int Int)) (v_ArrVal_1493 (Array Int Int)) (v_ArrVal_1490 (Array Int Int))) (= (select (select (let ((.cse18 (let ((.cse19 (store (let ((.cse20 (store (let ((.cse21 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1487))) (store .cse21 c_threadThread1of1ForFork0_~p~0.base (store (select .cse21 c_threadThread1of1ForFork0_~p~0.base) .cse9 0))) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1490))) (store .cse20 c_threadThread1of1ForFork0_~p~0.base (store (select .cse20 c_threadThread1of1ForFork0_~p~0.base) .cse7 0))) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1493))) (store .cse19 c_threadThread1of1ForFork0_~p~0.base (store (select .cse19 c_threadThread1of1ForFork0_~p~0.base) .cse5 0))))) (store .cse18 .cse2 (store (select .cse18 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_50| .cse3) v_ArrVal_1497))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)) (not (<= .cse0 |v_ULTIMATE.start_main_#t~mem8#1.offset_50|)))))) is different from false
[2023-10-25 14:58:41,333 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-25 14:58:41,333 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 381 treesize of output 262
[2023-10-25 14:58:43,720 INFO  L321             Elim1Store]: treesize reduction 8, result has 33.3 percent of original size
[2023-10-25 14:58:43,728 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 42298302 treesize of output 41974080
Killed by 15
