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


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


Checking for data races
Using default analysis
Version 2329fc70
Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data -tc /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/config/AutomizerReach.xml -i /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-struct-in-array.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 81158b50f242c86171ca71449256e85a5ba990b96d32623e947acdc387b5ed11
--- Real Ultimate output ---
This is Ultimate 0.2.2-dev-2329fc7
[2023-10-25 15:08:04,452 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2023-10-25 15:08:04,454 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2023-10-25 15:08:04,510 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2023-10-25 15:08:04,511 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2023-10-25 15:08:04,527 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2023-10-25 15:08:04,529 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2023-10-25 15:08:04,531 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2023-10-25 15:08:04,533 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2023-10-25 15:08:04,537 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2023-10-25 15:08:04,538 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2023-10-25 15:08:04,539 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2023-10-25 15:08:04,539 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2023-10-25 15:08:04,541 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2023-10-25 15:08:04,543 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2023-10-25 15:08:04,544 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2023-10-25 15:08:04,545 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2023-10-25 15:08:04,546 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2023-10-25 15:08:04,547 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2023-10-25 15:08:04,552 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2023-10-25 15:08:04,553 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2023-10-25 15:08:04,554 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2023-10-25 15:08:04,555 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2023-10-25 15:08:04,555 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2023-10-25 15:08:04,577 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2023-10-25 15:08:04,577 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2023-10-25 15:08:04,578 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2023-10-25 15:08:04,579 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2023-10-25 15:08:04,580 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2023-10-25 15:08:04,581 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2023-10-25 15:08:04,581 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2023-10-25 15:08:04,582 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2023-10-25 15:08:04,583 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2023-10-25 15:08:04,584 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2023-10-25 15:08:04,585 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2023-10-25 15:08:04,585 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2023-10-25 15:08:04,585 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2023-10-25 15:08:04,586 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2023-10-25 15:08:04,586 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2023-10-25 15:08:04,587 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2023-10-25 15:08:04,588 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2023-10-25 15:08:04,589 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 15:08:04,635 INFO  L113        SettingsManager]: Loading preferences was successful
[2023-10-25 15:08:04,635 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2023-10-25 15:08:04,635 INFO  L136        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2023-10-25 15:08:04,636 INFO  L138        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2023-10-25 15:08:04,636 INFO  L136        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2023-10-25 15:08:04,636 INFO  L138        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2023-10-25 15:08:04,637 INFO  L136        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2023-10-25 15:08:04,637 INFO  L138        SettingsManager]:  * Create parallel compositions if possible=false
[2023-10-25 15:08:04,637 INFO  L138        SettingsManager]:  * Use SBE=true
[2023-10-25 15:08:04,637 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2023-10-25 15:08:04,638 INFO  L138        SettingsManager]:  * sizeof long=4
[2023-10-25 15:08:04,638 INFO  L138        SettingsManager]:  * Check unreachability of error function in SV-COMP mode=false
[2023-10-25 15:08:04,638 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2023-10-25 15:08:04,639 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2023-10-25 15:08:04,639 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2023-10-25 15:08:04,639 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2023-10-25 15:08:04,639 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2023-10-25 15:08:04,639 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2023-10-25 15:08:04,639 INFO  L138        SettingsManager]:  * Check absence of data races in concurrent programs=true
[2023-10-25 15:08:04,640 INFO  L138        SettingsManager]:  * sizeof long double=12
[2023-10-25 15:08:04,640 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2023-10-25 15:08:04,640 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2023-10-25 15:08:04,640 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2023-10-25 15:08:04,640 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2023-10-25 15:08:04,640 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2023-10-25 15:08:04,640 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2023-10-25 15:08:04,641 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2023-10-25 15:08:04,641 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2023-10-25 15:08:04,641 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2023-10-25 15:08:04,641 INFO  L138        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2023-10-25 15:08:04,642 INFO  L138        SettingsManager]:  * Trace refinement strategy=CAMEL
[2023-10-25 15:08:04,642 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2023-10-25 15:08:04,642 INFO  L138        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2023-10-25 15:08:04,643 INFO  L138        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2023-10-25 15:08:04,643 INFO  L138        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2023-10-25 15:08:04,643 INFO  L138        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2023-10-25 15:08:04,643 INFO  L138        SettingsManager]:  * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC
[2023-10-25 15:08:04,643 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 -> 81158b50f242c86171ca71449256e85a5ba990b96d32623e947acdc387b5ed11
[2023-10-25 15:08:05,021 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2023-10-25 15:08:05,066 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2023-10-25 15:08:05,070 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2023-10-25 15:08:05,071 INFO  L271        PluginConnector]: Initializing CDTParser...
[2023-10-25 15:08:05,072 INFO  L275        PluginConnector]: CDTParser initialized
[2023-10-25 15:08:05,073 INFO  L432   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-struct-in-array.i
[2023-10-25 15:08:06,770 INFO  L500              CDTParser]: Created temporary CDT project at NULL
[2023-10-25 15:08:07,164 INFO  L351              CDTParser]: Found 1 translation units.
[2023-10-25 15:08:07,173 INFO  L172              CDTParser]: Scanning /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-struct-in-array.i
[2023-10-25 15:08:07,208 INFO  L394              CDTParser]: About to delete temporary CDT project at /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data/52b56ad3a/7c80d11948aa403992f9b83f35447e67/FLAG26faf14c9
[2023-10-25 15:08:07,230 INFO  L402              CDTParser]: Successfully deleted /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data/52b56ad3a/7c80d11948aa403992f9b83f35447e67
[2023-10-25 15:08:07,233 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2023-10-25 15:08:07,234 INFO  L131        ToolchainWalker]: Walking toolchain with 6 elements.
[2023-10-25 15:08:07,235 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2023-10-25 15:08:07,235 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2023-10-25 15:08:07,237 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2023-10-25 15:08:07,245 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 03:08:07" (1/1) ...
[2023-10-25 15:08:07,247 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f2c58c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 03:08:07, skipping insertion in model container
[2023-10-25 15:08:07,247 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 03:08:07" (1/1) ...
[2023-10-25 15:08:07,274 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2023-10-25 15:08:07,349 INFO  L178         MainTranslator]: Built tables and reachable declarations
[2023-10-25 15:08:07,577 WARN  L611        FunctionHandler]: implicit declaration of function __builtin_bswap16
[2023-10-25 15:08:07,876 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2023-10-25 15:08:07,885 INFO  L203         MainTranslator]: Completed pre-run
[2023-10-25 15:08:07,914 WARN  L611        FunctionHandler]: implicit declaration of function __builtin_bswap16
[2023-10-25 15:08:07,963 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2023-10-25 15:08:08,039 INFO  L208         MainTranslator]: Completed translation
[2023-10-25 15:08:08,044 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 03:08:08 WrapperNode
[2023-10-25 15:08:08,044 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2023-10-25 15:08:08,045 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2023-10-25 15:08:08,045 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2023-10-25 15:08:08,048 INFO  L275        PluginConnector]: Boogie Procedure Inliner initialized
[2023-10-25 15:08:08,056 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 03:08:08" (1/1) ...
[2023-10-25 15:08:08,088 INFO  L185        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 03:08:08" (1/1) ...
[2023-10-25 15:08:08,135 INFO  L138                Inliner]: procedures = 266, calls = 25, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 97
[2023-10-25 15:08:08,136 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2023-10-25 15:08:08,136 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2023-10-25 15:08:08,136 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2023-10-25 15:08:08,137 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2023-10-25 15:08:08,145 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 03:08:08" (1/1) ...
[2023-10-25 15:08:08,146 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 03:08:08" (1/1) ...
[2023-10-25 15:08:08,162 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 03:08:08" (1/1) ...
[2023-10-25 15:08:08,162 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 03:08:08" (1/1) ...
[2023-10-25 15:08:08,170 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 03:08:08" (1/1) ...
[2023-10-25 15:08:08,201 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 03:08:08" (1/1) ...
[2023-10-25 15:08:08,219 INFO  L185        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 03:08:08" (1/1) ...
[2023-10-25 15:08:08,221 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 03:08:08" (1/1) ...
[2023-10-25 15:08:08,223 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2023-10-25 15:08:08,224 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2023-10-25 15:08:08,224 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2023-10-25 15:08:08,224 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2023-10-25 15:08:08,225 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 03:08:08" (1/1) ...
[2023-10-25 15:08:08,255 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2023-10-25 15:08:08,277 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-25 15:08:08,327 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 15:08:08,366 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 15:08:08,397 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2023-10-25 15:08:08,397 INFO  L130     BoogieDeclarations]: Found specification of procedure read~$Pointer$
[2023-10-25 15:08:08,397 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2023-10-25 15:08:08,397 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~$Pointer$
[2023-10-25 15:08:08,397 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int
[2023-10-25 15:08:08,397 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2023-10-25 15:08:08,397 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap
[2023-10-25 15:08:08,398 INFO  L130     BoogieDeclarations]: Found specification of procedure thread
[2023-10-25 15:08:08,398 INFO  L138     BoogieDeclarations]: Found implementation of procedure thread
[2023-10-25 15:08:08,398 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2023-10-25 15:08:08,398 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2023-10-25 15:08:08,400 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 15:08:08,651 INFO  L235             CfgBuilder]: Building ICFG
[2023-10-25 15:08:08,662 INFO  L261             CfgBuilder]: Building CFG for each procedure with an implementation
[2023-10-25 15:08:09,100 INFO  L276             CfgBuilder]: Performing block encoding
[2023-10-25 15:08:09,107 INFO  L295             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2023-10-25 15:08:09,122 INFO  L300             CfgBuilder]: Removed 2 assume(true) statements.
[2023-10-25 15:08:09,125 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 03:08:09 BoogieIcfgContainer
[2023-10-25 15:08:09,125 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2023-10-25 15:08:09,129 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2023-10-25 15:08:09,129 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2023-10-25 15:08:09,146 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2023-10-25 15:08:09,152 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.10 03:08:07" (1/3) ...
[2023-10-25 15:08:09,153 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c2a206a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 03:08:09, skipping insertion in model container
[2023-10-25 15:08:09,153 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 03:08:08" (2/3) ...
[2023-10-25 15:08:09,153 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c2a206a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 03:08:09, skipping insertion in model container
[2023-10-25 15:08:09,154 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 03:08:09" (3/3) ...
[2023-10-25 15:08:09,155 INFO  L112   eAbstractionObserver]: Analyzing ICFG per-thread-struct-in-array.i
[2023-10-25 15:08:09,173 WARN  L145   ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2023-10-25 15:08:09,186 INFO  L203   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2023-10-25 15:08:09,186 INFO  L162   ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations.
[2023-10-25 15:08:09,186 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2023-10-25 15:08:09,304 INFO  L144    ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions.
[2023-10-25 15:08:09,375 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 121 places, 122 transitions, 252 flow
[2023-10-25 15:08:09,516 INFO  L130       PetriNetUnfolder]: 6/186 cut-off events.
[2023-10-25 15:08:09,517 INFO  L131       PetriNetUnfolder]: For 1/1 co-relation queries the response was YES.
[2023-10-25 15:08:09,528 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 192 conditions, 186 events. 6/186 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 357 event pairs, 0 based on Foata normal form. 0/164 useless extension candidates. Maximal degree in co-relation 92. Up to 4 conditions per place. 
[2023-10-25 15:08:09,528 INFO  L82        GeneralOperation]: Start removeDead. Operand has 121 places, 122 transitions, 252 flow
[2023-10-25 15:08:09,534 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 121 places, 122 transitions, 252 flow
[2023-10-25 15:08:09,548 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2023-10-25 15:08:09,559 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 121 places, 122 transitions, 252 flow
[2023-10-25 15:08:09,564 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 121 places, 122 transitions, 252 flow
[2023-10-25 15:08:09,567 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 121 places, 122 transitions, 252 flow
[2023-10-25 15:08:09,642 INFO  L130       PetriNetUnfolder]: 6/186 cut-off events.
[2023-10-25 15:08:09,643 INFO  L131       PetriNetUnfolder]: For 1/1 co-relation queries the response was YES.
[2023-10-25 15:08:09,643 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 192 conditions, 186 events. 6/186 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 357 event pairs, 0 based on Foata normal form. 0/164 useless extension candidates. Maximal degree in co-relation 92. Up to 4 conditions per place. 
[2023-10-25 15:08:09,645 INFO  L119        LiptonReduction]: Number of co-enabled transitions 2160
[2023-10-25 15:08:13,344 INFO  L134        LiptonReduction]: Checked pairs total: 10638
[2023-10-25 15:08:13,344 INFO  L136        LiptonReduction]: Total number of compositions: 70
[2023-10-25 15:08:13,371 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-10-25 15:08:13,381 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;@440b6fe3, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2023-10-25 15:08:13,381 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 9 error locations.
[2023-10-25 15:08:13,406 INFO  L130       PetriNetUnfolder]: 0/15 cut-off events.
[2023-10-25 15:08:13,407 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2023-10-25 15:08:13,407 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:08:13,408 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2023-10-25 15:08:13,408 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2023-10-25 15:08:13,420 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:08:13,421 INFO  L85        PathProgramCache]: Analyzing trace with hash 1440899133, now seen corresponding path program 1 times
[2023-10-25 15:08:13,433 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:08:13,434 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501257808]
[2023-10-25 15:08:13,434 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:08:13,434 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:08:13,637 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:08:14,390 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 15:08:14,391 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:08:14,391 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501257808]
[2023-10-25 15:08:14,392 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501257808] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-25 15:08:14,392 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-25 15:08:14,392 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-10-25 15:08:14,393 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884382967]
[2023-10-25 15:08:14,400 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-25 15:08:14,420 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-10-25 15:08:14,420 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:08:14,438 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-10-25 15:08:14,451 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-10-25 15:08:14,919 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 98 out of 192
[2023-10-25 15:08:14,922 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 57 transitions, 122 flow. Second operand  has 6 states, 6 states have (on average 99.16666666666667) internal successors, (595), 6 states have internal predecessors, (595), 0 states have call successors, (0), 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 15:08:14,922 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:08:14,922 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 192
[2023-10-25 15:08:14,923 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 15:08:15,200 INFO  L130       PetriNetUnfolder]: 152/518 cut-off events.
[2023-10-25 15:08:15,200 INFO  L131       PetriNetUnfolder]: For 8/12 co-relation queries the response was YES.
[2023-10-25 15:08:15,204 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 895 conditions, 518 events. 152/518 cut-off events. For 8/12 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 2766 event pairs, 47 based on Foata normal form. 0/473 useless extension candidates. Maximal degree in co-relation 808. Up to 237 conditions per place. 
[2023-10-25 15:08:15,208 INFO  L137   encePairwiseOnDemand]: 176/192 looper letters, 49 selfloop transitions, 23 changer transitions 0/99 dead transitions.
[2023-10-25 15:08:15,209 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 99 transitions, 350 flow
[2023-10-25 15:08:15,210 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-10-25 15:08:15,212 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-10-25 15:08:15,238 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 662 transitions.
[2023-10-25 15:08:15,242 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5746527777777778
[2023-10-25 15:08:15,242 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 662 transitions.
[2023-10-25 15:08:15,243 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 662 transitions.
[2023-10-25 15:08:15,246 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 15:08:15,248 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 662 transitions.
[2023-10-25 15:08:15,253 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 110.33333333333333) internal successors, (662), 6 states have internal predecessors, (662), 0 states have call successors, (0), 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 15:08:15,261 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 192.0) internal successors, (1344), 7 states have internal predecessors, (1344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:08:15,264 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 192.0) internal successors, (1344), 7 states have internal predecessors, (1344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:08:15,267 INFO  L175             Difference]: Start difference. First operand has 59 places, 57 transitions, 122 flow. Second operand 6 states and 662 transitions.
[2023-10-25 15:08:15,282 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 99 transitions, 350 flow
[2023-10-25 15:08:15,285 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 99 transitions, 350 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-10-25 15:08:15,287 INFO  L231             Difference]: Finished difference. Result has 69 places, 80 transitions, 292 flow
[2023-10-25 15:08:15,289 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=292, PETRI_PLACES=69, PETRI_TRANSITIONS=80}
[2023-10-25 15:08:15,294 INFO  L288   CegarLoopForPetriNet]: 59 programPoint places, 10 predicate places.
[2023-10-25 15:08:15,294 INFO  L495      AbstractCegarLoop]: Abstraction has has 69 places, 80 transitions, 292 flow
[2023-10-25 15:08:15,295 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 99.16666666666667) internal successors, (595), 6 states have internal predecessors, (595), 0 states have call successors, (0), 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 15:08:15,295 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:08:15,295 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-25 15:08:15,296 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2023-10-25 15:08:15,297 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2023-10-25 15:08:15,302 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:08:15,303 INFO  L85        PathProgramCache]: Analyzing trace with hash 1491761304, now seen corresponding path program 1 times
[2023-10-25 15:08:15,303 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:08:15,305 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795673667]
[2023-10-25 15:08:15,306 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:08:15,306 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:08:15,340 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:08:15,672 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 15:08:15,684 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:08:15,685 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795673667]
[2023-10-25 15:08:15,685 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795673667] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-25 15:08:15,685 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-25 15:08:15,688 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-10-25 15:08:15,689 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091512100]
[2023-10-25 15:08:15,689 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-25 15:08:15,690 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-10-25 15:08:15,690 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:08:15,691 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-10-25 15:08:15,691 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-10-25 15:08:16,016 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 92 out of 192
[2023-10-25 15:08:16,017 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 80 transitions, 292 flow. Second operand  has 6 states, 6 states have (on average 93.33333333333333) internal successors, (560), 6 states have internal predecessors, (560), 0 states have call successors, (0), 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 15:08:16,017 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:08:16,017 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 192
[2023-10-25 15:08:16,017 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 15:08:16,389 INFO  L130       PetriNetUnfolder]: 294/866 cut-off events.
[2023-10-25 15:08:16,390 INFO  L131       PetriNetUnfolder]: For 338/344 co-relation queries the response was YES.
[2023-10-25 15:08:16,391 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 2068 conditions, 866 events. 294/866 cut-off events. For 338/344 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 5224 event pairs, 52 based on Foata normal form. 5/829 useless extension candidates. Maximal degree in co-relation 1919. Up to 411 conditions per place. 
[2023-10-25 15:08:16,394 INFO  L137   encePairwiseOnDemand]: 169/192 looper letters, 75 selfloop transitions, 50 changer transitions 0/153 dead transitions.
[2023-10-25 15:08:16,394 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 153 transitions, 805 flow
[2023-10-25 15:08:16,395 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-10-25 15:08:16,395 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-10-25 15:08:16,396 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 645 transitions.
[2023-10-25 15:08:16,397 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5598958333333334
[2023-10-25 15:08:16,397 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 645 transitions.
[2023-10-25 15:08:16,397 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 645 transitions.
[2023-10-25 15:08:16,397 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 15:08:16,397 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 645 transitions.
[2023-10-25 15:08:16,399 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 107.5) internal successors, (645), 6 states have internal predecessors, (645), 0 states have call successors, (0), 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 15:08:16,400 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 192.0) internal successors, (1344), 7 states have internal predecessors, (1344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:08:16,413 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 192.0) internal successors, (1344), 7 states have internal predecessors, (1344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:08:16,414 INFO  L175             Difference]: Start difference. First operand has 69 places, 80 transitions, 292 flow. Second operand 6 states and 645 transitions.
[2023-10-25 15:08:16,414 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 153 transitions, 805 flow
[2023-10-25 15:08:16,421 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 153 transitions, 805 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-10-25 15:08:16,423 INFO  L231             Difference]: Finished difference. Result has 79 places, 129 transitions, 770 flow
[2023-10-25 15:08:16,423 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=292, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=770, PETRI_PLACES=79, PETRI_TRANSITIONS=129}
[2023-10-25 15:08:16,424 INFO  L288   CegarLoopForPetriNet]: 59 programPoint places, 20 predicate places.
[2023-10-25 15:08:16,425 INFO  L495      AbstractCegarLoop]: Abstraction has has 79 places, 129 transitions, 770 flow
[2023-10-25 15:08:16,425 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 93.33333333333333) internal successors, (560), 6 states have internal predecessors, (560), 0 states have call successors, (0), 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 15:08:16,425 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:08:16,425 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-25 15:08:16,426 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2023-10-25 15:08:16,426 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2023-10-25 15:08:16,426 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:08:16,426 INFO  L85        PathProgramCache]: Analyzing trace with hash 365353206, now seen corresponding path program 1 times
[2023-10-25 15:08:16,427 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:08:16,427 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145775174]
[2023-10-25 15:08:16,427 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:08:16,427 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:08:16,458 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:08:16,835 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 15:08:16,835 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:08:16,835 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145775174]
[2023-10-25 15:08:16,836 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145775174] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-25 15:08:16,836 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-25 15:08:16,837 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-10-25 15:08:16,837 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45249926]
[2023-10-25 15:08:16,837 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-25 15:08:16,838 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-10-25 15:08:16,838 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:08:16,839 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-10-25 15:08:16,839 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-10-25 15:08:17,273 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 102 out of 192
[2023-10-25 15:08:17,274 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 129 transitions, 770 flow. Second operand  has 6 states, 6 states have (on average 103.33333333333333) internal successors, (620), 6 states have internal predecessors, (620), 0 states have call successors, (0), 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 15:08:17,274 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:08:17,274 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 192
[2023-10-25 15:08:17,274 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 15:08:17,547 INFO  L130       PetriNetUnfolder]: 290/850 cut-off events.
[2023-10-25 15:08:17,548 INFO  L131       PetriNetUnfolder]: For 1132/1151 co-relation queries the response was YES.
[2023-10-25 15:08:17,549 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 2602 conditions, 850 events. 290/850 cut-off events. For 1132/1151 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 5134 event pairs, 54 based on Foata normal form. 1/820 useless extension candidates. Maximal degree in co-relation 2430. Up to 452 conditions per place. 
[2023-10-25 15:08:17,552 INFO  L137   encePairwiseOnDemand]: 181/192 looper letters, 77 selfloop transitions, 33 changer transitions 8/171 dead transitions.
[2023-10-25 15:08:17,552 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 171 transitions, 1245 flow
[2023-10-25 15:08:17,553 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-10-25 15:08:17,553 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-10-25 15:08:17,554 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 669 transitions.
[2023-10-25 15:08:17,554 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5807291666666666
[2023-10-25 15:08:17,554 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 669 transitions.
[2023-10-25 15:08:17,554 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 669 transitions.
[2023-10-25 15:08:17,555 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 15:08:17,569 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 669 transitions.
[2023-10-25 15:08:17,570 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 111.5) internal successors, (669), 6 states have internal predecessors, (669), 0 states have call successors, (0), 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 15:08:17,572 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 192.0) internal successors, (1344), 7 states have internal predecessors, (1344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:08:17,573 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 192.0) internal successors, (1344), 7 states have internal predecessors, (1344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:08:17,573 INFO  L175             Difference]: Start difference. First operand has 79 places, 129 transitions, 770 flow. Second operand 6 states and 669 transitions.
[2023-10-25 15:08:17,573 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 171 transitions, 1245 flow
[2023-10-25 15:08:17,577 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 171 transitions, 1245 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-10-25 15:08:17,580 INFO  L231             Difference]: Finished difference. Result has 89 places, 159 transitions, 1135 flow
[2023-10-25 15:08:17,580 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=770, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1135, PETRI_PLACES=89, PETRI_TRANSITIONS=159}
[2023-10-25 15:08:17,581 INFO  L288   CegarLoopForPetriNet]: 59 programPoint places, 30 predicate places.
[2023-10-25 15:08:17,582 INFO  L495      AbstractCegarLoop]: Abstraction has has 89 places, 159 transitions, 1135 flow
[2023-10-25 15:08:17,582 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 103.33333333333333) internal successors, (620), 6 states have internal predecessors, (620), 0 states have call successors, (0), 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 15:08:17,582 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:08:17,583 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]
[2023-10-25 15:08:17,583 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2023-10-25 15:08:17,586 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2023-10-25 15:08:17,586 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:08:17,586 INFO  L85        PathProgramCache]: Analyzing trace with hash -1763579770, now seen corresponding path program 1 times
[2023-10-25 15:08:17,586 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:08:17,587 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270029443]
[2023-10-25 15:08:17,587 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:08:17,587 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:08:17,631 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:08:18,005 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 15:08:18,006 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:08:18,006 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270029443]
[2023-10-25 15:08:18,006 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270029443] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-25 15:08:18,006 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-25 15:08:18,006 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-10-25 15:08:18,007 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360891232]
[2023-10-25 15:08:18,021 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-25 15:08:18,022 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-10-25 15:08:18,022 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:08:18,023 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-10-25 15:08:18,023 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-10-25 15:08:18,170 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 84 out of 192
[2023-10-25 15:08:18,170 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 159 transitions, 1135 flow. Second operand  has 6 states, 6 states have (on average 87.16666666666667) internal successors, (523), 6 states have internal predecessors, (523), 0 states have call successors, (0), 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 15:08:18,170 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:08:18,171 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 192
[2023-10-25 15:08:18,171 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 15:08:18,693 INFO  L130       PetriNetUnfolder]: 555/1369 cut-off events.
[2023-10-25 15:08:18,699 INFO  L131       PetriNetUnfolder]: For 1875/1889 co-relation queries the response was YES.
[2023-10-25 15:08:18,704 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 4980 conditions, 1369 events. 555/1369 cut-off events. For 1875/1889 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 8623 event pairs, 99 based on Foata normal form. 0/1280 useless extension candidates. Maximal degree in co-relation 4798. Up to 1020 conditions per place. 
[2023-10-25 15:08:18,727 INFO  L137   encePairwiseOnDemand]: 162/192 looper letters, 172 selfloop transitions, 111 changer transitions 10/308 dead transitions.
[2023-10-25 15:08:18,728 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 308 transitions, 2383 flow
[2023-10-25 15:08:18,728 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-10-25 15:08:18,728 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-10-25 15:08:18,729 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 688 transitions.
[2023-10-25 15:08:18,730 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5972222222222222
[2023-10-25 15:08:18,730 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 688 transitions.
[2023-10-25 15:08:18,730 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 688 transitions.
[2023-10-25 15:08:18,731 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 15:08:18,732 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 688 transitions.
[2023-10-25 15:08:18,733 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 114.66666666666667) internal successors, (688), 6 states have internal predecessors, (688), 0 states have call successors, (0), 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 15:08:18,735 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 192.0) internal successors, (1344), 7 states have internal predecessors, (1344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:08:18,736 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 192.0) internal successors, (1344), 7 states have internal predecessors, (1344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:08:18,736 INFO  L175             Difference]: Start difference. First operand has 89 places, 159 transitions, 1135 flow. Second operand 6 states and 688 transitions.
[2023-10-25 15:08:18,736 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 308 transitions, 2383 flow
[2023-10-25 15:08:18,754 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 308 transitions, 2383 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-10-25 15:08:18,763 INFO  L231             Difference]: Finished difference. Result has 97 places, 262 transitions, 2045 flow
[2023-10-25 15:08:18,763 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=1135, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2045, PETRI_PLACES=97, PETRI_TRANSITIONS=262}
[2023-10-25 15:08:18,764 INFO  L288   CegarLoopForPetriNet]: 59 programPoint places, 38 predicate places.
[2023-10-25 15:08:18,764 INFO  L495      AbstractCegarLoop]: Abstraction has has 97 places, 262 transitions, 2045 flow
[2023-10-25 15:08:18,765 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 87.16666666666667) internal successors, (523), 6 states have internal predecessors, (523), 0 states have call successors, (0), 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 15:08:18,765 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:08:18,777 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-25 15:08:18,777 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2023-10-25 15:08:18,778 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2023-10-25 15:08:18,779 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:08:18,779 INFO  L85        PathProgramCache]: Analyzing trace with hash -766543501, now seen corresponding path program 1 times
[2023-10-25 15:08:18,779 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:08:18,779 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497414245]
[2023-10-25 15:08:18,779 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:08:18,779 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:08:18,825 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:08:19,572 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:08:19,572 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:08:19,572 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497414245]
[2023-10-25 15:08:19,573 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497414245] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-25 15:08:19,573 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1219118188]
[2023-10-25 15:08:19,573 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:08:19,573 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-25 15:08:19,573 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-25 15:08:19,589 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 15:08:19,633 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 15:08:19,741 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:08:19,762 INFO  L263         TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 26 conjunts are in the unsatisfiable core
[2023-10-25 15:08:19,768 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-25 15:08:19,903 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 17 treesize of output 9
[2023-10-25 15:08:20,087 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2023-10-25 15:08:20,128 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 15:08:20,129 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 15:08:20,183 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 15:08:20,184 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 15:08:20,185 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 15:08:20,250 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 15:08:20,251 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 15:08:20,252 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 15:08:20,253 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 15:08:20,338 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 15:08:20,339 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 15:08:20,368 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:08:20,369 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-25 15:08:20,414 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_237 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of1ForFork0_~t~0.base v_ArrVal_237) |c_ULTIMATE.start_main_~#ts~0#1.base|) (+ 2 |c_ULTIMATE.start_main_~#ts~0#1.offset|)) 0)) (forall ((v_ArrVal_237 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of1ForFork0_~t~0.base v_ArrVal_237) |c_ULTIMATE.start_main_~#ts~0#1.base|) |c_ULTIMATE.start_main_~#ts~0#1.offset|) 0)) (forall ((v_ArrVal_237 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of1ForFork0_~t~0.base v_ArrVal_237) |c_ULTIMATE.start_main_~#ts~0#1.base|) (+ |c_ULTIMATE.start_main_~#ts~0#1.offset| 1)) 0)) (forall ((v_ArrVal_237 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of1ForFork0_~t~0.base v_ArrVal_237) |c_ULTIMATE.start_main_~#ts~0#1.base|) (+ 3 |c_ULTIMATE.start_main_~#ts~0#1.offset|)) 0))) is different from false
[2023-10-25 15:08:20,454 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ 3 |c_ULTIMATE.start_main_~#ts~0#1.offset|))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base|) .cse1 0)))) (and (forall ((v_ArrVal_237 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_237) |c_ULTIMATE.start_main_~#ts~0#1.base|) (+ 2 |c_ULTIMATE.start_main_~#ts~0#1.offset|)) 0)) (forall ((v_ArrVal_237 (Array Int Int))) (= 0 (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_237) |c_ULTIMATE.start_main_~#ts~0#1.base|) |c_ULTIMATE.start_main_~#ts~0#1.offset|))) (forall ((v_ArrVal_237 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_237) |c_ULTIMATE.start_main_~#ts~0#1.base|) (+ |c_ULTIMATE.start_main_~#ts~0#1.offset| 1)) 0)) (forall ((v_ArrVal_237 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_237) |c_ULTIMATE.start_main_~#ts~0#1.base|) .cse1) 0))))) is different from false
[2023-10-25 15:08:20,492 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse2 (+ 2 |c_ULTIMATE.start_main_~#ts~0#1.offset|)) (.cse1 (+ 3 |c_ULTIMATE.start_main_~#ts~0#1.offset|))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base|) .cse2 0) .cse1 0)))) (and (forall ((v_ArrVal_237 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_237) |c_ULTIMATE.start_main_~#ts~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_237 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_237) |c_ULTIMATE.start_main_~#ts~0#1.base|) (+ |c_ULTIMATE.start_main_~#ts~0#1.offset| 1)) 0)) (forall ((v_ArrVal_237 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_237) |c_ULTIMATE.start_main_~#ts~0#1.base|) |c_ULTIMATE.start_main_~#ts~0#1.offset|) 0)) (forall ((v_ArrVal_237 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_237) |c_ULTIMATE.start_main_~#ts~0#1.base|) .cse2) 0))))) is different from false
[2023-10-25 15:08:20,657 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked.
[2023-10-25 15:08:20,658 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1219118188] provided 0 perfect and 2 imperfect interpolant sequences
[2023-10-25 15:08:20,658 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-10-25 15:08:20,658 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 25
[2023-10-25 15:08:20,660 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990161630]
[2023-10-25 15:08:20,660 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-10-25 15:08:20,661 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 27 states
[2023-10-25 15:08:20,661 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:08:20,662 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants.
[2023-10-25 15:08:20,662 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=460, Unknown=3, NotChecked=138, Total=702
[2023-10-25 15:08:20,726 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 59 out of 192
[2023-10-25 15:08:20,727 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 262 transitions, 2045 flow. Second operand  has 27 states, 27 states have (on average 61.592592592592595) internal successors, (1663), 27 states have internal predecessors, (1663), 0 states have call successors, (0), 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 15:08:20,727 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:08:20,728 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 192
[2023-10-25 15:08:20,728 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 15:08:22,015 INFO  L130       PetriNetUnfolder]: 631/1458 cut-off events.
[2023-10-25 15:08:22,023 INFO  L131       PetriNetUnfolder]: For 3368/3368 co-relation queries the response was YES.
[2023-10-25 15:08:22,039 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 6500 conditions, 1458 events. 631/1458 cut-off events. For 3368/3368 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 9140 event pairs, 83 based on Foata normal form. 10/1368 useless extension candidates. Maximal degree in co-relation 6377. Up to 1331 conditions per place. 
[2023-10-25 15:08:22,049 INFO  L137   encePairwiseOnDemand]: 182/192 looper letters, 304 selfloop transitions, 12 changer transitions 12/330 dead transitions.
[2023-10-25 15:08:22,050 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 330 transitions, 3086 flow
[2023-10-25 15:08:22,050 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2023-10-25 15:08:22,050 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2023-10-25 15:08:22,052 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 709 transitions.
[2023-10-25 15:08:22,052 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.3692708333333333
[2023-10-25 15:08:22,052 INFO  L72            ComplementDD]: Start complementDD. Operand 10 states and 709 transitions.
[2023-10-25 15:08:22,052 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 10 states and 709 transitions.
[2023-10-25 15:08:22,053 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 15:08:22,053 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 709 transitions.
[2023-10-25 15:08:22,054 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 11 states, 10 states have (on average 70.9) internal successors, (709), 10 states have internal predecessors, (709), 0 states have call successors, (0), 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 15:08:22,056 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 11 states, 11 states have (on average 192.0) internal successors, (2112), 11 states have internal predecessors, (2112), 0 states have call successors, (0), 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 15:08:22,067 INFO  L81            ComplementDD]: Finished complementDD. Result  has 11 states, 11 states have (on average 192.0) internal successors, (2112), 11 states have internal predecessors, (2112), 0 states have call successors, (0), 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 15:08:22,067 INFO  L175             Difference]: Start difference. First operand has 97 places, 262 transitions, 2045 flow. Second operand 10 states and 709 transitions.
[2023-10-25 15:08:22,068 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 330 transitions, 3086 flow
[2023-10-25 15:08:22,115 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 330 transitions, 2942 flow, removed 72 selfloop flow, removed 0 redundant places.
[2023-10-25 15:08:22,119 INFO  L231             Difference]: Finished difference. Result has 107 places, 265 transitions, 1941 flow
[2023-10-25 15:08:22,119 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=1893, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=260, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=250, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1941, PETRI_PLACES=107, PETRI_TRANSITIONS=265}
[2023-10-25 15:08:22,121 INFO  L288   CegarLoopForPetriNet]: 59 programPoint places, 48 predicate places.
[2023-10-25 15:08:22,121 INFO  L495      AbstractCegarLoop]: Abstraction has has 107 places, 265 transitions, 1941 flow
[2023-10-25 15:08:22,121 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 27 states, 27 states have (on average 61.592592592592595) internal successors, (1663), 27 states have internal predecessors, (1663), 0 states have call successors, (0), 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 15:08:22,121 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:08:22,122 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-25 15:08:22,144 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0
[2023-10-25 15:08:22,326 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-25 15:08:22,326 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2023-10-25 15:08:22,327 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:08:22,327 INFO  L85        PathProgramCache]: Analyzing trace with hash 140689641, now seen corresponding path program 1 times
[2023-10-25 15:08:22,327 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:08:22,327 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057009801]
[2023-10-25 15:08:22,327 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:08:22,328 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:08:22,351 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:08:22,907 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:08:22,908 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:08:22,910 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057009801]
[2023-10-25 15:08:22,910 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057009801] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-25 15:08:22,910 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [516137934]
[2023-10-25 15:08:22,910 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:08:22,911 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-25 15:08:22,911 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-25 15:08:22,926 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 15:08:22,963 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 15:08:23,121 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:08:23,122 INFO  L263         TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 24 conjunts are in the unsatisfiable core
[2023-10-25 15:08:23,125 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-25 15:08:23,156 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 17 treesize of output 9
[2023-10-25 15:08:23,229 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 15:08:23,267 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 0 case distinctions, treesize of input 21 treesize of output 20
[2023-10-25 15:08:23,315 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-25 15:08:23,315 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 1 case distinctions, treesize of input 30 treesize of output 32
[2023-10-25 15:08:23,372 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-25 15:08:23,373 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44
[2023-10-25 15:08:23,435 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 15:08:23,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 41 treesize of output 37
[2023-10-25 15:08:23,458 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:08:23,458 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-25 15:08:23,477 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_350 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_350) c_threadThread1of1ForFork0_~t~0.base) (+ c_threadThread1of1ForFork0_~t~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_350 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_350) c_threadThread1of1ForFork0_~t~0.base) (+ 2 c_threadThread1of1ForFork0_~t~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_350 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_350) c_threadThread1of1ForFork0_~t~0.base) c_threadThread1of1ForFork0_~t~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_350 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_350) c_threadThread1of1ForFork0_~t~0.base) (+ 3 c_threadThread1of1ForFork0_~t~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|))) is different from false
[2023-10-25 15:08:23,516 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ 3 c_threadThread1of1ForFork0_~t~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (select |c_#race| c_threadThread1of1ForFork0_~t~0.base) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_350 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_350) c_threadThread1of1ForFork0_~t~0.base) (+ 2 c_threadThread1of1ForFork0_~t~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_350 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_350) c_threadThread1of1ForFork0_~t~0.base) c_threadThread1of1ForFork0_~t~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_350 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_350) c_threadThread1of1ForFork0_~t~0.base) .cse1) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_350 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_350) c_threadThread1of1ForFork0_~t~0.base) (+ c_threadThread1of1ForFork0_~t~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|))))) is different from false
[2023-10-25 15:08:23,534 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ 2 c_threadThread1of1ForFork0_~t~0.offset)) (.cse2 (+ 3 c_threadThread1of1ForFork0_~t~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (store (select |c_#race| c_threadThread1of1ForFork0_~t~0.base) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|) .cse2 |c_threadThread1of1ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_350 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_350) c_threadThread1of1ForFork0_~t~0.base) .cse1))) (forall ((v_ArrVal_350 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_350) c_threadThread1of1ForFork0_~t~0.base) (+ c_threadThread1of1ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_350 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_350) c_threadThread1of1ForFork0_~t~0.base) c_threadThread1of1ForFork0_~t~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_350 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_350) c_threadThread1of1ForFork0_~t~0.base) .cse2) |c_threadThread1of1ForFork0_#t~nondet4|))))) is different from false
[2023-10-25 15:08:23,676 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked.
[2023-10-25 15:08:23,676 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [516137934] provided 0 perfect and 2 imperfect interpolant sequences
[2023-10-25 15:08:23,676 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-10-25 15:08:23,676 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 24
[2023-10-25 15:08:23,677 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116163531]
[2023-10-25 15:08:23,677 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-10-25 15:08:23,677 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 26 states
[2023-10-25 15:08:23,677 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:08:23,678 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants.
[2023-10-25 15:08:23,678 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=418, Unknown=3, NotChecked=132, Total=650
[2023-10-25 15:08:23,680 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 57 out of 192
[2023-10-25 15:08:23,682 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 265 transitions, 1941 flow. Second operand  has 26 states, 26 states have (on average 59.65384615384615) internal successors, (1551), 26 states have internal predecessors, (1551), 0 states have call successors, (0), 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 15:08:23,682 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:08:23,682 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 192
[2023-10-25 15:08:23,682 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 15:08:26,248 INFO  L130       PetriNetUnfolder]: 674/1547 cut-off events.
[2023-10-25 15:08:26,248 INFO  L131       PetriNetUnfolder]: For 3758/3764 co-relation queries the response was YES.
[2023-10-25 15:08:26,252 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 6977 conditions, 1547 events. 674/1547 cut-off events. For 3758/3764 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 9797 event pairs, 106 based on Foata normal form. 2/1468 useless extension candidates. Maximal degree in co-relation 6844. Up to 962 conditions per place. 
[2023-10-25 15:08:26,273 INFO  L137   encePairwiseOnDemand]: 141/192 looper letters, 305 selfloop transitions, 163 changer transitions 40/510 dead transitions.
[2023-10-25 15:08:26,274 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 510 transitions, 4404 flow
[2023-10-25 15:08:26,274 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. 
[2023-10-25 15:08:26,274 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 19 states.
[2023-10-25 15:08:26,277 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 1396 transitions.
[2023-10-25 15:08:26,278 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.3826754385964912
[2023-10-25 15:08:26,278 INFO  L72            ComplementDD]: Start complementDD. Operand 19 states and 1396 transitions.
[2023-10-25 15:08:26,278 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 19 states and 1396 transitions.
[2023-10-25 15:08:26,279 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 15:08:26,279 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 1396 transitions.
[2023-10-25 15:08:26,281 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 20 states, 19 states have (on average 73.47368421052632) internal successors, (1396), 19 states have internal predecessors, (1396), 0 states have call successors, (0), 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 15:08:26,285 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 20 states, 20 states have (on average 192.0) internal successors, (3840), 20 states have internal predecessors, (3840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:08:26,286 INFO  L81            ComplementDD]: Finished complementDD. Result  has 20 states, 20 states have (on average 192.0) internal successors, (3840), 20 states have internal predecessors, (3840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:08:26,286 INFO  L175             Difference]: Start difference. First operand has 107 places, 265 transitions, 1941 flow. Second operand 19 states and 1396 transitions.
[2023-10-25 15:08:26,286 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 510 transitions, 4404 flow
[2023-10-25 15:08:26,319 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 510 transitions, 4376 flow, removed 0 selfloop flow, removed 4 redundant places.
[2023-10-25 15:08:26,337 INFO  L231             Difference]: Finished difference. Result has 127 places, 328 transitions, 3030 flow
[2023-10-25 15:08:26,337 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=1930, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=265, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=99, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=3030, PETRI_PLACES=127, PETRI_TRANSITIONS=328}
[2023-10-25 15:08:26,339 INFO  L288   CegarLoopForPetriNet]: 59 programPoint places, 68 predicate places.
[2023-10-25 15:08:26,340 INFO  L495      AbstractCegarLoop]: Abstraction has has 127 places, 328 transitions, 3030 flow
[2023-10-25 15:08:26,341 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 26 states, 26 states have (on average 59.65384615384615) internal successors, (1551), 26 states have internal predecessors, (1551), 0 states have call successors, (0), 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 15:08:26,341 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:08:26,341 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]
[2023-10-25 15:08:26,353 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0
[2023-10-25 15:08:26,551 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-25 15:08:26,551 INFO  L420      AbstractCegarLoop]: === Iteration 7 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2023-10-25 15:08:26,552 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:08:26,552 INFO  L85        PathProgramCache]: Analyzing trace with hash 1201166498, now seen corresponding path program 1 times
[2023-10-25 15:08:26,553 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:08:26,553 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943493910]
[2023-10-25 15:08:26,553 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:08:26,553 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:08:26,573 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:08:26,674 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:08:26,675 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:08:26,675 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943493910]
[2023-10-25 15:08:26,675 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943493910] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-25 15:08:26,675 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [656499113]
[2023-10-25 15:08:26,675 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:08:26,676 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-25 15:08:26,676 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-25 15:08:26,688 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 15:08:26,742 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 15:08:26,851 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:08:26,852 INFO  L263         TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 4 conjunts are in the unsatisfiable core
[2023-10-25 15:08:26,854 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-25 15:08:26,907 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:08:26,907 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-25 15:08:26,953 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:08:26,953 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [656499113] provided 0 perfect and 2 imperfect interpolant sequences
[2023-10-25 15:08:26,953 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-10-25 15:08:26,954 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8
[2023-10-25 15:08:26,954 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28697946]
[2023-10-25 15:08:26,954 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-10-25 15:08:26,955 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2023-10-25 15:08:26,955 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:08:26,955 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2023-10-25 15:08:26,955 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72
[2023-10-25 15:08:27,100 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 107 out of 192
[2023-10-25 15:08:27,101 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 328 transitions, 3030 flow. Second operand  has 9 states, 9 states have (on average 109.22222222222223) internal successors, (983), 9 states have internal predecessors, (983), 0 states have call successors, (0), 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 15:08:27,101 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:08:27,102 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 192
[2023-10-25 15:08:27,102 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 15:08:27,342 INFO  L130       PetriNetUnfolder]: 274/808 cut-off events.
[2023-10-25 15:08:27,342 INFO  L131       PetriNetUnfolder]: For 2711/2727 co-relation queries the response was YES.
[2023-10-25 15:08:27,345 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 3858 conditions, 808 events. 274/808 cut-off events. For 2711/2727 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 5020 event pairs, 11 based on Foata normal form. 2/794 useless extension candidates. Maximal degree in co-relation 3727. Up to 246 conditions per place. 
[2023-10-25 15:08:27,348 INFO  L137   encePairwiseOnDemand]: 186/192 looper letters, 24 selfloop transitions, 10 changer transitions 3/248 dead transitions.
[2023-10-25 15:08:27,348 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 248 transitions, 2348 flow
[2023-10-25 15:08:27,348 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2023-10-25 15:08:27,349 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2023-10-25 15:08:27,350 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 770 transitions.
[2023-10-25 15:08:27,362 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5729166666666666
[2023-10-25 15:08:27,362 INFO  L72            ComplementDD]: Start complementDD. Operand 7 states and 770 transitions.
[2023-10-25 15:08:27,363 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 7 states and 770 transitions.
[2023-10-25 15:08:27,363 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 15:08:27,363 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 770 transitions.
[2023-10-25 15:08:27,364 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 8 states, 7 states have (on average 110.0) internal successors, (770), 7 states have internal predecessors, (770), 0 states have call successors, (0), 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 15:08:27,366 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 8 states, 8 states have (on average 192.0) internal successors, (1536), 8 states have internal predecessors, (1536), 0 states have call successors, (0), 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 15:08:27,366 INFO  L81            ComplementDD]: Finished complementDD. Result  has 8 states, 8 states have (on average 192.0) internal successors, (1536), 8 states have internal predecessors, (1536), 0 states have call successors, (0), 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 15:08:27,374 INFO  L175             Difference]: Start difference. First operand has 127 places, 328 transitions, 3030 flow. Second operand 7 states and 770 transitions.
[2023-10-25 15:08:27,374 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 248 transitions, 2348 flow
[2023-10-25 15:08:27,388 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 248 transitions, 2248 flow, removed 28 selfloop flow, removed 8 redundant places.
[2023-10-25 15:08:27,398 INFO  L231             Difference]: Finished difference. Result has 113 places, 240 transitions, 2156 flow
[2023-10-25 15:08:27,410 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=2136, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=241, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=231, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2156, PETRI_PLACES=113, PETRI_TRANSITIONS=240}
[2023-10-25 15:08:27,411 INFO  L288   CegarLoopForPetriNet]: 59 programPoint places, 54 predicate places.
[2023-10-25 15:08:27,411 INFO  L495      AbstractCegarLoop]: Abstraction has has 113 places, 240 transitions, 2156 flow
[2023-10-25 15:08:27,411 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 109.22222222222223) internal successors, (983), 9 states have internal predecessors, (983), 0 states have call successors, (0), 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 15:08:27,411 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:08:27,412 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]
[2023-10-25 15:08:27,418 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 15:08:27,616 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-25 15:08:27,617 INFO  L420      AbstractCegarLoop]: === Iteration 8 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2023-10-25 15:08:27,618 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:08:27,618 INFO  L85        PathProgramCache]: Analyzing trace with hash 2116465637, now seen corresponding path program 1 times
[2023-10-25 15:08:27,618 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:08:27,619 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487828703]
[2023-10-25 15:08:27,619 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:08:27,619 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:08:27,668 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:08:28,146 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:08:28,146 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:08:28,146 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487828703]
[2023-10-25 15:08:28,146 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487828703] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-25 15:08:28,149 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2055905245]
[2023-10-25 15:08:28,149 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:08:28,149 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-25 15:08:28,149 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-25 15:08:28,166 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 15:08:28,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 15:08:28,317 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:08:28,318 INFO  L263         TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 24 conjunts are in the unsatisfiable core
[2023-10-25 15:08:28,322 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-25 15:08:28,344 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 17 treesize of output 9
[2023-10-25 15:08:28,413 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 15:08:28,466 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 0 case distinctions, treesize of input 21 treesize of output 20
[2023-10-25 15:08:28,516 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-25 15:08:28,517 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 1 case distinctions, treesize of input 30 treesize of output 32
[2023-10-25 15:08:28,585 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-25 15:08:28,586 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44
[2023-10-25 15:08:28,651 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 15:08:28,651 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 15:08:28,675 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:08:28,675 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-25 15:08:28,700 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_567 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_567) c_threadThread1of1ForFork0_~t~0.base) (+ 3 c_threadThread1of1ForFork0_~t~0.offset)))) (forall ((v_ArrVal_567 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_567) c_threadThread1of1ForFork0_~t~0.base) (+ 2 c_threadThread1of1ForFork0_~t~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_567 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_567) c_threadThread1of1ForFork0_~t~0.base) c_threadThread1of1ForFork0_~t~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_567 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_567) c_threadThread1of1ForFork0_~t~0.base) (+ c_threadThread1of1ForFork0_~t~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|))) is different from false
[2023-10-25 15:08:28,731 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ 3 c_threadThread1of1ForFork0_~t~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (select |c_#race| c_threadThread1of1ForFork0_~t~0.base) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_567 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_567) c_threadThread1of1ForFork0_~t~0.base) (+ c_threadThread1of1ForFork0_~t~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_567 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_567) c_threadThread1of1ForFork0_~t~0.base) (+ 2 c_threadThread1of1ForFork0_~t~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_567 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_567) c_threadThread1of1ForFork0_~t~0.base) .cse1) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_567 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_567) c_threadThread1of1ForFork0_~t~0.base) c_threadThread1of1ForFork0_~t~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|))))) is different from false
[2023-10-25 15:08:28,784 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ 2 c_threadThread1of1ForFork0_~t~0.offset)) (.cse2 (+ 3 c_threadThread1of1ForFork0_~t~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (store (select |c_#race| c_threadThread1of1ForFork0_~t~0.base) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|) .cse2 |c_threadThread1of1ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_567 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_567) c_threadThread1of1ForFork0_~t~0.base) .cse1) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_567 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_567) c_threadThread1of1ForFork0_~t~0.base) c_threadThread1of1ForFork0_~t~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_567 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_567) c_threadThread1of1ForFork0_~t~0.base) .cse2) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_567 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_567) c_threadThread1of1ForFork0_~t~0.base) (+ c_threadThread1of1ForFork0_~t~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|))))) is different from false
[2023-10-25 15:08:28,941 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked.
[2023-10-25 15:08:28,942 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [2055905245] provided 0 perfect and 2 imperfect interpolant sequences
[2023-10-25 15:08:28,942 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-10-25 15:08:28,942 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 24
[2023-10-25 15:08:28,942 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123531297]
[2023-10-25 15:08:28,942 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-10-25 15:08:28,943 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 26 states
[2023-10-25 15:08:28,943 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:08:28,943 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants.
[2023-10-25 15:08:28,944 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=418, Unknown=3, NotChecked=132, Total=650
[2023-10-25 15:08:28,991 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 54 out of 192
[2023-10-25 15:08:28,996 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 240 transitions, 2156 flow. Second operand  has 26 states, 26 states have (on average 56.73076923076923) internal successors, (1475), 26 states have internal predecessors, (1475), 0 states have call successors, (0), 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 15:08:28,996 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:08:28,996 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 192
[2023-10-25 15:08:28,996 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 15:08:32,336 INFO  L130       PetriNetUnfolder]: 523/1237 cut-off events.
[2023-10-25 15:08:32,337 INFO  L131       PetriNetUnfolder]: For 4531/4531 co-relation queries the response was YES.
[2023-10-25 15:08:32,340 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 6650 conditions, 1237 events. 523/1237 cut-off events. For 4531/4531 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 7532 event pairs, 30 based on Foata normal form. 43/1280 useless extension candidates. Maximal degree in co-relation 6497. Up to 649 conditions per place. 
[2023-10-25 15:08:32,346 INFO  L137   encePairwiseOnDemand]: 154/192 looper letters, 266 selfloop transitions, 192 changer transitions 8/468 dead transitions.
[2023-10-25 15:08:32,361 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 468 transitions, 4660 flow
[2023-10-25 15:08:32,362 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. 
[2023-10-25 15:08:32,362 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 20 states.
[2023-10-25 15:08:32,364 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 1344 transitions.
[2023-10-25 15:08:32,365 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.35
[2023-10-25 15:08:32,365 INFO  L72            ComplementDD]: Start complementDD. Operand 20 states and 1344 transitions.
[2023-10-25 15:08:32,365 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 20 states and 1344 transitions.
[2023-10-25 15:08:32,375 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 15:08:32,375 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 1344 transitions.
[2023-10-25 15:08:32,378 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 21 states, 20 states have (on average 67.2) internal successors, (1344), 20 states have internal predecessors, (1344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:08:32,382 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 21 states, 21 states have (on average 192.0) internal successors, (4032), 21 states have internal predecessors, (4032), 0 states have call successors, (0), 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 15:08:32,383 INFO  L81            ComplementDD]: Finished complementDD. Result  has 21 states, 21 states have (on average 192.0) internal successors, (4032), 21 states have internal predecessors, (4032), 0 states have call successors, (0), 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 15:08:32,383 INFO  L175             Difference]: Start difference. First operand has 113 places, 240 transitions, 2156 flow. Second operand 20 states and 1344 transitions.
[2023-10-25 15:08:32,397 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 468 transitions, 4660 flow
[2023-10-25 15:08:32,430 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 468 transitions, 4632 flow, removed 8 selfloop flow, removed 4 redundant places.
[2023-10-25 15:08:32,450 INFO  L231             Difference]: Finished difference. Result has 133 places, 339 transitions, 3801 flow
[2023-10-25 15:08:32,450 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=2142, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=240, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=98, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=3801, PETRI_PLACES=133, PETRI_TRANSITIONS=339}
[2023-10-25 15:08:32,452 INFO  L288   CegarLoopForPetriNet]: 59 programPoint places, 74 predicate places.
[2023-10-25 15:08:32,452 INFO  L495      AbstractCegarLoop]: Abstraction has has 133 places, 339 transitions, 3801 flow
[2023-10-25 15:08:32,453 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 26 states, 26 states have (on average 56.73076923076923) internal successors, (1475), 26 states have internal predecessors, (1475), 0 states have call successors, (0), 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 15:08:32,453 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:08:32,453 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]
[2023-10-25 15:08:32,459 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 15:08:32,657 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-25 15:08:32,658 INFO  L420      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2023-10-25 15:08:32,658 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:08:32,659 INFO  L85        PathProgramCache]: Analyzing trace with hash -831584502, now seen corresponding path program 1 times
[2023-10-25 15:08:32,659 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:08:32,659 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939628794]
[2023-10-25 15:08:32,659 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:08:32,659 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:08:32,711 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:08:33,239 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:08:33,241 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:08:33,241 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939628794]
[2023-10-25 15:08:33,241 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939628794] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-25 15:08:33,241 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [23002092]
[2023-10-25 15:08:33,241 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:08:33,241 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-25 15:08:33,242 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-25 15:08:33,258 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 15:08:33,292 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 15:08:33,402 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:08:33,418 INFO  L263         TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 26 conjunts are in the unsatisfiable core
[2023-10-25 15:08:33,422 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-25 15:08:33,439 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 17 treesize of output 9
[2023-10-25 15:08:33,552 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 15:08:33,587 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 15:08:33,588 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 15:08:33,639 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 15:08:33,640 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 15:08:33,642 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 15:08:33,696 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 15:08:33,696 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 15:08:33,697 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 15:08:33,698 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 15:08:33,826 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 15:08:33,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 15:08:33,871 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:08:33,871 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-25 15:08:33,887 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_680 (Array Int Int))) (= 0 (select (select (store |c_#race| c_threadThread1of1ForFork0_~t~0.base v_ArrVal_680) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|)))) (forall ((v_ArrVal_680 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of1ForFork0_~t~0.base v_ArrVal_680) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) 0)) (forall ((v_ArrVal_680 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of1ForFork0_~t~0.base v_ArrVal_680) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (forall ((v_ArrVal_680 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of1ForFork0_~t~0.base v_ArrVal_680) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0))) is different from false
[2023-10-25 15:08:33,940 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_threadThread1of1ForFork0_~t~0.base_39 Int)) (or (< |c_threadThread1of1ForFork0_#in~arg.base| v_threadThread1of1ForFork0_~t~0.base_39) (forall ((v_ArrVal_680 (Array Int Int))) (= (select (select (store |c_#race| v_threadThread1of1ForFork0_~t~0.base_39 v_ArrVal_680) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) 0)))) (forall ((v_threadThread1of1ForFork0_~t~0.base_39 Int)) (or (< |c_threadThread1of1ForFork0_#in~arg.base| v_threadThread1of1ForFork0_~t~0.base_39) (forall ((v_ArrVal_680 (Array Int Int))) (= (select (select (store |c_#race| v_threadThread1of1ForFork0_~t~0.base_39 v_ArrVal_680) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0)))) (forall ((v_threadThread1of1ForFork0_~t~0.base_39 Int)) (or (< |c_threadThread1of1ForFork0_#in~arg.base| v_threadThread1of1ForFork0_~t~0.base_39) (forall ((v_ArrVal_680 (Array Int Int))) (= (select (select (store |c_#race| v_threadThread1of1ForFork0_~t~0.base_39 v_ArrVal_680) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)))) (forall ((v_threadThread1of1ForFork0_~t~0.base_39 Int)) (or (< |c_threadThread1of1ForFork0_#in~arg.base| v_threadThread1of1ForFork0_~t~0.base_39) (forall ((v_ArrVal_680 (Array Int Int))) (= (select (select (store |c_#race| v_threadThread1of1ForFork0_~t~0.base_39 v_ArrVal_680) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) 0))))) is different from false
[2023-10-25 15:08:34,346 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1 0) (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)))) (and (forall ((v_threadThread1of1ForFork0_~t~0.base_39 Int)) (or (< |c_threadThread1of1ForFork0_#in~arg.base| v_threadThread1of1ForFork0_~t~0.base_39) (forall ((v_ArrVal_680 (Array Int Int))) (= 0 (select (select (store .cse0 v_threadThread1of1ForFork0_~t~0.base_39 v_ArrVal_680) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1))))) (forall ((v_threadThread1of1ForFork0_~t~0.base_39 Int)) (or (< |c_threadThread1of1ForFork0_#in~arg.base| v_threadThread1of1ForFork0_~t~0.base_39) (forall ((v_ArrVal_680 (Array Int Int))) (= (select (select (store .cse0 v_threadThread1of1ForFork0_~t~0.base_39 v_ArrVal_680) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0)))) (forall ((v_threadThread1of1ForFork0_~t~0.base_39 Int)) (or (< |c_threadThread1of1ForFork0_#in~arg.base| v_threadThread1of1ForFork0_~t~0.base_39) (forall ((v_ArrVal_680 (Array Int Int))) (= (select (select (store .cse0 v_threadThread1of1ForFork0_~t~0.base_39 v_ArrVal_680) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0))))))) is different from false
[2023-10-25 15:08:34,688 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-25 15:08:34,688 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 33 treesize of output 49
[2023-10-25 15:08:34,695 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-25 15:08:34,695 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 60 treesize of output 34
[2023-10-25 15:08:34,699 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 15:08:34,800 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:08:34,800 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [23002092] provided 0 perfect and 2 imperfect interpolant sequences
[2023-10-25 15:08:34,800 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-10-25 15:08:34,800 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 27
[2023-10-25 15:08:34,800 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885728425]
[2023-10-25 15:08:34,800 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-10-25 15:08:34,801 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 29 states
[2023-10-25 15:08:34,801 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:08:34,801 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants.
[2023-10-25 15:08:34,801 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=513, Unknown=24, NotChecked=150, Total=812
[2023-10-25 15:08:35,080 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 56 out of 192
[2023-10-25 15:08:35,081 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 339 transitions, 3801 flow. Second operand  has 29 states, 29 states have (on average 58.55172413793103) internal successors, (1698), 29 states have internal predecessors, (1698), 0 states have call successors, (0), 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 15:08:35,082 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:08:35,082 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 192
[2023-10-25 15:08:35,082 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 15:08:36,067 INFO  L130       PetriNetUnfolder]: 497/1175 cut-off events.
[2023-10-25 15:08:36,068 INFO  L131       PetriNetUnfolder]: For 7183/7185 co-relation queries the response was YES.
[2023-10-25 15:08:36,075 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 7793 conditions, 1175 events. 497/1175 cut-off events. For 7183/7185 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 7026 event pairs, 34 based on Foata normal form. 30/1204 useless extension candidates. Maximal degree in co-relation 7627. Up to 1087 conditions per place. 
[2023-10-25 15:08:36,100 INFO  L137   encePairwiseOnDemand]: 183/192 looper letters, 346 selfloop transitions, 13 changer transitions 1/362 dead transitions.
[2023-10-25 15:08:36,100 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 362 transitions, 4660 flow
[2023-10-25 15:08:36,101 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2023-10-25 15:08:36,101 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2023-10-25 15:08:36,110 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 643 transitions.
[2023-10-25 15:08:36,111 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.33489583333333334
[2023-10-25 15:08:36,111 INFO  L72            ComplementDD]: Start complementDD. Operand 10 states and 643 transitions.
[2023-10-25 15:08:36,111 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 10 states and 643 transitions.
[2023-10-25 15:08:36,112 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 15:08:36,112 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 643 transitions.
[2023-10-25 15:08:36,114 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 11 states, 10 states have (on average 64.3) internal successors, (643), 10 states have internal predecessors, (643), 0 states have call successors, (0), 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 15:08:36,118 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 11 states, 11 states have (on average 192.0) internal successors, (2112), 11 states have internal predecessors, (2112), 0 states have call successors, (0), 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 15:08:36,118 INFO  L81            ComplementDD]: Finished complementDD. Result  has 11 states, 11 states have (on average 192.0) internal successors, (2112), 11 states have internal predecessors, (2112), 0 states have call successors, (0), 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 15:08:36,118 INFO  L175             Difference]: Start difference. First operand has 133 places, 339 transitions, 3801 flow. Second operand 10 states and 643 transitions.
[2023-10-25 15:08:36,118 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 362 transitions, 4660 flow
[2023-10-25 15:08:36,197 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 362 transitions, 4471 flow, removed 58 selfloop flow, removed 12 redundant places.
[2023-10-25 15:08:36,202 INFO  L231             Difference]: Finished difference. Result has 129 places, 330 transitions, 3543 flow
[2023-10-25 15:08:36,202 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=3509, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=329, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=316, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3543, PETRI_PLACES=129, PETRI_TRANSITIONS=330}
[2023-10-25 15:08:36,203 INFO  L288   CegarLoopForPetriNet]: 59 programPoint places, 70 predicate places.
[2023-10-25 15:08:36,203 INFO  L495      AbstractCegarLoop]: Abstraction has has 129 places, 330 transitions, 3543 flow
[2023-10-25 15:08:36,204 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 29 states, 29 states have (on average 58.55172413793103) internal successors, (1698), 29 states have internal predecessors, (1698), 0 states have call successors, (0), 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 15:08:36,210 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:08:36,210 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-25 15:08:36,216 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 15:08:36,414 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-25 15:08:36,414 INFO  L420      AbstractCegarLoop]: === Iteration 10 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2023-10-25 15:08:36,415 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:08:36,416 INFO  L85        PathProgramCache]: Analyzing trace with hash 2140873883, now seen corresponding path program 2 times
[2023-10-25 15:08:36,416 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:08:36,416 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388441631]
[2023-10-25 15:08:36,416 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:08:36,416 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:08:36,439 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:08:37,126 INFO  L134       CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:08:37,126 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:08:37,126 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388441631]
[2023-10-25 15:08:37,126 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388441631] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-25 15:08:37,126 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1249208238]
[2023-10-25 15:08:37,126 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2023-10-25 15:08:37,126 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-25 15:08:37,126 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-25 15:08:37,127 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 15:08:37,161 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 15:08:37,354 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2023-10-25 15:08:37,354 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2023-10-25 15:08:37,364 INFO  L263         TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 33 conjunts are in the unsatisfiable core
[2023-10-25 15:08:37,368 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-25 15:08:37,392 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 26 treesize of output 14
[2023-10-25 15:08:37,597 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 15:08:37,641 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 0 case distinctions, treesize of input 21 treesize of output 20
[2023-10-25 15:08:37,698 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-25 15:08:37,698 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 1 case distinctions, treesize of input 30 treesize of output 32
[2023-10-25 15:08:37,748 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-25 15:08:37,748 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44
[2023-10-25 15:08:37,824 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 15:08:37,827 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-25 15:08:37,827 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 48 treesize of output 56
[2023-10-25 15:08:38,002 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 15:08:38,004 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 15:08:38,016 INFO  L321             Elim1Store]: treesize reduction 11, result has 45.0 percent of original size
[2023-10-25 15:08:38,016 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 56
[2023-10-25 15:08:38,053 INFO  L134       CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:08:38,054 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-25 15:08:39,082 INFO  L321             Elim1Store]: treesize reduction 242, result has 32.0 percent of original size
[2023-10-25 15:08:39,082 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 2 new quantified variables, introduced 6 case distinctions, treesize of input 656 treesize of output 539
[2023-10-25 15:08:39,209 INFO  L321             Elim1Store]: treesize reduction 37, result has 63.4 percent of original size
[2023-10-25 15:08:39,210 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 723 treesize of output 592
[2023-10-25 15:08:39,251 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 55 treesize of output 53
[2023-10-25 15:08:39,262 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 49
[2023-10-25 15:08:39,293 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 49 treesize of output 45
[2023-10-25 15:08:39,303 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 45 treesize of output 41
[2023-10-25 15:08:39,909 INFO  L134       CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:08:39,909 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1249208238] provided 0 perfect and 2 imperfect interpolant sequences
[2023-10-25 15:08:39,909 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-10-25 15:08:39,910 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 30
[2023-10-25 15:08:39,910 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727378108]
[2023-10-25 15:08:39,910 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-10-25 15:08:39,910 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 32 states
[2023-10-25 15:08:39,910 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:08:39,910 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants.
[2023-10-25 15:08:39,911 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=828, Unknown=3, NotChecked=0, Total=992
[2023-10-25 15:08:45,288 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 54 out of 192
[2023-10-25 15:08:45,289 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 330 transitions, 3543 flow. Second operand  has 32 states, 32 states have (on average 56.75) internal successors, (1816), 32 states have internal predecessors, (1816), 0 states have call successors, (0), 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 15:08:45,289 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:08:45,289 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 192
[2023-10-25 15:08:45,290 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 15:08:48,898 INFO  L130       PetriNetUnfolder]: 482/1137 cut-off events.
[2023-10-25 15:08:48,899 INFO  L131       PetriNetUnfolder]: For 6525/6527 co-relation queries the response was YES.
[2023-10-25 15:08:48,902 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 7201 conditions, 1137 events. 482/1137 cut-off events. For 6525/6527 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 6756 event pairs, 10 based on Foata normal form. 20/1156 useless extension candidates. Maximal degree in co-relation 7043. Up to 402 conditions per place. 
[2023-10-25 15:08:48,911 INFO  L137   encePairwiseOnDemand]: 174/192 looper letters, 335 selfloop transitions, 147 changer transitions 6/490 dead transitions.
[2023-10-25 15:08:48,911 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 490 transitions, 5841 flow
[2023-10-25 15:08:48,912 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. 
[2023-10-25 15:08:48,912 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 19 states.
[2023-10-25 15:08:48,915 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 1228 transitions.
[2023-10-25 15:08:48,916 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.3366228070175439
[2023-10-25 15:08:48,920 INFO  L72            ComplementDD]: Start complementDD. Operand 19 states and 1228 transitions.
[2023-10-25 15:08:48,920 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 19 states and 1228 transitions.
[2023-10-25 15:08:48,921 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 15:08:48,922 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 1228 transitions.
[2023-10-25 15:08:48,924 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 20 states, 19 states have (on average 64.63157894736842) internal successors, (1228), 19 states have internal predecessors, (1228), 0 states have call successors, (0), 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 15:08:48,939 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 20 states, 20 states have (on average 192.0) internal successors, (3840), 20 states have internal predecessors, (3840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:08:48,947 INFO  L81            ComplementDD]: Finished complementDD. Result  has 20 states, 20 states have (on average 192.0) internal successors, (3840), 20 states have internal predecessors, (3840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:08:48,948 INFO  L175             Difference]: Start difference. First operand has 129 places, 330 transitions, 3543 flow. Second operand 19 states and 1228 transitions.
[2023-10-25 15:08:48,948 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 490 transitions, 5841 flow
[2023-10-25 15:08:49,014 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 490 transitions, 5823 flow, removed 0 selfloop flow, removed 7 redundant places.
[2023-10-25 15:08:49,039 INFO  L231             Difference]: Finished difference. Result has 145 places, 342 transitions, 4132 flow
[2023-10-25 15:08:49,040 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=3525, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=330, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=136, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=188, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=4132, PETRI_PLACES=145, PETRI_TRANSITIONS=342}
[2023-10-25 15:08:49,041 INFO  L288   CegarLoopForPetriNet]: 59 programPoint places, 86 predicate places.
[2023-10-25 15:08:49,041 INFO  L495      AbstractCegarLoop]: Abstraction has has 145 places, 342 transitions, 4132 flow
[2023-10-25 15:08:49,042 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 32 states, 32 states have (on average 56.75) internal successors, (1816), 32 states have internal predecessors, (1816), 0 states have call successors, (0), 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 15:08:49,042 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:08:49,042 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1]
[2023-10-25 15:08:49,048 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 15:08:49,246 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,SelfDestructingSolverStorable9
[2023-10-25 15:08:49,247 INFO  L420      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2023-10-25 15:08:49,247 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:08:49,247 INFO  L85        PathProgramCache]: Analyzing trace with hash 1212047773, now seen corresponding path program 1 times
[2023-10-25 15:08:49,247 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:08:49,248 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954081099]
[2023-10-25 15:08:49,248 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:08:49,248 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:08:49,298 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-10-25 15:08:49,298 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2023-10-25 15:08:49,329 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-10-25 15:08:49,365 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2023-10-25 15:08:49,365 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2023-10-25 15:08:49,373 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 9 remaining)
[2023-10-25 15:08:49,375 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (7 of 9 remaining)
[2023-10-25 15:08:49,375 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (6 of 9 remaining)
[2023-10-25 15:08:49,375 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (5 of 9 remaining)
[2023-10-25 15:08:49,376 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (4 of 9 remaining)
[2023-10-25 15:08:49,376 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (3 of 9 remaining)
[2023-10-25 15:08:49,376 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (2 of 9 remaining)
[2023-10-25 15:08:49,376 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 9 remaining)
[2023-10-25 15:08:49,376 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 9 remaining)
[2023-10-25 15:08:49,376 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2023-10-25 15:08:49,377 INFO  L445         BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-25 15:08:49,389 WARN  L233   ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis
[2023-10-25 15:08:49,389 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances.
[2023-10-25 15:08:49,423 INFO  L144    ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions.
[2023-10-25 15:08:49,425 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 139 places, 139 transitions, 296 flow
[2023-10-25 15:08:49,489 INFO  L130       PetriNetUnfolder]: 11/329 cut-off events.
[2023-10-25 15:08:49,489 INFO  L131       PetriNetUnfolder]: For 6/6 co-relation queries the response was YES.
[2023-10-25 15:08:49,490 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 343 conditions, 329 events. 11/329 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 726 event pairs, 0 based on Foata normal form. 0/290 useless extension candidates. Maximal degree in co-relation 188. Up to 8 conditions per place. 
[2023-10-25 15:08:49,490 INFO  L82        GeneralOperation]: Start removeDead. Operand has 139 places, 139 transitions, 296 flow
[2023-10-25 15:08:49,494 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 139 places, 139 transitions, 296 flow
[2023-10-25 15:08:49,494 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2023-10-25 15:08:49,494 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 139 places, 139 transitions, 296 flow
[2023-10-25 15:08:49,495 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 139 places, 139 transitions, 296 flow
[2023-10-25 15:08:49,495 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 139 places, 139 transitions, 296 flow
[2023-10-25 15:08:49,534 INFO  L130       PetriNetUnfolder]: 11/329 cut-off events.
[2023-10-25 15:08:49,535 INFO  L131       PetriNetUnfolder]: For 6/6 co-relation queries the response was YES.
[2023-10-25 15:08:49,535 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 343 conditions, 329 events. 11/329 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 726 event pairs, 0 based on Foata normal form. 0/290 useless extension candidates. Maximal degree in co-relation 188. Up to 8 conditions per place. 
[2023-10-25 15:08:49,539 INFO  L119        LiptonReduction]: Number of co-enabled transitions 5160
[2023-10-25 15:08:52,724 INFO  L134        LiptonReduction]: Checked pairs total: 23741
[2023-10-25 15:08:52,724 INFO  L136        LiptonReduction]: Total number of compositions: 76
[2023-10-25 15:08:52,726 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-10-25 15:08:52,726 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;@440b6fe3, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2023-10-25 15:08:52,726 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 10 error locations.
[2023-10-25 15:08:52,738 INFO  L130       PetriNetUnfolder]: 0/15 cut-off events.
[2023-10-25 15:08:52,738 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2023-10-25 15:08:52,738 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:08:52,738 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2023-10-25 15:08:52,739 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2023-10-25 15:08:52,739 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:08:52,739 INFO  L85        PathProgramCache]: Analyzing trace with hash -708344653, now seen corresponding path program 1 times
[2023-10-25 15:08:52,739 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:08:52,739 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535627703]
[2023-10-25 15:08:52,739 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:08:52,740 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:08:52,760 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:08:52,938 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 15:08:52,938 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:08:52,938 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535627703]
[2023-10-25 15:08:52,938 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535627703] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-25 15:08:52,938 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-25 15:08:52,938 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-10-25 15:08:52,939 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411698156]
[2023-10-25 15:08:52,939 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-25 15:08:52,939 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-10-25 15:08:52,939 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:08:52,939 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-10-25 15:08:52,939 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-10-25 15:08:53,208 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 109 out of 215
[2023-10-25 15:08:53,209 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 68 transitions, 154 flow. Second operand  has 6 states, 6 states have (on average 110.16666666666667) internal successors, (661), 6 states have internal predecessors, (661), 0 states have call successors, (0), 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 15:08:53,209 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:08:53,209 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 215
[2023-10-25 15:08:53,209 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 15:08:54,315 INFO  L130       PetriNetUnfolder]: 2976/6074 cut-off events.
[2023-10-25 15:08:54,315 INFO  L131       PetriNetUnfolder]: For 191/349 co-relation queries the response was YES.
[2023-10-25 15:08:54,322 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 11160 conditions, 6074 events. 2976/6074 cut-off events. For 191/349 co-relation queries the response was YES. Maximal size of possible extension queue 201. Compared 41972 event pairs, 888 based on Foata normal form. 0/5674 useless extension candidates. Maximal degree in co-relation 5347. Up to 3609 conditions per place. 
[2023-10-25 15:08:54,360 INFO  L137   encePairwiseOnDemand]: 195/215 looper letters, 71 selfloop transitions, 42 changer transitions 0/143 dead transitions.
[2023-10-25 15:08:54,360 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 143 transitions, 538 flow
[2023-10-25 15:08:54,361 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-10-25 15:08:54,361 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-10-25 15:08:54,362 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 769 transitions.
[2023-10-25 15:08:54,363 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5961240310077519
[2023-10-25 15:08:54,363 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 769 transitions.
[2023-10-25 15:08:54,364 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 769 transitions.
[2023-10-25 15:08:54,364 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 15:08:54,364 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 769 transitions.
[2023-10-25 15:08:54,366 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 128.16666666666666) internal successors, (769), 6 states have internal predecessors, (769), 0 states have call successors, (0), 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 15:08:54,370 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 215.0) internal successors, (1505), 7 states have internal predecessors, (1505), 0 states have call successors, (0), 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 15:08:54,370 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 215.0) internal successors, (1505), 7 states have internal predecessors, (1505), 0 states have call successors, (0), 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 15:08:54,371 INFO  L175             Difference]: Start difference. First operand has 71 places, 68 transitions, 154 flow. Second operand 6 states and 769 transitions.
[2023-10-25 15:08:54,371 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 143 transitions, 538 flow
[2023-10-25 15:08:54,372 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 143 transitions, 538 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-10-25 15:08:54,386 INFO  L231             Difference]: Finished difference. Result has 81 places, 110 transitions, 446 flow
[2023-10-25 15:08:54,386 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=446, PETRI_PLACES=81, PETRI_TRANSITIONS=110}
[2023-10-25 15:08:54,387 INFO  L288   CegarLoopForPetriNet]: 71 programPoint places, 10 predicate places.
[2023-10-25 15:08:54,387 INFO  L495      AbstractCegarLoop]: Abstraction has has 81 places, 110 transitions, 446 flow
[2023-10-25 15:08:54,388 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 110.16666666666667) internal successors, (661), 6 states have internal predecessors, (661), 0 states have call successors, (0), 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 15:08:54,388 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:08:54,388 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-25 15:08:54,388 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2023-10-25 15:08:54,388 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2023-10-25 15:08:54,388 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:08:54,389 INFO  L85        PathProgramCache]: Analyzing trace with hash -555411616, now seen corresponding path program 1 times
[2023-10-25 15:08:54,389 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:08:54,389 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42079274]
[2023-10-25 15:08:54,389 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:08:54,390 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:08:54,397 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:08:54,430 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 15:08:54,430 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:08:54,430 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42079274]
[2023-10-25 15:08:54,430 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42079274] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-25 15:08:54,431 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-25 15:08:54,431 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2023-10-25 15:08:54,431 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109697003]
[2023-10-25 15:08:54,431 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-25 15:08:54,432 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2023-10-25 15:08:54,437 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:08:54,438 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2023-10-25 15:08:54,438 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2023-10-25 15:08:54,514 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 126 out of 215
[2023-10-25 15:08:54,515 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 110 transitions, 446 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 15:08:54,515 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:08:54,515 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 215
[2023-10-25 15:08:54,515 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 15:08:55,161 INFO  L130       PetriNetUnfolder]: 1575/4192 cut-off events.
[2023-10-25 15:08:55,165 INFO  L131       PetriNetUnfolder]: For 1357/1534 co-relation queries the response was YES.
[2023-10-25 15:08:55,189 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 9133 conditions, 4192 events. 1575/4192 cut-off events. For 1357/1534 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 32502 event pairs, 572 based on Foata normal form. 0/3855 useless extension candidates. Maximal degree in co-relation 3935. Up to 1547 conditions per place. 
[2023-10-25 15:08:55,198 INFO  L137   encePairwiseOnDemand]: 211/215 looper letters, 38 selfloop transitions, 3 changer transitions 3/122 dead transitions.
[2023-10-25 15:08:55,198 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 122 transitions, 568 flow
[2023-10-25 15:08:55,198 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2023-10-25 15:08:55,198 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2023-10-25 15:08:55,199 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 539 transitions.
[2023-10-25 15:08:55,199 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6267441860465116
[2023-10-25 15:08:55,199 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 539 transitions.
[2023-10-25 15:08:55,199 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 539 transitions.
[2023-10-25 15:08:55,205 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 15:08:55,205 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 539 transitions.
[2023-10-25 15:08:55,206 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 5 states, 4 states have (on average 134.75) internal successors, (539), 4 states have internal predecessors, (539), 0 states have call successors, (0), 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 15:08:55,207 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 5 states, 5 states have (on average 215.0) internal successors, (1075), 5 states have internal predecessors, (1075), 0 states have call successors, (0), 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 15:08:55,208 INFO  L81            ComplementDD]: Finished complementDD. Result  has 5 states, 5 states have (on average 215.0) internal successors, (1075), 5 states have internal predecessors, (1075), 0 states have call successors, (0), 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 15:08:55,208 INFO  L175             Difference]: Start difference. First operand has 81 places, 110 transitions, 446 flow. Second operand 4 states and 539 transitions.
[2023-10-25 15:08:55,208 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 122 transitions, 568 flow
[2023-10-25 15:08:55,211 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 122 transitions, 568 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-10-25 15:08:55,216 INFO  L231             Difference]: Finished difference. Result has 86 places, 112 transitions, 466 flow
[2023-10-25 15:08:55,217 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=446, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=466, PETRI_PLACES=86, PETRI_TRANSITIONS=112}
[2023-10-25 15:08:55,217 INFO  L288   CegarLoopForPetriNet]: 71 programPoint places, 15 predicate places.
[2023-10-25 15:08:55,217 INFO  L495      AbstractCegarLoop]: Abstraction has has 86 places, 112 transitions, 466 flow
[2023-10-25 15:08:55,217 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 15:08:55,218 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:08:55,218 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-25 15:08:55,218 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2023-10-25 15:08:55,218 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2023-10-25 15:08:55,218 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:08:55,218 INFO  L85        PathProgramCache]: Analyzing trace with hash 33476867, now seen corresponding path program 1 times
[2023-10-25 15:08:55,218 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:08:55,219 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711838246]
[2023-10-25 15:08:55,219 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:08:55,219 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:08:55,236 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:08:55,402 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 15:08:55,402 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:08:55,403 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711838246]
[2023-10-25 15:08:55,403 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711838246] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-25 15:08:55,403 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-25 15:08:55,403 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-10-25 15:08:55,403 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876869737]
[2023-10-25 15:08:55,404 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-25 15:08:55,405 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-10-25 15:08:55,405 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:08:55,405 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-10-25 15:08:55,405 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-10-25 15:08:55,674 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 103 out of 215
[2023-10-25 15:08:55,674 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 112 transitions, 466 flow. Second operand  has 6 states, 6 states have (on average 104.33333333333333) internal successors, (626), 6 states have internal predecessors, (626), 0 states have call successors, (0), 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 15:08:55,674 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:08:55,674 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 215
[2023-10-25 15:08:55,674 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 15:08:57,459 INFO  L130       PetriNetUnfolder]: 6417/12066 cut-off events.
[2023-10-25 15:08:57,460 INFO  L131       PetriNetUnfolder]: For 6131/6288 co-relation queries the response was YES.
[2023-10-25 15:08:57,500 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 30858 conditions, 12066 events. 6417/12066 cut-off events. For 6131/6288 co-relation queries the response was YES. Maximal size of possible extension queue 385. Compared 87978 event pairs, 1317 based on Foata normal form. 19/11724 useless extension candidates. Maximal degree in co-relation 30728. Up to 7055 conditions per place. 
[2023-10-25 15:08:57,564 INFO  L137   encePairwiseOnDemand]: 188/215 looper letters, 118 selfloop transitions, 104 changer transitions 1/254 dead transitions.
[2023-10-25 15:08:57,564 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 254 transitions, 1510 flow
[2023-10-25 15:08:57,565 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-10-25 15:08:57,565 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-10-25 15:08:57,566 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 751 transitions.
[2023-10-25 15:08:57,566 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5821705426356589
[2023-10-25 15:08:57,573 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 751 transitions.
[2023-10-25 15:08:57,573 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 751 transitions.
[2023-10-25 15:08:57,573 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 15:08:57,573 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 751 transitions.
[2023-10-25 15:08:57,583 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 125.16666666666667) internal successors, (751), 6 states have internal predecessors, (751), 0 states have call successors, (0), 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 15:08:57,585 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 215.0) internal successors, (1505), 7 states have internal predecessors, (1505), 0 states have call successors, (0), 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 15:08:57,585 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 215.0) internal successors, (1505), 7 states have internal predecessors, (1505), 0 states have call successors, (0), 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 15:08:57,585 INFO  L175             Difference]: Start difference. First operand has 86 places, 112 transitions, 466 flow. Second operand 6 states and 751 transitions.
[2023-10-25 15:08:57,585 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 254 transitions, 1510 flow
[2023-10-25 15:08:57,610 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 254 transitions, 1507 flow, removed 0 selfloop flow, removed 1 redundant places.
[2023-10-25 15:08:57,613 INFO  L231             Difference]: Finished difference. Result has 95 places, 215 transitions, 1492 flow
[2023-10-25 15:08:57,613 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=464, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1492, PETRI_PLACES=95, PETRI_TRANSITIONS=215}
[2023-10-25 15:08:57,614 INFO  L288   CegarLoopForPetriNet]: 71 programPoint places, 24 predicate places.
[2023-10-25 15:08:57,614 INFO  L495      AbstractCegarLoop]: Abstraction has has 95 places, 215 transitions, 1492 flow
[2023-10-25 15:08:57,614 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 104.33333333333333) internal successors, (626), 6 states have internal predecessors, (626), 0 states have call successors, (0), 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 15:08:57,614 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:08:57,615 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]
[2023-10-25 15:08:57,615 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2023-10-25 15:08:57,615 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2023-10-25 15:08:57,615 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:08:57,615 INFO  L85        PathProgramCache]: Analyzing trace with hash 163438136, now seen corresponding path program 1 times
[2023-10-25 15:08:57,615 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:08:57,615 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337055776]
[2023-10-25 15:08:57,616 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:08:57,616 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:08:57,662 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:08:57,906 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 15:08:57,906 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:08:57,907 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337055776]
[2023-10-25 15:08:57,907 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337055776] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-25 15:08:57,907 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-25 15:08:57,907 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-10-25 15:08:57,907 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147472066]
[2023-10-25 15:08:57,907 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-25 15:08:57,907 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-10-25 15:08:57,921 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:08:57,922 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-10-25 15:08:57,922 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-10-25 15:08:58,076 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 95 out of 215
[2023-10-25 15:08:58,077 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 215 transitions, 1492 flow. Second operand  has 6 states, 6 states have (on average 98.16666666666667) internal successors, (589), 6 states have internal predecessors, (589), 0 states have call successors, (0), 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 15:08:58,077 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:08:58,077 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 215
[2023-10-25 15:08:58,077 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 15:09:00,961 INFO  L130       PetriNetUnfolder]: 11069/19135 cut-off events.
[2023-10-25 15:09:00,961 INFO  L131       PetriNetUnfolder]: For 23646/23867 co-relation queries the response was YES.
[2023-10-25 15:09:00,993 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 64791 conditions, 19135 events. 11069/19135 cut-off events. For 23646/23867 co-relation queries the response was YES. Maximal size of possible extension queue 557. Compared 135080 event pairs, 3510 based on Foata normal form. 0/18291 useless extension candidates. Maximal degree in co-relation 46355. Up to 15473 conditions per place. 
[2023-10-25 15:09:01,125 INFO  L137   encePairwiseOnDemand]: 181/215 looper letters, 246 selfloop transitions, 178 changer transitions 0/441 dead transitions.
[2023-10-25 15:09:01,125 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 441 transitions, 3416 flow
[2023-10-25 15:09:01,125 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-10-25 15:09:01,125 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-10-25 15:09:01,126 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 800 transitions.
[2023-10-25 15:09:01,127 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6201550387596899
[2023-10-25 15:09:01,127 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 800 transitions.
[2023-10-25 15:09:01,127 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 800 transitions.
[2023-10-25 15:09:01,129 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 15:09:01,129 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 800 transitions.
[2023-10-25 15:09:01,130 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 133.33333333333334) internal successors, (800), 6 states have internal predecessors, (800), 0 states have call successors, (0), 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 15:09:01,146 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 215.0) internal successors, (1505), 7 states have internal predecessors, (1505), 0 states have call successors, (0), 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 15:09:01,147 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 215.0) internal successors, (1505), 7 states have internal predecessors, (1505), 0 states have call successors, (0), 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 15:09:01,147 INFO  L175             Difference]: Start difference. First operand has 95 places, 215 transitions, 1492 flow. Second operand 6 states and 800 transitions.
[2023-10-25 15:09:01,147 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 441 transitions, 3416 flow
[2023-10-25 15:09:01,211 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 441 transitions, 3406 flow, removed 5 selfloop flow, removed 1 redundant places.
[2023-10-25 15:09:01,214 INFO  L231             Difference]: Finished difference. Result has 102 places, 377 transitions, 2975 flow
[2023-10-25 15:09:01,215 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=1490, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=215, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=151, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2975, PETRI_PLACES=102, PETRI_TRANSITIONS=377}
[2023-10-25 15:09:01,216 INFO  L288   CegarLoopForPetriNet]: 71 programPoint places, 31 predicate places.
[2023-10-25 15:09:01,216 INFO  L495      AbstractCegarLoop]: Abstraction has has 102 places, 377 transitions, 2975 flow
[2023-10-25 15:09:01,216 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 98.16666666666667) internal successors, (589), 6 states have internal predecessors, (589), 0 states have call successors, (0), 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 15:09:01,216 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:09:01,216 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-25 15:09:01,217 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2023-10-25 15:09:01,217 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2023-10-25 15:09:01,217 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:09:01,217 INFO  L85        PathProgramCache]: Analyzing trace with hash -1795788423, now seen corresponding path program 1 times
[2023-10-25 15:09:01,217 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:09:01,217 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187535099]
[2023-10-25 15:09:01,218 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:09:01,218 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:09:01,243 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:09:01,766 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:09:01,766 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:09:01,766 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187535099]
[2023-10-25 15:09:01,766 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187535099] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-25 15:09:01,766 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [157271630]
[2023-10-25 15:09:01,767 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:09:01,767 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-25 15:09:01,767 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-25 15:09:01,768 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 15:09:01,820 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 15:09:01,996 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:09:01,998 INFO  L263         TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 24 conjunts are in the unsatisfiable core
[2023-10-25 15:09:02,002 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-25 15:09:02,014 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 17 treesize of output 9
[2023-10-25 15:09:02,096 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2023-10-25 15:09:02,120 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 0 case distinctions, treesize of input 21 treesize of output 20
[2023-10-25 15:09:02,158 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-25 15:09:02,159 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 1 case distinctions, treesize of input 30 treesize of output 32
[2023-10-25 15:09:02,208 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-25 15:09:02,209 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44
[2023-10-25 15:09:02,260 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 15:09:02,260 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 15:09:02,267 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:09:02,268 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-25 15:09:02,405 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_1098 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_1098) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_1098 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_1098) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_1098 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_1098) c_threadThread1of2ForFork0_~t~0.base) .cse1))) (forall ((v_ArrVal_1098 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_1098) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1))))))) is different from false
[2023-10-25 15:09:02,545 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:09:02,545 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [157271630] provided 0 perfect and 2 imperfect interpolant sequences
[2023-10-25 15:09:02,545 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-10-25 15:09:02,545 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 23
[2023-10-25 15:09:02,545 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445281427]
[2023-10-25 15:09:02,545 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-10-25 15:09:02,546 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 25 states
[2023-10-25 15:09:02,546 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:09:02,546 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants.
[2023-10-25 15:09:02,546 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=451, Unknown=7, NotChecked=44, Total=600
[2023-10-25 15:09:02,588 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 65 out of 215
[2023-10-25 15:09:02,589 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 377 transitions, 2975 flow. Second operand  has 25 states, 25 states have (on average 67.84) internal successors, (1696), 25 states have internal predecessors, (1696), 0 states have call successors, (0), 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 15:09:02,589 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:09:02,589 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 215
[2023-10-25 15:09:02,589 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 15:09:08,681 INFO  L130       PetriNetUnfolder]: 17059/27855 cut-off events.
[2023-10-25 15:09:08,681 INFO  L131       PetriNetUnfolder]: For 54148/54154 co-relation queries the response was YES.
[2023-10-25 15:09:08,761 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 113331 conditions, 27855 events. 17059/27855 cut-off events. For 54148/54154 co-relation queries the response was YES. Maximal size of possible extension queue 722. Compared 194158 event pairs, 4731 based on Foata normal form. 6/25308 useless extension candidates. Maximal degree in co-relation 75608. Up to 19388 conditions per place. 
[2023-10-25 15:09:08,960 INFO  L137   encePairwiseOnDemand]: 151/215 looper letters, 551 selfloop transitions, 440 changer transitions 1/995 dead transitions.
[2023-10-25 15:09:08,960 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 995 transitions, 9034 flow
[2023-10-25 15:09:08,961 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. 
[2023-10-25 15:09:08,961 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 19 states.
[2023-10-25 15:09:08,962 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 1684 transitions.
[2023-10-25 15:09:08,963 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.41223990208078337
[2023-10-25 15:09:08,963 INFO  L72            ComplementDD]: Start complementDD. Operand 19 states and 1684 transitions.
[2023-10-25 15:09:08,963 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 19 states and 1684 transitions.
[2023-10-25 15:09:08,964 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 15:09:08,964 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 1684 transitions.
[2023-10-25 15:09:08,966 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 20 states, 19 states have (on average 88.63157894736842) internal successors, (1684), 19 states have internal predecessors, (1684), 0 states have call successors, (0), 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 15:09:08,969 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 20 states, 20 states have (on average 215.0) internal successors, (4300), 20 states have internal predecessors, (4300), 0 states have call successors, (0), 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 15:09:08,982 INFO  L81            ComplementDD]: Finished complementDD. Result  has 20 states, 20 states have (on average 215.0) internal successors, (4300), 20 states have internal predecessors, (4300), 0 states have call successors, (0), 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 15:09:08,982 INFO  L175             Difference]: Start difference. First operand has 102 places, 377 transitions, 2975 flow. Second operand 19 states and 1684 transitions.
[2023-10-25 15:09:08,982 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 995 transitions, 9034 flow
[2023-10-25 15:09:09,777 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 995 transitions, 8884 flow, removed 75 selfloop flow, removed 0 redundant places.
[2023-10-25 15:09:09,793 INFO  L231             Difference]: Finished difference. Result has 129 places, 727 transitions, 7651 flow
[2023-10-25 15:09:09,793 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=2855, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=377, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=182, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=7651, PETRI_PLACES=129, PETRI_TRANSITIONS=727}
[2023-10-25 15:09:09,794 INFO  L288   CegarLoopForPetriNet]: 71 programPoint places, 58 predicate places.
[2023-10-25 15:09:09,794 INFO  L495      AbstractCegarLoop]: Abstraction has has 129 places, 727 transitions, 7651 flow
[2023-10-25 15:09:09,794 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 25 states, 25 states have (on average 67.84) internal successors, (1696), 25 states have internal predecessors, (1696), 0 states have call successors, (0), 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 15:09:09,794 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:09:09,795 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-25 15:09:09,801 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0
[2023-10-25 15:09:09,999 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15
[2023-10-25 15:09:10,000 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2023-10-25 15:09:10,001 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:09:10,001 INFO  L85        PathProgramCache]: Analyzing trace with hash 405194917, now seen corresponding path program 1 times
[2023-10-25 15:09:10,001 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:09:10,001 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096549839]
[2023-10-25 15:09:10,002 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:09:10,002 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:09:10,041 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:09:10,593 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:09:10,593 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:09:10,593 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096549839]
[2023-10-25 15:09:10,594 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096549839] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-25 15:09:10,594 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [707819584]
[2023-10-25 15:09:10,594 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:09:10,594 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-25 15:09:10,594 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-25 15:09:10,595 INFO  L229       MonitoredProcess]: Starting monitored process 9 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-10-25 15:09:10,658 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process
[2023-10-25 15:09:10,808 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:09:10,818 INFO  L263         TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 26 conjunts are in the unsatisfiable core
[2023-10-25 15:09:10,819 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-25 15:09:10,835 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 17 treesize of output 9
[2023-10-25 15:09:10,965 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 15:09:11,005 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 15:09:11,006 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 15:09:11,056 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 15:09:11,057 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 15:09:11,059 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 15:09:11,107 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 15:09:11,108 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 15:09:11,109 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 15:09:11,110 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 15:09:11,161 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 15:09:11,162 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 15:09:11,202 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:09:11,203 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-25 15:09:11,237 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1211 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1211) |c_ULTIMATE.start_main_~#ts~0#1.base|) |c_ULTIMATE.start_main_~#ts~0#1.offset|) 0)) (forall ((v_ArrVal_1211 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1211) |c_ULTIMATE.start_main_~#ts~0#1.base|) (+ 3 |c_ULTIMATE.start_main_~#ts~0#1.offset|)) 0)) (forall ((v_ArrVal_1211 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1211) |c_ULTIMATE.start_main_~#ts~0#1.base|) (+ |c_ULTIMATE.start_main_~#ts~0#1.offset| 1)) 0)) (forall ((v_ArrVal_1211 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1211) |c_ULTIMATE.start_main_~#ts~0#1.base|) (+ 2 |c_ULTIMATE.start_main_~#ts~0#1.offset|)) 0))) is different from false
[2023-10-25 15:09:11,406 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ 2 |c_ULTIMATE.start_main_~#ts~0#1.offset|)) (.cse2 (+ 3 |c_ULTIMATE.start_main_~#ts~0#1.offset|))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base|) .cse1 0) .cse2 0)))) (and (forall ((v_ArrVal_1211 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1211) |c_ULTIMATE.start_main_~#ts~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1211 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1211) |c_ULTIMATE.start_main_~#ts~0#1.base|) |c_ULTIMATE.start_main_~#ts~0#1.offset|) 0)) (forall ((v_ArrVal_1211 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1211) |c_ULTIMATE.start_main_~#ts~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_1211 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1211) |c_ULTIMATE.start_main_~#ts~0#1.base|) (+ |c_ULTIMATE.start_main_~#ts~0#1.offset| 1)) 0))))) is different from false
[2023-10-25 15:09:11,551 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked.
[2023-10-25 15:09:11,551 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [707819584] provided 0 perfect and 2 imperfect interpolant sequences
[2023-10-25 15:09:11,552 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-10-25 15:09:11,552 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 25
[2023-10-25 15:09:11,552 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055906158]
[2023-10-25 15:09:11,552 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-10-25 15:09:11,552 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 27 states
[2023-10-25 15:09:11,552 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:09:11,552 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants.
[2023-10-25 15:09:11,553 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=489, Unknown=11, NotChecked=94, Total=702
[2023-10-25 15:09:11,621 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 67 out of 215
[2023-10-25 15:09:11,623 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 727 transitions, 7651 flow. Second operand  has 27 states, 27 states have (on average 69.5925925925926) internal successors, (1879), 27 states have internal predecessors, (1879), 0 states have call successors, (0), 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 15:09:11,623 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:09:11,623 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 215
[2023-10-25 15:09:11,623 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 15:09:18,528 INFO  L130       PetriNetUnfolder]: 19905/32868 cut-off events.
[2023-10-25 15:09:18,528 INFO  L131       PetriNetUnfolder]: For 121458/121466 co-relation queries the response was YES.
[2023-10-25 15:09:18,630 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 170450 conditions, 32868 events. 19905/32868 cut-off events. For 121458/121466 co-relation queries the response was YES. Maximal size of possible extension queue 835. Compared 236537 event pairs, 3283 based on Foata normal form. 254/30257 useless extension candidates. Maximal degree in co-relation 149719. Up to 16549 conditions per place. 
[2023-10-25 15:09:18,870 INFO  L137   encePairwiseOnDemand]: 185/215 looper letters, 974 selfloop transitions, 520 changer transitions 0/1497 dead transitions.
[2023-10-25 15:09:18,870 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 1497 transitions, 17648 flow
[2023-10-25 15:09:18,871 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. 
[2023-10-25 15:09:18,871 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 16 states.
[2023-10-25 15:09:18,886 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1382 transitions.
[2023-10-25 15:09:18,902 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.40174418604651163
[2023-10-25 15:09:18,902 INFO  L72            ComplementDD]: Start complementDD. Operand 16 states and 1382 transitions.
[2023-10-25 15:09:18,902 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 16 states and 1382 transitions.
[2023-10-25 15:09:18,902 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 15:09:18,903 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1382 transitions.
[2023-10-25 15:09:18,904 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 17 states, 16 states have (on average 86.375) internal successors, (1382), 16 states have internal predecessors, (1382), 0 states have call successors, (0), 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 15:09:18,907 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 17 states, 17 states have (on average 215.0) internal successors, (3655), 17 states have internal predecessors, (3655), 0 states have call successors, (0), 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 15:09:18,907 INFO  L81            ComplementDD]: Finished complementDD. Result  has 17 states, 17 states have (on average 215.0) internal successors, (3655), 17 states have internal predecessors, (3655), 0 states have call successors, (0), 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 15:09:18,908 INFO  L175             Difference]: Start difference. First operand has 129 places, 727 transitions, 7651 flow. Second operand 16 states and 1382 transitions.
[2023-10-25 15:09:18,908 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 1497 transitions, 17648 flow
[2023-10-25 15:09:21,529 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 1497 transitions, 17381 flow, removed 132 selfloop flow, removed 1 redundant places.
[2023-10-25 15:09:21,545 INFO  L231             Difference]: Finished difference. Result has 150 places, 1033 transitions, 13043 flow
[2023-10-25 15:09:21,546 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=7541, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=727, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=250, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=345, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=13043, PETRI_PLACES=150, PETRI_TRANSITIONS=1033}
[2023-10-25 15:09:21,551 INFO  L288   CegarLoopForPetriNet]: 71 programPoint places, 79 predicate places.
[2023-10-25 15:09:21,551 INFO  L495      AbstractCegarLoop]: Abstraction has has 150 places, 1033 transitions, 13043 flow
[2023-10-25 15:09:21,551 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 27 states, 27 states have (on average 69.5925925925926) internal successors, (1879), 27 states have internal predecessors, (1879), 0 states have call successors, (0), 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 15:09:21,551 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:09:21,551 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]
[2023-10-25 15:09:21,557 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0
[2023-10-25 15:09:21,756 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16
[2023-10-25 15:09:21,756 INFO  L420      AbstractCegarLoop]: === Iteration 7 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2023-10-25 15:09:21,757 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:09:21,757 INFO  L85        PathProgramCache]: Analyzing trace with hash -1730679491, now seen corresponding path program 1 times
[2023-10-25 15:09:21,757 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:09:21,760 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149392348]
[2023-10-25 15:09:21,760 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:09:21,761 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:09:21,804 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:09:21,868 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:09:21,868 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:09:21,869 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149392348]
[2023-10-25 15:09:21,869 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149392348] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-25 15:09:21,869 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [435402063]
[2023-10-25 15:09:21,869 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:09:21,869 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-25 15:09:21,869 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-25 15:09:21,886 INFO  L229       MonitoredProcess]: Starting monitored process 10 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-10-25 15:09:21,923 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process
[2023-10-25 15:09:22,080 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:09:22,081 INFO  L263         TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 4 conjunts are in the unsatisfiable core
[2023-10-25 15:09:22,084 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-25 15:09:22,132 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:09:22,132 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-25 15:09:22,182 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:09:22,182 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [435402063] provided 0 perfect and 2 imperfect interpolant sequences
[2023-10-25 15:09:22,182 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-10-25 15:09:22,182 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6
[2023-10-25 15:09:22,182 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83435732]
[2023-10-25 15:09:22,182 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-10-25 15:09:22,183 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2023-10-25 15:09:22,183 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:09:22,183 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2023-10-25 15:09:22,183 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42
[2023-10-25 15:09:22,282 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 122 out of 215
[2023-10-25 15:09:22,283 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 1033 transitions, 13043 flow. Second operand  has 7 states, 7 states have (on average 124.0) internal successors, (868), 7 states have internal predecessors, (868), 0 states have call successors, (0), 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 15:09:22,283 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:09:22,283 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 215
[2023-10-25 15:09:22,283 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 15:09:23,795 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([571] L1018-7-->threadEXIT: Formula: (let ((.cse0 (select |v_#race_211| v_threadThread2of2ForFork0_~t~0.base_29))) (and (= |v_threadThread2of2ForFork0_#res.base_9| 0) (= |v_threadThread2of2ForFork0_#t~nondet4_28| (select .cse0 (+ v_threadThread2of2ForFork0_~t~0.offset_29 1))) (= |v_threadThread2of2ForFork0_#t~nondet4_28| (select .cse0 (+ 3 v_threadThread2of2ForFork0_~t~0.offset_29))) (= |v_threadThread2of2ForFork0_#res.offset_9| 0) (= |v_threadThread2of2ForFork0_#t~nondet4_28| (select .cse0 (+ 2 v_threadThread2of2ForFork0_~t~0.offset_29))) (= |v_threadThread2of2ForFork0_#t~nondet4_28| (select .cse0 v_threadThread2of2ForFork0_~t~0.offset_29))))  InVars {#race=|v_#race_211|, threadThread2of2ForFork0_~t~0.offset=v_threadThread2of2ForFork0_~t~0.offset_29, threadThread2of2ForFork0_#t~nondet4=|v_threadThread2of2ForFork0_#t~nondet4_28|, threadThread2of2ForFork0_~t~0.base=v_threadThread2of2ForFork0_~t~0.base_29}  OutVars{#race=|v_#race_211|, threadThread2of2ForFork0_~t~0.offset=v_threadThread2of2ForFork0_~t~0.offset_29, threadThread2of2ForFork0_#res.offset=|v_threadThread2of2ForFork0_#res.offset_9|, threadThread2of2ForFork0_#t~nondet3=|v_threadThread2of2ForFork0_#t~nondet3_15|, threadThread2of2ForFork0_~t~0.base=v_threadThread2of2ForFork0_~t~0.base_29, threadThread2of2ForFork0_#res.base=|v_threadThread2of2ForFork0_#res.base_9|}  AuxVars[]  AssignedVars[threadThread2of2ForFork0_#res.offset, threadThread2of2ForFork0_#t~nondet4, threadThread2of2ForFork0_#t~nondet3, threadThread2of2ForFork0_#res.base][272], [Black: 376#(and (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#ts~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ threadThread1of2ForFork0_~t~0.offset 1))) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#ts~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ 2 threadThread1of2ForFork0_~t~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset))), 60#L1029-5true, Black: 380#(and (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#ts~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ threadThread1of2ForFork0_~t~0.offset 1))) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#ts~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ 3 threadThread1of2ForFork0_~t~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ 2 threadThread1of2ForFork0_~t~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset))), 579#(and (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#ts~0#1.base|) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#ts~0#1.base|) (= |ULTIMATE.start_main_~#ts~0#1.offset| 0)), Black: 366#(and (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#ts~0#1.base|) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#ts~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset))), Black: 356#(and (= |ULTIMATE.start_main_#t~mem9#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#ts~0#1.base|) |ULTIMATE.start_main_~#ts~0#1.offset|)) (<= (+ |ULTIMATE.start_main_#t~mem9#1.base| 2) |ULTIMATE.start_main_~#ts~0#1.base|)), Black: 374#(and (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#ts~0#1.base|) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#ts~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ 2 threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_1098 (Array Int Int))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |#race| threadThread1of2ForFork0_~t~0.base (store (select |#race| threadThread1of2ForFork0_~t~0.base) (+ 3 threadThread1of2ForFork0_~t~0.offset) |threadThread1of2ForFork0_#t~nondet4|)) |ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_1098) threadThread1of2ForFork0_~t~0.base) (+ threadThread1of2ForFork0_~t~0.offset 1)))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset))), Black: 197#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ threadThread1of2ForFork0_~t~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ 3 threadThread1of2ForFork0_~t~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ 2 threadThread1of2ForFork0_~t~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset))), 47#threadEXITtrue, threadThread1of2ForFork0InUse, threadThread2of2ForFork0InUse, Black: 583#(and (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#ts~0#1.base|) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#ts~0#1.base|) (forall ((v_ArrVal_1211 (Array Int Int))) (= (select (select (store (store |#race| |ULTIMATE.start_main_~#ts~0#1.base| (store (store (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ 2 |ULTIMATE.start_main_~#ts~0#1.offset|) 0) (+ 3 |ULTIMATE.start_main_~#ts~0#1.offset|) 0)) threadThread1of2ForFork0_~t~0.base v_ArrVal_1211) |ULTIMATE.start_main_~#ts~0#1.base|) (+ |ULTIMATE.start_main_~#ts~0#1.offset| 1)) 0)) (= |ULTIMATE.start_main_~#ts~0#1.offset| 0) (forall ((v_ArrVal_1211 (Array Int Int))) (= (select (select (store (store |#race| |ULTIMATE.start_main_~#ts~0#1.base| (store (store (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ 2 |ULTIMATE.start_main_~#ts~0#1.offset|) 0) (+ 3 |ULTIMATE.start_main_~#ts~0#1.offset|) 0)) threadThread1of2ForFork0_~t~0.base v_ArrVal_1211) |ULTIMATE.start_main_~#ts~0#1.base|) |ULTIMATE.start_main_~#ts~0#1.offset|) 0))), Black: 575#(and (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ |ULTIMATE.start_main_~#ts~0#1.offset| 1)) 0) (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#ts~0#1.base|) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#ts~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ 2 |ULTIMATE.start_main_~#ts~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) |ULTIMATE.start_main_~#ts~0#1.offset|) 0) (= |ULTIMATE.start_main_~#ts~0#1.offset| 0) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ 3 |ULTIMATE.start_main_~#ts~0#1.offset|)) 0)), Black: 587#(and (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ |ULTIMATE.start_main_~#ts~0#1.offset| 1)) 0) (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#ts~0#1.base|) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#ts~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) |ULTIMATE.start_main_~#ts~0#1.offset|) 0) (= |ULTIMATE.start_main_~#ts~0#1.offset| 0)), Black: 585#(and (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ |ULTIMATE.start_main_~#ts~0#1.offset| 1)) 0) (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#ts~0#1.base|) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#ts~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ 2 |ULTIMATE.start_main_~#ts~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) |ULTIMATE.start_main_~#ts~0#1.offset|) 0) (= |ULTIMATE.start_main_~#ts~0#1.offset| 0)), Black: 573#(and (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ |ULTIMATE.start_main_~#ts~0#1.offset| 1)) 0) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#ts~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ 2 |ULTIMATE.start_main_~#ts~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) |ULTIMATE.start_main_~#ts~0#1.offset|) 0) (= |ULTIMATE.start_main_~#ts~0#1.offset| 0) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ 3 |ULTIMATE.start_main_~#ts~0#1.offset|)) 0)), Black: 581#(and (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#ts~0#1.base|) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#ts~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) |ULTIMATE.start_main_~#ts~0#1.offset|) 0) (= |ULTIMATE.start_main_~#ts~0#1.offset| 0)), Black: 146#(and (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ |ULTIMATE.start_main_~#ts~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ 2 |ULTIMATE.start_main_~#ts~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) |ULTIMATE.start_main_~#ts~0#1.offset|) 0)), Black: 147#(and (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ |ULTIMATE.start_main_~#ts~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ 2 |ULTIMATE.start_main_~#ts~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) |ULTIMATE.start_main_~#ts~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ 3 |ULTIMATE.start_main_~#ts~0#1.offset|)) 0)), Black: 145#(and (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ |ULTIMATE.start_main_~#ts~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) |ULTIMATE.start_main_~#ts~0#1.offset|) 0)), Black: 144#(= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) |ULTIMATE.start_main_~#ts~0#1.offset|) 0), 142#true, Black: 156#(= |ULTIMATE.start_main_~i~0#1| 0), 756#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), Black: 165#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 166#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 168#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 167#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), 364#(and (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#ts~0#1.base|) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#ts~0#1.base|)), 5#threadEXITtrue, Black: 177#(= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset)), Black: 179#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ threadThread1of2ForFork0_~t~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ 2 threadThread1of2ForFork0_~t~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset))), 175#true, Black: 180#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ threadThread1of2ForFork0_~t~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ 3 threadThread1of2ForFork0_~t~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ 2 threadThread1of2ForFork0_~t~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset))), Black: 178#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ threadThread1of2ForFork0_~t~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset))), Black: 201#(<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#ts~0#1.base|) |ULTIMATE.start_main_~#ts~0#1.offset|)) |ULTIMATE.start_main_~#ts~0#1.base|), 163#true, Black: 370#(and (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#ts~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ threadThread1of2ForFork0_~t~0.offset 1))) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#ts~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset)))])
[2023-10-25 15:09:23,797 INFO  L383   tUnfolder$Statistics]: this new event has 46 ancestors and is cut-off event
[2023-10-25 15:09:23,797 INFO  L386   tUnfolder$Statistics]:   existing Event has 46 ancestors and is cut-off event
[2023-10-25 15:09:23,798 INFO  L386   tUnfolder$Statistics]:   existing Event has 46 ancestors and is cut-off event
[2023-10-25 15:09:23,798 INFO  L386   tUnfolder$Statistics]:   existing Event has 46 ancestors and is cut-off event
[2023-10-25 15:09:23,942 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([571] L1018-7-->threadEXIT: Formula: (let ((.cse0 (select |v_#race_211| v_threadThread2of2ForFork0_~t~0.base_29))) (and (= |v_threadThread2of2ForFork0_#res.base_9| 0) (= |v_threadThread2of2ForFork0_#t~nondet4_28| (select .cse0 (+ v_threadThread2of2ForFork0_~t~0.offset_29 1))) (= |v_threadThread2of2ForFork0_#t~nondet4_28| (select .cse0 (+ 3 v_threadThread2of2ForFork0_~t~0.offset_29))) (= |v_threadThread2of2ForFork0_#res.offset_9| 0) (= |v_threadThread2of2ForFork0_#t~nondet4_28| (select .cse0 (+ 2 v_threadThread2of2ForFork0_~t~0.offset_29))) (= |v_threadThread2of2ForFork0_#t~nondet4_28| (select .cse0 v_threadThread2of2ForFork0_~t~0.offset_29))))  InVars {#race=|v_#race_211|, threadThread2of2ForFork0_~t~0.offset=v_threadThread2of2ForFork0_~t~0.offset_29, threadThread2of2ForFork0_#t~nondet4=|v_threadThread2of2ForFork0_#t~nondet4_28|, threadThread2of2ForFork0_~t~0.base=v_threadThread2of2ForFork0_~t~0.base_29}  OutVars{#race=|v_#race_211|, threadThread2of2ForFork0_~t~0.offset=v_threadThread2of2ForFork0_~t~0.offset_29, threadThread2of2ForFork0_#res.offset=|v_threadThread2of2ForFork0_#res.offset_9|, threadThread2of2ForFork0_#t~nondet3=|v_threadThread2of2ForFork0_#t~nondet3_15|, threadThread2of2ForFork0_~t~0.base=v_threadThread2of2ForFork0_~t~0.base_29, threadThread2of2ForFork0_#res.base=|v_threadThread2of2ForFork0_#res.base_9|}  AuxVars[]  AssignedVars[threadThread2of2ForFork0_#res.offset, threadThread2of2ForFork0_#t~nondet4, threadThread2of2ForFork0_#t~nondet3, threadThread2of2ForFork0_#res.base][272], [Black: 376#(and (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#ts~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ threadThread1of2ForFork0_~t~0.offset 1))) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#ts~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ 2 threadThread1of2ForFork0_~t~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset))), Black: 380#(and (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#ts~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ threadThread1of2ForFork0_~t~0.offset 1))) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#ts~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ 3 threadThread1of2ForFork0_~t~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ 2 threadThread1of2ForFork0_~t~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset))), 579#(and (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#ts~0#1.base|) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#ts~0#1.base|) (= |ULTIMATE.start_main_~#ts~0#1.offset| 0)), Black: 366#(and (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#ts~0#1.base|) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#ts~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset))), Black: 356#(and (= |ULTIMATE.start_main_#t~mem9#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#ts~0#1.base|) |ULTIMATE.start_main_~#ts~0#1.offset|)) (<= (+ |ULTIMATE.start_main_#t~mem9#1.base| 2) |ULTIMATE.start_main_~#ts~0#1.base|)), Black: 374#(and (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#ts~0#1.base|) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#ts~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ 2 threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_1098 (Array Int Int))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |#race| threadThread1of2ForFork0_~t~0.base (store (select |#race| threadThread1of2ForFork0_~t~0.base) (+ 3 threadThread1of2ForFork0_~t~0.offset) |threadThread1of2ForFork0_#t~nondet4|)) |ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_1098) threadThread1of2ForFork0_~t~0.base) (+ threadThread1of2ForFork0_~t~0.offset 1)))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset))), Black: 197#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ threadThread1of2ForFork0_~t~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ 3 threadThread1of2ForFork0_~t~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ 2 threadThread1of2ForFork0_~t~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset))), 47#threadEXITtrue, threadThread1of2ForFork0InUse, threadThread2of2ForFork0InUse, Black: 583#(and (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#ts~0#1.base|) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#ts~0#1.base|) (forall ((v_ArrVal_1211 (Array Int Int))) (= (select (select (store (store |#race| |ULTIMATE.start_main_~#ts~0#1.base| (store (store (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ 2 |ULTIMATE.start_main_~#ts~0#1.offset|) 0) (+ 3 |ULTIMATE.start_main_~#ts~0#1.offset|) 0)) threadThread1of2ForFork0_~t~0.base v_ArrVal_1211) |ULTIMATE.start_main_~#ts~0#1.base|) (+ |ULTIMATE.start_main_~#ts~0#1.offset| 1)) 0)) (= |ULTIMATE.start_main_~#ts~0#1.offset| 0) (forall ((v_ArrVal_1211 (Array Int Int))) (= (select (select (store (store |#race| |ULTIMATE.start_main_~#ts~0#1.base| (store (store (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ 2 |ULTIMATE.start_main_~#ts~0#1.offset|) 0) (+ 3 |ULTIMATE.start_main_~#ts~0#1.offset|) 0)) threadThread1of2ForFork0_~t~0.base v_ArrVal_1211) |ULTIMATE.start_main_~#ts~0#1.base|) |ULTIMATE.start_main_~#ts~0#1.offset|) 0))), Black: 575#(and (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ |ULTIMATE.start_main_~#ts~0#1.offset| 1)) 0) (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#ts~0#1.base|) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#ts~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ 2 |ULTIMATE.start_main_~#ts~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) |ULTIMATE.start_main_~#ts~0#1.offset|) 0) (= |ULTIMATE.start_main_~#ts~0#1.offset| 0) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ 3 |ULTIMATE.start_main_~#ts~0#1.offset|)) 0)), Black: 587#(and (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ |ULTIMATE.start_main_~#ts~0#1.offset| 1)) 0) (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#ts~0#1.base|) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#ts~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) |ULTIMATE.start_main_~#ts~0#1.offset|) 0) (= |ULTIMATE.start_main_~#ts~0#1.offset| 0)), Black: 585#(and (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ |ULTIMATE.start_main_~#ts~0#1.offset| 1)) 0) (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#ts~0#1.base|) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#ts~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ 2 |ULTIMATE.start_main_~#ts~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) |ULTIMATE.start_main_~#ts~0#1.offset|) 0) (= |ULTIMATE.start_main_~#ts~0#1.offset| 0)), Black: 573#(and (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ |ULTIMATE.start_main_~#ts~0#1.offset| 1)) 0) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#ts~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ 2 |ULTIMATE.start_main_~#ts~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) |ULTIMATE.start_main_~#ts~0#1.offset|) 0) (= |ULTIMATE.start_main_~#ts~0#1.offset| 0) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ 3 |ULTIMATE.start_main_~#ts~0#1.offset|)) 0)), Black: 581#(and (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#ts~0#1.base|) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#ts~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) |ULTIMATE.start_main_~#ts~0#1.offset|) 0) (= |ULTIMATE.start_main_~#ts~0#1.offset| 0)), Black: 146#(and (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ |ULTIMATE.start_main_~#ts~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ 2 |ULTIMATE.start_main_~#ts~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) |ULTIMATE.start_main_~#ts~0#1.offset|) 0)), Black: 147#(and (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ |ULTIMATE.start_main_~#ts~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ 2 |ULTIMATE.start_main_~#ts~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) |ULTIMATE.start_main_~#ts~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ 3 |ULTIMATE.start_main_~#ts~0#1.offset|)) 0)), Black: 145#(and (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ |ULTIMATE.start_main_~#ts~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) |ULTIMATE.start_main_~#ts~0#1.offset|) 0)), Black: 144#(= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) |ULTIMATE.start_main_~#ts~0#1.offset|) 0), 142#true, Black: 156#(= |ULTIMATE.start_main_~i~0#1| 0), 756#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), Black: 165#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), 71#L1030-1true, Black: 166#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 168#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 167#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), 364#(and (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#ts~0#1.base|) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#ts~0#1.base|)), 5#threadEXITtrue, Black: 177#(= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset)), Black: 179#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ threadThread1of2ForFork0_~t~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ 2 threadThread1of2ForFork0_~t~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset))), 175#true, Black: 180#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ threadThread1of2ForFork0_~t~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ 3 threadThread1of2ForFork0_~t~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ 2 threadThread1of2ForFork0_~t~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset))), Black: 178#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ threadThread1of2ForFork0_~t~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset))), Black: 201#(<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#ts~0#1.base|) |ULTIMATE.start_main_~#ts~0#1.offset|)) |ULTIMATE.start_main_~#ts~0#1.base|), 163#true, Black: 370#(and (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#ts~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ threadThread1of2ForFork0_~t~0.offset 1))) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#ts~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset)))])
[2023-10-25 15:09:23,943 INFO  L383   tUnfolder$Statistics]: this new event has 47 ancestors and is cut-off event
[2023-10-25 15:09:23,943 INFO  L386   tUnfolder$Statistics]:   existing Event has 47 ancestors and is cut-off event
[2023-10-25 15:09:23,943 INFO  L386   tUnfolder$Statistics]:   existing Event has 47 ancestors and is cut-off event
[2023-10-25 15:09:23,943 INFO  L386   tUnfolder$Statistics]:   existing Event has 47 ancestors and is cut-off event
[2023-10-25 15:09:24,160 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([510] L1018-2-->L1018-4: Formula: (= (store |v_#race_192| v_threadThread2of2ForFork0_~t~0.base_19 (store (select |v_#race_192| v_threadThread2of2ForFork0_~t~0.base_19) v_threadThread2of2ForFork0_~t~0.offset_19 |v_threadThread2of2ForFork0_#t~nondet4_19|)) |v_#race_191|)  InVars {#race=|v_#race_192|, threadThread2of2ForFork0_~t~0.offset=v_threadThread2of2ForFork0_~t~0.offset_19, threadThread2of2ForFork0_~t~0.base=v_threadThread2of2ForFork0_~t~0.base_19}  OutVars{#race=|v_#race_191|, threadThread2of2ForFork0_~t~0.offset=v_threadThread2of2ForFork0_~t~0.offset_19, threadThread2of2ForFork0_#t~nondet4=|v_threadThread2of2ForFork0_#t~nondet4_19|, threadThread2of2ForFork0_~t~0.base=v_threadThread2of2ForFork0_~t~0.base_19}  AuxVars[]  AssignedVars[#race, threadThread2of2ForFork0_#t~nondet4][227], [Black: 376#(and (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#ts~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ threadThread1of2ForFork0_~t~0.offset 1))) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#ts~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ 2 threadThread1of2ForFork0_~t~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset))), Black: 380#(and (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#ts~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ threadThread1of2ForFork0_~t~0.offset 1))) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#ts~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ 3 threadThread1of2ForFork0_~t~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ 2 threadThread1of2ForFork0_~t~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset))), 579#(and (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#ts~0#1.base|) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#ts~0#1.base|) (= |ULTIMATE.start_main_~#ts~0#1.offset| 0)), Black: 366#(and (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#ts~0#1.base|) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#ts~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset))), 114#L1018-4true, Black: 356#(and (= |ULTIMATE.start_main_#t~mem9#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#ts~0#1.base|) |ULTIMATE.start_main_~#ts~0#1.offset|)) (<= (+ |ULTIMATE.start_main_#t~mem9#1.base| 2) |ULTIMATE.start_main_~#ts~0#1.base|)), Black: 374#(and (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#ts~0#1.base|) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#ts~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ 2 threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_1098 (Array Int Int))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |#race| threadThread1of2ForFork0_~t~0.base (store (select |#race| threadThread1of2ForFork0_~t~0.base) (+ 3 threadThread1of2ForFork0_~t~0.offset) |threadThread1of2ForFork0_#t~nondet4|)) |ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_1098) threadThread1of2ForFork0_~t~0.base) (+ threadThread1of2ForFork0_~t~0.offset 1)))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset))), Black: 197#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ threadThread1of2ForFork0_~t~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ 3 threadThread1of2ForFork0_~t~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ 2 threadThread1of2ForFork0_~t~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset))), 102#L1018-7true, 91#L1027-11true, threadThread1of2ForFork0InUse, threadThread2of2ForFork0InUse, 754#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), Black: 583#(and (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#ts~0#1.base|) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#ts~0#1.base|) (forall ((v_ArrVal_1211 (Array Int Int))) (= (select (select (store (store |#race| |ULTIMATE.start_main_~#ts~0#1.base| (store (store (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ 2 |ULTIMATE.start_main_~#ts~0#1.offset|) 0) (+ 3 |ULTIMATE.start_main_~#ts~0#1.offset|) 0)) threadThread1of2ForFork0_~t~0.base v_ArrVal_1211) |ULTIMATE.start_main_~#ts~0#1.base|) (+ |ULTIMATE.start_main_~#ts~0#1.offset| 1)) 0)) (= |ULTIMATE.start_main_~#ts~0#1.offset| 0) (forall ((v_ArrVal_1211 (Array Int Int))) (= (select (select (store (store |#race| |ULTIMATE.start_main_~#ts~0#1.base| (store (store (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ 2 |ULTIMATE.start_main_~#ts~0#1.offset|) 0) (+ 3 |ULTIMATE.start_main_~#ts~0#1.offset|) 0)) threadThread1of2ForFork0_~t~0.base v_ArrVal_1211) |ULTIMATE.start_main_~#ts~0#1.base|) |ULTIMATE.start_main_~#ts~0#1.offset|) 0))), Black: 575#(and (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ |ULTIMATE.start_main_~#ts~0#1.offset| 1)) 0) (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#ts~0#1.base|) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#ts~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ 2 |ULTIMATE.start_main_~#ts~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) |ULTIMATE.start_main_~#ts~0#1.offset|) 0) (= |ULTIMATE.start_main_~#ts~0#1.offset| 0) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ 3 |ULTIMATE.start_main_~#ts~0#1.offset|)) 0)), Black: 587#(and (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ |ULTIMATE.start_main_~#ts~0#1.offset| 1)) 0) (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#ts~0#1.base|) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#ts~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) |ULTIMATE.start_main_~#ts~0#1.offset|) 0) (= |ULTIMATE.start_main_~#ts~0#1.offset| 0)), Black: 585#(and (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ |ULTIMATE.start_main_~#ts~0#1.offset| 1)) 0) (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#ts~0#1.base|) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#ts~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ 2 |ULTIMATE.start_main_~#ts~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) |ULTIMATE.start_main_~#ts~0#1.offset|) 0) (= |ULTIMATE.start_main_~#ts~0#1.offset| 0)), Black: 573#(and (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ |ULTIMATE.start_main_~#ts~0#1.offset| 1)) 0) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#ts~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ 2 |ULTIMATE.start_main_~#ts~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) |ULTIMATE.start_main_~#ts~0#1.offset|) 0) (= |ULTIMATE.start_main_~#ts~0#1.offset| 0) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ 3 |ULTIMATE.start_main_~#ts~0#1.offset|)) 0)), Black: 581#(and (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#ts~0#1.base|) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#ts~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) |ULTIMATE.start_main_~#ts~0#1.offset|) 0) (= |ULTIMATE.start_main_~#ts~0#1.offset| 0)), Black: 146#(and (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ |ULTIMATE.start_main_~#ts~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ 2 |ULTIMATE.start_main_~#ts~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) |ULTIMATE.start_main_~#ts~0#1.offset|) 0)), Black: 147#(and (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ |ULTIMATE.start_main_~#ts~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ 2 |ULTIMATE.start_main_~#ts~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) |ULTIMATE.start_main_~#ts~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ 3 |ULTIMATE.start_main_~#ts~0#1.offset|)) 0)), Black: 145#(and (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ |ULTIMATE.start_main_~#ts~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) |ULTIMATE.start_main_~#ts~0#1.offset|) 0)), Black: 144#(= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) |ULTIMATE.start_main_~#ts~0#1.offset|) 0), 142#true, Black: 156#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 165#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 166#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 168#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 167#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), 364#(and (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#ts~0#1.base|) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#ts~0#1.base|)), Black: 177#(= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset)), Black: 179#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ threadThread1of2ForFork0_~t~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ 2 threadThread1of2ForFork0_~t~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset))), Black: 180#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ threadThread1of2ForFork0_~t~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ 3 threadThread1of2ForFork0_~t~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ 2 threadThread1of2ForFork0_~t~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset))), 175#true, Black: 178#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ threadThread1of2ForFork0_~t~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset))), Black: 201#(<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#ts~0#1.base|) |ULTIMATE.start_main_~#ts~0#1.offset|)) |ULTIMATE.start_main_~#ts~0#1.base|), 163#true, Black: 370#(and (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#ts~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ threadThread1of2ForFork0_~t~0.offset 1))) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#ts~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset)))])
[2023-10-25 15:09:24,161 INFO  L383   tUnfolder$Statistics]: this new event has 49 ancestors and is cut-off event
[2023-10-25 15:09:24,161 INFO  L386   tUnfolder$Statistics]:   existing Event has 49 ancestors and is cut-off event
[2023-10-25 15:09:24,161 INFO  L386   tUnfolder$Statistics]:   existing Event has 49 ancestors and is cut-off event
[2023-10-25 15:09:24,161 INFO  L386   tUnfolder$Statistics]:   existing Event has 49 ancestors and is cut-off event
[2023-10-25 15:09:24,393 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([510] L1018-2-->L1018-4: Formula: (= (store |v_#race_192| v_threadThread2of2ForFork0_~t~0.base_19 (store (select |v_#race_192| v_threadThread2of2ForFork0_~t~0.base_19) v_threadThread2of2ForFork0_~t~0.offset_19 |v_threadThread2of2ForFork0_#t~nondet4_19|)) |v_#race_191|)  InVars {#race=|v_#race_192|, threadThread2of2ForFork0_~t~0.offset=v_threadThread2of2ForFork0_~t~0.offset_19, threadThread2of2ForFork0_~t~0.base=v_threadThread2of2ForFork0_~t~0.base_19}  OutVars{#race=|v_#race_191|, threadThread2of2ForFork0_~t~0.offset=v_threadThread2of2ForFork0_~t~0.offset_19, threadThread2of2ForFork0_#t~nondet4=|v_threadThread2of2ForFork0_#t~nondet4_19|, threadThread2of2ForFork0_~t~0.base=v_threadThread2of2ForFork0_~t~0.base_19}  AuxVars[]  AssignedVars[#race, threadThread2of2ForFork0_#t~nondet4][227], [Black: 376#(and (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#ts~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ threadThread1of2ForFork0_~t~0.offset 1))) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#ts~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ 2 threadThread1of2ForFork0_~t~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset))), Black: 380#(and (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#ts~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ threadThread1of2ForFork0_~t~0.offset 1))) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#ts~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ 3 threadThread1of2ForFork0_~t~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ 2 threadThread1of2ForFork0_~t~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset))), 579#(and (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#ts~0#1.base|) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#ts~0#1.base|) (= |ULTIMATE.start_main_~#ts~0#1.offset| 0)), Black: 366#(and (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#ts~0#1.base|) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#ts~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset))), 114#L1018-4true, Black: 356#(and (= |ULTIMATE.start_main_#t~mem9#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#ts~0#1.base|) |ULTIMATE.start_main_~#ts~0#1.offset|)) (<= (+ |ULTIMATE.start_main_#t~mem9#1.base| 2) |ULTIMATE.start_main_~#ts~0#1.base|)), Black: 374#(and (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#ts~0#1.base|) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#ts~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ 2 threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_1098 (Array Int Int))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |#race| threadThread1of2ForFork0_~t~0.base (store (select |#race| threadThread1of2ForFork0_~t~0.base) (+ 3 threadThread1of2ForFork0_~t~0.offset) |threadThread1of2ForFork0_#t~nondet4|)) |ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_1098) threadThread1of2ForFork0_~t~0.base) (+ threadThread1of2ForFork0_~t~0.offset 1)))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset))), Black: 197#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ threadThread1of2ForFork0_~t~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ 3 threadThread1of2ForFork0_~t~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ 2 threadThread1of2ForFork0_~t~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset))), 102#L1018-7true, threadThread1of2ForFork0InUse, threadThread2of2ForFork0InUse, 754#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), Black: 583#(and (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#ts~0#1.base|) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#ts~0#1.base|) (forall ((v_ArrVal_1211 (Array Int Int))) (= (select (select (store (store |#race| |ULTIMATE.start_main_~#ts~0#1.base| (store (store (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ 2 |ULTIMATE.start_main_~#ts~0#1.offset|) 0) (+ 3 |ULTIMATE.start_main_~#ts~0#1.offset|) 0)) threadThread1of2ForFork0_~t~0.base v_ArrVal_1211) |ULTIMATE.start_main_~#ts~0#1.base|) (+ |ULTIMATE.start_main_~#ts~0#1.offset| 1)) 0)) (= |ULTIMATE.start_main_~#ts~0#1.offset| 0) (forall ((v_ArrVal_1211 (Array Int Int))) (= (select (select (store (store |#race| |ULTIMATE.start_main_~#ts~0#1.base| (store (store (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ 2 |ULTIMATE.start_main_~#ts~0#1.offset|) 0) (+ 3 |ULTIMATE.start_main_~#ts~0#1.offset|) 0)) threadThread1of2ForFork0_~t~0.base v_ArrVal_1211) |ULTIMATE.start_main_~#ts~0#1.base|) |ULTIMATE.start_main_~#ts~0#1.offset|) 0))), Black: 575#(and (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ |ULTIMATE.start_main_~#ts~0#1.offset| 1)) 0) (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#ts~0#1.base|) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#ts~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ 2 |ULTIMATE.start_main_~#ts~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) |ULTIMATE.start_main_~#ts~0#1.offset|) 0) (= |ULTIMATE.start_main_~#ts~0#1.offset| 0) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ 3 |ULTIMATE.start_main_~#ts~0#1.offset|)) 0)), Black: 587#(and (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ |ULTIMATE.start_main_~#ts~0#1.offset| 1)) 0) (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#ts~0#1.base|) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#ts~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) |ULTIMATE.start_main_~#ts~0#1.offset|) 0) (= |ULTIMATE.start_main_~#ts~0#1.offset| 0)), Black: 585#(and (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ |ULTIMATE.start_main_~#ts~0#1.offset| 1)) 0) (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#ts~0#1.base|) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#ts~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ 2 |ULTIMATE.start_main_~#ts~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) |ULTIMATE.start_main_~#ts~0#1.offset|) 0) (= |ULTIMATE.start_main_~#ts~0#1.offset| 0)), Black: 573#(and (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ |ULTIMATE.start_main_~#ts~0#1.offset| 1)) 0) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#ts~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ 2 |ULTIMATE.start_main_~#ts~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) |ULTIMATE.start_main_~#ts~0#1.offset|) 0) (= |ULTIMATE.start_main_~#ts~0#1.offset| 0) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ 3 |ULTIMATE.start_main_~#ts~0#1.offset|)) 0)), Black: 581#(and (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#ts~0#1.base|) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#ts~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) |ULTIMATE.start_main_~#ts~0#1.offset|) 0) (= |ULTIMATE.start_main_~#ts~0#1.offset| 0)), Black: 146#(and (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ |ULTIMATE.start_main_~#ts~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ 2 |ULTIMATE.start_main_~#ts~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) |ULTIMATE.start_main_~#ts~0#1.offset|) 0)), Black: 147#(and (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ |ULTIMATE.start_main_~#ts~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ 2 |ULTIMATE.start_main_~#ts~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) |ULTIMATE.start_main_~#ts~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ 3 |ULTIMATE.start_main_~#ts~0#1.offset|)) 0)), Black: 145#(and (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ |ULTIMATE.start_main_~#ts~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) |ULTIMATE.start_main_~#ts~0#1.offset|) 0)), Black: 144#(= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) |ULTIMATE.start_main_~#ts~0#1.offset|) 0), 21#L1027-12true, 142#true, Black: 156#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 165#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 166#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 168#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 167#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), 364#(and (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#ts~0#1.base|) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#ts~0#1.base|)), Black: 177#(= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset)), Black: 179#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ threadThread1of2ForFork0_~t~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ 2 threadThread1of2ForFork0_~t~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset))), Black: 180#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ threadThread1of2ForFork0_~t~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ 3 threadThread1of2ForFork0_~t~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ 2 threadThread1of2ForFork0_~t~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset))), 175#true, Black: 178#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ threadThread1of2ForFork0_~t~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset))), Black: 201#(<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#ts~0#1.base|) |ULTIMATE.start_main_~#ts~0#1.offset|)) |ULTIMATE.start_main_~#ts~0#1.base|), 163#true, Black: 370#(and (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#ts~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ threadThread1of2ForFork0_~t~0.offset 1))) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#ts~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset)))])
[2023-10-25 15:09:24,393 INFO  L383   tUnfolder$Statistics]: this new event has 50 ancestors and is cut-off event
[2023-10-25 15:09:24,393 INFO  L386   tUnfolder$Statistics]:   existing Event has 50 ancestors and is cut-off event
[2023-10-25 15:09:24,394 INFO  L386   tUnfolder$Statistics]:   existing Event has 50 ancestors and is cut-off event
[2023-10-25 15:09:24,394 INFO  L386   tUnfolder$Statistics]:   existing Event has 50 ancestors and is cut-off event
[2023-10-25 15:09:25,910 INFO  L130       PetriNetUnfolder]: 8983/17386 cut-off events.
[2023-10-25 15:09:25,911 INFO  L131       PetriNetUnfolder]: For 96850/101238 co-relation queries the response was YES.
[2023-10-25 15:09:25,971 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 88452 conditions, 17386 events. 8983/17386 cut-off events. For 96850/101238 co-relation queries the response was YES. Maximal size of possible extension queue 609. Compared 139766 event pairs, 1459 based on Foata normal form. 804/17245 useless extension candidates. Maximal degree in co-relation 81369. Up to 6267 conditions per place. 
[2023-10-25 15:09:26,034 INFO  L137   encePairwiseOnDemand]: 209/215 looper letters, 199 selfloop transitions, 9 changer transitions 18/947 dead transitions.
[2023-10-25 15:09:26,034 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 947 transitions, 12139 flow
[2023-10-25 15:09:26,034 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-10-25 15:09:26,035 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-10-25 15:09:26,035 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 772 transitions.
[2023-10-25 15:09:26,035 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5984496124031008
[2023-10-25 15:09:26,036 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 772 transitions.
[2023-10-25 15:09:26,036 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 772 transitions.
[2023-10-25 15:09:26,038 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 15:09:26,038 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 772 transitions.
[2023-10-25 15:09:26,040 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 128.66666666666666) internal successors, (772), 6 states have internal predecessors, (772), 0 states have call successors, (0), 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 15:09:26,041 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 215.0) internal successors, (1505), 7 states have internal predecessors, (1505), 0 states have call successors, (0), 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 15:09:26,041 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 215.0) internal successors, (1505), 7 states have internal predecessors, (1505), 0 states have call successors, (0), 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 15:09:26,041 INFO  L175             Difference]: Start difference. First operand has 150 places, 1033 transitions, 13043 flow. Second operand 6 states and 772 transitions.
[2023-10-25 15:09:26,041 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 947 transitions, 12139 flow
[2023-10-25 15:09:27,144 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 947 transitions, 11957 flow, removed 72 selfloop flow, removed 5 redundant places.
[2023-10-25 15:09:27,157 INFO  L231             Difference]: Finished difference. Result has 152 places, 881 transitions, 10765 flow
[2023-10-25 15:09:27,158 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=10904, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=896, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=888, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=10765, PETRI_PLACES=152, PETRI_TRANSITIONS=881}
[2023-10-25 15:09:27,174 INFO  L288   CegarLoopForPetriNet]: 71 programPoint places, 81 predicate places.
[2023-10-25 15:09:27,174 INFO  L495      AbstractCegarLoop]: Abstraction has has 152 places, 881 transitions, 10765 flow
[2023-10-25 15:09:27,174 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 124.0) internal successors, (868), 7 states have internal predecessors, (868), 0 states have call successors, (0), 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 15:09:27,174 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:09:27,174 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]
[2023-10-25 15:09:27,186 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0
[2023-10-25 15:09:27,379 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17
[2023-10-25 15:09:27,380 INFO  L420      AbstractCegarLoop]: === Iteration 8 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2023-10-25 15:09:27,380 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:09:27,381 INFO  L85        PathProgramCache]: Analyzing trace with hash 84688353, now seen corresponding path program 1 times
[2023-10-25 15:09:27,381 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:09:27,381 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058201199]
[2023-10-25 15:09:27,381 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:09:27,381 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:09:27,398 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:09:27,825 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:09:27,826 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:09:27,826 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058201199]
[2023-10-25 15:09:27,826 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058201199] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-25 15:09:27,826 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2076802362]
[2023-10-25 15:09:27,826 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:09:27,826 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-25 15:09:27,826 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-25 15:09:27,827 INFO  L229       MonitoredProcess]: Starting monitored process 11 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-10-25 15:09:27,871 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process
[2023-10-25 15:09:28,035 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:09:28,042 INFO  L263         TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 24 conjunts are in the unsatisfiable core
[2023-10-25 15:09:28,044 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-25 15:09:28,056 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 17 treesize of output 9
[2023-10-25 15:09:28,146 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 15:09:28,170 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 0 case distinctions, treesize of input 21 treesize of output 20
[2023-10-25 15:09:28,226 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-25 15:09:28,227 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 1 case distinctions, treesize of input 30 treesize of output 32
[2023-10-25 15:09:28,262 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-25 15:09:28,262 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44
[2023-10-25 15:09:28,361 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 15:09:28,362 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 15:09:28,369 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:09:28,369 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-25 15:09:28,402 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1428 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1428) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_1428 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1428) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1428 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1428) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3)))) (forall ((v_ArrVal_1428 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1428) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1))))) is different from false
[2023-10-25 15:09:28,439 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_1428 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1428) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_1428 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1428) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_1428 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1428) c_threadThread1of2ForFork0_~t~0.base) .cse1))) (forall ((v_ArrVal_1428 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1428) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2))))))) is different from false
[2023-10-25 15:09:28,466 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_threadThread1of2ForFork0_~t~0.offset 2)) (.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_1428 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1428) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1428 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1428) c_threadThread1of2ForFork0_~t~0.base) .cse1))) (forall ((v_ArrVal_1428 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1428) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_1428 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1428) c_threadThread1of2ForFork0_~t~0.base) .cse2) |c_threadThread1of2ForFork0_#t~nondet4|))))) is different from false
[2023-10-25 15:09:28,583 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked.
[2023-10-25 15:09:28,584 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [2076802362] provided 0 perfect and 2 imperfect interpolant sequences
[2023-10-25 15:09:28,584 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-10-25 15:09:28,584 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 24
[2023-10-25 15:09:28,584 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852162669]
[2023-10-25 15:09:28,584 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-10-25 15:09:28,584 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 26 states
[2023-10-25 15:09:28,584 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:09:28,585 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants.
[2023-10-25 15:09:28,585 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=418, Unknown=3, NotChecked=132, Total=650
[2023-10-25 15:09:28,771 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 62 out of 215
[2023-10-25 15:09:28,772 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 881 transitions, 10765 flow. Second operand  has 26 states, 26 states have (on average 64.8076923076923) internal successors, (1685), 26 states have internal predecessors, (1685), 0 states have call successors, (0), 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 15:09:28,772 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:09:28,772 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 215
[2023-10-25 15:09:28,772 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 15:09:37,083 INFO  L130       PetriNetUnfolder]: 17230/28784 cut-off events.
[2023-10-25 15:09:37,083 INFO  L131       PetriNetUnfolder]: For 145653/145659 co-relation queries the response was YES.
[2023-10-25 15:09:37,171 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 162156 conditions, 28784 events. 17230/28784 cut-off events. For 145653/145659 co-relation queries the response was YES. Maximal size of possible extension queue 693. Compared 205325 event pairs, 3822 based on Foata normal form. 6/26614 useless extension candidates. Maximal degree in co-relation 155020. Up to 19262 conditions per place. 
[2023-10-25 15:09:37,271 INFO  L137   encePairwiseOnDemand]: 151/215 looper letters, 874 selfloop transitions, 671 changer transitions 8/1556 dead transitions.
[2023-10-25 15:09:37,271 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 1556 transitions, 19935 flow
[2023-10-25 15:09:37,271 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. 
[2023-10-25 15:09:37,271 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 19 states.
[2023-10-25 15:09:37,298 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 1659 transitions.
[2023-10-25 15:09:37,299 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.40611995104039167
[2023-10-25 15:09:37,299 INFO  L72            ComplementDD]: Start complementDD. Operand 19 states and 1659 transitions.
[2023-10-25 15:09:37,299 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 19 states and 1659 transitions.
[2023-10-25 15:09:37,300 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 15:09:37,300 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 1659 transitions.
[2023-10-25 15:09:37,303 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 20 states, 19 states have (on average 87.3157894736842) internal successors, (1659), 19 states have internal predecessors, (1659), 0 states have call successors, (0), 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 15:09:37,306 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 20 states, 20 states have (on average 215.0) internal successors, (4300), 20 states have internal predecessors, (4300), 0 states have call successors, (0), 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 15:09:37,306 INFO  L81            ComplementDD]: Finished complementDD. Result  has 20 states, 20 states have (on average 215.0) internal successors, (4300), 20 states have internal predecessors, (4300), 0 states have call successors, (0), 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 15:09:37,307 INFO  L175             Difference]: Start difference. First operand has 152 places, 881 transitions, 10765 flow. Second operand 19 states and 1659 transitions.
[2023-10-25 15:09:37,307 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 1556 transitions, 19935 flow
[2023-10-25 15:09:39,191 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 1556 transitions, 19503 flow, removed 6 selfloop flow, removed 5 redundant places.
[2023-10-25 15:09:39,209 INFO  L231             Difference]: Finished difference. Result has 170 places, 1268 transitions, 17043 flow
[2023-10-25 15:09:39,210 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=10362, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=881, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=356, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=442, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=17043, PETRI_PLACES=170, PETRI_TRANSITIONS=1268}
[2023-10-25 15:09:39,210 INFO  L288   CegarLoopForPetriNet]: 71 programPoint places, 99 predicate places.
[2023-10-25 15:09:39,210 INFO  L495      AbstractCegarLoop]: Abstraction has has 170 places, 1268 transitions, 17043 flow
[2023-10-25 15:09:39,211 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 26 states, 26 states have (on average 64.8076923076923) internal successors, (1685), 26 states have internal predecessors, (1685), 0 states have call successors, (0), 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 15:09:39,211 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:09:39,211 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]
[2023-10-25 15:09:39,217 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0
[2023-10-25 15:09:39,415 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-25 15:09:39,416 INFO  L420      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2023-10-25 15:09:39,419 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:09:39,420 INFO  L85        PathProgramCache]: Analyzing trace with hash 1752528282, now seen corresponding path program 1 times
[2023-10-25 15:09:39,420 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:09:39,427 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250530116]
[2023-10-25 15:09:39,428 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:09:39,428 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:09:39,461 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:09:39,905 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:09:39,906 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:09:39,906 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250530116]
[2023-10-25 15:09:39,906 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250530116] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-25 15:09:39,906 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [569248518]
[2023-10-25 15:09:39,906 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:09:39,907 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-25 15:09:39,907 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-25 15:09:39,922 INFO  L229       MonitoredProcess]: Starting monitored process 12 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-10-25 15:09:39,961 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process
[2023-10-25 15:09:40,123 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:09:40,137 INFO  L263         TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 26 conjunts are in the unsatisfiable core
[2023-10-25 15:09:40,141 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-25 15:09:40,159 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 17 treesize of output 9
[2023-10-25 15:09:40,304 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 15:09:40,341 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 15:09:40,342 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 15:09:40,385 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 15:09:40,386 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 15:09:40,387 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 15:09:40,437 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 15:09:40,438 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 15:09:40,439 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 15:09:40,440 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 15:09:40,518 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 15:09:40,519 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 15:09:40,563 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:09:40,563 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-25 15:09:40,848 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse2 (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse1 (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse2 0) .cse1 0)))) (and (forall ((v_ArrVal_1541 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1541) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1541 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1541) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0)) (forall ((v_ArrVal_1541 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1541) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_1541 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1541) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0))))) is different from false
[2023-10-25 15:09:40,864 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) (.cse3 (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse2 (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1 0) .cse3 0) .cse2 0)))) (and (forall ((v_ArrVal_1541 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1541) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (forall ((v_ArrVal_1541 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1541) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1541 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1541) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_1541 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1541) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse3) 0))))) is different from false
[2023-10-25 15:09:40,877 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-25 15:09:40,878 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 35 treesize of output 51
[2023-10-25 15:09:40,881 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-25 15:09:40,881 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 64 treesize of output 36
[2023-10-25 15:09:40,884 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 7 treesize of output 3
[2023-10-25 15:09:40,889 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2023-10-25 15:09:40,889 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 33 treesize of output 1
[2023-10-25 15:09:40,893 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2023-10-25 15:09:40,894 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 1
[2023-10-25 15:09:40,907 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2023-10-25 15:09:40,907 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 1
[2023-10-25 15:09:40,969 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:09:40,969 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [569248518] provided 0 perfect and 2 imperfect interpolant sequences
[2023-10-25 15:09:40,969 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-10-25 15:09:40,970 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 26
[2023-10-25 15:09:40,970 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303769228]
[2023-10-25 15:09:40,970 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-10-25 15:09:40,970 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 28 states
[2023-10-25 15:09:40,970 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:09:40,970 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants.
[2023-10-25 15:09:40,970 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=525, Unknown=22, NotChecked=98, Total=756
[2023-10-25 15:09:41,105 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 64 out of 215
[2023-10-25 15:09:41,106 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 1268 transitions, 17043 flow. Second operand  has 28 states, 28 states have (on average 66.60714285714286) internal successors, (1865), 28 states have internal predecessors, (1865), 0 states have call successors, (0), 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 15:09:41,106 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:09:41,106 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 215
[2023-10-25 15:09:41,106 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 15:09:50,268 INFO  L130       PetriNetUnfolder]: 20037/33573 cut-off events.
[2023-10-25 15:09:50,270 INFO  L131       PetriNetUnfolder]: For 242114/242124 co-relation queries the response was YES.
[2023-10-25 15:09:50,406 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 231238 conditions, 33573 events. 20037/33573 cut-off events. For 242114/242124 co-relation queries the response was YES. Maximal size of possible extension queue 872. Compared 247554 event pairs, 2351 based on Foata normal form. 408/32242 useless extension candidates. Maximal degree in co-relation 195838. Up to 14770 conditions per place. 
[2023-10-25 15:09:50,540 INFO  L137   encePairwiseOnDemand]: 178/215 looper letters, 1396 selfloop transitions, 812 changer transitions 2/2213 dead transitions.
[2023-10-25 15:09:50,541 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 2213 transitions, 33212 flow
[2023-10-25 15:09:50,541 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. 
[2023-10-25 15:09:50,541 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 16 states.
[2023-10-25 15:09:50,542 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1327 transitions.
[2023-10-25 15:09:50,543 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.38575581395348835
[2023-10-25 15:09:50,543 INFO  L72            ComplementDD]: Start complementDD. Operand 16 states and 1327 transitions.
[2023-10-25 15:09:50,543 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 16 states and 1327 transitions.
[2023-10-25 15:09:50,559 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 15:09:50,560 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1327 transitions.
[2023-10-25 15:09:50,561 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 17 states, 16 states have (on average 82.9375) internal successors, (1327), 16 states have internal predecessors, (1327), 0 states have call successors, (0), 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 15:09:50,564 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 17 states, 17 states have (on average 215.0) internal successors, (3655), 17 states have internal predecessors, (3655), 0 states have call successors, (0), 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 15:09:50,567 INFO  L81            ComplementDD]: Finished complementDD. Result  has 17 states, 17 states have (on average 215.0) internal successors, (3655), 17 states have internal predecessors, (3655), 0 states have call successors, (0), 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 15:09:50,567 INFO  L175             Difference]: Start difference. First operand has 170 places, 1268 transitions, 17043 flow. Second operand 16 states and 1327 transitions.
[2023-10-25 15:09:50,567 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 2213 transitions, 33212 flow
[2023-10-25 15:09:57,457 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 2213 transitions, 32536 flow, removed 316 selfloop flow, removed 9 redundant places.
[2023-10-25 15:09:57,482 INFO  L231             Difference]: Finished difference. Result has 184 places, 1755 transitions, 27082 flow
[2023-10-25 15:09:57,483 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=16793, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1268, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=404, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=692, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=27082, PETRI_PLACES=184, PETRI_TRANSITIONS=1755}
[2023-10-25 15:09:57,483 INFO  L288   CegarLoopForPetriNet]: 71 programPoint places, 113 predicate places.
[2023-10-25 15:09:57,483 INFO  L495      AbstractCegarLoop]: Abstraction has has 184 places, 1755 transitions, 27082 flow
[2023-10-25 15:09:57,483 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 28 states, 28 states have (on average 66.60714285714286) internal successors, (1865), 28 states have internal predecessors, (1865), 0 states have call successors, (0), 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 15:09:57,484 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:09:57,484 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 15:09:57,490 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0
[2023-10-25 15:09:57,688 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-25 15:09:57,689 INFO  L420      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2023-10-25 15:09:57,701 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:09:57,701 INFO  L85        PathProgramCache]: Analyzing trace with hash -1139698224, now seen corresponding path program 1 times
[2023-10-25 15:09:57,701 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:09:57,702 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474074882]
[2023-10-25 15:09:57,703 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:09:57,703 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:09:57,731 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:09:58,041 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 15:09:58,041 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:09:58,041 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474074882]
[2023-10-25 15:09:58,041 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474074882] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-25 15:09:58,042 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-25 15:09:58,042 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-10-25 15:09:58,042 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829209947]
[2023-10-25 15:09:58,042 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-25 15:09:58,042 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-10-25 15:09:58,042 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:09:58,043 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-10-25 15:09:58,043 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-10-25 15:09:58,456 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 113 out of 215
[2023-10-25 15:09:58,457 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 1755 transitions, 27082 flow. Second operand  has 6 states, 6 states have (on average 115.16666666666667) internal successors, (691), 6 states have internal predecessors, (691), 0 states have call successors, (0), 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 15:09:58,457 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:09:58,457 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 215
[2023-10-25 15:09:58,457 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 15:10:06,915 INFO  L130       PetriNetUnfolder]: 17500/30900 cut-off events.
[2023-10-25 15:10:06,916 INFO  L131       PetriNetUnfolder]: For 332725/340692 co-relation queries the response was YES.
[2023-10-25 15:10:07,079 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 223929 conditions, 30900 events. 17500/30900 cut-off events. For 332725/340692 co-relation queries the response was YES. Maximal size of possible extension queue 931. Compared 244192 event pairs, 3013 based on Foata normal form. 866/30828 useless extension candidates. Maximal degree in co-relation 184179. Up to 19203 conditions per place. 
[2023-10-25 15:10:07,965 INFO  L137   encePairwiseOnDemand]: 200/215 looper letters, 1313 selfloop transitions, 176 changer transitions 1/1942 dead transitions.
[2023-10-25 15:10:07,972 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 1942 transitions, 33000 flow
[2023-10-25 15:10:07,973 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-10-25 15:10:07,973 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-10-25 15:10:07,973 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 769 transitions.
[2023-10-25 15:10:07,974 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5961240310077519
[2023-10-25 15:10:07,974 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 769 transitions.
[2023-10-25 15:10:07,974 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 769 transitions.
[2023-10-25 15:10:07,974 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 15:10:07,974 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 769 transitions.
[2023-10-25 15:10:07,975 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 128.16666666666666) internal successors, (769), 6 states have internal predecessors, (769), 0 states have call successors, (0), 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 15:10:07,979 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 215.0) internal successors, (1505), 7 states have internal predecessors, (1505), 0 states have call successors, (0), 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 15:10:07,979 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 215.0) internal successors, (1505), 7 states have internal predecessors, (1505), 0 states have call successors, (0), 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 15:10:07,980 INFO  L175             Difference]: Start difference. First operand has 184 places, 1755 transitions, 27082 flow. Second operand 6 states and 769 transitions.
[2023-10-25 15:10:07,980 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 1942 transitions, 33000 flow
[2023-10-25 15:10:14,021 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 1942 transitions, 32655 flow, removed 155 selfloop flow, removed 6 redundant places.
[2023-10-25 15:10:14,064 INFO  L231             Difference]: Finished difference. Result has 188 places, 1914 transitions, 30208 flow
[2023-10-25 15:10:14,078 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=26761, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1755, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1672, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=30208, PETRI_PLACES=188, PETRI_TRANSITIONS=1914}
[2023-10-25 15:10:14,079 INFO  L288   CegarLoopForPetriNet]: 71 programPoint places, 117 predicate places.
[2023-10-25 15:10:14,079 INFO  L495      AbstractCegarLoop]: Abstraction has has 188 places, 1914 transitions, 30208 flow
[2023-10-25 15:10:14,079 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 115.16666666666667) internal successors, (691), 6 states have internal predecessors, (691), 0 states have call successors, (0), 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 15:10:14,079 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:10:14,079 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-25 15:10:14,079 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20
[2023-10-25 15:10:14,079 INFO  L420      AbstractCegarLoop]: === Iteration 11 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2023-10-25 15:10:14,080 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:10:14,080 INFO  L85        PathProgramCache]: Analyzing trace with hash 370424642, now seen corresponding path program 2 times
[2023-10-25 15:10:14,080 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:10:14,080 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793273722]
[2023-10-25 15:10:14,080 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:10:14,080 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:10:14,117 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:10:14,971 INFO  L134       CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:10:14,971 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:10:14,972 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793273722]
[2023-10-25 15:10:14,972 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793273722] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-25 15:10:14,972 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1321710200]
[2023-10-25 15:10:14,972 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2023-10-25 15:10:14,972 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-25 15:10:14,972 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-25 15:10:14,973 INFO  L229       MonitoredProcess]: Starting monitored process 13 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-10-25 15:10:15,017 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process
[2023-10-25 15:10:15,232 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2023-10-25 15:10:15,232 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2023-10-25 15:10:15,233 INFO  L263         TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 47 conjunts are in the unsatisfiable core
[2023-10-25 15:10:15,236 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-25 15:10:15,264 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 15 treesize of output 7
[2023-10-25 15:10:15,266 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 26 treesize of output 14
[2023-10-25 15:10:15,450 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 15:10:15,498 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 15:10:15,499 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 15:10:15,586 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 15:10:15,587 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 15:10:15,587 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 15:10:15,648 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 15:10:15,649 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 15:10:15,650 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 15:10:15,651 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 15:10:15,725 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 15:10:15,725 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 15:10:15,742 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 15:10:15,743 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 15:10:15,768 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 15:10:15,769 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 15:10:15,788 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 15:10:15,794 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 15:10:15,884 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 15:10:15,885 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 15:10:15,932 INFO  L134       CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:10:15,932 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-25 15:10:15,960 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1726 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1726) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_1726 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1726) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3)))) (forall ((v_ArrVal_1726 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1726) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1726 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1726) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset)))) is different from false
[2023-10-25 15:10:16,007 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1725 (Array Int Int)) (v_ArrVal_1726 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_1725) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1726) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_1725 (Array Int Int)) (v_ArrVal_1726 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_1725) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1726) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_1725 (Array Int Int)) (v_ArrVal_1726 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_1725) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1726) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3)))) (forall ((v_ArrVal_1725 (Array Int Int)) (v_ArrVal_1726 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_1725) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1726) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|))) is different from false
[2023-10-25 15:10:16,078 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_1725 (Array Int Int)) (v_ArrVal_1726 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_1725) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1726) c_threadThread1of2ForFork0_~t~0.base) .cse1))) (forall ((v_ArrVal_1725 (Array Int Int)) (v_ArrVal_1726 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_1725) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1726) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_1725 (Array Int Int)) (v_ArrVal_1726 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_1725) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1726) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_1725 (Array Int Int)) (v_ArrVal_1726 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_1725) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1726) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)) |c_threadThread1of2ForFork0_#t~nondet4|))))) is different from false
[2023-10-25 15:10:16,101 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_threadThread1of2ForFork0_~t~0.offset 2)) (.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_1725 (Array Int Int)) (v_ArrVal_1726 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_1725) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1726) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_1725 (Array Int Int)) (v_ArrVal_1726 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_1725) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1726) c_threadThread1of2ForFork0_~t~0.base) .cse1))) (forall ((v_ArrVal_1725 (Array Int Int)) (v_ArrVal_1726 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_1725) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1726) c_threadThread1of2ForFork0_~t~0.base) .cse2))) (forall ((v_ArrVal_1725 (Array Int Int)) (v_ArrVal_1726 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_1725) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1726) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset)))))) is different from false
[2023-10-25 15:10:16,183 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_threadThread1of2ForFork0_~t~0.offset 1)) (.cse3 (+ c_threadThread1of2ForFork0_~t~0.offset 2)) (.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (store (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_1725 (Array Int Int)) (v_ArrVal_1726 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_1725) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1726) c_threadThread1of2ForFork0_~t~0.base) .cse1))) (forall ((v_ArrVal_1725 (Array Int Int)) (v_ArrVal_1726 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_1725) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1726) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_1725 (Array Int Int)) (v_ArrVal_1726 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_1725) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1726) c_threadThread1of2ForFork0_~t~0.base) .cse2))) (forall ((v_ArrVal_1725 (Array Int Int)) (v_ArrVal_1726 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_1725) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1726) c_threadThread1of2ForFork0_~t~0.base) .cse3) |c_threadThread1of2ForFork0_#t~nondet4|))))) is different from false
[2023-10-25 15:10:16,195 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-25 15:10:16,196 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 38 treesize of output 54
[2023-10-25 15:10:16,217 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-25 15:10:16,217 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 204 treesize of output 130
[2023-10-25 15:10:16,226 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 102 treesize of output 86
[2023-10-25 15:10:16,228 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 86 treesize of output 78
[2023-10-25 15:10:16,269 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2023-10-25 15:10:16,270 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 36 treesize of output 1
[2023-10-25 15:10:16,274 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2023-10-25 15:10:16,274 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 38 treesize of output 1
[2023-10-25 15:10:16,279 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2023-10-25 15:10:16,279 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 38 treesize of output 1
[2023-10-25 15:10:16,334 INFO  L134       CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked.
[2023-10-25 15:10:16,334 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1321710200] provided 0 perfect and 2 imperfect interpolant sequences
[2023-10-25 15:10:16,334 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-10-25 15:10:16,334 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 26
[2023-10-25 15:10:16,335 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647805848]
[2023-10-25 15:10:16,335 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-10-25 15:10:16,335 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 28 states
[2023-10-25 15:10:16,335 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:10:16,335 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants.
[2023-10-25 15:10:16,336 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=417, Unknown=5, NotChecked=230, Total=756
[2023-10-25 15:10:16,565 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 57 out of 215
[2023-10-25 15:10:16,566 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 1914 transitions, 30208 flow. Second operand  has 28 states, 28 states have (on average 60.17857142857143) internal successors, (1685), 28 states have internal predecessors, (1685), 0 states have call successors, (0), 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 15:10:16,566 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:10:16,566 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 215
[2023-10-25 15:10:16,566 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 15:10:34,302 INFO  L130       PetriNetUnfolder]: 21616/36166 cut-off events.
[2023-10-25 15:10:34,302 INFO  L131       PetriNetUnfolder]: For 381904/381919 co-relation queries the response was YES.
[2023-10-25 15:10:34,495 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 282319 conditions, 36166 events. 21616/36166 cut-off events. For 381904/381919 co-relation queries the response was YES. Maximal size of possible extension queue 945. Compared 269577 event pairs, 2431 based on Foata normal form. 404/34964 useless extension candidates. Maximal degree in co-relation 243035. Up to 20201 conditions per place. 
[2023-10-25 15:10:34,649 INFO  L137   encePairwiseOnDemand]: 151/215 looper letters, 1198 selfloop transitions, 1545 changer transitions 46/2793 dead transitions.
[2023-10-25 15:10:34,649 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 2793 transitions, 47112 flow
[2023-10-25 15:10:34,650 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. 
[2023-10-25 15:10:34,650 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 20 states.
[2023-10-25 15:10:34,671 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 1632 transitions.
[2023-10-25 15:10:34,671 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.37953488372093025
[2023-10-25 15:10:34,672 INFO  L72            ComplementDD]: Start complementDD. Operand 20 states and 1632 transitions.
[2023-10-25 15:10:34,672 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 20 states and 1632 transitions.
[2023-10-25 15:10:34,672 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 15:10:34,672 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 1632 transitions.
[2023-10-25 15:10:34,674 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 21 states, 20 states have (on average 81.6) internal successors, (1632), 20 states have internal predecessors, (1632), 0 states have call successors, (0), 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 15:10:34,677 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 21 states, 21 states have (on average 215.0) internal successors, (4515), 21 states have internal predecessors, (4515), 0 states have call successors, (0), 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 15:10:34,683 INFO  L81            ComplementDD]: Finished complementDD. Result  has 21 states, 21 states have (on average 215.0) internal successors, (4515), 21 states have internal predecessors, (4515), 0 states have call successors, (0), 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 15:10:34,683 INFO  L175             Difference]: Start difference. First operand has 188 places, 1914 transitions, 30208 flow. Second operand 20 states and 1632 transitions.
[2023-10-25 15:10:34,684 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 207 places, 2793 transitions, 47112 flow
[2023-10-25 15:10:44,561 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 2793 transitions, 46872 flow, removed 120 selfloop flow, removed 0 redundant places.
[2023-10-25 15:10:44,595 INFO  L231             Difference]: Finished difference. Result has 214 places, 2271 transitions, 41225 flow
[2023-10-25 15:10:44,597 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=29974, PETRI_DIFFERENCE_MINUEND_PLACES=188, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1914, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1225, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=599, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=41225, PETRI_PLACES=214, PETRI_TRANSITIONS=2271}
[2023-10-25 15:10:44,600 INFO  L288   CegarLoopForPetriNet]: 71 programPoint places, 143 predicate places.
[2023-10-25 15:10:44,600 INFO  L495      AbstractCegarLoop]: Abstraction has has 214 places, 2271 transitions, 41225 flow
[2023-10-25 15:10:44,600 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 28 states, 28 states have (on average 60.17857142857143) internal successors, (1685), 28 states have internal predecessors, (1685), 0 states have call successors, (0), 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 15:10:44,601 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:10:44,601 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]
[2023-10-25 15:10:44,607 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0
[2023-10-25 15:10:44,806 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21
[2023-10-25 15:10:44,806 INFO  L420      AbstractCegarLoop]: === Iteration 12 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2023-10-25 15:10:44,807 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:10:44,808 INFO  L85        PathProgramCache]: Analyzing trace with hash -614487279, now seen corresponding path program 1 times
[2023-10-25 15:10:44,808 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:10:44,808 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047748880]
[2023-10-25 15:10:44,809 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:10:44,810 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:10:44,860 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:10:46,034 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:10:46,034 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:10:46,035 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047748880]
[2023-10-25 15:10:46,035 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047748880] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-25 15:10:46,035 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1783184666]
[2023-10-25 15:10:46,035 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:10:46,035 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-25 15:10:46,035 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-25 15:10:46,054 INFO  L229       MonitoredProcess]: Starting monitored process 14 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-10-25 15:10:46,082 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process
[2023-10-25 15:10:46,266 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:10:46,268 INFO  L263         TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 57 conjunts are in the unsatisfiable core
[2023-10-25 15:10:46,273 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-25 15:10:46,284 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 15:10:46,285 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 15:10:46,286 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 15:10:46,291 INFO  L321             Elim1Store]: treesize reduction 15, result has 6.3 percent of original size
[2023-10-25 15:10:46,291 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 19
[2023-10-25 15:10:46,726 INFO  L321             Elim1Store]: treesize reduction 36, result has 23.4 percent of original size
[2023-10-25 15:10:46,726 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 66 treesize of output 62
[2023-10-25 15:10:46,902 INFO  L321             Elim1Store]: treesize reduction 3, result has 75.0 percent of original size
[2023-10-25 15:10:46,902 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 63 treesize of output 40
[2023-10-25 15:10:46,979 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2023-10-25 15:10:47,016 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 15:10:47,054 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-25 15:10:47,055 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32
[2023-10-25 15:10:47,095 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-25 15:10:47,095 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44
[2023-10-25 15:10:47,180 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 15:10:47,188 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:10:47,188 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-25 15:10:47,218 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1862 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1862) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1862 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1862) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_1862 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1862) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1862 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1862) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3)) |c_threadThread1of2ForFork0_#t~nondet4|))) is different from false
[2023-10-25 15:10:47,435 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 2)) (.cse2 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_1862 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1862) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1862 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1862) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_1862 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1862) c_threadThread1of2ForFork0_~t~0.base) .cse1) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1862 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1862) c_threadThread1of2ForFork0_~t~0.base) .cse2)))))) is different from false
[2023-10-25 15:10:47,449 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_threadThread1of2ForFork0_~t~0.offset 1)) (.cse3 (+ c_threadThread1of2ForFork0_~t~0.offset 2)) (.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (store (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_1862 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1862) c_threadThread1of2ForFork0_~t~0.base) .cse1) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1862 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1862) c_threadThread1of2ForFork0_~t~0.base) .cse2))) (forall ((v_ArrVal_1862 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1862) c_threadThread1of2ForFork0_~t~0.base) .cse3) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1862 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1862) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset)))))) is different from false
[2023-10-25 15:10:47,487 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-25 15:10:47,487 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 33 treesize of output 49
[2023-10-25 15:10:47,492 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-25 15:10:47,493 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 80 treesize of output 30
[2023-10-25 15:10:47,500 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2023-10-25 15:10:47,500 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 1
[2023-10-25 15:10:47,504 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2023-10-25 15:10:47,504 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 1
[2023-10-25 15:10:47,508 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2023-10-25 15:10:47,508 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 1
[2023-10-25 15:10:47,623 WARN  L837   $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1853 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_1853) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) |c_ULTIMATE.start_main_#t~mem9#1.base|))) is different from false
[2023-10-25 15:10:47,735 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:10:47,736 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1783184666] provided 0 perfect and 2 imperfect interpolant sequences
[2023-10-25 15:10:47,736 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-10-25 15:10:47,736 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 12] total 33
[2023-10-25 15:10:47,736 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554836114]
[2023-10-25 15:10:47,736 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-10-25 15:10:47,736 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 35 states
[2023-10-25 15:10:47,736 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:10:47,737 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants.
[2023-10-25 15:10:47,737 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=801, Unknown=13, NotChecked=244, Total=1190
[2023-10-25 15:10:47,945 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 45 out of 215
[2023-10-25 15:10:47,946 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 2271 transitions, 41225 flow. Second operand  has 35 states, 35 states have (on average 47.51428571428571) internal successors, (1663), 35 states have internal predecessors, (1663), 0 states have call successors, (0), 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 15:10:47,946 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:10:47,946 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 215
[2023-10-25 15:10:47,946 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 15:11:27,265 INFO  L130       PetriNetUnfolder]: 48391/80337 cut-off events.
[2023-10-25 15:11:27,266 INFO  L131       PetriNetUnfolder]: For 1226289/1226289 co-relation queries the response was YES.
[2023-10-25 15:11:27,915 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 715788 conditions, 80337 events. 48391/80337 cut-off events. For 1226289/1226289 co-relation queries the response was YES. Maximal size of possible extension queue 2100. Compared 661070 event pairs, 7467 based on Foata normal form. 235/77059 useless extension candidates. Maximal degree in co-relation 670912. Up to 35860 conditions per place. 
[2023-10-25 15:11:28,314 INFO  L137   encePairwiseOnDemand]: 179/215 looper letters, 5603 selfloop transitions, 709 changer transitions 31/6344 dead transitions.
[2023-10-25 15:11:28,314 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 248 places, 6344 transitions, 122822 flow
[2023-10-25 15:11:28,314 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. 
[2023-10-25 15:11:28,314 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 36 states.
[2023-10-25 15:11:28,335 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 2212 transitions.
[2023-10-25 15:11:28,349 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.28578811369509044
[2023-10-25 15:11:28,349 INFO  L72            ComplementDD]: Start complementDD. Operand 36 states and 2212 transitions.
[2023-10-25 15:11:28,349 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 36 states and 2212 transitions.
[2023-10-25 15:11:28,351 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 15:11:28,351 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 36 states and 2212 transitions.
[2023-10-25 15:11:28,355 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 37 states, 36 states have (on average 61.44444444444444) internal successors, (2212), 36 states have internal predecessors, (2212), 0 states have call successors, (0), 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 15:11:28,442 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 37 states, 37 states have (on average 215.0) internal successors, (7955), 37 states have internal predecessors, (7955), 0 states have call successors, (0), 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 15:11:28,443 INFO  L81            ComplementDD]: Finished complementDD. Result  has 37 states, 37 states have (on average 215.0) internal successors, (7955), 37 states have internal predecessors, (7955), 0 states have call successors, (0), 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 15:11:28,443 INFO  L175             Difference]: Start difference. First operand has 214 places, 2271 transitions, 41225 flow. Second operand 36 states and 2212 transitions.
[2023-10-25 15:11:28,443 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 248 places, 6344 transitions, 122822 flow
[2023-10-25 15:12:35,656 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 236 places, 6344 transitions, 122026 flow, removed 351 selfloop flow, removed 12 redundant places.
[2023-10-25 15:12:35,758 INFO  L231             Difference]: Finished difference. Result has 258 places, 2968 transitions, 57139 flow
[2023-10-25 15:12:35,759 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=40843, PETRI_DIFFERENCE_MINUEND_PLACES=201, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2271, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1884, PETRI_DIFFERENCE_SUBTRAHEND_STATES=36, PETRI_FLOW=57139, PETRI_PLACES=258, PETRI_TRANSITIONS=2968}
[2023-10-25 15:12:35,760 INFO  L288   CegarLoopForPetriNet]: 71 programPoint places, 187 predicate places.
[2023-10-25 15:12:35,761 INFO  L495      AbstractCegarLoop]: Abstraction has has 258 places, 2968 transitions, 57139 flow
[2023-10-25 15:12:35,761 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 35 states, 35 states have (on average 47.51428571428571) internal successors, (1663), 35 states have internal predecessors, (1663), 0 states have call successors, (0), 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 15:12:35,761 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:12:35,762 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]
[2023-10-25 15:12:35,768 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0
[2023-10-25 15:12:35,966 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22
[2023-10-25 15:12:35,966 INFO  L420      AbstractCegarLoop]: === Iteration 13 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2023-10-25 15:12:35,967 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:12:35,967 INFO  L85        PathProgramCache]: Analyzing trace with hash 564881149, now seen corresponding path program 2 times
[2023-10-25 15:12:35,967 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:12:35,967 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543557112]
[2023-10-25 15:12:35,968 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:12:35,968 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:12:36,039 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:12:36,951 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:12:36,951 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:12:36,951 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543557112]
[2023-10-25 15:12:36,951 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543557112] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-25 15:12:36,951 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2139552891]
[2023-10-25 15:12:36,951 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2023-10-25 15:12:36,951 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-25 15:12:36,952 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-25 15:12:36,953 INFO  L229       MonitoredProcess]: Starting monitored process 15 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-10-25 15:12:36,979 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process
[2023-10-25 15:12:37,140 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2023-10-25 15:12:37,140 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2023-10-25 15:12:37,146 INFO  L263         TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 77 conjunts are in the unsatisfiable core
[2023-10-25 15:12:37,150 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-25 15:12:37,184 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 15:12:37,187 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 15:12:37,192 INFO  L321             Elim1Store]: treesize reduction 15, result has 6.3 percent of original size
[2023-10-25 15:12:37,193 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 27
[2023-10-25 15:12:37,788 INFO  L321             Elim1Store]: treesize reduction 32, result has 31.9 percent of original size
[2023-10-25 15:12:37,788 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 66 treesize of output 66
[2023-10-25 15:12:37,796 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 15:12:37,823 INFO  L321             Elim1Store]: treesize reduction 15, result has 46.4 percent of original size
[2023-10-25 15:12:37,824 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 1 case distinctions, treesize of input 32 treesize of output 43
[2023-10-25 15:12:37,832 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 15:12:37,847 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 30 treesize of output 22
[2023-10-25 15:12:38,236 INFO  L321             Elim1Store]: treesize reduction 32, result has 31.9 percent of original size
[2023-10-25 15:12:38,236 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 86 treesize of output 85
[2023-10-25 15:12:38,280 INFO  L321             Elim1Store]: treesize reduction 32, result has 31.9 percent of original size
[2023-10-25 15:12:38,281 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 77 treesize of output 84
[2023-10-25 15:12:38,291 WARN  L207             Elim1Store]: Array PQE input equivalent to false
[2023-10-25 15:12:38,451 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 15:12:38,673 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 0 case distinctions, treesize of input 21 treesize of output 20
[2023-10-25 15:12:39,041 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-25 15:12:39,042 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 87 treesize of output 63
[2023-10-25 15:12:39,054 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-25 15:12:39,055 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 62 treesize of output 54
[2023-10-25 15:12:39,286 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 15:12:39,287 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 15:12:39,288 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32
[2023-10-25 15:12:39,386 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 15:12:39,387 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 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 15:12:39,425 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 15:12:39,426 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 15:12:39,426 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 15:12:39,427 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44
[2023-10-25 15:12:39,528 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 15:12:39,529 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 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 15:12:39,565 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 15:12:39,566 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 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 15:12:39,598 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 15:12:39,599 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 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 15:12:39,722 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 15:12:39,722 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 15:12:39,723 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 15:12:39,733 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 54
[2023-10-25 15:12:39,776 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:12:39,776 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-25 15:12:39,923 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_#t~mem14#1.offset| (* |c_ULTIMATE.start_main_~i~1#1| 4)))) (and (forall ((v_ArrVal_2004 (Array Int Int)) (v_ArrVal_2005 Int)) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2004))) (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| (store (select .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base|) .cse1 v_ArrVal_2005))) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_2004 (Array Int Int)) (v_ArrVal_2005 Int)) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2004))) (store .cse2 |c_ULTIMATE.start_main_#t~mem14#1.base| (store (select .cse2 |c_ULTIMATE.start_main_#t~mem14#1.base|) .cse1 v_ArrVal_2005))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3)))) (forall ((v_ArrVal_2004 (Array Int Int)) (v_ArrVal_2005 Int)) (= (select (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2004))) (store .cse3 |c_ULTIMATE.start_main_#t~mem14#1.base| (store (select .cse3 |c_ULTIMATE.start_main_#t~mem14#1.base|) .cse1 v_ArrVal_2005))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_2004 (Array Int Int)) (v_ArrVal_2005 Int)) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2004))) (store .cse4 |c_ULTIMATE.start_main_#t~mem14#1.base| (store (select .cse4 |c_ULTIMATE.start_main_#t~mem14#1.base|) .cse1 v_ArrVal_2005))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))))) is different from false
[2023-10-25 15:12:41,985 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_#t~mem14#1.offset| (* |c_ULTIMATE.start_main_~i~1#1| 4))) (.cse3 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (and (forall ((v_ArrVal_1999 (Array Int Int)) (v_ArrVal_2004 (Array Int Int)) (v_ArrVal_2005 Int)) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse0 (store (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1999))) (store .cse2 c_threadThread1of2ForFork0_~t~0.base (store (select .cse2 c_threadThread1of2ForFork0_~t~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2004))) (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| (store (select .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base|) .cse1 v_ArrVal_2005))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_1999 (Array Int Int)) (v_ArrVal_2004 (Array Int Int)) (v_ArrVal_2005 Int)) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse4 (store (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1999))) (store .cse5 c_threadThread1of2ForFork0_~t~0.base (store (select .cse5 c_threadThread1of2ForFork0_~t~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2004))) (store .cse4 |c_ULTIMATE.start_main_#t~mem14#1.base| (store (select .cse4 |c_ULTIMATE.start_main_#t~mem14#1.base|) .cse1 v_ArrVal_2005))) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_1999 (Array Int Int)) (v_ArrVal_2004 (Array Int Int)) (v_ArrVal_2005 Int)) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse6 (store (let ((.cse7 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1999))) (store .cse7 c_threadThread1of2ForFork0_~t~0.base (store (select .cse7 c_threadThread1of2ForFork0_~t~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2004))) (store .cse6 |c_ULTIMATE.start_main_#t~mem14#1.base| (store (select .cse6 |c_ULTIMATE.start_main_#t~mem14#1.base|) .cse1 v_ArrVal_2005))) c_threadThread1of2ForFork0_~t~0.base) .cse3))) (forall ((v_ArrVal_1999 (Array Int Int)) (v_ArrVal_2004 (Array Int Int)) (v_ArrVal_2005 Int)) (= (select (select (let ((.cse8 (store (let ((.cse9 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1999))) (store .cse9 c_threadThread1of2ForFork0_~t~0.base (store (select .cse9 c_threadThread1of2ForFork0_~t~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2004))) (store .cse8 |c_ULTIMATE.start_main_#t~mem14#1.base| (store (select .cse8 |c_ULTIMATE.start_main_#t~mem14#1.base|) .cse1 v_ArrVal_2005))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)) |c_threadThread1of2ForFork0_#t~nondet4|)))) is different from false
[2023-10-25 15:12:42,035 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse5 (+ c_threadThread1of2ForFork0_~t~0.offset 2))) (let ((.cse1 (+ |c_ULTIMATE.start_main_#t~mem14#1.offset| (* |c_ULTIMATE.start_main_~i~1#1| 4))) (.cse3 (+ c_threadThread1of2ForFork0_~t~0.offset 3)) (.cse4 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse5 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_1999 (Array Int Int)) (v_ArrVal_2004 (Array Int Int)) (v_ArrVal_2005 Int)) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse0 (store (let ((.cse2 (store .cse4 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1999))) (store .cse2 c_threadThread1of2ForFork0_~t~0.base (store (select .cse2 c_threadThread1of2ForFork0_~t~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2004))) (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| (store (select .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base|) .cse1 v_ArrVal_2005))) c_threadThread1of2ForFork0_~t~0.base) .cse5))) (forall ((v_ArrVal_1999 (Array Int Int)) (v_ArrVal_2004 (Array Int Int)) (v_ArrVal_2005 Int)) (= (select (select (let ((.cse6 (store (let ((.cse7 (store .cse4 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1999))) (store .cse7 c_threadThread1of2ForFork0_~t~0.base (store (select .cse7 c_threadThread1of2ForFork0_~t~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2004))) (store .cse6 |c_ULTIMATE.start_main_#t~mem14#1.base| (store (select .cse6 |c_ULTIMATE.start_main_#t~mem14#1.base|) .cse1 v_ArrVal_2005))) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1999 (Array Int Int)) (v_ArrVal_2004 (Array Int Int)) (v_ArrVal_2005 Int)) (= (select (select (let ((.cse8 (store (let ((.cse9 (store .cse4 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1999))) (store .cse9 c_threadThread1of2ForFork0_~t~0.base (store (select .cse9 c_threadThread1of2ForFork0_~t~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2004))) (store .cse8 |c_ULTIMATE.start_main_#t~mem14#1.base| (store (select .cse8 |c_ULTIMATE.start_main_#t~mem14#1.base|) .cse1 v_ArrVal_2005))) c_threadThread1of2ForFork0_~t~0.base) .cse3) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1999 (Array Int Int)) (v_ArrVal_2004 (Array Int Int)) (v_ArrVal_2005 Int)) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse10 (store (let ((.cse11 (store .cse4 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1999))) (store .cse11 c_threadThread1of2ForFork0_~t~0.base (store (select .cse11 c_threadThread1of2ForFork0_~t~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2004))) (store .cse10 |c_ULTIMATE.start_main_#t~mem14#1.base| (store (select .cse10 |c_ULTIMATE.start_main_#t~mem14#1.base|) .cse1 v_ArrVal_2005))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1))))))) is different from false
[2023-10-25 15:12:42,083 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse10 (+ c_threadThread1of2ForFork0_~t~0.offset 2))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse2 (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) (* |c_ULTIMATE.start_main_~i~1#1| 4))) (.cse4 (+ c_threadThread1of2ForFork0_~t~0.offset 3)) (.cse5 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse10 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_1999 (Array Int Int)) (v_ArrVal_2004 (Array Int Int)) (v_ArrVal_2005 Int)) (= (select (select (let ((.cse0 (store (let ((.cse3 (store .cse5 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1999))) (store .cse3 c_threadThread1of2ForFork0_~t~0.base (store (select .cse3 c_threadThread1of2ForFork0_~t~0.base) .cse4 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2004))) (store .cse0 .cse1 (store (select .cse0 .cse1) .cse2 v_ArrVal_2005))) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1999 (Array Int Int)) (v_ArrVal_2004 (Array Int Int)) (v_ArrVal_2005 Int)) (= (select (select (let ((.cse6 (store (let ((.cse7 (store .cse5 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1999))) (store .cse7 c_threadThread1of2ForFork0_~t~0.base (store (select .cse7 c_threadThread1of2ForFork0_~t~0.base) .cse4 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2004))) (store .cse6 .cse1 (store (select .cse6 .cse1) .cse2 v_ArrVal_2005))) c_threadThread1of2ForFork0_~t~0.base) .cse4) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1999 (Array Int Int)) (v_ArrVal_2004 (Array Int Int)) (v_ArrVal_2005 Int)) (= (select (select (let ((.cse8 (store (let ((.cse9 (store .cse5 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1999))) (store .cse9 c_threadThread1of2ForFork0_~t~0.base (store (select .cse9 c_threadThread1of2ForFork0_~t~0.base) .cse4 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2004))) (store .cse8 .cse1 (store (select .cse8 .cse1) .cse2 v_ArrVal_2005))) c_threadThread1of2ForFork0_~t~0.base) .cse10) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1999 (Array Int Int)) (v_ArrVal_2004 (Array Int Int)) (v_ArrVal_2005 Int)) (= (select (select (let ((.cse11 (store (let ((.cse12 (store .cse5 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1999))) (store .cse12 c_threadThread1of2ForFork0_~t~0.base (store (select .cse12 c_threadThread1of2ForFork0_~t~0.base) .cse4 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2004))) (store .cse11 .cse1 (store (select .cse11 .cse1) .cse2 v_ArrVal_2005))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|))))) is different from false
[2023-10-25 15:12:42,716 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse6 (+ c_threadThread1of2ForFork0_~t~0.offset 1)) (.cse11 (+ c_threadThread1of2ForFork0_~t~0.offset 2))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse4 (+ c_threadThread1of2ForFork0_~t~0.offset 3)) (.cse5 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse6 |c_threadThread1of2ForFork0_#t~nondet4|) .cse11 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_1999 (Array Int Int)) (v_ArrVal_2004 (Array Int Int)) (v_ArrVal_2005 Int)) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse0 (store (let ((.cse3 (store .cse5 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1999))) (store .cse3 c_threadThread1of2ForFork0_~t~0.base (store (select .cse3 c_threadThread1of2ForFork0_~t~0.base) .cse4 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2004))) (store .cse0 .cse1 (store (select .cse0 .cse1) .cse2 v_ArrVal_2005))) c_threadThread1of2ForFork0_~t~0.base) .cse6))) (forall ((v_ArrVal_1999 (Array Int Int)) (v_ArrVal_2004 (Array Int Int)) (v_ArrVal_2005 Int)) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse7 (store (let ((.cse8 (store .cse5 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1999))) (store .cse8 c_threadThread1of2ForFork0_~t~0.base (store (select .cse8 c_threadThread1of2ForFork0_~t~0.base) .cse4 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2004))) (store .cse7 .cse1 (store (select .cse7 .cse1) .cse2 v_ArrVal_2005))) c_threadThread1of2ForFork0_~t~0.base) .cse4))) (forall ((v_ArrVal_1999 (Array Int Int)) (v_ArrVal_2004 (Array Int Int)) (v_ArrVal_2005 Int)) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse9 (store (let ((.cse10 (store .cse5 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1999))) (store .cse10 c_threadThread1of2ForFork0_~t~0.base (store (select .cse10 c_threadThread1of2ForFork0_~t~0.base) .cse4 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2004))) (store .cse9 .cse1 (store (select .cse9 .cse1) .cse2 v_ArrVal_2005))) c_threadThread1of2ForFork0_~t~0.base) .cse11))) (forall ((v_ArrVal_1999 (Array Int Int)) (v_ArrVal_2004 (Array Int Int)) (v_ArrVal_2005 Int)) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse12 (store (let ((.cse13 (store .cse5 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1999))) (store .cse13 c_threadThread1of2ForFork0_~t~0.base (store (select .cse13 c_threadThread1of2ForFork0_~t~0.base) .cse4 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2004))) (store .cse12 .cse1 (store (select .cse12 .cse1) .cse2 v_ArrVal_2005))) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset)))))) is different from false
[2023-10-25 15:12:42,814 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-25 15:12:42,814 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 139 treesize of output 96
[2023-10-25 15:12:42,836 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-25 15:12:42,836 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 3880 treesize of output 3572
[2023-10-25 15:12:42,924 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 3998 treesize of output 3782
[2023-10-25 15:12:42,976 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 4149 treesize of output 3997
[2023-10-25 15:12:49,456 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 9
[2023-10-25 15:12:49,470 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-25 15:12:49,470 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 139 treesize of output 96
[2023-10-25 15:12:49,474 INFO  L173   IndexEqualityManager]: detected equality via solver
[2023-10-25 15:12:49,500 INFO  L321             Elim1Store]: treesize reduction 8, result has 33.3 percent of original size
[2023-10-25 15:12:49,500 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 2266 treesize of output 2014
[2023-10-25 15:12:49,532 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 2310 treesize of output 2246
[2023-10-25 15:12:49,557 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 1189 treesize of output 1173
[2023-10-25 15:12:49,571 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 2514 treesize of output 2134
[2023-10-25 15:12:49,858 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-25 15:12:49,858 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 139 treesize of output 96
[2023-10-25 15:12:49,860 INFO  L173   IndexEqualityManager]: detected equality via solver
[2023-10-25 15:12:49,873 INFO  L321             Elim1Store]: treesize reduction 8, result has 33.3 percent of original size
[2023-10-25 15:12:49,873 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 1900 treesize of output 1776
[2023-10-25 15:12:49,908 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 942 treesize of output 910
[2023-10-25 15:12:49,915 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 932 treesize of output 822
[2023-10-25 15:12:50,106 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-25 15:12:50,106 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 137 treesize of output 94
[2023-10-25 15:12:50,109 INFO  L173   IndexEqualityManager]: detected equality via solver
[2023-10-25 15:12:50,130 INFO  L321             Elim1Store]: treesize reduction 8, result has 33.3 percent of original size
[2023-10-25 15:12:50,130 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 580 treesize of output 514
[2023-10-25 15:12:50,139 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 261 treesize of output 259
[2023-10-25 15:12:50,158 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 562 treesize of output 446
[2023-10-25 15:12:50,168 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 354 treesize of output 346
[2023-10-25 15:13:02,035 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:13:02,036 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [2139552891] provided 0 perfect and 2 imperfect interpolant sequences
[2023-10-25 15:13:02,036 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-10-25 15:13:02,036 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 15] total 42
[2023-10-25 15:13:02,036 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988107012]
[2023-10-25 15:13:02,036 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-10-25 15:13:02,037 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 44 states
[2023-10-25 15:13:02,037 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:13:02,037 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants.
[2023-10-25 15:13:02,037 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=1291, Unknown=29, NotChecked=390, Total=1892
[2023-10-25 15:13:02,414 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 49 out of 215
[2023-10-25 15:13:02,416 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 258 places, 2968 transitions, 57139 flow. Second operand  has 44 states, 44 states have (on average 51.15909090909091) internal successors, (2251), 44 states have internal predecessors, (2251), 0 states have call successors, (0), 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 15:13:02,416 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:13:02,416 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 215
[2023-10-25 15:13:02,416 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 15:13:58,727 INFO  L130       PetriNetUnfolder]: 48732/81070 cut-off events.
[2023-10-25 15:13:58,727 INFO  L131       PetriNetUnfolder]: For 1718028/1718028 co-relation queries the response was YES.
[2023-10-25 15:13:59,615 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 802352 conditions, 81070 events. 48732/81070 cut-off events. For 1718028/1718028 co-relation queries the response was YES. Maximal size of possible extension queue 2083. Compared 667843 event pairs, 10215 based on Foata normal form. 48/77605 useless extension candidates. Maximal degree in co-relation 772700. Up to 77105 conditions per place. 
[2023-10-25 15:14:00,263 INFO  L137   encePairwiseOnDemand]: 191/215 looper letters, 3438 selfloop transitions, 170 changer transitions 128/3737 dead transitions.
[2023-10-25 15:14:00,264 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 278 places, 3737 transitions, 76564 flow
[2023-10-25 15:14:00,265 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. 
[2023-10-25 15:14:00,265 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 21 states.
[2023-10-25 15:14:00,266 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 1346 transitions.
[2023-10-25 15:14:00,267 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.2981173864894795
[2023-10-25 15:14:00,268 INFO  L72            ComplementDD]: Start complementDD. Operand 21 states and 1346 transitions.
[2023-10-25 15:14:00,268 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 21 states and 1346 transitions.
[2023-10-25 15:14:00,268 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 15:14:00,268 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 1346 transitions.
[2023-10-25 15:14:00,284 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 22 states, 21 states have (on average 64.0952380952381) internal successors, (1346), 21 states have internal predecessors, (1346), 0 states have call successors, (0), 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 15:14:00,287 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 22 states, 22 states have (on average 215.0) internal successors, (4730), 22 states have internal predecessors, (4730), 0 states have call successors, (0), 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 15:14:00,300 INFO  L81            ComplementDD]: Finished complementDD. Result  has 22 states, 22 states have (on average 215.0) internal successors, (4730), 22 states have internal predecessors, (4730), 0 states have call successors, (0), 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 15:14:00,300 INFO  L175             Difference]: Start difference. First operand has 258 places, 2968 transitions, 57139 flow. Second operand 21 states and 1346 transitions.
[2023-10-25 15:14:00,300 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 278 places, 3737 transitions, 76564 flow
[2023-10-25 15:15:03,947 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 276 places, 3737 transitions, 75368 flow, removed 596 selfloop flow, removed 2 redundant places.
[2023-10-25 15:15:04,001 INFO  L231             Difference]: Finished difference. Result has 287 places, 3124 transitions, 60028 flow
[2023-10-25 15:15:04,007 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=56187, PETRI_DIFFERENCE_MINUEND_PLACES=256, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2968, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2827, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=60028, PETRI_PLACES=287, PETRI_TRANSITIONS=3124}
[2023-10-25 15:15:04,008 INFO  L288   CegarLoopForPetriNet]: 71 programPoint places, 216 predicate places.
[2023-10-25 15:15:04,008 INFO  L495      AbstractCegarLoop]: Abstraction has has 287 places, 3124 transitions, 60028 flow
[2023-10-25 15:15:04,009 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 44 states, 44 states have (on average 51.15909090909091) internal successors, (2251), 44 states have internal predecessors, (2251), 0 states have call successors, (0), 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 15:15:04,009 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:15:04,009 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]
[2023-10-25 15:15:04,015 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0
[2023-10-25 15:15:04,213 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,15 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-25 15:15:04,214 INFO  L420      AbstractCegarLoop]: === Iteration 14 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2023-10-25 15:15:04,214 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:15:04,215 INFO  L85        PathProgramCache]: Analyzing trace with hash 1792801883, now seen corresponding path program 3 times
[2023-10-25 15:15:04,215 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:15:04,215 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424367279]
[2023-10-25 15:15:04,216 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:15:04,217 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:15:04,251 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:15:04,986 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:15:04,986 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:15:04,986 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424367279]
[2023-10-25 15:15:04,986 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424367279] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-25 15:15:04,986 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [570527739]
[2023-10-25 15:15:04,986 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2023-10-25 15:15:04,986 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-25 15:15:04,986 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-25 15:15:04,988 INFO  L229       MonitoredProcess]: Starting monitored process 16 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-10-25 15:15:05,014 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process
[2023-10-25 15:15:05,212 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s)
[2023-10-25 15:15:05,212 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2023-10-25 15:15:05,214 INFO  L263         TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 64 conjunts are in the unsatisfiable core
[2023-10-25 15:15:05,218 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-25 15:15:05,301 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 15:15:05,303 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 15:15:05,308 INFO  L321             Elim1Store]: treesize reduction 15, result has 6.3 percent of original size
[2023-10-25 15:15:05,309 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 44
[2023-10-25 15:15:05,832 INFO  L321             Elim1Store]: treesize reduction 32, result has 31.9 percent of original size
[2023-10-25 15:15:05,832 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 66 treesize of output 66
[2023-10-25 15:15:05,876 INFO  L321             Elim1Store]: treesize reduction 23, result has 36.1 percent of original size
[2023-10-25 15:15:05,876 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 43
[2023-10-25 15:15:05,885 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 15:15:05,900 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 30 treesize of output 22
[2023-10-25 15:15:06,263 INFO  L321             Elim1Store]: treesize reduction 32, result has 31.9 percent of original size
[2023-10-25 15:15:06,263 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 86 treesize of output 85
[2023-10-25 15:15:06,292 INFO  L321             Elim1Store]: treesize reduction 32, result has 31.9 percent of original size
[2023-10-25 15:15:06,292 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 77 treesize of output 84
[2023-10-25 15:15:06,347 WARN  L207             Elim1Store]: Array PQE input equivalent to false
[2023-10-25 15:15:06,585 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-25 15:15:06,586 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 87 treesize of output 67
[2023-10-25 15:15:06,598 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-25 15:15:06,598 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 62 treesize of output 58
[2023-10-25 15:15:06,779 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2023-10-25 15:15:06,823 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 15:15:06,823 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20
[2023-10-25 15:15:06,864 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 15:15:06,865 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 15:15:06,866 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32
[2023-10-25 15:15:06,922 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 15:15:06,924 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 15:15:06,924 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 15:15:06,926 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44
[2023-10-25 15:15:06,988 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 15:15:06,989 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 15:15:06,990 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 15:15:06,991 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 54
[2023-10-25 15:15:07,029 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:15:07,029 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-25 15:15:07,923 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse0 (forall ((v_ArrVal_2134 (Array Int Int))) (not (= |c_threadThread1of2ForFork0_#in~arg.base| (select (select (store |c_#memory_$Pointer$.base| |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_2134) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)))))) (and (or (forall ((v_ArrVal_2133 (Array Int Int))) (not (= (+ 2 |c_threadThread1of2ForFork0_#in~arg.offset|) (select (select (store |c_#memory_$Pointer$.offset| |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_2133) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)))) .cse0) (or (forall ((v_ArrVal_2133 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.offset| |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_2133) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) (+ 3 |c_threadThread1of2ForFork0_#in~arg.offset|)))) .cse0) (or (forall ((v_ArrVal_2133 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.offset| |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_2133) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) |c_threadThread1of2ForFork0_#in~arg.offset|))) .cse0) (or (forall ((v_ArrVal_2133 (Array Int Int))) (not (= (+ |c_threadThread1of2ForFork0_#in~arg.offset| 1) (select (select (store |c_#memory_$Pointer$.offset| |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_2133) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)))) .cse0))) is different from false
[2023-10-25 15:15:08,013 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse0 (forall ((v_ArrVal_2134 (Array Int Int))) (not (= |c_ULTIMATE.start_main_#t~mem9#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem9#1.base| v_ArrVal_2134) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))))) (.cse1 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (and (or .cse0 (forall ((v_ArrVal_2133 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem9#1.base| v_ArrVal_2133) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) (+ |c_ULTIMATE.start_main_#t~mem9#1.offset| .cse1 1))))) (or .cse0 (forall ((v_ArrVal_2133 (Array Int Int))) (not (= (+ |c_ULTIMATE.start_main_#t~mem9#1.offset| .cse1) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem9#1.base| v_ArrVal_2133) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))))) (or .cse0 (forall ((v_ArrVal_2133 (Array Int Int))) (not (= (+ |c_ULTIMATE.start_main_#t~mem9#1.offset| .cse1 3) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem9#1.base| v_ArrVal_2133) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))))) (or .cse0 (forall ((v_ArrVal_2133 (Array Int Int))) (not (= (+ |c_ULTIMATE.start_main_#t~mem9#1.offset| .cse1 2) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem9#1.base| v_ArrVal_2133) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))))))) is different from false
[2023-10-25 15:15:08,571 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|)) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#ts~0#1.base|) |c_ULTIMATE.start_main_~#ts~0#1.offset|))) (let ((.cse4 (forall ((v_ArrVal_2134 (Array Int Int)) (v_ArrVal_2132 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2132) .cse1 v_ArrVal_2134) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) .cse1)))) (.cse2 (* |c_ULTIMATE.start_main_~i~0#1| 4)) (.cse3 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#ts~0#1.base|) |c_ULTIMATE.start_main_~#ts~0#1.offset|))) (and (or (forall ((v_ArrVal_2133 (Array Int Int)) (v_ArrVal_2131 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2131) .cse1 v_ArrVal_2133) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) (+ .cse2 .cse3)))) .cse4) (or (forall ((v_ArrVal_2133 (Array Int Int)) (v_ArrVal_2131 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2131) .cse1 v_ArrVal_2133) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) (+ .cse2 .cse3 1)))) .cse4) (or .cse4 (forall ((v_ArrVal_2133 (Array Int Int)) (v_ArrVal_2131 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2131) .cse1 v_ArrVal_2133) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) (+ .cse2 .cse3 2))))) (or .cse4 (forall ((v_ArrVal_2133 (Array Int Int)) (v_ArrVal_2131 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2131) .cse1 v_ArrVal_2133) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) (+ .cse2 .cse3 3)))))))) is different from false
[2023-10-25 15:15:08,574 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked.
[2023-10-25 15:15:08,574 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [570527739] provided 0 perfect and 2 imperfect interpolant sequences
[2023-10-25 15:15:08,574 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-10-25 15:15:08,574 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 38
[2023-10-25 15:15:08,575 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693363372]
[2023-10-25 15:15:08,575 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-10-25 15:15:08,575 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 40 states
[2023-10-25 15:15:08,576 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:15:08,576 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants.
[2023-10-25 15:15:08,577 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=1133, Unknown=21, NotChecked=216, Total=1560
[2023-10-25 15:15:08,729 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 49 out of 215
[2023-10-25 15:15:08,731 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 287 places, 3124 transitions, 60028 flow. Second operand  has 40 states, 40 states have (on average 51.375) internal successors, (2055), 40 states have internal predecessors, (2055), 0 states have call successors, (0), 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 15:15:08,731 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:15:08,731 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 215
[2023-10-25 15:15:08,731 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 15:16:00,484 INFO  L130       PetriNetUnfolder]: 48747/81216 cut-off events.
[2023-10-25 15:16:00,484 INFO  L131       PetriNetUnfolder]: For 1990043/1990043 co-relation queries the response was YES.
[2023-10-25 15:16:01,656 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 836938 conditions, 81216 events. 48747/81216 cut-off events. For 1990043/1990043 co-relation queries the response was YES. Maximal size of possible extension queue 2083. Compared 669957 event pairs, 10146 based on Foata normal form. 32/77735 useless extension candidates. Maximal degree in co-relation 806166. Up to 77103 conditions per place. 
[2023-10-25 15:16:02,095 INFO  L137   encePairwiseOnDemand]: 198/215 looper letters, 3732 selfloop transitions, 153 changer transitions 140/4026 dead transitions.
[2023-10-25 15:16:02,095 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 308 places, 4026 transitions, 83159 flow
[2023-10-25 15:16:02,096 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. 
[2023-10-25 15:16:02,096 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 22 states.
[2023-10-25 15:16:02,110 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 1396 transitions.
[2023-10-25 15:16:02,113 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.29513742071881605
[2023-10-25 15:16:02,113 INFO  L72            ComplementDD]: Start complementDD. Operand 22 states and 1396 transitions.
[2023-10-25 15:16:02,114 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 22 states and 1396 transitions.
[2023-10-25 15:16:02,114 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 15:16:02,115 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 22 states and 1396 transitions.
[2023-10-25 15:16:02,116 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 23 states, 22 states have (on average 63.45454545454545) internal successors, (1396), 22 states have internal predecessors, (1396), 0 states have call successors, (0), 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 15:16:02,120 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 23 states, 23 states have (on average 215.0) internal successors, (4945), 23 states have internal predecessors, (4945), 0 states have call successors, (0), 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 15:16:02,121 INFO  L81            ComplementDD]: Finished complementDD. Result  has 23 states, 23 states have (on average 215.0) internal successors, (4945), 23 states have internal predecessors, (4945), 0 states have call successors, (0), 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 15:16:02,121 INFO  L175             Difference]: Start difference. First operand has 287 places, 3124 transitions, 60028 flow. Second operand 22 states and 1396 transitions.
[2023-10-25 15:16:02,121 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 308 places, 4026 transitions, 83159 flow
[2023-10-25 15:17:49,713 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 299 places, 4026 transitions, 82892 flow, removed 121 selfloop flow, removed 9 redundant places.
[2023-10-25 15:17:49,767 INFO  L231             Difference]: Finished difference. Result has 312 places, 3225 transitions, 62935 flow
[2023-10-25 15:17:49,769 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=59839, PETRI_DIFFERENCE_MINUEND_PLACES=278, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=3124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=3022, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=62935, PETRI_PLACES=312, PETRI_TRANSITIONS=3225}
[2023-10-25 15:17:49,770 INFO  L288   CegarLoopForPetriNet]: 71 programPoint places, 241 predicate places.
[2023-10-25 15:17:49,771 INFO  L495      AbstractCegarLoop]: Abstraction has has 312 places, 3225 transitions, 62935 flow
[2023-10-25 15:17:49,771 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 40 states, 40 states have (on average 51.375) internal successors, (2055), 40 states have internal predecessors, (2055), 0 states have call successors, (0), 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 15:17:49,771 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:17:49,772 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]
[2023-10-25 15:17:49,778 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0
[2023-10-25 15:17:49,976 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,16 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-25 15:17:49,977 INFO  L420      AbstractCegarLoop]: === Iteration 15 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2023-10-25 15:17:49,977 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:17:49,977 INFO  L85        PathProgramCache]: Analyzing trace with hash 2001051211, now seen corresponding path program 4 times
[2023-10-25 15:17:49,978 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:17:49,978 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911795903]
[2023-10-25 15:17:49,978 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:17:49,979 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:17:50,015 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:17:50,839 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:17:50,839 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:17:50,839 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911795903]
[2023-10-25 15:17:50,839 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911795903] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-25 15:17:50,839 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [236625462]
[2023-10-25 15:17:50,839 INFO  L93    rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2023-10-25 15:17:50,839 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-25 15:17:50,840 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-25 15:17:50,840 INFO  L229       MonitoredProcess]: Starting monitored process 17 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-10-25 15:17:50,869 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process
[2023-10-25 15:17:51,123 INFO  L228   tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s)
[2023-10-25 15:17:51,123 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2023-10-25 15:17:51,125 INFO  L263         TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 69 conjunts are in the unsatisfiable core
[2023-10-25 15:17:51,127 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-25 15:17:51,139 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 38 treesize of output 32
[2023-10-25 15:17:51,371 INFO  L321             Elim1Store]: treesize reduction 11, result has 8.3 percent of original size
[2023-10-25 15:17:51,371 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 22 treesize of output 10
[2023-10-25 15:17:51,616 INFO  L321             Elim1Store]: treesize reduction 32, result has 31.9 percent of original size
[2023-10-25 15:17:51,616 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 55 treesize of output 57
[2023-10-25 15:17:51,628 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 22 treesize of output 16
[2023-10-25 15:17:51,722 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 24 treesize of output 24
[2023-10-25 15:17:51,761 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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 15:17:51,818 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 13
[2023-10-25 15:17:51,863 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16
[2023-10-25 15:17:51,878 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 15:17:51,879 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 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 15:17:51,928 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23
[2023-10-25 15:17:51,945 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23
[2023-10-25 15:17:51,974 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23
[2023-10-25 15:17:51,988 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 15:17:51,989 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 15:17:51,989 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 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 15:17:52,054 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 15:17:52,055 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 15:17:52,056 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 15:17:52,057 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 8 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 15:17:52,219 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 15:17:52,219 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 55 treesize of output 52
[2023-10-25 15:17:52,310 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:17:52,310 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-25 15:17:52,342 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2283 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2283) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_2283 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2283) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_2283 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2283) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_2283 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2283) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset)))) is different from false
[2023-10-25 15:17:53,198 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse3 (+ c_threadThread1of2ForFork0_~t~0.offset 1))) (let ((.cse1 (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse5 (+ c_threadThread1of2ForFork0_~t~0.offset 2)) (.cse6 (+ c_threadThread1of2ForFork0_~t~0.offset 3)) (.cse7 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_2278 (Array Int Int))) (let ((.cse2 (let ((.cse4 (store .cse7 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2278))) (store .cse4 c_threadThread1of2ForFork0_~t~0.base (store (store (select .cse4 c_threadThread1of2ForFork0_~t~0.base) .cse5 |c_threadThread1of2ForFork0_#t~nondet4|) .cse6 |c_threadThread1of2ForFork0_#t~nondet4|))))) (let ((.cse0 (select .cse2 |c_ULTIMATE.start_main_~#tids~0#1.base|))) (or (not (= 0 (select .cse0 .cse1))) (not (= (select .cse0 |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (forall ((v_ArrVal_2283 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse2 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2283) c_threadThread1of2ForFork0_~t~0.base) .cse3))))))) (forall ((v_ArrVal_2278 (Array Int Int))) (let ((.cse8 (let ((.cse10 (store .cse7 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2278))) (store .cse10 c_threadThread1of2ForFork0_~t~0.base (store (store (select .cse10 c_threadThread1of2ForFork0_~t~0.base) .cse5 |c_threadThread1of2ForFork0_#t~nondet4|) .cse6 |c_threadThread1of2ForFork0_#t~nondet4|))))) (let ((.cse9 (select .cse8 |c_ULTIMATE.start_main_~#tids~0#1.base|))) (or (forall ((v_ArrVal_2283 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse8 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2283) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (not (= 0 (select .cse9 .cse1))) (not (= (select .cse9 |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)))))) (forall ((v_ArrVal_2278 (Array Int Int))) (let ((.cse12 (let ((.cse13 (store .cse7 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2278))) (store .cse13 c_threadThread1of2ForFork0_~t~0.base (store (store (select .cse13 c_threadThread1of2ForFork0_~t~0.base) .cse5 |c_threadThread1of2ForFork0_#t~nondet4|) .cse6 |c_threadThread1of2ForFork0_#t~nondet4|))))) (let ((.cse11 (select .cse12 |c_ULTIMATE.start_main_~#tids~0#1.base|))) (or (not (= 0 (select .cse11 .cse1))) (not (= (select .cse11 |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (forall ((v_ArrVal_2283 (Array Int Int))) (= (select (select (store .cse12 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2283) c_threadThread1of2ForFork0_~t~0.base) .cse5) |c_threadThread1of2ForFork0_#t~nondet4|))))))))) is different from false
[2023-10-25 15:18:05,668 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-25 15:18:05,668 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 290 treesize of output 202
[2023-10-25 15:18:05,691 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 578 treesize of output 526
[2023-10-25 15:18:05,765 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-25 15:18:05,765 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 724 treesize of output 672
[2023-10-25 15:18:05,829 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 767 treesize of output 761
[2023-10-25 15:18:05,886 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 921 treesize of output 885
[2023-10-25 15:18:05,908 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 94 treesize of output 78
[2023-10-25 15:18:06,198 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-25 15:18:06,199 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 288 treesize of output 200
[2023-10-25 15:18:06,227 INFO  L173   IndexEqualityManager]: detected equality via solver
[2023-10-25 15:18:06,236 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 492 treesize of output 442
[2023-10-25 15:18:06,325 INFO  L321             Elim1Store]: treesize reduction 9, result has 52.6 percent of original size
[2023-10-25 15:18:06,326 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 646 treesize of output 590
[2023-10-25 15:18:06,470 INFO  L321             Elim1Store]: treesize reduction 9, result has 52.6 percent of original size
[2023-10-25 15:18:06,471 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 789 treesize of output 791
[2023-10-25 15:18:06,642 INFO  L321             Elim1Store]: treesize reduction 5, result has 73.7 percent of original size
[2023-10-25 15:18:06,642 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 942 treesize of output 917
[2023-10-25 15:18:07,106 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-25 15:18:07,106 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 290 treesize of output 202
[2023-10-25 15:18:07,121 INFO  L173   IndexEqualityManager]: detected equality via solver
[2023-10-25 15:18:07,129 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 486 treesize of output 438
[2023-10-25 15:18:07,138 INFO  L173   IndexEqualityManager]: detected equality via solver
[2023-10-25 15:18:07,139 INFO  L173   IndexEqualityManager]: detected equality via solver
[2023-10-25 15:18:07,139 INFO  L173   IndexEqualityManager]: detected equality via solver
[2023-10-25 15:18:07,140 INFO  L173   IndexEqualityManager]: detected equality via solver
[2023-10-25 15:18:07,140 INFO  L173   IndexEqualityManager]: detected equality via solver
[2023-10-25 15:18:07,144 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 15:18:07,154 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 15:18:07,155 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 358 treesize of output 324
[2023-10-25 15:18:07,163 INFO  L173   IndexEqualityManager]: detected equality via solver
[2023-10-25 15:18:07,164 INFO  L173   IndexEqualityManager]: detected equality via solver
[2023-10-25 15:18:07,164 INFO  L173   IndexEqualityManager]: detected equality via solver
[2023-10-25 15:18:07,165 INFO  L173   IndexEqualityManager]: detected equality via solver
[2023-10-25 15:18:07,165 INFO  L173   IndexEqualityManager]: detected equality via solver
[2023-10-25 15:18:07,169 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 15:18:07,176 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 283 treesize of output 281
[2023-10-25 15:18:07,182 INFO  L173   IndexEqualityManager]: detected equality via solver
[2023-10-25 15:18:07,187 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 15:18:07,188 INFO  L173   IndexEqualityManager]: detected equality via solver
[2023-10-25 15:18:07,188 INFO  L173   IndexEqualityManager]: detected equality via solver
[2023-10-25 15:18:07,194 INFO  L173   IndexEqualityManager]: detected equality via solver
[2023-10-25 15:18:07,195 INFO  L173   IndexEqualityManager]: detected equality via solver
[2023-10-25 15:18:07,195 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 240 treesize of output 208
[2023-10-25 15:18:08,251 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:18:08,252 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [236625462] provided 0 perfect and 2 imperfect interpolant sequences
[2023-10-25 15:18:08,252 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-10-25 15:18:08,252 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 15] total 38
[2023-10-25 15:18:08,252 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540560208]
[2023-10-25 15:18:08,252 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-10-25 15:18:08,252 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 40 states
[2023-10-25 15:18:08,252 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:18:08,253 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants.
[2023-10-25 15:18:08,253 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=1189, Unknown=50, NotChecked=146, Total=1560
[2023-10-25 15:18:10,592 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 54 out of 215
[2023-10-25 15:18:10,593 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 312 places, 3225 transitions, 62935 flow. Second operand  has 40 states, 40 states have (on average 56.275) internal successors, (2251), 40 states have internal predecessors, (2251), 0 states have call successors, (0), 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 15:18:10,593 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:18:10,593 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 215
[2023-10-25 15:18:10,593 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 15:19:20,816 INFO  L130       PetriNetUnfolder]: 48616/80969 cut-off events.
[2023-10-25 15:19:20,817 INFO  L131       PetriNetUnfolder]: For 2185458/2185458 co-relation queries the response was YES.
[2023-10-25 15:19:21,924 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 851081 conditions, 80969 events. 48616/80969 cut-off events. For 2185458/2185458 co-relation queries the response was YES. Maximal size of possible extension queue 2080. Compared 667618 event pairs, 10112 based on Foata normal form. 24/77480 useless extension candidates. Maximal degree in co-relation 819901. Up to 77103 conditions per place. 
[2023-10-25 15:19:22,532 INFO  L137   encePairwiseOnDemand]: 192/215 looper letters, 3525 selfloop transitions, 170 changer transitions 56/3752 dead transitions.
[2023-10-25 15:19:22,532 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 328 places, 3752 transitions, 78932 flow
[2023-10-25 15:19:22,533 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. 
[2023-10-25 15:19:22,533 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 17 states.
[2023-10-25 15:19:22,534 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1179 transitions.
[2023-10-25 15:19:22,535 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.3225718194254446
[2023-10-25 15:19:22,535 INFO  L72            ComplementDD]: Start complementDD. Operand 17 states and 1179 transitions.
[2023-10-25 15:19:22,538 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 17 states and 1179 transitions.
[2023-10-25 15:19:22,539 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 15:19:22,539 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 1179 transitions.
[2023-10-25 15:19:22,540 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 18 states, 17 states have (on average 69.3529411764706) internal successors, (1179), 17 states have internal predecessors, (1179), 0 states have call successors, (0), 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 15:19:22,542 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 18 states, 18 states have (on average 215.0) internal successors, (3870), 18 states have internal predecessors, (3870), 0 states have call successors, (0), 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 15:19:22,543 INFO  L81            ComplementDD]: Finished complementDD. Result  has 18 states, 18 states have (on average 215.0) internal successors, (3870), 18 states have internal predecessors, (3870), 0 states have call successors, (0), 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 15:19:22,543 INFO  L175             Difference]: Start difference. First operand has 312 places, 3225 transitions, 62935 flow. Second operand 17 states and 1179 transitions.
[2023-10-25 15:19:22,543 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 328 places, 3752 transitions, 78932 flow
[2023-10-25 15:21:39,948 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 321 places, 3752 transitions, 78442 flow, removed 233 selfloop flow, removed 7 redundant places.
[2023-10-25 15:21:40,008 INFO  L231             Difference]: Finished difference. Result has 327 places, 3277 transitions, 64366 flow
[2023-10-25 15:21:40,011 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=62445, PETRI_DIFFERENCE_MINUEND_PLACES=305, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=3225, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=118, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=3055, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=64366, PETRI_PLACES=327, PETRI_TRANSITIONS=3277}
[2023-10-25 15:21:40,011 INFO  L288   CegarLoopForPetriNet]: 71 programPoint places, 256 predicate places.
[2023-10-25 15:21:40,011 INFO  L495      AbstractCegarLoop]: Abstraction has has 327 places, 3277 transitions, 64366 flow
[2023-10-25 15:21:40,012 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 40 states, 40 states have (on average 56.275) internal successors, (2251), 40 states have internal predecessors, (2251), 0 states have call successors, (0), 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 15:21:40,012 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:21:40,012 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]
[2023-10-25 15:21:40,020 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0
[2023-10-25 15:21:40,218 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25
[2023-10-25 15:21:40,219 INFO  L420      AbstractCegarLoop]: === Iteration 16 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2023-10-25 15:21:40,219 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:21:40,220 INFO  L85        PathProgramCache]: Analyzing trace with hash -2124722161, now seen corresponding path program 5 times
[2023-10-25 15:21:40,220 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:21:40,220 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536681506]
[2023-10-25 15:21:40,221 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:21:40,225 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:21:40,283 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:21:43,136 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:21:43,137 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:21:43,137 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536681506]
[2023-10-25 15:21:43,137 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536681506] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-25 15:21:43,137 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1312297169]
[2023-10-25 15:21:43,137 INFO  L93    rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1
[2023-10-25 15:21:43,137 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-25 15:21:43,137 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-25 15:21:43,138 INFO  L229       MonitoredProcess]: Starting monitored process 18 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 15:21:43,164 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process
[2023-10-25 15:21:43,344 INFO  L228   tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2023-10-25 15:21:43,344 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2023-10-25 15:21:43,346 INFO  L263         TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 57 conjunts are in the unsatisfiable core
[2023-10-25 15:21:43,349 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-25 15:21:43,382 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 15:21:43,395 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 15:21:43,402 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 38 treesize of output 32
[2023-10-25 15:21:43,692 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 15 treesize of output 7
[2023-10-25 15:21:45,372 INFO  L321             Elim1Store]: treesize reduction 36, result has 23.4 percent of original size
[2023-10-25 15:21:45,373 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 69 treesize of output 62
[2023-10-25 15:21:45,950 INFO  L321             Elim1Store]: treesize reduction 36, result has 23.4 percent of original size
[2023-10-25 15:21:45,950 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 62 treesize of output 57
[2023-10-25 15:21:46,299 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 15:21:46,580 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 15:21:46,581 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 15:21:46,916 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 15:21:46,923 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 15:21:46,925 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-25 15:21:46,925 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 1 case distinctions, treesize of input 30 treesize of output 32
[2023-10-25 15:21:47,277 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 15:21:47,281 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 15:21:47,286 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 15:21:47,289 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-25 15:21:47,289 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 3 case distinctions, treesize of input 39 treesize of output 44
[2023-10-25 15:21:47,682 INFO  L321             Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2023-10-25 15:21:47,683 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 63 treesize of output 35
[2023-10-25 15:21:47,990 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 15:21:47,991 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-10-25 15:21:48,080 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 15:21:48,093 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-10-25 15:21:48,184 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 15:21:48,185 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-10-25 15:21:48,266 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 15:21:48,266 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-10-25 15:21:48,623 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 15:21:48,834 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:21:48,834 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-25 15:21:48,921 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2421 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2421) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_2421 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2421) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_2421 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2421) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3)))) (forall ((v_ArrVal_2421 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2421) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1))))) is different from false
[2023-10-25 15:21:49,097 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2421 (Array Int Int)) (v_ArrVal_2420 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2420) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2421) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_2421 (Array Int Int)) (v_ArrVal_2420 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2420) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2421) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_2421 (Array Int Int)) (v_ArrVal_2420 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2420) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2421) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_2421 (Array Int Int)) (v_ArrVal_2420 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2420) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2421) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3))))) is different from false
[2023-10-25 15:21:49,412 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|))) (and (forall ((v_ArrVal_2421 (Array Int Int)) (v_ArrVal_2420 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2420) .cse0 v_ArrVal_2421) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_2421 (Array Int Int)) (v_ArrVal_2420 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2420) .cse0 v_ArrVal_2421) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3)))) (forall ((v_ArrVal_2421 (Array Int Int)) (v_ArrVal_2420 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2420) .cse0 v_ArrVal_2421) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_2421 (Array Int Int)) (v_ArrVal_2420 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2420) .cse0 v_ArrVal_2421) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))))) is different from false
[2023-10-25 15:21:51,979 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-25 15:21:51,979 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 40 treesize of output 56
[2023-10-25 15:21:51,995 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-25 15:21:51,995 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 114 treesize of output 72
[2023-10-25 15:21:52,007 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 32 treesize of output 30
[2023-10-25 15:21:52,016 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 50 treesize of output 46
[2023-10-25 15:21:52,099 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2023-10-25 15:21:52,099 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 42 treesize of output 1
[2023-10-25 15:21:52,112 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2023-10-25 15:21:52,113 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 42 treesize of output 1
[2023-10-25 15:21:52,128 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2023-10-25 15:21:52,129 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 42 treesize of output 1
[2023-10-25 15:21:53,318 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:21:53,318 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1312297169] provided 0 perfect and 2 imperfect interpolant sequences
[2023-10-25 15:21:53,318 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-10-25 15:21:53,318 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 13] total 35
[2023-10-25 15:21:53,318 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424429945]
[2023-10-25 15:21:53,318 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-10-25 15:21:53,318 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 37 states
[2023-10-25 15:21:53,318 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:21:53,319 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants.
[2023-10-25 15:21:53,319 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=926, Unknown=49, NotChecked=198, Total=1332
[2023-10-25 15:21:54,326 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 54 out of 215
[2023-10-25 15:21:54,327 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 327 places, 3277 transitions, 64366 flow. Second operand  has 37 states, 37 states have (on average 56.432432432432435) internal successors, (2088), 37 states have internal predecessors, (2088), 0 states have call successors, (0), 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 15:21:54,327 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:21:54,328 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 215
[2023-10-25 15:21:54,328 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
Killed by 15
