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


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


Checking for data races
Using default analysis
Version 2329fc70
Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data -tc /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/config/AutomizerReach.xml -i /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-array-index-race-2.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 88a08bc4e972dfc9a678d317920ca53726f26c10399ef49b28cbf95e4f2e3240
--- Real Ultimate output ---
This is Ultimate 0.2.2-dev-2329fc7
[2023-10-27 12:18:30,535 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2023-10-27 12:18:30,536 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2023-10-27 12:18:30,577 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2023-10-27 12:18:30,594 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2023-10-27 12:18:30,595 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2023-10-27 12:18:30,596 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2023-10-27 12:18:30,597 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2023-10-27 12:18:30,598 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2023-10-27 12:18:30,599 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2023-10-27 12:18:30,600 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2023-10-27 12:18:30,600 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2023-10-27 12:18:30,617 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2023-10-27 12:18:30,624 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2023-10-27 12:18:30,625 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2023-10-27 12:18:30,627 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2023-10-27 12:18:30,628 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2023-10-27 12:18:30,630 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2023-10-27 12:18:30,631 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2023-10-27 12:18:30,636 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2023-10-27 12:18:30,638 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2023-10-27 12:18:30,639 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2023-10-27 12:18:30,641 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2023-10-27 12:18:30,642 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2023-10-27 12:18:30,647 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2023-10-27 12:18:30,650 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2023-10-27 12:18:30,650 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2023-10-27 12:18:30,650 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2023-10-27 12:18:30,652 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2023-10-27 12:18:30,652 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2023-10-27 12:18:30,665 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2023-10-27 12:18:30,666 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2023-10-27 12:18:30,667 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2023-10-27 12:18:30,668 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2023-10-27 12:18:30,669 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2023-10-27 12:18:30,669 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2023-10-27 12:18:30,670 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2023-10-27 12:18:30,670 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2023-10-27 12:18:30,670 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2023-10-27 12:18:30,670 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2023-10-27 12:18:30,671 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2023-10-27 12:18:30,672 INFO  L101        SettingsManager]: Beginning loading settings from /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf
[2023-10-27 12:18:30,709 INFO  L113        SettingsManager]: Loading preferences was successful
[2023-10-27 12:18:30,709 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2023-10-27 12:18:30,710 INFO  L136        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2023-10-27 12:18:30,710 INFO  L138        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2023-10-27 12:18:30,711 INFO  L136        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2023-10-27 12:18:30,711 INFO  L138        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2023-10-27 12:18:30,711 INFO  L136        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2023-10-27 12:18:30,711 INFO  L138        SettingsManager]:  * Create parallel compositions if possible=false
[2023-10-27 12:18:30,712 INFO  L138        SettingsManager]:  * Use SBE=true
[2023-10-27 12:18:30,712 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2023-10-27 12:18:30,712 INFO  L138        SettingsManager]:  * sizeof long=4
[2023-10-27 12:18:30,713 INFO  L138        SettingsManager]:  * Check unreachability of error function in SV-COMP mode=false
[2023-10-27 12:18:30,713 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2023-10-27 12:18:30,713 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2023-10-27 12:18:30,713 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2023-10-27 12:18:30,713 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2023-10-27 12:18:30,713 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2023-10-27 12:18:30,714 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2023-10-27 12:18:30,714 INFO  L138        SettingsManager]:  * Check absence of data races in concurrent programs=true
[2023-10-27 12:18:30,714 INFO  L138        SettingsManager]:  * sizeof long double=12
[2023-10-27 12:18:30,714 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2023-10-27 12:18:30,714 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2023-10-27 12:18:30,714 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2023-10-27 12:18:30,715 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2023-10-27 12:18:30,729 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2023-10-27 12:18:30,729 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2023-10-27 12:18:30,729 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2023-10-27 12:18:30,730 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2023-10-27 12:18:30,730 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2023-10-27 12:18:30,730 INFO  L138        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2023-10-27 12:18:30,730 INFO  L138        SettingsManager]:  * Trace refinement strategy=CAMEL
[2023-10-27 12:18:30,731 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2023-10-27 12:18:30,731 INFO  L138        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2023-10-27 12:18:30,731 INFO  L138        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2023-10-27 12:18:30,732 INFO  L138        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2023-10-27 12:18:30,732 INFO  L138        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2023-10-27 12:18:30,732 INFO  L138        SettingsManager]:  * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC
[2023-10-27 12:18:30,732 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 -> 88a08bc4e972dfc9a678d317920ca53726f26c10399ef49b28cbf95e4f2e3240
[2023-10-27 12:18:31,092 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2023-10-27 12:18:31,112 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2023-10-27 12:18:31,114 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2023-10-27 12:18:31,115 INFO  L271        PluginConnector]: Initializing CDTParser...
[2023-10-27 12:18:31,116 INFO  L275        PluginConnector]: CDTParser initialized
[2023-10-27 12:18:31,117 INFO  L432   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-array-index-race-2.i
[2023-10-27 12:18:32,790 INFO  L500              CDTParser]: Created temporary CDT project at NULL
[2023-10-27 12:18:33,195 INFO  L351              CDTParser]: Found 1 translation units.
[2023-10-27 12:18:33,209 INFO  L172              CDTParser]: Scanning /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-array-index-race-2.i
[2023-10-27 12:18:33,228 INFO  L394              CDTParser]: About to delete temporary CDT project at /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data/106fa5ccb/542a5dd272fc4effb0dd06166244a103/FLAGedcdc7bc8
[2023-10-27 12:18:33,261 INFO  L402              CDTParser]: Successfully deleted /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data/106fa5ccb/542a5dd272fc4effb0dd06166244a103
[2023-10-27 12:18:33,265 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2023-10-27 12:18:33,266 INFO  L131        ToolchainWalker]: Walking toolchain with 6 elements.
[2023-10-27 12:18:33,272 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2023-10-27 12:18:33,272 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2023-10-27 12:18:33,274 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2023-10-27 12:18:33,274 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 12:18:33" (1/1) ...
[2023-10-27 12:18:33,283 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29b1b77b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:18:33, skipping insertion in model container
[2023-10-27 12:18:33,283 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 12:18:33" (1/1) ...
[2023-10-27 12:18:33,288 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2023-10-27 12:18:33,358 INFO  L178         MainTranslator]: Built tables and reachable declarations
[2023-10-27 12:18:33,614 WARN  L611        FunctionHandler]: implicit declaration of function __builtin_bswap16
[2023-10-27 12:18:33,993 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2023-10-27 12:18:33,999 INFO  L203         MainTranslator]: Completed pre-run
[2023-10-27 12:18:34,027 WARN  L611        FunctionHandler]: implicit declaration of function __builtin_bswap16
[2023-10-27 12:18:34,086 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2023-10-27 12:18:34,169 INFO  L208         MainTranslator]: Completed translation
[2023-10-27 12:18:34,169 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:18:34 WrapperNode
[2023-10-27 12:18:34,169 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2023-10-27 12:18:34,170 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2023-10-27 12:18:34,171 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2023-10-27 12:18:34,171 INFO  L275        PluginConnector]: Boogie Procedure Inliner initialized
[2023-10-27 12:18:34,176 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:18:34" (1/1) ...
[2023-10-27 12:18:34,207 INFO  L185        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:18:34" (1/1) ...
[2023-10-27 12:18:34,265 INFO  L138                Inliner]: procedures = 266, calls = 19, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 85
[2023-10-27 12:18:34,266 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2023-10-27 12:18:34,266 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2023-10-27 12:18:34,266 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2023-10-27 12:18:34,267 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2023-10-27 12:18:34,280 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:18:34" (1/1) ...
[2023-10-27 12:18:34,280 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:18:34" (1/1) ...
[2023-10-27 12:18:34,310 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:18:34" (1/1) ...
[2023-10-27 12:18:34,311 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:18:34" (1/1) ...
[2023-10-27 12:18:34,322 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:18:34" (1/1) ...
[2023-10-27 12:18:34,329 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:18:34" (1/1) ...
[2023-10-27 12:18:34,332 INFO  L185        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:18:34" (1/1) ...
[2023-10-27 12:18:34,335 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:18:34" (1/1) ...
[2023-10-27 12:18:34,337 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2023-10-27 12:18:34,340 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2023-10-27 12:18:34,349 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2023-10-27 12:18:34,350 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2023-10-27 12:18:34,350 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:18:34" (1/1) ...
[2023-10-27 12:18:34,355 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2023-10-27 12:18:34,376 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-27 12:18:34,409 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
[2023-10-27 12:18:34,467 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process
[2023-10-27 12:18:34,473 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2023-10-27 12:18:34,474 INFO  L130     BoogieDeclarations]: Found specification of procedure read~$Pointer$
[2023-10-27 12:18:34,474 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2023-10-27 12:18:34,474 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~$Pointer$
[2023-10-27 12:18:34,475 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int
[2023-10-27 12:18:34,475 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2023-10-27 12:18:34,475 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap
[2023-10-27 12:18:34,475 INFO  L130     BoogieDeclarations]: Found specification of procedure thread
[2023-10-27 12:18:34,475 INFO  L138     BoogieDeclarations]: Found implementation of procedure thread
[2023-10-27 12:18:34,475 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2023-10-27 12:18:34,475 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2023-10-27 12:18:34,477 WARN  L209             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement
[2023-10-27 12:18:34,707 INFO  L235             CfgBuilder]: Building ICFG
[2023-10-27 12:18:34,712 INFO  L261             CfgBuilder]: Building CFG for each procedure with an implementation
[2023-10-27 12:18:35,104 INFO  L276             CfgBuilder]: Performing block encoding
[2023-10-27 12:18:35,114 INFO  L295             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2023-10-27 12:18:35,128 INFO  L300             CfgBuilder]: Removed 2 assume(true) statements.
[2023-10-27 12:18:35,130 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 12:18:35 BoogieIcfgContainer
[2023-10-27 12:18:35,136 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2023-10-27 12:18:35,137 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2023-10-27 12:18:35,137 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2023-10-27 12:18:35,140 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2023-10-27 12:18:35,149 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.10 12:18:33" (1/3) ...
[2023-10-27 12:18:35,150 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1958e056 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.10 12:18:35, skipping insertion in model container
[2023-10-27 12:18:35,150 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:18:34" (2/3) ...
[2023-10-27 12:18:35,150 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1958e056 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.10 12:18:35, skipping insertion in model container
[2023-10-27 12:18:35,151 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 12:18:35" (3/3) ...
[2023-10-27 12:18:35,152 INFO  L112   eAbstractionObserver]: Analyzing ICFG per-thread-array-index-race-2.i
[2023-10-27 12:18:35,159 WARN  L145   ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2023-10-27 12:18:35,179 INFO  L203   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2023-10-27 12:18:35,179 INFO  L162   ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations.
[2023-10-27 12:18:35,180 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2023-10-27 12:18:35,308 INFO  L144    ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions.
[2023-10-27 12:18:35,375 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 114 places, 115 transitions, 238 flow
[2023-10-27 12:18:35,463 INFO  L130       PetriNetUnfolder]: 6/165 cut-off events.
[2023-10-27 12:18:35,472 INFO  L131       PetriNetUnfolder]: For 1/1 co-relation queries the response was YES.
[2023-10-27 12:18:35,483 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 171 conditions, 165 events. 6/165 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 334 event pairs, 0 based on Foata normal form. 0/143 useless extension candidates. Maximal degree in co-relation 83. Up to 4 conditions per place. 
[2023-10-27 12:18:35,483 INFO  L82        GeneralOperation]: Start removeDead. Operand has 114 places, 115 transitions, 238 flow
[2023-10-27 12:18:35,488 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 114 places, 115 transitions, 238 flow
[2023-10-27 12:18:35,504 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2023-10-27 12:18:35,521 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 114 places, 115 transitions, 238 flow
[2023-10-27 12:18:35,526 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 114 places, 115 transitions, 238 flow
[2023-10-27 12:18:35,527 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 114 places, 115 transitions, 238 flow
[2023-10-27 12:18:35,614 INFO  L130       PetriNetUnfolder]: 6/165 cut-off events.
[2023-10-27 12:18:35,614 INFO  L131       PetriNetUnfolder]: For 1/1 co-relation queries the response was YES.
[2023-10-27 12:18:35,615 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 171 conditions, 165 events. 6/165 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 334 event pairs, 0 based on Foata normal form. 0/143 useless extension candidates. Maximal degree in co-relation 83. Up to 4 conditions per place. 
[2023-10-27 12:18:35,618 INFO  L119        LiptonReduction]: Number of co-enabled transitions 2052
[2023-10-27 12:18:38,859 INFO  L134        LiptonReduction]: Checked pairs total: 12265
[2023-10-27 12:18:38,860 INFO  L136        LiptonReduction]: Total number of compositions: 78
[2023-10-27 12:18:38,888 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-10-27 12:18:38,902 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;@1daed5c8, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2023-10-27 12:18:38,903 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 11 error locations.
[2023-10-27 12:18:38,904 INFO  L130       PetriNetUnfolder]: 0/0 cut-off events.
[2023-10-27 12:18:38,904 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2023-10-27 12:18:38,904 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:18:38,905 INFO  L209   CegarLoopForPetriNet]: trace histogram [1]
[2023-10-27 12:18:38,905 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2023-10-27 12:18:38,908 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:18:38,918 INFO  L85        PathProgramCache]: Analyzing trace with hash 381, now seen corresponding path program 1 times
[2023-10-27 12:18:38,926 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-27 12:18:38,926 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889903982]
[2023-10-27 12:18:38,926 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:18:38,927 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-27 12:18:39,041 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:18:39,088 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-27 12:18:39,088 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-27 12:18:39,089 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889903982]
[2023-10-27 12:18:39,090 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889903982] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-27 12:18:39,090 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-27 12:18:39,090 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0
[2023-10-27 12:18:39,092 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227414926]
[2023-10-27 12:18:39,092 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-27 12:18:39,111 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2023-10-27 12:18:39,111 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-27 12:18:39,137 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2023-10-27 12:18:39,154 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2023-10-27 12:18:39,156 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 110 out of 193
[2023-10-27 12:18:39,158 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 50 transitions, 108 flow. Second operand  has 2 states, 2 states have (on average 110.5) internal successors, (221), 2 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:18:39,158 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-27 12:18:39,159 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 193
[2023-10-27 12:18:39,159 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-27 12:18:39,261 INFO  L130       PetriNetUnfolder]: 33/213 cut-off events.
[2023-10-27 12:18:39,262 INFO  L131       PetriNetUnfolder]: For 4/7 co-relation queries the response was YES.
[2023-10-27 12:18:39,264 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 308 conditions, 213 events. 33/213 cut-off events. For 4/7 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1010 event pairs, 32 based on Foata normal form. 0/190 useless extension candidates. Maximal degree in co-relation 250. Up to 88 conditions per place. 
[2023-10-27 12:18:39,266 INFO  L137   encePairwiseOnDemand]: 192/193 looper letters, 16 selfloop transitions, 0 changer transitions 0/49 dead transitions.
[2023-10-27 12:18:39,266 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 49 transitions, 138 flow
[2023-10-27 12:18:39,267 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2023-10-27 12:18:39,269 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2 states.
[2023-10-27 12:18:39,285 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 237 transitions.
[2023-10-27 12:18:39,287 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6139896373056994
[2023-10-27 12:18:39,288 INFO  L72            ComplementDD]: Start complementDD. Operand 2 states and 237 transitions.
[2023-10-27 12:18:39,288 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 2 states and 237 transitions.
[2023-10-27 12:18:39,290 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-27 12:18:39,292 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 237 transitions.
[2023-10-27 12:18:39,297 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 3 states, 2 states have (on average 118.5) internal successors, (237), 2 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:18:39,316 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 3 states, 3 states have (on average 193.0) internal successors, (579), 3 states have internal predecessors, (579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:18:39,317 INFO  L81            ComplementDD]: Finished complementDD. Result  has 3 states, 3 states have (on average 193.0) internal successors, (579), 3 states have internal predecessors, (579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:18:39,318 INFO  L175             Difference]: Start difference. First operand has 52 places, 50 transitions, 108 flow. Second operand 2 states and 237 transitions.
[2023-10-27 12:18:39,319 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 49 transitions, 138 flow
[2023-10-27 12:18:39,326 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 49 transitions, 138 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-10-27 12:18:39,327 INFO  L231             Difference]: Finished difference. Result has 52 places, 49 transitions, 106 flow
[2023-10-27 12:18:39,329 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=106, PETRI_PLACES=52, PETRI_TRANSITIONS=49}
[2023-10-27 12:18:39,332 INFO  L288   CegarLoopForPetriNet]: 52 programPoint places, 0 predicate places.
[2023-10-27 12:18:39,332 INFO  L495      AbstractCegarLoop]: Abstraction has has 52 places, 49 transitions, 106 flow
[2023-10-27 12:18:39,332 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 110.5) internal successors, (221), 2 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:18:39,332 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:18:39,332 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2023-10-27 12:18:39,333 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2023-10-27 12:18:39,334 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2023-10-27 12:18:39,334 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:18:39,334 INFO  L85        PathProgramCache]: Analyzing trace with hash -835068003, now seen corresponding path program 1 times
[2023-10-27 12:18:39,335 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-27 12:18:39,337 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489576493]
[2023-10-27 12:18:39,337 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:18:39,337 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-27 12:18:39,440 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:18:40,041 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-27 12:18:40,043 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-27 12:18:40,044 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489576493]
[2023-10-27 12:18:40,044 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489576493] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-27 12:18:40,044 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-27 12:18:40,047 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-10-27 12:18:40,047 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299327061]
[2023-10-27 12:18:40,047 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-27 12:18:40,048 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-10-27 12:18:40,048 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-27 12:18:40,049 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-10-27 12:18:40,050 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-10-27 12:18:40,317 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 85 out of 193
[2023-10-27 12:18:40,318 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 49 transitions, 106 flow. Second operand  has 6 states, 6 states have (on average 86.16666666666667) internal successors, (517), 6 states have internal predecessors, (517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:18:40,318 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-27 12:18:40,318 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 193
[2023-10-27 12:18:40,318 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-27 12:18:40,569 INFO  L130       PetriNetUnfolder]: 245/703 cut-off events.
[2023-10-27 12:18:40,569 INFO  L131       PetriNetUnfolder]: For 7/9 co-relation queries the response was YES.
[2023-10-27 12:18:40,572 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1300 conditions, 703 events. 245/703 cut-off events. For 7/9 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 4008 event pairs, 86 based on Foata normal form. 1/658 useless extension candidates. Maximal degree in co-relation 1296. Up to 291 conditions per place. 
[2023-10-27 12:18:40,592 INFO  L137   encePairwiseOnDemand]: 170/193 looper letters, 61 selfloop transitions, 29 changer transitions 0/102 dead transitions.
[2023-10-27 12:18:40,592 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 102 transitions, 395 flow
[2023-10-27 12:18:40,593 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-10-27 12:18:40,593 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-10-27 12:18:40,596 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 603 transitions.
[2023-10-27 12:18:40,597 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5207253886010362
[2023-10-27 12:18:40,597 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 603 transitions.
[2023-10-27 12:18:40,597 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 603 transitions.
[2023-10-27 12:18:40,597 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-27 12:18:40,598 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 603 transitions.
[2023-10-27 12:18:40,600 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 100.5) internal successors, (603), 6 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:18:40,603 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 193.0) internal successors, (1351), 7 states have internal predecessors, (1351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:18:40,603 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 193.0) internal successors, (1351), 7 states have internal predecessors, (1351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:18:40,603 INFO  L175             Difference]: Start difference. First operand has 52 places, 49 transitions, 106 flow. Second operand 6 states and 603 transitions.
[2023-10-27 12:18:40,604 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 102 transitions, 395 flow
[2023-10-27 12:18:40,607 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 102 transitions, 395 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-10-27 12:18:40,608 INFO  L231             Difference]: Finished difference. Result has 62 places, 78 transitions, 326 flow
[2023-10-27 12:18:40,608 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=326, PETRI_PLACES=62, PETRI_TRANSITIONS=78}
[2023-10-27 12:18:40,609 INFO  L288   CegarLoopForPetriNet]: 52 programPoint places, 10 predicate places.
[2023-10-27 12:18:40,609 INFO  L495      AbstractCegarLoop]: Abstraction has has 62 places, 78 transitions, 326 flow
[2023-10-27 12:18:40,609 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 86.16666666666667) internal successors, (517), 6 states have internal predecessors, (517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:18:40,610 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:18:40,610 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-27 12:18:40,610 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2023-10-27 12:18:40,610 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2023-10-27 12:18:40,610 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:18:40,611 INFO  L85        PathProgramCache]: Analyzing trace with hash 1573274442, now seen corresponding path program 1 times
[2023-10-27 12:18:40,611 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-27 12:18:40,611 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897210502]
[2023-10-27 12:18:40,612 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:18:40,612 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-27 12:18:40,645 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:18:40,668 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-27 12:18:40,668 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-27 12:18:40,668 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897210502]
[2023-10-27 12:18:40,669 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897210502] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-27 12:18:40,669 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-27 12:18:40,669 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-10-27 12:18:40,669 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443297588]
[2023-10-27 12:18:40,669 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-27 12:18:40,670 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-10-27 12:18:40,670 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-27 12:18:40,670 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-10-27 12:18:40,670 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-10-27 12:18:40,694 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 103 out of 193
[2023-10-27 12:18:40,694 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 78 transitions, 326 flow. Second operand  has 3 states, 3 states have (on average 105.0) internal successors, (315), 3 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:18:40,695 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-27 12:18:40,695 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 193
[2023-10-27 12:18:40,695 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-27 12:18:40,872 INFO  L130       PetriNetUnfolder]: 122/485 cut-off events.
[2023-10-27 12:18:40,873 INFO  L131       PetriNetUnfolder]: For 111/116 co-relation queries the response was YES.
[2023-10-27 12:18:40,874 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1085 conditions, 485 events. 122/485 cut-off events. For 111/116 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 2711 event pairs, 10 based on Foata normal form. 11/468 useless extension candidates. Maximal degree in co-relation 1076. Up to 129 conditions per place. 
[2023-10-27 12:18:40,875 INFO  L137   encePairwiseOnDemand]: 189/193 looper letters, 24 selfloop transitions, 2 changer transitions 0/84 dead transitions.
[2023-10-27 12:18:40,875 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 84 transitions, 392 flow
[2023-10-27 12:18:40,876 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-10-27 12:18:40,876 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-10-27 12:18:40,876 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 335 transitions.
[2023-10-27 12:18:40,877 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5785837651122625
[2023-10-27 12:18:40,877 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 335 transitions.
[2023-10-27 12:18:40,877 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 335 transitions.
[2023-10-27 12:18:40,877 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-27 12:18:40,877 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 335 transitions.
[2023-10-27 12:18:40,891 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:18:40,892 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 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-27 12:18:40,893 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 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-27 12:18:40,893 INFO  L175             Difference]: Start difference. First operand has 62 places, 78 transitions, 326 flow. Second operand 3 states and 335 transitions.
[2023-10-27 12:18:40,893 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 84 transitions, 392 flow
[2023-10-27 12:18:40,899 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 84 transitions, 392 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-10-27 12:18:40,901 INFO  L231             Difference]: Finished difference. Result has 63 places, 78 transitions, 336 flow
[2023-10-27 12:18:40,901 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=322, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=336, PETRI_PLACES=63, PETRI_TRANSITIONS=78}
[2023-10-27 12:18:40,902 INFO  L288   CegarLoopForPetriNet]: 52 programPoint places, 11 predicate places.
[2023-10-27 12:18:40,902 INFO  L495      AbstractCegarLoop]: Abstraction has has 63 places, 78 transitions, 336 flow
[2023-10-27 12:18:40,902 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 105.0) internal successors, (315), 3 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:18:40,903 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:18:40,903 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-27 12:18:40,903 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2023-10-27 12:18:40,905 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2023-10-27 12:18:40,906 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:18:40,906 INFO  L85        PathProgramCache]: Analyzing trace with hash 348753171, now seen corresponding path program 1 times
[2023-10-27 12:18:40,906 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-27 12:18:40,906 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128203477]
[2023-10-27 12:18:40,906 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:18:40,907 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-27 12:18:40,936 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:18:41,284 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-27 12:18:41,284 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-27 12:18:41,285 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128203477]
[2023-10-27 12:18:41,285 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128203477] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-27 12:18:41,285 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-27 12:18:41,293 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-10-27 12:18:41,293 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311276946]
[2023-10-27 12:18:41,293 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-27 12:18:41,294 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-10-27 12:18:41,294 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-27 12:18:41,295 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-10-27 12:18:41,296 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-10-27 12:18:41,545 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 95 out of 193
[2023-10-27 12:18:41,545 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 78 transitions, 336 flow. Second operand  has 6 states, 6 states have (on average 96.33333333333333) internal successors, (578), 6 states have internal predecessors, (578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:18:41,546 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-27 12:18:41,546 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 193
[2023-10-27 12:18:41,546 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-27 12:18:41,768 INFO  L130       PetriNetUnfolder]: 228/682 cut-off events.
[2023-10-27 12:18:41,768 INFO  L131       PetriNetUnfolder]: For 296/304 co-relation queries the response was YES.
[2023-10-27 12:18:41,772 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1758 conditions, 682 events. 228/682 cut-off events. For 296/304 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 3726 event pairs, 57 based on Foata normal form. 0/646 useless extension candidates. Maximal degree in co-relation 1748. Up to 360 conditions per place. 
[2023-10-27 12:18:41,774 INFO  L137   encePairwiseOnDemand]: 182/193 looper letters, 52 selfloop transitions, 33 changer transitions 8/128 dead transitions.
[2023-10-27 12:18:41,774 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 128 transitions, 725 flow
[2023-10-27 12:18:41,774 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-10-27 12:18:41,774 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-10-27 12:18:41,775 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 635 transitions.
[2023-10-27 12:18:41,776 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5483592400690847
[2023-10-27 12:18:41,776 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 635 transitions.
[2023-10-27 12:18:41,776 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 635 transitions.
[2023-10-27 12:18:41,777 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-27 12:18:41,777 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 635 transitions.
[2023-10-27 12:18:41,778 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 105.83333333333333) internal successors, (635), 6 states have internal predecessors, (635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:18:41,780 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 193.0) internal successors, (1351), 7 states have internal predecessors, (1351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:18:41,781 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 193.0) internal successors, (1351), 7 states have internal predecessors, (1351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:18:41,793 INFO  L175             Difference]: Start difference. First operand has 63 places, 78 transitions, 336 flow. Second operand 6 states and 635 transitions.
[2023-10-27 12:18:41,793 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 128 transitions, 725 flow
[2023-10-27 12:18:41,797 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 128 transitions, 725 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-10-27 12:18:41,799 INFO  L231             Difference]: Finished difference. Result has 73 places, 108 transitions, 637 flow
[2023-10-27 12:18:41,800 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=336, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=637, PETRI_PLACES=73, PETRI_TRANSITIONS=108}
[2023-10-27 12:18:41,801 INFO  L288   CegarLoopForPetriNet]: 52 programPoint places, 21 predicate places.
[2023-10-27 12:18:41,801 INFO  L495      AbstractCegarLoop]: Abstraction has has 73 places, 108 transitions, 637 flow
[2023-10-27 12:18:41,801 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 96.33333333333333) internal successors, (578), 6 states have internal predecessors, (578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:18:41,801 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:18:41,802 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-27 12:18:41,802 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2023-10-27 12:18:41,802 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2023-10-27 12:18:41,802 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:18:41,802 INFO  L85        PathProgramCache]: Analyzing trace with hash -1543790880, now seen corresponding path program 1 times
[2023-10-27 12:18:41,803 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-27 12:18:41,803 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276429090]
[2023-10-27 12:18:41,803 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:18:41,803 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-27 12:18:41,835 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:18:42,231 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-27 12:18:42,231 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-27 12:18:42,231 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276429090]
[2023-10-27 12:18:42,231 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276429090] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-27 12:18:42,232 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-27 12:18:42,232 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-10-27 12:18:42,232 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994344322]
[2023-10-27 12:18:42,232 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-27 12:18:42,232 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-10-27 12:18:42,232 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-27 12:18:42,233 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-10-27 12:18:42,233 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-10-27 12:18:42,413 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 83 out of 193
[2023-10-27 12:18:42,414 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 108 transitions, 637 flow. Second operand  has 6 states, 6 states have (on average 85.5) internal successors, (513), 6 states have internal predecessors, (513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:18:42,414 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-27 12:18:42,414 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 193
[2023-10-27 12:18:42,414 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-27 12:18:42,801 INFO  L130       PetriNetUnfolder]: 402/1014 cut-off events.
[2023-10-27 12:18:42,801 INFO  L131       PetriNetUnfolder]: For 761/769 co-relation queries the response was YES.
[2023-10-27 12:18:42,803 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 3297 conditions, 1014 events. 402/1014 cut-off events. For 761/769 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 6010 event pairs, 103 based on Foata normal form. 0/949 useless extension candidates. Maximal degree in co-relation 3282. Up to 729 conditions per place. 
[2023-10-27 12:18:42,815 INFO  L137   encePairwiseOnDemand]: 171/193 looper letters, 105 selfloop transitions, 76 changer transitions 24/218 dead transitions.
[2023-10-27 12:18:42,815 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 218 transitions, 1523 flow
[2023-10-27 12:18:42,816 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-10-27 12:18:42,816 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-10-27 12:18:42,817 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 634 transitions.
[2023-10-27 12:18:42,833 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5474956822107081
[2023-10-27 12:18:42,834 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 634 transitions.
[2023-10-27 12:18:42,834 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 634 transitions.
[2023-10-27 12:18:42,834 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-27 12:18:42,834 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 634 transitions.
[2023-10-27 12:18:42,836 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 105.66666666666667) internal successors, (634), 6 states have internal predecessors, (634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:18:42,838 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 193.0) internal successors, (1351), 7 states have internal predecessors, (1351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:18:42,840 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 193.0) internal successors, (1351), 7 states have internal predecessors, (1351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:18:42,840 INFO  L175             Difference]: Start difference. First operand has 73 places, 108 transitions, 637 flow. Second operand 6 states and 634 transitions.
[2023-10-27 12:18:42,840 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 218 transitions, 1523 flow
[2023-10-27 12:18:42,844 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 218 transitions, 1523 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-10-27 12:18:42,848 INFO  L231             Difference]: Finished difference. Result has 81 places, 174 transitions, 1228 flow
[2023-10-27 12:18:42,848 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=637, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1228, PETRI_PLACES=81, PETRI_TRANSITIONS=174}
[2023-10-27 12:18:42,849 INFO  L288   CegarLoopForPetriNet]: 52 programPoint places, 29 predicate places.
[2023-10-27 12:18:42,850 INFO  L495      AbstractCegarLoop]: Abstraction has has 81 places, 174 transitions, 1228 flow
[2023-10-27 12:18:42,850 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 85.5) internal successors, (513), 6 states have internal predecessors, (513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:18:42,850 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:18:42,850 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1]
[2023-10-27 12:18:42,850 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2023-10-27 12:18:42,851 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2023-10-27 12:18:42,851 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:18:42,851 INFO  L85        PathProgramCache]: Analyzing trace with hash -1557923308, now seen corresponding path program 1 times
[2023-10-27 12:18:42,851 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-27 12:18:42,851 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898288815]
[2023-10-27 12:18:42,852 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:18:42,852 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-27 12:18:42,902 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-10-27 12:18:42,902 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2023-10-27 12:18:42,932 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-10-27 12:18:42,975 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2023-10-27 12:18:42,975 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2023-10-27 12:18:42,976 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 11 remaining)
[2023-10-27 12:18:42,978 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (9 of 11 remaining)
[2023-10-27 12:18:42,978 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (8 of 11 remaining)
[2023-10-27 12:18:42,978 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (7 of 11 remaining)
[2023-10-27 12:18:42,979 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (6 of 11 remaining)
[2023-10-27 12:18:42,979 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (5 of 11 remaining)
[2023-10-27 12:18:42,983 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (4 of 11 remaining)
[2023-10-27 12:18:42,983 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 11 remaining)
[2023-10-27 12:18:42,983 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (2 of 11 remaining)
[2023-10-27 12:18:42,983 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 11 remaining)
[2023-10-27 12:18:42,983 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (0 of 11 remaining)
[2023-10-27 12:18:42,984 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2023-10-27 12:18:42,984 INFO  L445         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1]
[2023-10-27 12:18:42,987 WARN  L233   ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis
[2023-10-27 12:18:42,987 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances.
[2023-10-27 12:18:43,041 INFO  L144    ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions.
[2023-10-27 12:18:43,045 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 135 places, 135 transitions, 288 flow
[2023-10-27 12:18:43,076 INFO  L130       PetriNetUnfolder]: 11/289 cut-off events.
[2023-10-27 12:18:43,076 INFO  L131       PetriNetUnfolder]: For 6/6 co-relation queries the response was YES.
[2023-10-27 12:18:43,076 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 303 conditions, 289 events. 11/289 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 710 event pairs, 0 based on Foata normal form. 0/250 useless extension candidates. Maximal degree in co-relation 167. Up to 8 conditions per place. 
[2023-10-27 12:18:43,077 INFO  L82        GeneralOperation]: Start removeDead. Operand has 135 places, 135 transitions, 288 flow
[2023-10-27 12:18:43,078 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 135 places, 135 transitions, 288 flow
[2023-10-27 12:18:43,090 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2023-10-27 12:18:43,090 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 135 places, 135 transitions, 288 flow
[2023-10-27 12:18:43,091 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 135 places, 135 transitions, 288 flow
[2023-10-27 12:18:43,091 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 135 places, 135 transitions, 288 flow
[2023-10-27 12:18:43,110 INFO  L130       PetriNetUnfolder]: 11/289 cut-off events.
[2023-10-27 12:18:43,125 INFO  L131       PetriNetUnfolder]: For 6/6 co-relation queries the response was YES.
[2023-10-27 12:18:43,126 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 303 conditions, 289 events. 11/289 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 710 event pairs, 0 based on Foata normal form. 0/250 useless extension candidates. Maximal degree in co-relation 167. Up to 8 conditions per place. 
[2023-10-27 12:18:43,129 INFO  L119        LiptonReduction]: Number of co-enabled transitions 5220
[2023-10-27 12:18:46,055 INFO  L134        LiptonReduction]: Checked pairs total: 30411
[2023-10-27 12:18:46,055 INFO  L136        LiptonReduction]: Total number of compositions: 82
[2023-10-27 12:18:46,056 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-10-27 12:18:46,057 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;@1daed5c8, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2023-10-27 12:18:46,057 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 13 error locations.
[2023-10-27 12:18:46,057 INFO  L130       PetriNetUnfolder]: 0/1 cut-off events.
[2023-10-27 12:18:46,057 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2023-10-27 12:18:46,057 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:18:46,058 INFO  L209   CegarLoopForPetriNet]: trace histogram [1]
[2023-10-27 12:18:46,058 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] ===
[2023-10-27 12:18:46,058 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:18:46,058 INFO  L85        PathProgramCache]: Analyzing trace with hash 617, now seen corresponding path program 1 times
[2023-10-27 12:18:46,058 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-27 12:18:46,058 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149350403]
[2023-10-27 12:18:46,058 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:18:46,058 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-27 12:18:46,061 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:18:46,064 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-27 12:18:46,064 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-27 12:18:46,064 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149350403]
[2023-10-27 12:18:46,064 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149350403] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-27 12:18:46,064 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-27 12:18:46,064 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0
[2023-10-27 12:18:46,065 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913015714]
[2023-10-27 12:18:46,065 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-27 12:18:46,065 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2023-10-27 12:18:46,065 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-27 12:18:46,065 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2023-10-27 12:18:46,066 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2023-10-27 12:18:46,066 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 128 out of 217
[2023-10-27 12:18:46,066 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 64 transitions, 146 flow. Second operand  has 2 states, 2 states have (on average 128.5) internal successors, (257), 2 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:18:46,066 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-27 12:18:46,066 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 217
[2023-10-27 12:18:46,067 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-27 12:18:46,345 INFO  L130       PetriNetUnfolder]: 411/1257 cut-off events.
[2023-10-27 12:18:46,346 INFO  L131       PetriNetUnfolder]: For 71/158 co-relation queries the response was YES.
[2023-10-27 12:18:46,347 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 2022 conditions, 1257 events. 411/1257 cut-off events. For 71/158 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 8092 event pairs, 404 based on Foata normal form. 0/1088 useless extension candidates. Maximal degree in co-relation 1664. Up to 731 conditions per place. 
[2023-10-27 12:18:46,350 INFO  L137   encePairwiseOnDemand]: 216/217 looper letters, 22 selfloop transitions, 0 changer transitions 0/63 dead transitions.
[2023-10-27 12:18:46,350 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 63 transitions, 188 flow
[2023-10-27 12:18:46,350 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2023-10-27 12:18:46,351 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2 states.
[2023-10-27 12:18:46,351 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 279 transitions.
[2023-10-27 12:18:46,351 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6428571428571429
[2023-10-27 12:18:46,351 INFO  L72            ComplementDD]: Start complementDD. Operand 2 states and 279 transitions.
[2023-10-27 12:18:46,352 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 2 states and 279 transitions.
[2023-10-27 12:18:46,352 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-27 12:18:46,352 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 279 transitions.
[2023-10-27 12:18:46,352 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 3 states, 2 states have (on average 139.5) internal successors, (279), 2 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:18:46,366 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 3 states, 3 states have (on average 217.0) internal successors, (651), 3 states have internal predecessors, (651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:18:46,366 INFO  L81            ComplementDD]: Finished complementDD. Result  has 3 states, 3 states have (on average 217.0) internal successors, (651), 3 states have internal predecessors, (651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:18:46,366 INFO  L175             Difference]: Start difference. First operand has 67 places, 64 transitions, 146 flow. Second operand 2 states and 279 transitions.
[2023-10-27 12:18:46,366 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 63 transitions, 188 flow
[2023-10-27 12:18:46,367 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 63 transitions, 188 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-10-27 12:18:46,369 INFO  L231             Difference]: Finished difference. Result has 67 places, 63 transitions, 144 flow
[2023-10-27 12:18:46,369 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=144, PETRI_PLACES=67, PETRI_TRANSITIONS=63}
[2023-10-27 12:18:46,371 INFO  L288   CegarLoopForPetriNet]: 67 programPoint places, 0 predicate places.
[2023-10-27 12:18:46,371 INFO  L495      AbstractCegarLoop]: Abstraction has has 67 places, 63 transitions, 144 flow
[2023-10-27 12:18:46,373 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 128.5) internal successors, (257), 2 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:18:46,373 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:18:46,373 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2023-10-27 12:18:46,373 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2023-10-27 12:18:46,374 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] ===
[2023-10-27 12:18:46,374 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:18:46,374 INFO  L85        PathProgramCache]: Analyzing trace with hash -1578260816, now seen corresponding path program 1 times
[2023-10-27 12:18:46,374 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-27 12:18:46,374 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762488849]
[2023-10-27 12:18:46,375 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:18:46,375 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-27 12:18:46,385 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:18:46,616 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-27 12:18:46,616 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-27 12:18:46,616 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762488849]
[2023-10-27 12:18:46,617 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762488849] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-27 12:18:46,617 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-27 12:18:46,617 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-10-27 12:18:46,617 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366914152]
[2023-10-27 12:18:46,617 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-27 12:18:46,617 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-10-27 12:18:46,617 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-27 12:18:46,618 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-10-27 12:18:46,618 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-10-27 12:18:46,889 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 99 out of 217
[2023-10-27 12:18:46,890 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 63 transitions, 144 flow. Second operand  has 6 states, 6 states have (on average 100.16666666666667) internal successors, (601), 6 states have internal predecessors, (601), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:18:46,890 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-27 12:18:46,890 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 217
[2023-10-27 12:18:46,890 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-27 12:18:48,473 INFO  L130       PetriNetUnfolder]: 5742/10965 cut-off events.
[2023-10-27 12:18:48,489 INFO  L131       PetriNetUnfolder]: For 239/274 co-relation queries the response was YES.
[2023-10-27 12:18:48,497 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 20646 conditions, 10965 events. 5742/10965 cut-off events. For 239/274 co-relation queries the response was YES. Maximal size of possible extension queue 422. Compared 81958 event pairs, 1527 based on Foata normal form. 16/10301 useless extension candidates. Maximal degree in co-relation 20641. Up to 5895 conditions per place. 
[2023-10-27 12:18:48,587 INFO  L137   encePairwiseOnDemand]: 190/217 looper letters, 93 selfloop transitions, 48 changer transitions 0/158 dead transitions.
[2023-10-27 12:18:48,587 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 158 transitions, 627 flow
[2023-10-27 12:18:48,588 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-10-27 12:18:48,588 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-10-27 12:18:48,589 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 738 transitions.
[2023-10-27 12:18:48,605 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5668202764976958
[2023-10-27 12:18:48,606 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 738 transitions.
[2023-10-27 12:18:48,606 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 738 transitions.
[2023-10-27 12:18:48,606 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-27 12:18:48,606 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 738 transitions.
[2023-10-27 12:18:48,607 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 123.0) internal successors, (738), 6 states have internal predecessors, (738), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:18:48,609 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 217.0) internal successors, (1519), 7 states have internal predecessors, (1519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:18:48,609 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 217.0) internal successors, (1519), 7 states have internal predecessors, (1519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:18:48,609 INFO  L175             Difference]: Start difference. First operand has 67 places, 63 transitions, 144 flow. Second operand 6 states and 738 transitions.
[2023-10-27 12:18:48,610 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 158 transitions, 627 flow
[2023-10-27 12:18:48,611 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 158 transitions, 627 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-10-27 12:18:48,613 INFO  L231             Difference]: Finished difference. Result has 77 places, 111 transitions, 486 flow
[2023-10-27 12:18:48,613 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=486, PETRI_PLACES=77, PETRI_TRANSITIONS=111}
[2023-10-27 12:18:48,614 INFO  L288   CegarLoopForPetriNet]: 67 programPoint places, 10 predicate places.
[2023-10-27 12:18:48,615 INFO  L495      AbstractCegarLoop]: Abstraction has has 77 places, 111 transitions, 486 flow
[2023-10-27 12:18:48,615 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 100.16666666666667) internal successors, (601), 6 states have internal predecessors, (601), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:18:48,615 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:18:48,615 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-27 12:18:48,615 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2023-10-27 12:18:48,615 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] ===
[2023-10-27 12:18:48,616 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:18:48,616 INFO  L85        PathProgramCache]: Analyzing trace with hash 933296301, now seen corresponding path program 1 times
[2023-10-27 12:18:48,616 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-27 12:18:48,616 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713999856]
[2023-10-27 12:18:48,616 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:18:48,616 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-27 12:18:48,623 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:18:48,643 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-27 12:18:48,643 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-27 12:18:48,643 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713999856]
[2023-10-27 12:18:48,644 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713999856] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-27 12:18:48,644 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-27 12:18:48,644 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-10-27 12:18:48,644 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365765238]
[2023-10-27 12:18:48,644 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-27 12:18:48,644 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-10-27 12:18:48,645 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-27 12:18:48,645 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-10-27 12:18:48,645 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-10-27 12:18:48,671 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 118 out of 217
[2023-10-27 12:18:48,671 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 111 transitions, 486 flow. Second operand  has 3 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:18:48,671 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-27 12:18:48,671 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 217
[2023-10-27 12:18:48,672 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-27 12:18:49,534 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([574] L1016-9-->threadEXIT: Formula: (let ((.cse0 (select |v_#race_71| v_~datas~0.base_81)) (.cse1 (* v_threadThread1of2ForFork0_~i~0_29 4))) (and (= |v_threadThread1of2ForFork0_#t~nondet4_30| (select .cse0 (+ 2 .cse1 v_~datas~0.offset_71))) (= |v_threadThread1of2ForFork0_#t~nondet4_30| (select .cse0 (+ .cse1 v_~datas~0.offset_71))) (= (select .cse0 (+ .cse1 v_~datas~0.offset_71 1)) |v_threadThread1of2ForFork0_#t~nondet4_30|) (= |v_threadThread1of2ForFork0_#res.offset_9| 0) (= |v_threadThread1of2ForFork0_#res.base_9| 0) (= (select .cse0 (+ 3 .cse1 v_~datas~0.offset_71)) |v_threadThread1of2ForFork0_#t~nondet4_30|)))  InVars {#race=|v_#race_71|, ~datas~0.base=v_~datas~0.base_81, threadThread1of2ForFork0_~i~0=v_threadThread1of2ForFork0_~i~0_29, ~datas~0.offset=v_~datas~0.offset_71, threadThread1of2ForFork0_#t~nondet4=|v_threadThread1of2ForFork0_#t~nondet4_30|}  OutVars{#race=|v_#race_71|, threadThread1of2ForFork0_#res.base=|v_threadThread1of2ForFork0_#res.base_9|, threadThread1of2ForFork0_#res.offset=|v_threadThread1of2ForFork0_#res.offset_9|, threadThread1of2ForFork0_#t~nondet3=|v_threadThread1of2ForFork0_#t~nondet3_17|, ~datas~0.base=v_~datas~0.base_81, threadThread1of2ForFork0_~i~0=v_threadThread1of2ForFork0_~i~0_29, ~datas~0.offset=v_~datas~0.offset_71}  AuxVars[]  AssignedVars[threadThread1of2ForFork0_#res.base, threadThread1of2ForFork0_#res.offset, threadThread1of2ForFork0_#t~nondet3, threadThread1of2ForFork0_#t~nondet4][58], [Black: 146#(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)), 141#true, 2#ULTIMATE.startEXITtrue, Black: 143#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), threadThread1of2ForFork0InUse, Black: 145#(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)), Black: 144#(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)), 138#true, threadThread2of2ForFork0InUse, 47#threadEXITtrue, 21#L1016-4true, 155#(= |#race~datas~0| 0)])
[2023-10-27 12:18:49,534 INFO  L383   tUnfolder$Statistics]: this new event has 41 ancestors and is cut-off event
[2023-10-27 12:18:49,534 INFO  L386   tUnfolder$Statistics]:   existing Event has 41 ancestors and is cut-off event
[2023-10-27 12:18:49,535 INFO  L386   tUnfolder$Statistics]:   existing Event has 41 ancestors and is cut-off event
[2023-10-27 12:18:49,535 INFO  L386   tUnfolder$Statistics]:   existing Event has 41 ancestors and is cut-off event
[2023-10-27 12:18:49,535 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([517] L1016-4-->L1016-6: Formula: (= (store |v_#race_60| v_~datas~0.base_57 (store (select |v_#race_60| v_~datas~0.base_57) (+ (* v_threadThread2of2ForFork0_~i~0_19 4) v_~datas~0.offset_51) |v_threadThread2of2ForFork0_#t~nondet4_21|)) |v_#race_59|)  InVars {#race=|v_#race_60|, ~datas~0.base=v_~datas~0.base_57, ~datas~0.offset=v_~datas~0.offset_51, threadThread2of2ForFork0_~i~0=v_threadThread2of2ForFork0_~i~0_19}  OutVars{#race=|v_#race_59|, ~datas~0.base=v_~datas~0.base_57, threadThread2of2ForFork0_#t~nondet4=|v_threadThread2of2ForFork0_#t~nondet4_21|, ~datas~0.offset=v_~datas~0.offset_51, threadThread2of2ForFork0_~i~0=v_threadThread2of2ForFork0_~i~0_19}  AuxVars[]  AssignedVars[#race, threadThread2of2ForFork0_#t~nondet4][91], [Black: 146#(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)), 2#ULTIMATE.startEXITtrue, 141#true, Black: 143#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), threadThread1of2ForFork0InUse, Black: 145#(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)), 138#true, Black: 144#(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)), threadThread2of2ForFork0InUse, 123#L1016-6true, 64#L1016-9true, 155#(= |#race~datas~0| 0)])
[2023-10-27 12:18:49,535 INFO  L383   tUnfolder$Statistics]: this new event has 41 ancestors and is cut-off event
[2023-10-27 12:18:49,535 INFO  L386   tUnfolder$Statistics]:   existing Event has 41 ancestors and is cut-off event
[2023-10-27 12:18:49,535 INFO  L386   tUnfolder$Statistics]:   existing Event has 41 ancestors and is cut-off event
[2023-10-27 12:18:49,536 INFO  L386   tUnfolder$Statistics]:   existing Event has 41 ancestors and is cut-off event
[2023-10-27 12:18:49,733 INFO  L130       PetriNetUnfolder]: 2751/6463 cut-off events.
[2023-10-27 12:18:49,733 INFO  L131       PetriNetUnfolder]: For 1904/2456 co-relation queries the response was YES.
[2023-10-27 12:18:49,759 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 14861 conditions, 6463 events. 2751/6463 cut-off events. For 1904/2456 co-relation queries the response was YES. Maximal size of possible extension queue 330. Compared 53231 event pairs, 924 based on Foata normal form. 125/6164 useless extension candidates. Maximal degree in co-relation 14851. Up to 2371 conditions per place. 
[2023-10-27 12:18:49,809 INFO  L137   encePairwiseOnDemand]: 211/217 looper letters, 36 selfloop transitions, 3 changer transitions 0/118 dead transitions.
[2023-10-27 12:18:49,809 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 118 transitions, 585 flow
[2023-10-27 12:18:49,809 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-10-27 12:18:49,809 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-10-27 12:18:49,810 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 390 transitions.
[2023-10-27 12:18:49,811 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5990783410138248
[2023-10-27 12:18:49,811 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 390 transitions.
[2023-10-27 12:18:49,811 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 390 transitions.
[2023-10-27 12:18:49,811 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-27 12:18:49,811 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 390 transitions.
[2023-10-27 12:18:49,812 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 130.0) internal successors, (390), 3 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:18:49,813 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 217.0) internal successors, (868), 4 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-27 12:18:49,815 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 217.0) internal successors, (868), 4 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-27 12:18:49,815 INFO  L175             Difference]: Start difference. First operand has 77 places, 111 transitions, 486 flow. Second operand 3 states and 390 transitions.
[2023-10-27 12:18:49,815 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 118 transitions, 585 flow
[2023-10-27 12:18:49,853 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 118 transitions, 585 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-10-27 12:18:49,855 INFO  L231             Difference]: Finished difference. Result has 77 places, 111 transitions, 501 flow
[2023-10-27 12:18:49,855 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=480, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=501, PETRI_PLACES=77, PETRI_TRANSITIONS=111}
[2023-10-27 12:18:49,857 INFO  L288   CegarLoopForPetriNet]: 67 programPoint places, 10 predicate places.
[2023-10-27 12:18:49,857 INFO  L495      AbstractCegarLoop]: Abstraction has has 77 places, 111 transitions, 501 flow
[2023-10-27 12:18:49,857 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:18:49,857 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:18:49,857 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-27 12:18:49,857 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2023-10-27 12:18:49,857 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] ===
[2023-10-27 12:18:49,858 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:18:49,858 INFO  L85        PathProgramCache]: Analyzing trace with hash -2101318696, now seen corresponding path program 1 times
[2023-10-27 12:18:49,858 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-27 12:18:49,858 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31422503]
[2023-10-27 12:18:49,858 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:18:49,859 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-27 12:18:49,876 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:18:50,136 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-27 12:18:50,137 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-27 12:18:50,137 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31422503]
[2023-10-27 12:18:50,138 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31422503] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-27 12:18:50,138 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-27 12:18:50,138 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-10-27 12:18:50,138 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406693746]
[2023-10-27 12:18:50,139 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-27 12:18:50,140 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-10-27 12:18:50,140 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-27 12:18:50,140 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-10-27 12:18:50,141 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-10-27 12:18:50,417 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 109 out of 217
[2023-10-27 12:18:50,417 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 111 transitions, 501 flow. Second operand  has 6 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-27 12:18:50,417 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-27 12:18:50,417 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 217
[2023-10-27 12:18:50,418 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-27 12:18:52,290 INFO  L130       PetriNetUnfolder]: 5675/10752 cut-off events.
[2023-10-27 12:18:52,290 INFO  L131       PetriNetUnfolder]: For 6509/6607 co-relation queries the response was YES.
[2023-10-27 12:18:52,331 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 28674 conditions, 10752 events. 5675/10752 cut-off events. For 6509/6607 co-relation queries the response was YES. Maximal size of possible extension queue 370. Compared 79142 event pairs, 1877 based on Foata normal form. 0/10235 useless extension candidates. Maximal degree in co-relation 28663. Up to 6983 conditions per place. 
[2023-10-27 12:18:52,418 INFO  L137   encePairwiseOnDemand]: 202/217 looper letters, 110 selfloop transitions, 70 changer transitions 0/218 dead transitions.
[2023-10-27 12:18:52,418 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 218 transitions, 1313 flow
[2023-10-27 12:18:52,419 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-10-27 12:18:52,419 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-10-27 12:18:52,421 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 758 transitions.
[2023-10-27 12:18:52,421 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5821812596006144
[2023-10-27 12:18:52,421 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 758 transitions.
[2023-10-27 12:18:52,421 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 758 transitions.
[2023-10-27 12:18:52,422 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-27 12:18:52,422 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 758 transitions.
[2023-10-27 12:18:52,423 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 126.33333333333333) internal successors, (758), 6 states have internal predecessors, (758), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:18:52,425 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 217.0) internal successors, (1519), 7 states have internal predecessors, (1519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:18:52,425 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 217.0) internal successors, (1519), 7 states have internal predecessors, (1519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:18:52,425 INFO  L175             Difference]: Start difference. First operand has 77 places, 111 transitions, 501 flow. Second operand 6 states and 758 transitions.
[2023-10-27 12:18:52,425 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 218 transitions, 1313 flow
[2023-10-27 12:18:52,443 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 218 transitions, 1313 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-10-27 12:18:52,460 INFO  L231             Difference]: Finished difference. Result has 87 places, 180 transitions, 1155 flow
[2023-10-27 12:18:52,461 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=501, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1155, PETRI_PLACES=87, PETRI_TRANSITIONS=180}
[2023-10-27 12:18:52,461 INFO  L288   CegarLoopForPetriNet]: 67 programPoint places, 20 predicate places.
[2023-10-27 12:18:52,462 INFO  L495      AbstractCegarLoop]: Abstraction has has 87 places, 180 transitions, 1155 flow
[2023-10-27 12:18:52,462 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 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-27 12:18:52,462 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:18:52,462 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-27 12:18:52,462 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2023-10-27 12:18:52,462 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] ===
[2023-10-27 12:18:52,463 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:18:52,463 INFO  L85        PathProgramCache]: Analyzing trace with hash 1490734773, now seen corresponding path program 1 times
[2023-10-27 12:18:52,463 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-27 12:18:52,464 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761788844]
[2023-10-27 12:18:52,464 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:18:52,464 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-27 12:18:52,493 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:18:52,821 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-27 12:18:52,822 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-27 12:18:52,822 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761788844]
[2023-10-27 12:18:52,822 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761788844] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-27 12:18:52,822 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-27 12:18:52,822 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-10-27 12:18:52,822 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454016672]
[2023-10-27 12:18:52,822 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-27 12:18:52,823 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-10-27 12:18:52,823 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-27 12:18:52,823 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-10-27 12:18:52,824 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-10-27 12:18:53,028 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 97 out of 217
[2023-10-27 12:18:53,029 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 180 transitions, 1155 flow. Second operand  has 6 states, 6 states have (on average 99.5) internal successors, (597), 6 states have internal predecessors, (597), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:18:53,029 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-27 12:18:53,029 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 217
[2023-10-27 12:18:53,029 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-27 12:18:56,452 INFO  L130       PetriNetUnfolder]: 11355/20109 cut-off events.
[2023-10-27 12:18:56,452 INFO  L131       PetriNetUnfolder]: For 18604/18765 co-relation queries the response was YES.
[2023-10-27 12:18:56,485 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 64116 conditions, 20109 events. 11355/20109 cut-off events. For 18604/18765 co-relation queries the response was YES. Maximal size of possible extension queue 608. Compared 151214 event pairs, 3272 based on Foata normal form. 0/18815 useless extension candidates. Maximal degree in co-relation 64100. Up to 13848 conditions per place. 
[2023-10-27 12:18:56,642 INFO  L137   encePairwiseOnDemand]: 191/217 looper letters, 239 selfloop transitions, 132 changer transitions 0/389 dead transitions.
[2023-10-27 12:18:56,642 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 389 transitions, 2939 flow
[2023-10-27 12:18:56,643 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-10-27 12:18:56,643 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-10-27 12:18:56,645 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 778 transitions.
[2023-10-27 12:18:56,646 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5975422427035331
[2023-10-27 12:18:56,646 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 778 transitions.
[2023-10-27 12:18:56,646 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 778 transitions.
[2023-10-27 12:18:56,646 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-27 12:18:56,646 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 778 transitions.
[2023-10-27 12:18:56,648 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 129.66666666666666) internal successors, (778), 6 states have internal predecessors, (778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:18:56,650 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 217.0) internal successors, (1519), 7 states have internal predecessors, (1519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:18:56,653 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 217.0) internal successors, (1519), 7 states have internal predecessors, (1519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:18:56,653 INFO  L175             Difference]: Start difference. First operand has 87 places, 180 transitions, 1155 flow. Second operand 6 states and 778 transitions.
[2023-10-27 12:18:56,653 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 389 transitions, 2939 flow
[2023-10-27 12:18:56,738 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 389 transitions, 2939 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-10-27 12:18:56,742 INFO  L231             Difference]: Finished difference. Result has 96 places, 302 transitions, 2326 flow
[2023-10-27 12:18:56,743 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=1155, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=180, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2326, PETRI_PLACES=96, PETRI_TRANSITIONS=302}
[2023-10-27 12:18:56,744 INFO  L288   CegarLoopForPetriNet]: 67 programPoint places, 29 predicate places.
[2023-10-27 12:18:56,744 INFO  L495      AbstractCegarLoop]: Abstraction has has 96 places, 302 transitions, 2326 flow
[2023-10-27 12:18:56,744 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 99.5) internal successors, (597), 6 states have internal predecessors, (597), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:18:56,757 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:18:56,757 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-27 12:18:56,758 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2023-10-27 12:18:56,758 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] ===
[2023-10-27 12:18:56,758 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:18:56,758 INFO  L85        PathProgramCache]: Analyzing trace with hash -686777030, now seen corresponding path program 1 times
[2023-10-27 12:18:56,758 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-27 12:18:56,758 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292103635]
[2023-10-27 12:18:56,759 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:18:56,759 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-27 12:18:56,794 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:18:57,324 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2023-10-27 12:18:57,324 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-27 12:18:57,325 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292103635]
[2023-10-27 12:18:57,325 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292103635] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-27 12:18:57,328 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [785140489]
[2023-10-27 12:18:57,328 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:18:57,328 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-27 12:18:57,329 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-27 12:18:57,361 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-10-27 12:18:57,444 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2023-10-27 12:18:57,584 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:18:57,587 INFO  L263         TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 22 conjunts are in the unsatisfiable core
[2023-10-27 12:18:57,593 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-27 12:18:57,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2023-10-27 12:18:57,879 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:18:57,880 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20
[2023-10-27 12:18:57,932 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:18:57,932 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:18:57,933 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32
[2023-10-27 12:18:58,001 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:18:58,002 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:18:58,003 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:18:58,004 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44
[2023-10-27 12:18:58,091 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:18:58,091 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-10-27 12:18:58,129 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2023-10-27 12:18:58,129 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-27 12:18:58,185 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_318 (Array Int Int))) (= (select (select (store |c_#race| c_~datas~0.base v_ArrVal_318) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) 0)) (forall ((v_ArrVal_318 (Array Int Int))) (= 0 (select (select (store |c_#race| c_~datas~0.base v_ArrVal_318) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)))) (forall ((v_ArrVal_318 (Array Int Int))) (= (select (select (store |c_#race| c_~datas~0.base v_ArrVal_318) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (forall ((v_ArrVal_318 (Array Int Int))) (= (select (select (store |c_#race| c_~datas~0.base v_ArrVal_318) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) 0))) is different from false
[2023-10-27 12:18:58,228 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1 0)))) (and (forall ((v_ArrVal_318 (Array Int Int))) (= 0 (select (select (store .cse0 c_~datas~0.base v_ArrVal_318) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1))) (forall ((v_ArrVal_318 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_318) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (forall ((v_ArrVal_318 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_318) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0)) (forall ((v_ArrVal_318 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_318) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) 0))))) is different from false
[2023-10-27 12:18:58,270 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_318 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_318) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0)) (forall ((v_ArrVal_318 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_318) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_318 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_318) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (forall ((v_ArrVal_318 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_318) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse2) 0))))) is different from false
[2023-10-27 12:18:58,348 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 2 not checked.
[2023-10-27 12:18:58,349 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [785140489] provided 0 perfect and 2 imperfect interpolant sequences
[2023-10-27 12:18:58,349 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-10-27 12:18:58,349 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 15
[2023-10-27 12:18:58,349 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340993688]
[2023-10-27 12:18:58,349 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-10-27 12:18:58,350 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 17 states
[2023-10-27 12:18:58,350 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-27 12:18:58,350 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants.
[2023-10-27 12:18:58,351 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=121, Unknown=3, NotChecked=78, Total=272
[2023-10-27 12:18:58,358 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 79 out of 217
[2023-10-27 12:18:58,360 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 302 transitions, 2326 flow. Second operand  has 17 states, 17 states have (on average 81.3529411764706) internal successors, (1383), 17 states have internal predecessors, (1383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:18:58,360 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-27 12:18:58,360 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 217
[2023-10-27 12:18:58,360 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-27 12:19:02,751 INFO  L130       PetriNetUnfolder]: 14603/24245 cut-off events.
[2023-10-27 12:19:02,752 INFO  L131       PetriNetUnfolder]: For 41050/41050 co-relation queries the response was YES.
[2023-10-27 12:19:02,809 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 94260 conditions, 24245 events. 14603/24245 cut-off events. For 41050/41050 co-relation queries the response was YES. Maximal size of possible extension queue 666. Compared 173289 event pairs, 3234 based on Foata normal form. 162/22857 useless extension candidates. Maximal degree in co-relation 94239. Up to 14161 conditions per place. 
[2023-10-27 12:19:03,013 INFO  L137   encePairwiseOnDemand]: 207/217 looper letters, 500 selfloop transitions, 54 changer transitions 1/562 dead transitions.
[2023-10-27 12:19:03,013 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 562 transitions, 5374 flow
[2023-10-27 12:19:03,013 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2023-10-27 12:19:03,013 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2023-10-27 12:19:03,015 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 699 transitions.
[2023-10-27 12:19:03,015 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.46017116524028967
[2023-10-27 12:19:03,015 INFO  L72            ComplementDD]: Start complementDD. Operand 7 states and 699 transitions.
[2023-10-27 12:19:03,015 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 7 states and 699 transitions.
[2023-10-27 12:19:03,016 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-27 12:19:03,016 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 699 transitions.
[2023-10-27 12:19:03,017 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 8 states, 7 states have (on average 99.85714285714286) internal successors, (699), 7 states have internal predecessors, (699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:19:03,019 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 8 states, 8 states have (on average 217.0) internal successors, (1736), 8 states have internal predecessors, (1736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:19:03,019 INFO  L81            ComplementDD]: Finished complementDD. Result  has 8 states, 8 states have (on average 217.0) internal successors, (1736), 8 states have internal predecessors, (1736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:19:03,019 INFO  L175             Difference]: Start difference. First operand has 96 places, 302 transitions, 2326 flow. Second operand 7 states and 699 transitions.
[2023-10-27 12:19:03,019 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 562 transitions, 5374 flow
[2023-10-27 12:19:03,493 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 562 transitions, 5278 flow, removed 48 selfloop flow, removed 0 redundant places.
[2023-10-27 12:19:03,510 INFO  L231             Difference]: Finished difference. Result has 102 places, 314 transitions, 2506 flow
[2023-10-27 12:19:03,511 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=2226, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=301, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=248, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2506, PETRI_PLACES=102, PETRI_TRANSITIONS=314}
[2023-10-27 12:19:03,511 INFO  L288   CegarLoopForPetriNet]: 67 programPoint places, 35 predicate places.
[2023-10-27 12:19:03,511 INFO  L495      AbstractCegarLoop]: Abstraction has has 102 places, 314 transitions, 2506 flow
[2023-10-27 12:19:03,512 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 17 states, 17 states have (on average 81.3529411764706) internal successors, (1383), 17 states have internal predecessors, (1383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:19:03,512 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:19:03,512 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-27 12:19:03,522 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0
[2023-10-27 12:19:03,716 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11
[2023-10-27 12:19:03,717 INFO  L420      AbstractCegarLoop]: === Iteration 7 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] ===
[2023-10-27 12:19:03,718 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:19:03,718 INFO  L85        PathProgramCache]: Analyzing trace with hash -1154275821, now seen corresponding path program 1 times
[2023-10-27 12:19:03,718 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-27 12:19:03,718 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293343423]
[2023-10-27 12:19:03,719 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:19:03,719 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-27 12:19:03,750 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:19:04,168 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2023-10-27 12:19:04,168 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-27 12:19:04,168 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293343423]
[2023-10-27 12:19:04,169 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293343423] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-27 12:19:04,169 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-27 12:19:04,169 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2023-10-27 12:19:04,169 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358962130]
[2023-10-27 12:19:04,169 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-27 12:19:04,170 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2023-10-27 12:19:04,170 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-27 12:19:04,170 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2023-10-27 12:19:04,171 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56
[2023-10-27 12:19:04,708 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 94 out of 217
[2023-10-27 12:19:04,709 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 314 transitions, 2506 flow. Second operand  has 8 states, 8 states have (on average 96.125) internal successors, (769), 8 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-27 12:19:04,709 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-27 12:19:04,709 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 217
[2023-10-27 12:19:04,709 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-27 12:19:08,655 INFO  L130       PetriNetUnfolder]: 13820/24388 cut-off events.
[2023-10-27 12:19:08,656 INFO  L131       PetriNetUnfolder]: For 46821/46988 co-relation queries the response was YES.
[2023-10-27 12:19:08,699 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 97397 conditions, 24388 events. 13820/24388 cut-off events. For 46821/46988 co-relation queries the response was YES. Maximal size of possible extension queue 869. Compared 189768 event pairs, 3201 based on Foata normal form. 348/24232 useless extension candidates. Maximal degree in co-relation 97374. Up to 11426 conditions per place. 
[2023-10-27 12:19:08,873 INFO  L137   encePairwiseOnDemand]: 201/217 looper letters, 462 selfloop transitions, 166 changer transitions 2/647 dead transitions.
[2023-10-27 12:19:08,874 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 647 transitions, 6020 flow
[2023-10-27 12:19:08,874 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2023-10-27 12:19:08,874 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2023-10-27 12:19:08,879 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 973 transitions.
[2023-10-27 12:19:08,880 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5604838709677419
[2023-10-27 12:19:08,880 INFO  L72            ComplementDD]: Start complementDD. Operand 8 states and 973 transitions.
[2023-10-27 12:19:08,880 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 8 states and 973 transitions.
[2023-10-27 12:19:08,880 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-27 12:19:08,881 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 973 transitions.
[2023-10-27 12:19:08,883 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 9 states, 8 states have (on average 121.625) internal successors, (973), 8 states have internal predecessors, (973), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:19:08,886 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 9 states, 9 states have (on average 217.0) internal successors, (1953), 9 states have internal predecessors, (1953), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:19:08,886 INFO  L81            ComplementDD]: Finished complementDD. Result  has 9 states, 9 states have (on average 217.0) internal successors, (1953), 9 states have internal predecessors, (1953), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:19:08,886 INFO  L175             Difference]: Start difference. First operand has 102 places, 314 transitions, 2506 flow. Second operand 8 states and 973 transitions.
[2023-10-27 12:19:08,887 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 647 transitions, 6020 flow
[2023-10-27 12:19:09,243 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 647 transitions, 5921 flow, removed 0 selfloop flow, removed 4 redundant places.
[2023-10-27 12:19:09,250 INFO  L231             Difference]: Finished difference. Result has 111 places, 430 transitions, 4113 flow
[2023-10-27 12:19:09,250 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=2462, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=314, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=74, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=202, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4113, PETRI_PLACES=111, PETRI_TRANSITIONS=430}
[2023-10-27 12:19:09,252 INFO  L288   CegarLoopForPetriNet]: 67 programPoint places, 44 predicate places.
[2023-10-27 12:19:09,252 INFO  L495      AbstractCegarLoop]: Abstraction has has 111 places, 430 transitions, 4113 flow
[2023-10-27 12:19:09,259 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 96.125) internal successors, (769), 8 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-27 12:19:09,259 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:19:09,260 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]
[2023-10-27 12:19:09,260 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2023-10-27 12:19:09,260 INFO  L420      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] ===
[2023-10-27 12:19:09,260 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:19:09,260 INFO  L85        PathProgramCache]: Analyzing trace with hash 340394548, now seen corresponding path program 1 times
[2023-10-27 12:19:09,261 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-27 12:19:09,265 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641254524]
[2023-10-27 12:19:09,265 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:19:09,265 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-27 12:19:09,307 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:19:09,367 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-27 12:19:09,367 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-27 12:19:09,368 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641254524]
[2023-10-27 12:19:09,368 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641254524] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-27 12:19:09,368 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1497366523]
[2023-10-27 12:19:09,368 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:19:09,368 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-27 12:19:09,368 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-27 12:19:09,369 INFO  L229       MonitoredProcess]: Starting monitored process 3 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-10-27 12:19:09,413 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2023-10-27 12:19:09,531 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:19:09,533 INFO  L263         TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 4 conjunts are in the unsatisfiable core
[2023-10-27 12:19:09,534 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-27 12:19:09,558 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-27 12:19:09,558 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-27 12:19:09,601 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-27 12:19:09,601 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1497366523] provided 0 perfect and 2 imperfect interpolant sequences
[2023-10-27 12:19:09,601 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-10-27 12:19:09,601 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6
[2023-10-27 12:19:09,603 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540295465]
[2023-10-27 12:19:09,603 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-10-27 12:19:09,603 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2023-10-27 12:19:09,603 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-27 12:19:09,604 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2023-10-27 12:19:09,604 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42
[2023-10-27 12:19:09,730 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 118 out of 217
[2023-10-27 12:19:09,731 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 430 transitions, 4113 flow. Second operand  has 7 states, 7 states have (on average 119.85714285714286) internal successors, (839), 7 states have internal predecessors, (839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:19:09,731 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-27 12:19:09,731 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 217
[2023-10-27 12:19:09,731 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-27 12:19:11,785 INFO  L130       PetriNetUnfolder]: 5754/12879 cut-off events.
[2023-10-27 12:19:11,786 INFO  L131       PetriNetUnfolder]: For 42930/44884 co-relation queries the response was YES.
[2023-10-27 12:19:11,816 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 55285 conditions, 12879 events. 5754/12879 cut-off events. For 42930/44884 co-relation queries the response was YES. Maximal size of possible extension queue 555. Compared 112065 event pairs, 470 based on Foata normal form. 202/12746 useless extension candidates. Maximal degree in co-relation 55256. Up to 5114 conditions per place. 
[2023-10-27 12:19:11,869 INFO  L137   encePairwiseOnDemand]: 211/217 looper letters, 152 selfloop transitions, 5 changer transitions 23/483 dead transitions.
[2023-10-27 12:19:11,870 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 483 transitions, 4821 flow
[2023-10-27 12:19:11,870 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2023-10-27 12:19:11,870 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2023-10-27 12:19:11,873 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 876 transitions.
[2023-10-27 12:19:11,874 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5766951942067149
[2023-10-27 12:19:11,874 INFO  L72            ComplementDD]: Start complementDD. Operand 7 states and 876 transitions.
[2023-10-27 12:19:11,875 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 7 states and 876 transitions.
[2023-10-27 12:19:11,875 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-27 12:19:11,875 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 876 transitions.
[2023-10-27 12:19:11,878 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 8 states, 7 states have (on average 125.14285714285714) internal successors, (876), 7 states have internal predecessors, (876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:19:11,879 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 8 states, 8 states have (on average 217.0) internal successors, (1736), 8 states have internal predecessors, (1736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:19:11,882 INFO  L81            ComplementDD]: Finished complementDD. Result  has 8 states, 8 states have (on average 217.0) internal successors, (1736), 8 states have internal predecessors, (1736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:19:11,882 INFO  L175             Difference]: Start difference. First operand has 111 places, 430 transitions, 4113 flow. Second operand 7 states and 876 transitions.
[2023-10-27 12:19:11,882 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 483 transitions, 4821 flow
[2023-10-27 12:19:12,057 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 483 transitions, 4807 flow, removed 7 selfloop flow, removed 0 redundant places.
[2023-10-27 12:19:12,061 INFO  L231             Difference]: Finished difference. Result has 120 places, 390 transitions, 3685 flow
[2023-10-27 12:19:12,062 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=3757, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=399, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=394, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3685, PETRI_PLACES=120, PETRI_TRANSITIONS=390}
[2023-10-27 12:19:12,064 INFO  L288   CegarLoopForPetriNet]: 67 programPoint places, 53 predicate places.
[2023-10-27 12:19:12,064 INFO  L495      AbstractCegarLoop]: Abstraction has has 120 places, 390 transitions, 3685 flow
[2023-10-27 12:19:12,065 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 119.85714285714286) internal successors, (839), 7 states have internal predecessors, (839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:19:12,065 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:19:12,065 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]
[2023-10-27 12:19:12,071 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0
[2023-10-27 12:19:12,269 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,3 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-27 12:19:12,270 INFO  L420      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] ===
[2023-10-27 12:19:12,293 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:19:12,293 INFO  L85        PathProgramCache]: Analyzing trace with hash -2108254852, now seen corresponding path program 1 times
[2023-10-27 12:19:12,294 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-27 12:19:12,294 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175247950]
[2023-10-27 12:19:12,294 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:19:12,294 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-27 12:19:12,321 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:19:12,710 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2023-10-27 12:19:12,710 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-27 12:19:12,710 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175247950]
[2023-10-27 12:19:12,710 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175247950] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-27 12:19:12,711 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-27 12:19:12,711 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2023-10-27 12:19:12,711 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124579802]
[2023-10-27 12:19:12,711 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-27 12:19:12,712 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2023-10-27 12:19:12,712 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-27 12:19:12,712 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2023-10-27 12:19:12,713 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56
[2023-10-27 12:19:13,132 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 97 out of 217
[2023-10-27 12:19:13,132 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 390 transitions, 3685 flow. Second operand  has 8 states, 8 states have (on average 99.5) internal successors, (796), 8 states have internal predecessors, (796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:19:13,132 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-27 12:19:13,132 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 217
[2023-10-27 12:19:13,133 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-27 12:19:15,465 INFO  L130       PetriNetUnfolder]: 8771/16346 cut-off events.
[2023-10-27 12:19:15,466 INFO  L131       PetriNetUnfolder]: For 65828/66223 co-relation queries the response was YES.
[2023-10-27 12:19:15,501 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 77526 conditions, 16346 events. 8771/16346 cut-off events. For 65828/66223 co-relation queries the response was YES. Maximal size of possible extension queue 584. Compared 123686 event pairs, 2787 based on Foata normal form. 240/16416 useless extension candidates. Maximal degree in co-relation 77493. Up to 13560 conditions per place. 
[2023-10-27 12:19:15,551 INFO  L137   encePairwiseOnDemand]: 209/217 looper letters, 343 selfloop transitions, 13 changer transitions 7/402 dead transitions.
[2023-10-27 12:19:15,551 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 402 transitions, 4497 flow
[2023-10-27 12:19:15,552 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2023-10-27 12:19:15,552 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2023-10-27 12:19:15,553 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 742 transitions.
[2023-10-27 12:19:15,553 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.48847926267281105
[2023-10-27 12:19:15,554 INFO  L72            ComplementDD]: Start complementDD. Operand 7 states and 742 transitions.
[2023-10-27 12:19:15,554 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 7 states and 742 transitions.
[2023-10-27 12:19:15,554 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-27 12:19:15,555 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 742 transitions.
[2023-10-27 12:19:15,556 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 8 states, 7 states have (on average 106.0) internal successors, (742), 7 states have internal predecessors, (742), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:19:15,558 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 8 states, 8 states have (on average 217.0) internal successors, (1736), 8 states have internal predecessors, (1736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:19:15,559 INFO  L81            ComplementDD]: Finished complementDD. Result  has 8 states, 8 states have (on average 217.0) internal successors, (1736), 8 states have internal predecessors, (1736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:19:15,559 INFO  L175             Difference]: Start difference. First operand has 120 places, 390 transitions, 3685 flow. Second operand 7 states and 742 transitions.
[2023-10-27 12:19:15,559 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 402 transitions, 4497 flow
[2023-10-27 12:19:15,796 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 402 transitions, 4408 flow, removed 6 selfloop flow, removed 3 redundant places.
[2023-10-27 12:19:15,802 INFO  L231             Difference]: Finished difference. Result has 122 places, 388 transitions, 3635 flow
[2023-10-27 12:19:15,802 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=3592, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=388, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=375, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3635, PETRI_PLACES=122, PETRI_TRANSITIONS=388}
[2023-10-27 12:19:15,803 INFO  L288   CegarLoopForPetriNet]: 67 programPoint places, 55 predicate places.
[2023-10-27 12:19:15,804 INFO  L495      AbstractCegarLoop]: Abstraction has has 122 places, 388 transitions, 3635 flow
[2023-10-27 12:19:15,804 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 99.5) internal successors, (796), 8 states have internal predecessors, (796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:19:15,804 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:19:15,804 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-27 12:19:15,804 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2023-10-27 12:19:15,805 INFO  L420      AbstractCegarLoop]: === Iteration 10 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] ===
[2023-10-27 12:19:15,805 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:19:15,805 INFO  L85        PathProgramCache]: Analyzing trace with hash 860099489, now seen corresponding path program 1 times
[2023-10-27 12:19:15,805 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-27 12:19:15,805 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233509834]
[2023-10-27 12:19:15,806 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:19:15,806 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-27 12:19:15,851 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:19:16,188 INFO  L134       CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked.
[2023-10-27 12:19:16,188 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-27 12:19:16,188 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233509834]
[2023-10-27 12:19:16,188 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233509834] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-27 12:19:16,189 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-27 12:19:16,189 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-10-27 12:19:16,189 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888212804]
[2023-10-27 12:19:16,189 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-27 12:19:16,191 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-10-27 12:19:16,191 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-27 12:19:16,192 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-10-27 12:19:16,192 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-10-27 12:19:16,375 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 97 out of 217
[2023-10-27 12:19:16,376 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 388 transitions, 3635 flow. Second operand  has 6 states, 6 states have (on average 99.66666666666667) internal successors, (598), 6 states have internal predecessors, (598), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:19:16,376 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-27 12:19:16,376 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 217
[2023-10-27 12:19:16,376 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-27 12:19:19,862 INFO  L130       PetriNetUnfolder]: 12785/22892 cut-off events.
[2023-10-27 12:19:19,862 INFO  L131       PetriNetUnfolder]: For 82261/82659 co-relation queries the response was YES.
[2023-10-27 12:19:19,913 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 105773 conditions, 22892 events. 12785/22892 cut-off events. For 82261/82659 co-relation queries the response was YES. Maximal size of possible extension queue 796. Compared 175825 event pairs, 2816 based on Foata normal form. 45/21734 useless extension candidates. Maximal degree in co-relation 105739. Up to 17260 conditions per place. 
[2023-10-27 12:19:20,017 INFO  L137   encePairwiseOnDemand]: 191/217 looper letters, 405 selfloop transitions, 156 changer transitions 18/594 dead transitions.
[2023-10-27 12:19:20,017 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 594 transitions, 6405 flow
[2023-10-27 12:19:20,017 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-10-27 12:19:20,017 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-10-27 12:19:20,019 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 778 transitions.
[2023-10-27 12:19:20,020 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5975422427035331
[2023-10-27 12:19:20,020 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 778 transitions.
[2023-10-27 12:19:20,020 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 778 transitions.
[2023-10-27 12:19:20,020 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-27 12:19:20,020 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 778 transitions.
[2023-10-27 12:19:20,022 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 129.66666666666666) internal successors, (778), 6 states have internal predecessors, (778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:19:20,042 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 217.0) internal successors, (1519), 7 states have internal predecessors, (1519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:19:20,043 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 217.0) internal successors, (1519), 7 states have internal predecessors, (1519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:19:20,043 INFO  L175             Difference]: Start difference. First operand has 122 places, 388 transitions, 3635 flow. Second operand 6 states and 778 transitions.
[2023-10-27 12:19:20,043 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 594 transitions, 6405 flow
[2023-10-27 12:19:20,460 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 594 transitions, 6347 flow, removed 1 selfloop flow, removed 3 redundant places.
[2023-10-27 12:19:20,470 INFO  L231             Difference]: Finished difference. Result has 128 places, 501 transitions, 5166 flow
[2023-10-27 12:19:20,471 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=3601, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=388, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=69, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=304, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=5166, PETRI_PLACES=128, PETRI_TRANSITIONS=501}
[2023-10-27 12:19:20,471 INFO  L288   CegarLoopForPetriNet]: 67 programPoint places, 61 predicate places.
[2023-10-27 12:19:20,471 INFO  L495      AbstractCegarLoop]: Abstraction has has 128 places, 501 transitions, 5166 flow
[2023-10-27 12:19:20,471 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 99.66666666666667) internal successors, (598), 6 states have internal predecessors, (598), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:19:20,471 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:19:20,472 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]
[2023-10-27 12:19:20,472 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2023-10-27 12:19:20,472 INFO  L420      AbstractCegarLoop]: === Iteration 11 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] ===
[2023-10-27 12:19:20,472 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:19:20,472 INFO  L85        PathProgramCache]: Analyzing trace with hash -907237555, now seen corresponding path program 1 times
[2023-10-27 12:19:20,472 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-27 12:19:20,473 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234981012]
[2023-10-27 12:19:20,473 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:19:20,473 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-27 12:19:20,524 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:19:22,043 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-27 12:19:22,044 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-27 12:19:22,044 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234981012]
[2023-10-27 12:19:22,044 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234981012] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-27 12:19:22,044 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1233692535]
[2023-10-27 12:19:22,044 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:19:22,044 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-27 12:19:22,044 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-27 12:19:22,045 INFO  L229       MonitoredProcess]: Starting monitored process 4 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-10-27 12:19:22,081 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2023-10-27 12:19:22,206 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:19:22,213 INFO  L263         TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 32 conjunts are in the unsatisfiable core
[2023-10-27 12:19:22,216 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-27 12:19:22,230 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 18 treesize of output 16
[2023-10-27 12:19:22,392 INFO  L321             Elim1Store]: treesize reduction 15, result has 25.0 percent of original size
[2023-10-27 12:19:22,392 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 1 case distinctions, treesize of input 31 treesize of output 29
[2023-10-27 12:19:22,468 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-27 12:19:22,481 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-27 12:19:22,524 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11
[2023-10-27 12:19:22,551 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27
[2023-10-27 12:19:22,616 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-27 12:19:22,616 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42
[2023-10-27 12:19:22,684 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-27 12:19:22,684 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57
[2023-10-27 12:19:22,771 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50
[2023-10-27 12:19:22,781 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2023-10-27 12:19:22,781 INFO  L324         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2023-10-27 12:19:22,781 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1233692535] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-27 12:19:22,781 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2023-10-27 12:19:22,782 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [14] total 21
[2023-10-27 12:19:22,782 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524336328]
[2023-10-27 12:19:22,782 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-27 12:19:22,783 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2023-10-27 12:19:22,783 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-27 12:19:22,784 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2023-10-27 12:19:22,784 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=418, Unknown=0, NotChecked=0, Total=506
[2023-10-27 12:19:23,484 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 89 out of 217
[2023-10-27 12:19:23,484 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 501 transitions, 5166 flow. Second operand  has 10 states, 10 states have (on average 91.4) internal successors, (914), 10 states have internal predecessors, (914), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:19:23,484 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-27 12:19:23,484 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 217
[2023-10-27 12:19:23,485 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-27 12:19:29,466 INFO  L130       PetriNetUnfolder]: 16066/28224 cut-off events.
[2023-10-27 12:19:29,467 INFO  L131       PetriNetUnfolder]: For 138124/138543 co-relation queries the response was YES.
[2023-10-27 12:19:29,560 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 145503 conditions, 28224 events. 16066/28224 cut-off events. For 138124/138543 co-relation queries the response was YES. Maximal size of possible extension queue 938. Compared 221081 event pairs, 2413 based on Foata normal form. 232/28257 useless extension candidates. Maximal degree in co-relation 145465. Up to 10206 conditions per place. 
[2023-10-27 12:19:29,670 INFO  L137   encePairwiseOnDemand]: 201/217 looper letters, 933 selfloop transitions, 283 changer transitions 35/1263 dead transitions.
[2023-10-27 12:19:29,670 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 1263 transitions, 15728 flow
[2023-10-27 12:19:29,671 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2023-10-27 12:19:29,671 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2023-10-27 12:19:29,682 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1167 transitions.
[2023-10-27 12:19:29,683 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.48889819857561795
[2023-10-27 12:19:29,683 INFO  L72            ComplementDD]: Start complementDD. Operand 11 states and 1167 transitions.
[2023-10-27 12:19:29,683 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 11 states and 1167 transitions.
[2023-10-27 12:19:29,684 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-27 12:19:29,684 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1167 transitions.
[2023-10-27 12:19:29,686 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 12 states, 11 states have (on average 106.0909090909091) internal successors, (1167), 11 states have internal predecessors, (1167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:19:29,689 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 12 states, 12 states have (on average 217.0) internal successors, (2604), 12 states have internal predecessors, (2604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:19:29,706 INFO  L81            ComplementDD]: Finished complementDD. Result  has 12 states, 12 states have (on average 217.0) internal successors, (2604), 12 states have internal predecessors, (2604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:19:29,706 INFO  L175             Difference]: Start difference. First operand has 128 places, 501 transitions, 5166 flow. Second operand 11 states and 1167 transitions.
[2023-10-27 12:19:29,706 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 1263 transitions, 15728 flow
[2023-10-27 12:19:30,975 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 1263 transitions, 15478 flow, removed 125 selfloop flow, removed 0 redundant places.
[2023-10-27 12:19:30,987 INFO  L231             Difference]: Finished difference. Result has 145 places, 755 transitions, 9363 flow
[2023-10-27 12:19:30,988 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=5000, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=501, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=284, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=9363, PETRI_PLACES=145, PETRI_TRANSITIONS=755}
[2023-10-27 12:19:30,989 INFO  L288   CegarLoopForPetriNet]: 67 programPoint places, 78 predicate places.
[2023-10-27 12:19:30,989 INFO  L495      AbstractCegarLoop]: Abstraction has has 145 places, 755 transitions, 9363 flow
[2023-10-27 12:19:30,989 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 91.4) internal successors, (914), 10 states have internal predecessors, (914), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:19:30,990 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:19:30,990 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]
[2023-10-27 12:19:30,996 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0
[2023-10-27 12:19:31,194 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16
[2023-10-27 12:19:31,195 INFO  L420      AbstractCegarLoop]: === Iteration 12 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] ===
[2023-10-27 12:19:31,209 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:19:31,209 INFO  L85        PathProgramCache]: Analyzing trace with hash -103982335, now seen corresponding path program 2 times
[2023-10-27 12:19:31,210 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-27 12:19:31,210 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670517467]
[2023-10-27 12:19:31,210 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:19:31,210 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-27 12:19:31,257 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:19:32,095 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-27 12:19:32,095 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-27 12:19:32,095 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670517467]
[2023-10-27 12:19:32,095 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670517467] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-27 12:19:32,095 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2128934210]
[2023-10-27 12:19:32,095 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2023-10-27 12:19:32,096 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-27 12:19:32,096 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-27 12:19:32,110 INFO  L229       MonitoredProcess]: Starting monitored process 5 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-10-27 12:19:32,142 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process
[2023-10-27 12:19:32,285 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2023-10-27 12:19:32,285 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2023-10-27 12:19:32,286 INFO  L263         TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 32 conjunts are in the unsatisfiable core
[2023-10-27 12:19:32,289 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-27 12:19:32,298 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:19:32,313 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 26 treesize of output 24
[2023-10-27 12:19:32,451 INFO  L321             Elim1Store]: treesize reduction 15, result has 25.0 percent of original size
[2023-10-27 12:19:32,465 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29
[2023-10-27 12:19:32,497 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:19:32,497 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-27 12:19:32,531 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11
[2023-10-27 12:19:32,575 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27
[2023-10-27 12:19:32,634 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-27 12:19:32,634 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42
[2023-10-27 12:19:32,781 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 25 treesize of output 13
[2023-10-27 12:19:32,832 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:19:32,833 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 42 treesize of output 40
[2023-10-27 12:19:32,861 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-27 12:19:32,862 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57
[2023-10-27 12:19:32,941 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:19:32,941 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 54 treesize of output 50
[2023-10-27 12:19:32,983 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:19:32,985 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 54 treesize of output 50
[2023-10-27 12:19:33,006 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:19:33,022 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 54 treesize of output 50
[2023-10-27 12:19:33,078 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50
[2023-10-27 12:19:33,087 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-27 12:19:33,087 INFO  L324         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2023-10-27 12:19:33,087 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [2128934210] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-27 12:19:33,089 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2023-10-27 12:19:33,089 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 17
[2023-10-27 12:19:33,089 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903776885]
[2023-10-27 12:19:33,089 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-27 12:19:33,090 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2023-10-27 12:19:33,090 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-27 12:19:33,090 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2023-10-27 12:19:33,090 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342
[2023-10-27 12:19:34,056 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 89 out of 217
[2023-10-27 12:19:34,057 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 755 transitions, 9363 flow. Second operand  has 11 states, 11 states have (on average 91.18181818181819) internal successors, (1003), 11 states have internal predecessors, (1003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:19:34,057 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-27 12:19:34,057 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 217
[2023-10-27 12:19:34,058 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-27 12:19:41,421 INFO  L130       PetriNetUnfolder]: 17180/30220 cut-off events.
[2023-10-27 12:19:41,422 INFO  L131       PetriNetUnfolder]: For 206398/206888 co-relation queries the response was YES.
[2023-10-27 12:19:41,518 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 172995 conditions, 30220 events. 17180/30220 cut-off events. For 206398/206888 co-relation queries the response was YES. Maximal size of possible extension queue 970. Compared 238311 event pairs, 2207 based on Foata normal form. 290/30331 useless extension candidates. Maximal degree in co-relation 172949. Up to 12901 conditions per place. 
[2023-10-27 12:19:41,671 INFO  L137   encePairwiseOnDemand]: 197/217 looper letters, 838 selfloop transitions, 526 changer transitions 51/1427 dead transitions.
[2023-10-27 12:19:41,672 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 1427 transitions, 19203 flow
[2023-10-27 12:19:41,672 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. 
[2023-10-27 12:19:41,672 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 15 states.
[2023-10-27 12:19:41,687 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1651 transitions.
[2023-10-27 12:19:41,692 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5072196620583718
[2023-10-27 12:19:41,692 INFO  L72            ComplementDD]: Start complementDD. Operand 15 states and 1651 transitions.
[2023-10-27 12:19:41,692 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 15 states and 1651 transitions.
[2023-10-27 12:19:41,693 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-27 12:19:41,693 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1651 transitions.
[2023-10-27 12:19:41,696 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 16 states, 15 states have (on average 110.06666666666666) internal successors, (1651), 15 states have internal predecessors, (1651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:19:41,706 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 16 states, 16 states have (on average 217.0) internal successors, (3472), 16 states have internal predecessors, (3472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:19:41,706 INFO  L81            ComplementDD]: Finished complementDD. Result  has 16 states, 16 states have (on average 217.0) internal successors, (3472), 16 states have internal predecessors, (3472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:19:41,706 INFO  L175             Difference]: Start difference. First operand has 145 places, 755 transitions, 9363 flow. Second operand 15 states and 1651 transitions.
[2023-10-27 12:19:41,706 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 1427 transitions, 19203 flow
[2023-10-27 12:19:44,067 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 1427 transitions, 19137 flow, removed 25 selfloop flow, removed 2 redundant places.
[2023-10-27 12:19:44,093 INFO  L231             Difference]: Finished difference. Result has 163 places, 999 transitions, 14370 flow
[2023-10-27 12:19:44,094 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=9322, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=755, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=292, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=416, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=14370, PETRI_PLACES=163, PETRI_TRANSITIONS=999}
[2023-10-27 12:19:44,094 INFO  L288   CegarLoopForPetriNet]: 67 programPoint places, 96 predicate places.
[2023-10-27 12:19:44,094 INFO  L495      AbstractCegarLoop]: Abstraction has has 163 places, 999 transitions, 14370 flow
[2023-10-27 12:19:44,095 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 91.18181818181819) internal successors, (1003), 11 states have internal predecessors, (1003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:19:44,095 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:19:44,095 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]
[2023-10-27 12:19:44,101 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0
[2023-10-27 12:19:44,300 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17
[2023-10-27 12:19:44,300 INFO  L420      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] ===
[2023-10-27 12:19:44,301 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:19:44,315 INFO  L85        PathProgramCache]: Analyzing trace with hash -1403000896, now seen corresponding path program 1 times
[2023-10-27 12:19:44,315 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-27 12:19:44,316 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85801774]
[2023-10-27 12:19:44,316 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:19:44,316 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-27 12:19:44,360 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:19:44,939 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-27 12:19:44,939 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-27 12:19:44,940 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85801774]
[2023-10-27 12:19:44,940 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85801774] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-27 12:19:44,940 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1393480389]
[2023-10-27 12:19:44,940 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:19:44,940 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-27 12:19:44,940 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-27 12:19:44,954 INFO  L229       MonitoredProcess]: Starting monitored process 6 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-10-27 12:19:44,997 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process
[2023-10-27 12:19:45,151 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:19:45,166 INFO  L263         TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 29 conjunts are in the unsatisfiable core
[2023-10-27 12:19:45,169 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-27 12:19:45,177 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:19:45,179 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 26 treesize of output 24
[2023-10-27 12:19:45,306 INFO  L321             Elim1Store]: treesize reduction 15, result has 25.0 percent of original size
[2023-10-27 12:19:45,307 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 1 case distinctions, treesize of input 28 treesize of output 29
[2023-10-27 12:19:45,347 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:19:45,347 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-27 12:19:45,389 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 25 treesize of output 13
[2023-10-27 12:19:45,410 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11
[2023-10-27 12:19:45,431 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27
[2023-10-27 12:19:45,441 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-27 12:19:45,441 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42
[2023-10-27 12:19:45,467 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-27 12:19:45,467 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57
[2023-10-27 12:19:45,482 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50
[2023-10-27 12:19:45,504 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2023-10-27 12:19:45,504 INFO  L324         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2023-10-27 12:19:45,504 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1393480389] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-27 12:19:45,504 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2023-10-27 12:19:45,504 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10] total 12
[2023-10-27 12:19:45,505 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667099542]
[2023-10-27 12:19:45,505 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-27 12:19:45,506 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2023-10-27 12:19:45,506 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-27 12:19:45,506 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2023-10-27 12:19:45,506 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182
[2023-10-27 12:19:46,437 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 102 out of 217
[2023-10-27 12:19:46,439 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 999 transitions, 14370 flow. Second operand  has 10 states, 10 states have (on average 103.6) internal successors, (1036), 10 states have internal predecessors, (1036), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:19:46,439 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-27 12:19:46,439 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 217
[2023-10-27 12:19:46,439 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-27 12:19:52,912 INFO  L130       PetriNetUnfolder]: 14478/26890 cut-off events.
[2023-10-27 12:19:52,912 INFO  L131       PetriNetUnfolder]: For 258288/259655 co-relation queries the response was YES.
[2023-10-27 12:19:53,026 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 169027 conditions, 26890 events. 14478/26890 cut-off events. For 258288/259655 co-relation queries the response was YES. Maximal size of possible extension queue 931. Compared 223662 event pairs, 1217 based on Foata normal form. 518/26956 useless extension candidates. Maximal degree in co-relation 168975. Up to 10035 conditions per place. 
[2023-10-27 12:19:53,174 INFO  L137   encePairwiseOnDemand]: 206/217 looper letters, 1230 selfloop transitions, 93 changer transitions 15/1486 dead transitions.
[2023-10-27 12:19:53,174 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 1486 transitions, 23687 flow
[2023-10-27 12:19:53,174 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2023-10-27 12:19:53,175 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2023-10-27 12:19:53,185 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1057 transitions.
[2023-10-27 12:19:53,185 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5412186379928315
[2023-10-27 12:19:53,185 INFO  L72            ComplementDD]: Start complementDD. Operand 9 states and 1057 transitions.
[2023-10-27 12:19:53,186 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 9 states and 1057 transitions.
[2023-10-27 12:19:53,186 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-27 12:19:53,186 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1057 transitions.
[2023-10-27 12:19:53,202 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 10 states, 9 states have (on average 117.44444444444444) internal successors, (1057), 9 states have internal predecessors, (1057), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:19:53,204 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 10 states, 10 states have (on average 217.0) internal successors, (2170), 10 states have internal predecessors, (2170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:19:53,204 INFO  L81            ComplementDD]: Finished complementDD. Result  has 10 states, 10 states have (on average 217.0) internal successors, (2170), 10 states have internal predecessors, (2170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:19:53,204 INFO  L175             Difference]: Start difference. First operand has 163 places, 999 transitions, 14370 flow. Second operand 9 states and 1057 transitions.
[2023-10-27 12:19:53,204 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 1486 transitions, 23687 flow
[2023-10-27 12:19:56,313 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 1486 transitions, 23017 flow, removed 328 selfloop flow, removed 3 redundant places.
[2023-10-27 12:19:56,330 INFO  L231             Difference]: Finished difference. Result has 165 places, 998 transitions, 13986 flow
[2023-10-27 12:19:56,330 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=13800, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=998, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=93, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=905, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=13986, PETRI_PLACES=165, PETRI_TRANSITIONS=998}
[2023-10-27 12:19:56,331 INFO  L288   CegarLoopForPetriNet]: 67 programPoint places, 98 predicate places.
[2023-10-27 12:19:56,331 INFO  L495      AbstractCegarLoop]: Abstraction has has 165 places, 998 transitions, 13986 flow
[2023-10-27 12:19:56,331 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 103.6) internal successors, (1036), 10 states have internal predecessors, (1036), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:19:56,331 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:19:56,332 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]
[2023-10-27 12:19:56,338 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0
[2023-10-27 12:19:56,536 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,6 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-27 12:19:56,536 INFO  L420      AbstractCegarLoop]: === Iteration 14 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] ===
[2023-10-27 12:19:56,549 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:19:56,549 INFO  L85        PathProgramCache]: Analyzing trace with hash 1127119439, now seen corresponding path program 3 times
[2023-10-27 12:19:56,550 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-27 12:19:56,550 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365220221]
[2023-10-27 12:19:56,550 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:19:56,551 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-27 12:19:56,583 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:19:57,329 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-27 12:19:57,329 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-27 12:19:57,329 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365220221]
[2023-10-27 12:19:57,329 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365220221] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-27 12:19:57,329 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [69312622]
[2023-10-27 12:19:57,329 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2023-10-27 12:19:57,329 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-27 12:19:57,329 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-27 12:19:57,330 INFO  L229       MonitoredProcess]: Starting monitored process 7 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-10-27 12:19:57,373 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process
[2023-10-27 12:19:57,566 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s)
[2023-10-27 12:19:57,566 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2023-10-27 12:19:57,567 INFO  L263         TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 58 conjunts are in the unsatisfiable core
[2023-10-27 12:19:57,572 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-27 12:19:57,588 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 18 treesize of output 16
[2023-10-27 12:19:57,812 INFO  L321             Elim1Store]: treesize reduction 15, result has 25.0 percent of original size
[2023-10-27 12:19:57,813 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 1 case distinctions, treesize of input 31 treesize of output 29
[2023-10-27 12:19:57,818 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:19:57,821 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-27 12:19:57,975 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-27 12:19:57,992 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-27 12:19:58,081 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 15 treesize of output 11
[2023-10-27 12:19:58,151 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 28 treesize of output 27
[2023-10-27 12:19:58,225 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 7 treesize of output 3
[2023-10-27 12:19:58,234 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-27 12:19:58,301 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 40 treesize of output 42
[2023-10-27 12:19:58,377 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 42 treesize of output 40
[2023-10-27 12:19:58,417 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 52 treesize of output 57
[2023-10-27 12:19:58,488 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 54 treesize of output 50
[2023-10-27 12:19:58,526 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 54 treesize of output 50
[2023-10-27 12:19:58,567 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 54 treesize of output 50
[2023-10-27 12:19:58,667 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50
[2023-10-27 12:19:58,718 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-27 12:19:58,718 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-27 12:19:58,739 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse0 (* 4 c_threadThread1of2ForFork0_~i~0))) (and (forall ((v_ArrVal_964 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_964) c_~datas~0.base) (+ c_~datas~0.offset .cse0 1)))) (forall ((v_ArrVal_964 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_964) c_~datas~0.base) (+ c_~datas~0.offset 2 .cse0)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_964 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_964) c_~datas~0.base) (+ c_~datas~0.offset 3 .cse0)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_964 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_964) c_~datas~0.base) (+ c_~datas~0.offset .cse0)) |c_threadThread1of2ForFork0_#t~nondet4|)))) is different from false
[2023-10-27 12:20:11,277 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (* 4 c_threadThread1of2ForFork0_~i~0))) (let ((.cse2 (+ c_~datas~0.offset 3 .cse1))) (let ((.cse0 (store |c_#race| c_~datas~0.base (store (select |c_#race| c_~datas~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_963 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_963) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_964) c_~datas~0.base) (+ c_~datas~0.offset .cse1)))) (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_963 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_963) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_964) c_~datas~0.base) .cse2) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_963 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_963) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_964) c_~datas~0.base) (+ c_~datas~0.offset .cse1 1)))) (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_963 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_963) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_964) c_~datas~0.base) (+ c_~datas~0.offset 2 .cse1)))))))) is different from false
[2023-10-27 12:20:11,302 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse2 (* 4 c_threadThread1of2ForFork0_~i~0))) (let ((.cse1 (+ c_~datas~0.offset 3 .cse2))) (and (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_963 (Array Int Int)) (v_ArrVal_958 (Array Int Int))) (= (select (select (store (store (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_958))) (store .cse0 c_~datas~0.base (store (select .cse0 c_~datas~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_963) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_964) c_~datas~0.base) (+ c_~datas~0.offset .cse2)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_963 (Array Int Int)) (v_ArrVal_958 (Array Int Int))) (= (select (select (store (store (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_958))) (store .cse3 c_~datas~0.base (store (select .cse3 c_~datas~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_963) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_964) c_~datas~0.base) .cse1) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_963 (Array Int Int)) (v_ArrVal_958 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_958))) (store .cse4 c_~datas~0.base (store (select .cse4 c_~datas~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_963) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_964) c_~datas~0.base) (+ c_~datas~0.offset .cse2 1)))) (forall ((v_ArrVal_964 (Array Int Int)) (v_ArrVal_963 (Array Int Int)) (v_ArrVal_958 (Array Int Int))) (= (select (select (store (store (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_958))) (store .cse5 c_~datas~0.base (store (select .cse5 c_~datas~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_963) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_964) c_~datas~0.base) (+ c_~datas~0.offset 2 .cse2)) |c_threadThread1of2ForFork0_#t~nondet4|))))) is different from false
[2023-10-27 12:20:11,980 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-27 12:20:11,981 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 97 treesize of output 80
[2023-10-27 12:20:11,990 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-27 12:20:11,990 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 277 treesize of output 179
[2023-10-27 12:20:11,998 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 163 treesize of output 135
[2023-10-27 12:20:12,003 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 76 treesize of output 69
[2023-10-27 12:20:12,013 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 128 treesize of output 114
[2023-10-27 12:20:12,077 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2023-10-27 12:20:12,078 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 3 case distinctions, treesize of input 97 treesize of output 1
[2023-10-27 12:20:12,085 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2023-10-27 12:20:12,086 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 3 case distinctions, treesize of input 96 treesize of output 1
[2023-10-27 12:20:12,094 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2023-10-27 12:20:12,094 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 3 case distinctions, treesize of input 97 treesize of output 1
[2023-10-27 12:20:12,384 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-27 12:20:12,384 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [69312622] provided 0 perfect and 2 imperfect interpolant sequences
[2023-10-27 12:20:12,384 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-10-27 12:20:12,384 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11] total 30
[2023-10-27 12:20:12,384 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912262530]
[2023-10-27 12:20:12,384 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-10-27 12:20:12,385 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 32 states
[2023-10-27 12:20:12,385 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-27 12:20:12,385 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants.
[2023-10-27 12:20:12,385 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=622, Unknown=68, NotChecked=168, Total=992
[2023-10-27 12:20:12,387 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 66 out of 217
[2023-10-27 12:20:12,388 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 998 transitions, 13986 flow. Second operand  has 32 states, 32 states have (on average 68.3125) internal successors, (2186), 32 states have internal predecessors, (2186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:20:12,388 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-27 12:20:12,388 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 217
[2023-10-27 12:20:12,388 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-27 12:20:27,170 INFO  L130       PetriNetUnfolder]: 25390/41997 cut-off events.
[2023-10-27 12:20:27,170 INFO  L131       PetriNetUnfolder]: For 365076/365076 co-relation queries the response was YES.
[2023-10-27 12:20:27,329 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 261786 conditions, 41997 events. 25390/41997 cut-off events. For 365076/365076 co-relation queries the response was YES. Maximal size of possible extension queue 1168. Compared 316891 event pairs, 4210 based on Foata normal form. 201/42198 useless extension candidates. Maximal degree in co-relation 261736. Up to 17367 conditions per place. 
[2023-10-27 12:20:27,486 INFO  L137   encePairwiseOnDemand]: 184/217 looper letters, 1213 selfloop transitions, 584 changer transitions 59/1859 dead transitions.
[2023-10-27 12:20:27,486 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 1859 transitions, 27522 flow
[2023-10-27 12:20:27,486 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. 
[2023-10-27 12:20:27,487 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 22 states.
[2023-10-27 12:20:27,488 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 1827 transitions.
[2023-10-27 12:20:27,489 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.38269794721407624
[2023-10-27 12:20:27,489 INFO  L72            ComplementDD]: Start complementDD. Operand 22 states and 1827 transitions.
[2023-10-27 12:20:27,489 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 22 states and 1827 transitions.
[2023-10-27 12:20:27,490 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-27 12:20:27,490 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 22 states and 1827 transitions.
[2023-10-27 12:20:27,493 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 23 states, 22 states have (on average 83.04545454545455) internal successors, (1827), 22 states have internal predecessors, (1827), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:20:27,516 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 23 states, 23 states have (on average 217.0) internal successors, (4991), 23 states have internal predecessors, (4991), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:20:27,517 INFO  L81            ComplementDD]: Finished complementDD. Result  has 23 states, 23 states have (on average 217.0) internal successors, (4991), 23 states have internal predecessors, (4991), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:20:27,517 INFO  L175             Difference]: Start difference. First operand has 165 places, 998 transitions, 13986 flow. Second operand 22 states and 1827 transitions.
[2023-10-27 12:20:27,517 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 1859 transitions, 27522 flow
[2023-10-27 12:20:31,075 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 1859 transitions, 27148 flow, removed 0 selfloop flow, removed 8 redundant places.
[2023-10-27 12:20:31,097 INFO  L231             Difference]: Finished difference. Result has 186 places, 1230 transitions, 19430 flow
[2023-10-27 12:20:31,098 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=13800, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=998, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=375, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=532, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=19430, PETRI_PLACES=186, PETRI_TRANSITIONS=1230}
[2023-10-27 12:20:31,098 INFO  L288   CegarLoopForPetriNet]: 67 programPoint places, 119 predicate places.
[2023-10-27 12:20:31,098 INFO  L495      AbstractCegarLoop]: Abstraction has has 186 places, 1230 transitions, 19430 flow
[2023-10-27 12:20:31,099 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 32 states, 32 states have (on average 68.3125) internal successors, (2186), 32 states have internal predecessors, (2186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:20:31,099 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:20:31,099 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]
[2023-10-27 12:20:31,105 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0
[2023-10-27 12:20:31,304 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,7 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-27 12:20:31,304 INFO  L420      AbstractCegarLoop]: === Iteration 15 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] ===
[2023-10-27 12:20:31,305 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:20:31,305 INFO  L85        PathProgramCache]: Analyzing trace with hash -1195414565, now seen corresponding path program 4 times
[2023-10-27 12:20:31,305 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-27 12:20:31,306 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331804493]
[2023-10-27 12:20:31,306 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:20:31,306 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-27 12:20:31,347 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:20:32,174 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-27 12:20:32,174 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-27 12:20:32,175 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331804493]
[2023-10-27 12:20:32,175 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331804493] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-27 12:20:32,175 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [852496024]
[2023-10-27 12:20:32,175 INFO  L93    rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2023-10-27 12:20:32,175 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-27 12:20:32,175 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-27 12:20:32,181 INFO  L229       MonitoredProcess]: Starting monitored process 8 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-10-27 12:20:32,224 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process
[2023-10-27 12:20:32,482 INFO  L228   tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s)
[2023-10-27 12:20:32,483 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2023-10-27 12:20:32,484 INFO  L263         TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 60 conjunts are in the unsatisfiable core
[2023-10-27 12:20:32,489 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-27 12:20:32,510 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:20:32,513 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 26 treesize of output 24
[2023-10-27 12:20:32,822 INFO  L321             Elim1Store]: treesize reduction 15, result has 25.0 percent of original size
[2023-10-27 12:20:32,822 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29
[2023-10-27 12:20:32,828 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:20:32,829 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16
[2023-10-27 12:20:33,025 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:20:33,026 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24
[2023-10-27 12:20:33,055 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:20:33,057 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-27 12:20:33,135 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11
[2023-10-27 12:20:33,226 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 25 treesize of output 13
[2023-10-27 12:20:33,235 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 7 treesize of output 3
[2023-10-27 12:20:33,295 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27
[2023-10-27 12:20:33,393 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42
[2023-10-27 12:20:33,499 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 57
[2023-10-27 12:20:33,637 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:20:33,638 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 54 treesize of output 50
[2023-10-27 12:20:33,682 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:20:33,683 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 54 treesize of output 50
[2023-10-27 12:20:33,727 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:20:33,728 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 54 treesize of output 50
[2023-10-27 12:20:33,760 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:20:33,761 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 54 treesize of output 50
[2023-10-27 12:20:33,954 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:20:33,955 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:20:33,957 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 61 treesize of output 60
[2023-10-27 12:20:34,047 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-27 12:20:34,047 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-27 12:20:34,088 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse0 (* 4 c_threadThread1of2ForFork0_~i~0))) (and (forall ((v_ArrVal_1077 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1077) c_~datas~0.base) (+ c_~datas~0.offset .cse0)))) (forall ((v_ArrVal_1077 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1077) c_~datas~0.base) (+ c_~datas~0.offset 2 .cse0)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1077 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1077) c_~datas~0.base) (+ c_~datas~0.offset 3 .cse0)))) (forall ((v_ArrVal_1077 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1077) c_~datas~0.base) (+ c_~datas~0.offset .cse0 1)))))) is different from false
[2023-10-27 12:20:34,236 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse0 (* 4 c_threadThread1of2ForFork0_~i~0))) (and (forall ((v_ArrVal_1076 (Array Int Int))) (or (forall ((v_ArrVal_1077 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1076) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1077) c_~datas~0.base) (+ c_~datas~0.offset 2 .cse0)))) (not (= (select v_ArrVal_1076 |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)))) (forall ((v_ArrVal_1076 (Array Int Int))) (or (forall ((v_ArrVal_1077 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1076) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1077) c_~datas~0.base) (+ c_~datas~0.offset .cse0 1)) |c_threadThread1of2ForFork0_#t~nondet4|)) (not (= (select v_ArrVal_1076 |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)))) (forall ((v_ArrVal_1076 (Array Int Int))) (or (forall ((v_ArrVal_1077 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1076) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1077) c_~datas~0.base) (+ c_~datas~0.offset 3 .cse0)))) (not (= (select v_ArrVal_1076 |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)))) (forall ((v_ArrVal_1076 (Array Int Int))) (or (forall ((v_ArrVal_1077 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1076) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1077) c_~datas~0.base) (+ c_~datas~0.offset .cse0)))) (not (= (select v_ArrVal_1076 |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)))))) is different from false
[2023-10-27 12:20:34,403 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (* 4 c_threadThread1of2ForFork0_~i~0))) (let ((.cse2 (+ c_~datas~0.offset 3 .cse1))) (let ((.cse0 (store |c_#race| c_~datas~0.base (store (select |c_#race| c_~datas~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_1076 (Array Int Int))) (or (forall ((v_ArrVal_1077 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1076) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1077) c_~datas~0.base) (+ c_~datas~0.offset 2 .cse1)))) (not (= (select v_ArrVal_1076 |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)))) (forall ((v_ArrVal_1076 (Array Int Int))) (or (forall ((v_ArrVal_1077 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1076) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1077) c_~datas~0.base) (+ c_~datas~0.offset .cse1)))) (not (= (select v_ArrVal_1076 |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)))) (forall ((v_ArrVal_1076 (Array Int Int))) (or (forall ((v_ArrVal_1077 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1076) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1077) c_~datas~0.base) .cse2) |c_threadThread1of2ForFork0_#t~nondet4|)) (not (= (select v_ArrVal_1076 |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)))) (forall ((v_ArrVal_1076 (Array Int Int))) (or (forall ((v_ArrVal_1077 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1076) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1077) c_~datas~0.base) (+ c_~datas~0.offset .cse1 1)))) (not (= (select v_ArrVal_1076 |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)))))))) is different from false
[2023-10-27 12:20:34,468 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse2 (* 4 c_threadThread1of2ForFork0_~i~0))) (let ((.cse3 (+ c_~datas~0.offset 2 .cse2)) (.cse1 (+ c_~datas~0.offset 3 .cse2))) (let ((.cse0 (store |c_#race| c_~datas~0.base (store (store (select |c_#race| c_~datas~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_1076 (Array Int Int))) (or (forall ((v_ArrVal_1077 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1076) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1077) c_~datas~0.base) .cse1))) (not (= (select v_ArrVal_1076 |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)))) (forall ((v_ArrVal_1076 (Array Int Int))) (or (forall ((v_ArrVal_1077 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1076) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1077) c_~datas~0.base) (+ c_~datas~0.offset .cse2)))) (not (= (select v_ArrVal_1076 |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)))) (forall ((v_ArrVal_1076 (Array Int Int))) (or (forall ((v_ArrVal_1077 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1076) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1077) c_~datas~0.base) (+ c_~datas~0.offset .cse2 1)))) (not (= (select v_ArrVal_1076 |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)))) (forall ((v_ArrVal_1076 (Array Int Int))) (or (forall ((v_ArrVal_1077 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1076) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1077) c_~datas~0.base) .cse3))) (not (= (select v_ArrVal_1076 |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)))))))) is different from false
[2023-10-27 12:20:34,542 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse4 (* 4 c_threadThread1of2ForFork0_~i~0))) (let ((.cse2 (+ c_~datas~0.offset .cse4 1)) (.cse3 (+ c_~datas~0.offset 2 .cse4)) (.cse1 (+ c_~datas~0.offset 3 .cse4))) (let ((.cse0 (store |c_#race| c_~datas~0.base (store (store (store (select |c_#race| c_~datas~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_1076 (Array Int Int))) (or (forall ((v_ArrVal_1077 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1076) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1077) c_~datas~0.base) .cse1))) (not (= (select v_ArrVal_1076 |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)))) (forall ((v_ArrVal_1076 (Array Int Int))) (or (forall ((v_ArrVal_1077 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1076) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1077) c_~datas~0.base) .cse2))) (not (= (select v_ArrVal_1076 |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)))) (forall ((v_ArrVal_1076 (Array Int Int))) (or (not (= (select v_ArrVal_1076 |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (forall ((v_ArrVal_1077 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1076) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1077) c_~datas~0.base) .cse3) |c_threadThread1of2ForFork0_#t~nondet4|)))) (forall ((v_ArrVal_1076 (Array Int Int))) (or (forall ((v_ArrVal_1077 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1076) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1077) c_~datas~0.base) (+ c_~datas~0.offset .cse4)))) (not (= (select v_ArrVal_1076 |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)))))))) is different from false
[2023-10-27 12:20:34,594 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse4 (* 4 c_threadThread1of2ForFork0_~i~0))) (let ((.cse5 (+ c_~datas~0.offset .cse4 1)) (.cse3 (+ c_~datas~0.offset 2 .cse4)) (.cse2 (+ c_~datas~0.offset 3 .cse4))) (let ((.cse0 (store |c_#race| c_~datas~0.base (store (store (store (select |c_#race| c_~datas~0.base) .cse5 |c_threadThread1of2ForFork0_#t~nondet4|) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|))) (.cse1 (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_1076 (Array Int Int))) (or (not (= (select v_ArrVal_1076 |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (forall ((v_ArrVal_1077 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1076) .cse1 v_ArrVal_1077) c_~datas~0.base) .cse2))))) (forall ((v_ArrVal_1076 (Array Int Int))) (or (forall ((v_ArrVal_1077 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1076) .cse1 v_ArrVal_1077) c_~datas~0.base) .cse3) |c_threadThread1of2ForFork0_#t~nondet4|)) (not (= (select v_ArrVal_1076 |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)))) (forall ((v_ArrVal_1076 (Array Int Int))) (or (forall ((v_ArrVal_1077 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1076) .cse1 v_ArrVal_1077) c_~datas~0.base) (+ c_~datas~0.offset .cse4)))) (not (= (select v_ArrVal_1076 |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)))) (forall ((v_ArrVal_1076 (Array Int Int))) (or (not (= (select v_ArrVal_1076 |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (forall ((v_ArrVal_1077 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1076) .cse1 v_ArrVal_1077) c_~datas~0.base) .cse5) |c_threadThread1of2ForFork0_#t~nondet4|)))))))) is different from false
[2023-10-27 12:20:34,627 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-27 12:20:34,628 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 58 treesize of output 74
[2023-10-27 12:20:34,635 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-27 12:20:34,636 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 189 treesize of output 91
[2023-10-27 12:20:34,640 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 67 treesize of output 53
[2023-10-27 12:20:34,654 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-27 12:20:34,654 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 42 treesize of output 46
[2023-10-27 12:20:34,743 INFO  L321             Elim1Store]: treesize reduction 51, result has 1.9 percent of original size
[2023-10-27 12:20:34,743 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 58 treesize of output 1
[2023-10-27 12:20:34,751 INFO  L321             Elim1Store]: treesize reduction 51, result has 1.9 percent of original size
[2023-10-27 12:20:34,751 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 57 treesize of output 1
[2023-10-27 12:20:34,759 INFO  L321             Elim1Store]: treesize reduction 51, result has 1.9 percent of original size
[2023-10-27 12:20:34,759 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 58 treesize of output 1
[2023-10-27 12:20:34,943 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-27 12:20:34,943 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [852496024] provided 0 perfect and 2 imperfect interpolant sequences
[2023-10-27 12:20:34,944 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-10-27 12:20:34,944 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11] total 30
[2023-10-27 12:20:34,944 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930917861]
[2023-10-27 12:20:34,944 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-10-27 12:20:34,944 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 32 states
[2023-10-27 12:20:34,944 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-27 12:20:34,944 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants.
[2023-10-27 12:20:34,945 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=544, Unknown=8, NotChecked=318, Total=992
[2023-10-27 12:20:35,212 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 66 out of 217
[2023-10-27 12:20:35,213 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 1230 transitions, 19430 flow. Second operand  has 32 states, 32 states have (on average 68.3125) internal successors, (2186), 32 states have internal predecessors, (2186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:20:35,213 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-27 12:20:35,213 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 217
[2023-10-27 12:20:35,213 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-27 12:20:54,228 INFO  L130       PetriNetUnfolder]: 28151/46603 cut-off events.
[2023-10-27 12:20:54,228 INFO  L131       PetriNetUnfolder]: For 590156/590166 co-relation queries the response was YES.
[2023-10-27 12:20:54,487 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 331463 conditions, 46603 events. 28151/46603 cut-off events. For 590156/590166 co-relation queries the response was YES. Maximal size of possible extension queue 1231. Compared 356428 event pairs, 4382 based on Foata normal form. 206/46804 useless extension candidates. Maximal degree in co-relation 331405. Up to 17274 conditions per place. 
[2023-10-27 12:20:54,766 INFO  L137   encePairwiseOnDemand]: 180/217 looper letters, 1439 selfloop transitions, 726 changer transitions 95/2263 dead transitions.
[2023-10-27 12:20:54,767 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 2263 transitions, 37749 flow
[2023-10-27 12:20:54,767 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. 
[2023-10-27 12:20:54,767 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 29 states.
[2023-10-27 12:20:54,769 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 2342 transitions.
[2023-10-27 12:20:54,770 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.37215954234864135
[2023-10-27 12:20:54,770 INFO  L72            ComplementDD]: Start complementDD. Operand 29 states and 2342 transitions.
[2023-10-27 12:20:54,770 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 29 states and 2342 transitions.
[2023-10-27 12:20:54,787 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-27 12:20:54,787 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 29 states and 2342 transitions.
[2023-10-27 12:20:54,789 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 30 states, 29 states have (on average 80.75862068965517) internal successors, (2342), 29 states have internal predecessors, (2342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:20:54,793 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 30 states, 30 states have (on average 217.0) internal successors, (6510), 30 states have internal predecessors, (6510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:20:54,795 INFO  L81            ComplementDD]: Finished complementDD. Result  has 30 states, 30 states have (on average 217.0) internal successors, (6510), 30 states have internal predecessors, (6510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:20:54,795 INFO  L175             Difference]: Start difference. First operand has 186 places, 1230 transitions, 19430 flow. Second operand 29 states and 2342 transitions.
[2023-10-27 12:20:54,795 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 2263 transitions, 37749 flow
[2023-10-27 12:21:02,153 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 2263 transitions, 36923 flow, removed 338 selfloop flow, removed 9 redundant places.
[2023-10-27 12:21:02,186 INFO  L231             Difference]: Finished difference. Result has 219 places, 1626 transitions, 27977 flow
[2023-10-27 12:21:02,187 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=18681, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1230, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=392, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=730, PETRI_DIFFERENCE_SUBTRAHEND_STATES=29, PETRI_FLOW=27977, PETRI_PLACES=219, PETRI_TRANSITIONS=1626}
[2023-10-27 12:21:02,188 INFO  L288   CegarLoopForPetriNet]: 67 programPoint places, 152 predicate places.
[2023-10-27 12:21:02,188 INFO  L495      AbstractCegarLoop]: Abstraction has has 219 places, 1626 transitions, 27977 flow
[2023-10-27 12:21:02,188 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 32 states, 32 states have (on average 68.3125) internal successors, (2186), 32 states have internal predecessors, (2186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:21:02,188 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:21:02,188 INFO  L209   CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1]
[2023-10-27 12:21:02,194 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0
[2023-10-27 12:21:02,393 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,SelfDestructingSolverStorable20
[2023-10-27 12:21:02,393 INFO  L420      AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] ===
[2023-10-27 12:21:02,396 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:21:02,396 INFO  L85        PathProgramCache]: Analyzing trace with hash -2108278345, now seen corresponding path program 1 times
[2023-10-27 12:21:02,397 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-27 12:21:02,398 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33855214]
[2023-10-27 12:21:02,399 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:21:02,399 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-27 12:21:02,442 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-10-27 12:21:02,454 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2023-10-27 12:21:02,480 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-10-27 12:21:02,504 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2023-10-27 12:21:02,511 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2023-10-27 12:21:02,512 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 13 remaining)
[2023-10-27 12:21:02,512 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (11 of 13 remaining)
[2023-10-27 12:21:02,512 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (10 of 13 remaining)
[2023-10-27 12:21:02,512 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (9 of 13 remaining)
[2023-10-27 12:21:02,512 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (8 of 13 remaining)
[2023-10-27 12:21:02,512 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (7 of 13 remaining)
[2023-10-27 12:21:02,513 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (6 of 13 remaining)
[2023-10-27 12:21:02,513 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (5 of 13 remaining)
[2023-10-27 12:21:02,513 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (4 of 13 remaining)
[2023-10-27 12:21:02,513 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 13 remaining)
[2023-10-27 12:21:02,513 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (2 of 13 remaining)
[2023-10-27 12:21:02,513 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 13 remaining)
[2023-10-27 12:21:02,513 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (0 of 13 remaining)
[2023-10-27 12:21:02,513 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21
[2023-10-27 12:21:02,514 INFO  L445         BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-27 12:21:02,515 WARN  L233   ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis
[2023-10-27 12:21:02,515 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances.
[2023-10-27 12:21:02,547 INFO  L144    ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions.
[2023-10-27 12:21:02,556 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 156 places, 155 transitions, 340 flow
[2023-10-27 12:21:02,598 INFO  L130       PetriNetUnfolder]: 21/500 cut-off events.
[2023-10-27 12:21:02,610 INFO  L131       PetriNetUnfolder]: For 19/19 co-relation queries the response was YES.
[2023-10-27 12:21:02,611 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 528 conditions, 500 events. 21/500 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1504 event pairs, 1 based on Foata normal form. 0/432 useless extension candidates. Maximal degree in co-relation 297. Up to 16 conditions per place. 
[2023-10-27 12:21:02,611 INFO  L82        GeneralOperation]: Start removeDead. Operand has 156 places, 155 transitions, 340 flow
[2023-10-27 12:21:02,613 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 156 places, 155 transitions, 340 flow
[2023-10-27 12:21:02,613 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2023-10-27 12:21:02,613 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 156 places, 155 transitions, 340 flow
[2023-10-27 12:21:02,613 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 156 places, 155 transitions, 340 flow
[2023-10-27 12:21:02,613 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 156 places, 155 transitions, 340 flow
[2023-10-27 12:21:02,668 INFO  L130       PetriNetUnfolder]: 21/500 cut-off events.
[2023-10-27 12:21:02,668 INFO  L131       PetriNetUnfolder]: For 19/19 co-relation queries the response was YES.
[2023-10-27 12:21:02,669 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 528 conditions, 500 events. 21/500 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1504 event pairs, 1 based on Foata normal form. 0/432 useless extension candidates. Maximal degree in co-relation 297. Up to 16 conditions per place. 
[2023-10-27 12:21:02,676 INFO  L119        LiptonReduction]: Number of co-enabled transitions 8964
[2023-10-27 12:21:05,640 INFO  L134        LiptonReduction]: Checked pairs total: 51687
[2023-10-27 12:21:05,640 INFO  L136        LiptonReduction]: Total number of compositions: 90
[2023-10-27 12:21:05,641 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-10-27 12:21:05,642 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;@1daed5c8, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2023-10-27 12:21:05,642 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 15 error locations.
[2023-10-27 12:21:05,642 INFO  L130       PetriNetUnfolder]: 0/0 cut-off events.
[2023-10-27 12:21:05,642 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2023-10-27 12:21:05,642 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:21:05,642 INFO  L209   CegarLoopForPetriNet]: trace histogram [1]
[2023-10-27 12:21:05,642 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] ===
[2023-10-27 12:21:05,642 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:21:05,642 INFO  L85        PathProgramCache]: Analyzing trace with hash 881, now seen corresponding path program 1 times
[2023-10-27 12:21:05,642 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-27 12:21:05,643 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122941577]
[2023-10-27 12:21:05,643 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:21:05,643 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-27 12:21:05,645 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:21:05,648 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-27 12:21:05,648 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-27 12:21:05,648 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122941577]
[2023-10-27 12:21:05,651 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122941577] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-27 12:21:05,651 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-27 12:21:05,652 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0
[2023-10-27 12:21:05,652 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132211042]
[2023-10-27 12:21:05,652 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-27 12:21:05,652 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2023-10-27 12:21:05,652 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-27 12:21:05,652 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2023-10-27 12:21:05,653 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2023-10-27 12:21:05,661 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 146 out of 245
[2023-10-27 12:21:05,661 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 76 transitions, 182 flow. Second operand  has 2 states, 2 states have (on average 146.5) internal successors, (293), 2 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:21:05,661 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-27 12:21:05,662 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 245
[2023-10-27 12:21:05,662 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-27 12:21:06,623 INFO  L130       PetriNetUnfolder]: 3680/8504 cut-off events.
[2023-10-27 12:21:06,623 INFO  L131       PetriNetUnfolder]: For 651/1631 co-relation queries the response was YES.
[2023-10-27 12:21:06,632 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 14271 conditions, 8504 events. 3680/8504 cut-off events. For 651/1631 co-relation queries the response was YES. Maximal size of possible extension queue 327. Compared 72254 event pairs, 3637 based on Foata normal form. 0/7834 useless extension candidates. Maximal degree in co-relation 11836. Up to 5535 conditions per place. 
[2023-10-27 12:21:06,656 INFO  L137   encePairwiseOnDemand]: 244/245 looper letters, 28 selfloop transitions, 0 changer transitions 0/75 dead transitions.
[2023-10-27 12:21:06,657 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 75 transitions, 236 flow
[2023-10-27 12:21:06,657 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2023-10-27 12:21:06,657 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2 states.
[2023-10-27 12:21:06,658 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 321 transitions.
[2023-10-27 12:21:06,658 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6551020408163265
[2023-10-27 12:21:06,658 INFO  L72            ComplementDD]: Start complementDD. Operand 2 states and 321 transitions.
[2023-10-27 12:21:06,658 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 2 states and 321 transitions.
[2023-10-27 12:21:06,660 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-27 12:21:06,660 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 321 transitions.
[2023-10-27 12:21:06,661 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 3 states, 2 states have (on average 160.5) internal successors, (321), 2 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:21:06,665 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 3 states, 3 states have (on average 245.0) internal successors, (735), 3 states have internal predecessors, (735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:21:06,666 INFO  L81            ComplementDD]: Finished complementDD. Result  has 3 states, 3 states have (on average 245.0) internal successors, (735), 3 states have internal predecessors, (735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:21:06,666 INFO  L175             Difference]: Start difference. First operand has 80 places, 76 transitions, 182 flow. Second operand 2 states and 321 transitions.
[2023-10-27 12:21:06,666 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 75 transitions, 236 flow
[2023-10-27 12:21:06,685 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 75 transitions, 236 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-10-27 12:21:06,686 INFO  L231             Difference]: Finished difference. Result has 80 places, 75 transitions, 180 flow
[2023-10-27 12:21:06,686 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=180, PETRI_PLACES=80, PETRI_TRANSITIONS=75}
[2023-10-27 12:21:06,686 INFO  L288   CegarLoopForPetriNet]: 80 programPoint places, 0 predicate places.
[2023-10-27 12:21:06,687 INFO  L495      AbstractCegarLoop]: Abstraction has has 80 places, 75 transitions, 180 flow
[2023-10-27 12:21:06,687 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 146.5) internal successors, (293), 2 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:21:06,687 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:21:06,687 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2023-10-27 12:21:06,687 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22
[2023-10-27 12:21:06,687 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] ===
[2023-10-27 12:21:06,687 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:21:06,688 INFO  L85        PathProgramCache]: Analyzing trace with hash 847683071, now seen corresponding path program 1 times
[2023-10-27 12:21:06,688 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-27 12:21:06,688 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372208726]
[2023-10-27 12:21:06,688 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:21:06,688 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-27 12:21:06,694 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:21:06,862 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-27 12:21:06,863 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-27 12:21:06,863 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372208726]
[2023-10-27 12:21:06,863 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372208726] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-27 12:21:06,863 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-27 12:21:06,863 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-10-27 12:21:06,863 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156703835]
[2023-10-27 12:21:06,863 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-27 12:21:06,864 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-10-27 12:21:06,864 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-27 12:21:06,864 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-10-27 12:21:06,864 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-10-27 12:21:07,114 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 113 out of 245
[2023-10-27 12:21:07,115 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 75 transitions, 180 flow. Second operand  has 6 states, 6 states have (on average 114.16666666666667) internal successors, (685), 6 states have internal predecessors, (685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:21:07,115 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-27 12:21:07,115 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 245
[2023-10-27 12:21:07,115 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-27 12:21:15,967 INFO  L130       PetriNetUnfolder]: 75663/120904 cut-off events.
[2023-10-27 12:21:15,968 INFO  L131       PetriNetUnfolder]: For 3763/4244 co-relation queries the response was YES.
[2023-10-27 12:21:16,149 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 231350 conditions, 120904 events. 75663/120904 cut-off events. For 3763/4244 co-relation queries the response was YES. Maximal size of possible extension queue 2764. Compared 1003932 event pairs, 19231 based on Foata normal form. 157/116594 useless extension candidates. Maximal degree in co-relation 231344. Up to 73144 conditions per place. 
[2023-10-27 12:21:16,530 INFO  L137   encePairwiseOnDemand]: 214/245 looper letters, 111 selfloop transitions, 64 changer transitions 0/196 dead transitions.
[2023-10-27 12:21:16,530 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 196 transitions, 793 flow
[2023-10-27 12:21:16,530 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-10-27 12:21:16,531 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-10-27 12:21:16,531 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 856 transitions.
[2023-10-27 12:21:16,531 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.582312925170068
[2023-10-27 12:21:16,531 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 856 transitions.
[2023-10-27 12:21:16,532 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 856 transitions.
[2023-10-27 12:21:16,539 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-27 12:21:16,539 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 856 transitions.
[2023-10-27 12:21:16,540 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 142.66666666666666) internal successors, (856), 6 states have internal predecessors, (856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:21:16,541 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 245.0) internal successors, (1715), 7 states have internal predecessors, (1715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:21:16,541 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 245.0) internal successors, (1715), 7 states have internal predecessors, (1715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:21:16,541 INFO  L175             Difference]: Start difference. First operand has 80 places, 75 transitions, 180 flow. Second operand 6 states and 856 transitions.
[2023-10-27 12:21:16,541 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 196 transitions, 793 flow
[2023-10-27 12:21:16,546 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 196 transitions, 793 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-10-27 12:21:16,547 INFO  L231             Difference]: Finished difference. Result has 90 places, 139 transitions, 626 flow
[2023-10-27 12:21:16,555 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=626, PETRI_PLACES=90, PETRI_TRANSITIONS=139}
[2023-10-27 12:21:16,555 INFO  L288   CegarLoopForPetriNet]: 80 programPoint places, 10 predicate places.
[2023-10-27 12:21:16,556 INFO  L495      AbstractCegarLoop]: Abstraction has has 90 places, 139 transitions, 626 flow
[2023-10-27 12:21:16,556 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 114.16666666666667) internal successors, (685), 6 states have internal predecessors, (685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:21:16,556 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:21:16,556 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-27 12:21:16,556 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23
[2023-10-27 12:21:16,556 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] ===
[2023-10-27 12:21:16,557 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:21:16,557 INFO  L85        PathProgramCache]: Analyzing trace with hash -309025520, now seen corresponding path program 1 times
[2023-10-27 12:21:16,557 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-27 12:21:16,557 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660770110]
[2023-10-27 12:21:16,557 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:21:16,557 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-27 12:21:16,590 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:21:16,599 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-27 12:21:16,599 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-27 12:21:16,599 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660770110]
[2023-10-27 12:21:16,599 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660770110] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-27 12:21:16,600 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-27 12:21:16,600 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-10-27 12:21:16,600 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446978696]
[2023-10-27 12:21:16,600 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-27 12:21:16,600 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-10-27 12:21:16,600 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-27 12:21:16,601 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-10-27 12:21:16,601 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-10-27 12:21:16,623 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 133 out of 245
[2023-10-27 12:21:16,623 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 139 transitions, 626 flow. Second operand  has 3 states, 3 states have (on average 135.0) internal successors, (405), 3 states have internal predecessors, (405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:21:16,623 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-27 12:21:16,623 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 245
[2023-10-27 12:21:16,624 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-27 12:21:20,279 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([831] L1016-9-->threadEXIT: Formula: (let ((.cse0 (select |v_#race_181| v_~datas~0.base_125)) (.cse1 (* v_threadThread1of3ForFork0_~i~0_27 4))) (and (= |v_threadThread1of3ForFork0_#t~nondet4_26| (select .cse0 (+ .cse1 v_~datas~0.offset_111))) (= |v_threadThread1of3ForFork0_#res.base_9| 0) (= (select .cse0 (+ .cse1 2 v_~datas~0.offset_111)) |v_threadThread1of3ForFork0_#t~nondet4_26|) (= (select .cse0 (+ .cse1 1 v_~datas~0.offset_111)) |v_threadThread1of3ForFork0_#t~nondet4_26|) (= 0 |v_threadThread1of3ForFork0_#res.offset_9|) (= |v_threadThread1of3ForFork0_#t~nondet4_26| (select .cse0 (+ .cse1 3 v_~datas~0.offset_111)))))  InVars {#race=|v_#race_181|, threadThread1of3ForFork0_#t~nondet4=|v_threadThread1of3ForFork0_#t~nondet4_26|, ~datas~0.base=v_~datas~0.base_125, ~datas~0.offset=v_~datas~0.offset_111, threadThread1of3ForFork0_~i~0=v_threadThread1of3ForFork0_~i~0_27}  OutVars{threadThread1of3ForFork0_#t~nondet3=|v_threadThread1of3ForFork0_#t~nondet3_13|, #race=|v_#race_181|, threadThread1of3ForFork0_#res.base=|v_threadThread1of3ForFork0_#res.base_9|, ~datas~0.base=v_~datas~0.base_125, threadThread1of3ForFork0_#res.offset=|v_threadThread1of3ForFork0_#res.offset_9|, ~datas~0.offset=v_~datas~0.offset_111, threadThread1of3ForFork0_~i~0=v_threadThread1of3ForFork0_~i~0_27}  AuxVars[]  AssignedVars[threadThread1of3ForFork0_#t~nondet3, threadThread1of3ForFork0_#t~nondet4, threadThread1of3ForFork0_#res.base, threadThread1of3ForFork0_#res.offset][58], [120#L1016-3true, 83#threadEXITtrue, 2#ULTIMATE.startEXITtrue, 162#true, Black: 164#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 165#(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)), 159#true, 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|) (+ 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)), 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| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, 176#(= |#race~datas~0| 0), 126#L1016-1true, threadThread3of3ForFork0InUse])
[2023-10-27 12:21:20,280 INFO  L383   tUnfolder$Statistics]: this new event has 51 ancestors and is cut-off event
[2023-10-27 12:21:20,280 INFO  L386   tUnfolder$Statistics]:   existing Event has 51 ancestors and is cut-off event
[2023-10-27 12:21:20,280 INFO  L386   tUnfolder$Statistics]:   existing Event has 51 ancestors and is cut-off event
[2023-10-27 12:21:20,280 INFO  L386   tUnfolder$Statistics]:   existing Event has 51 ancestors and is cut-off event
[2023-10-27 12:21:20,280 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([831] L1016-9-->threadEXIT: Formula: (let ((.cse0 (select |v_#race_181| v_~datas~0.base_125)) (.cse1 (* v_threadThread1of3ForFork0_~i~0_27 4))) (and (= |v_threadThread1of3ForFork0_#t~nondet4_26| (select .cse0 (+ .cse1 v_~datas~0.offset_111))) (= |v_threadThread1of3ForFork0_#res.base_9| 0) (= (select .cse0 (+ .cse1 2 v_~datas~0.offset_111)) |v_threadThread1of3ForFork0_#t~nondet4_26|) (= (select .cse0 (+ .cse1 1 v_~datas~0.offset_111)) |v_threadThread1of3ForFork0_#t~nondet4_26|) (= 0 |v_threadThread1of3ForFork0_#res.offset_9|) (= |v_threadThread1of3ForFork0_#t~nondet4_26| (select .cse0 (+ .cse1 3 v_~datas~0.offset_111)))))  InVars {#race=|v_#race_181|, threadThread1of3ForFork0_#t~nondet4=|v_threadThread1of3ForFork0_#t~nondet4_26|, ~datas~0.base=v_~datas~0.base_125, ~datas~0.offset=v_~datas~0.offset_111, threadThread1of3ForFork0_~i~0=v_threadThread1of3ForFork0_~i~0_27}  OutVars{threadThread1of3ForFork0_#t~nondet3=|v_threadThread1of3ForFork0_#t~nondet3_13|, #race=|v_#race_181|, threadThread1of3ForFork0_#res.base=|v_threadThread1of3ForFork0_#res.base_9|, ~datas~0.base=v_~datas~0.base_125, threadThread1of3ForFork0_#res.offset=|v_threadThread1of3ForFork0_#res.offset_9|, ~datas~0.offset=v_~datas~0.offset_111, threadThread1of3ForFork0_~i~0=v_threadThread1of3ForFork0_~i~0_27}  AuxVars[]  AssignedVars[threadThread1of3ForFork0_#t~nondet3, threadThread1of3ForFork0_#t~nondet4, threadThread1of3ForFork0_#res.base, threadThread1of3ForFork0_#res.offset][58], [83#threadEXITtrue, 2#ULTIMATE.startEXITtrue, 162#true, 79#L1016-3true, 47#L1016-1true, Black: 164#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 165#(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)), 159#true, 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|) (+ 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)), 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| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, 176#(= |#race~datas~0| 0), threadThread3of3ForFork0InUse])
[2023-10-27 12:21:20,280 INFO  L383   tUnfolder$Statistics]: this new event has 51 ancestors and is cut-off event
[2023-10-27 12:21:20,281 INFO  L386   tUnfolder$Statistics]:   existing Event has 51 ancestors and is cut-off event
[2023-10-27 12:21:20,281 INFO  L386   tUnfolder$Statistics]:   existing Event has 51 ancestors and is cut-off event
[2023-10-27 12:21:20,281 INFO  L386   tUnfolder$Statistics]:   existing Event has 51 ancestors and is cut-off event
[2023-10-27 12:21:20,647 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([831] L1016-9-->threadEXIT: Formula: (let ((.cse0 (select |v_#race_181| v_~datas~0.base_125)) (.cse1 (* v_threadThread1of3ForFork0_~i~0_27 4))) (and (= |v_threadThread1of3ForFork0_#t~nondet4_26| (select .cse0 (+ .cse1 v_~datas~0.offset_111))) (= |v_threadThread1of3ForFork0_#res.base_9| 0) (= (select .cse0 (+ .cse1 2 v_~datas~0.offset_111)) |v_threadThread1of3ForFork0_#t~nondet4_26|) (= (select .cse0 (+ .cse1 1 v_~datas~0.offset_111)) |v_threadThread1of3ForFork0_#t~nondet4_26|) (= 0 |v_threadThread1of3ForFork0_#res.offset_9|) (= |v_threadThread1of3ForFork0_#t~nondet4_26| (select .cse0 (+ .cse1 3 v_~datas~0.offset_111)))))  InVars {#race=|v_#race_181|, threadThread1of3ForFork0_#t~nondet4=|v_threadThread1of3ForFork0_#t~nondet4_26|, ~datas~0.base=v_~datas~0.base_125, ~datas~0.offset=v_~datas~0.offset_111, threadThread1of3ForFork0_~i~0=v_threadThread1of3ForFork0_~i~0_27}  OutVars{threadThread1of3ForFork0_#t~nondet3=|v_threadThread1of3ForFork0_#t~nondet3_13|, #race=|v_#race_181|, threadThread1of3ForFork0_#res.base=|v_threadThread1of3ForFork0_#res.base_9|, ~datas~0.base=v_~datas~0.base_125, threadThread1of3ForFork0_#res.offset=|v_threadThread1of3ForFork0_#res.offset_9|, ~datas~0.offset=v_~datas~0.offset_111, threadThread1of3ForFork0_~i~0=v_threadThread1of3ForFork0_~i~0_27}  AuxVars[]  AssignedVars[threadThread1of3ForFork0_#t~nondet3, threadThread1of3ForFork0_#t~nondet4, threadThread1of3ForFork0_#res.base, threadThread1of3ForFork0_#res.offset][58], [120#L1016-3true, 83#threadEXITtrue, 2#ULTIMATE.startEXITtrue, 162#true, 79#L1016-3true, Black: 164#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 165#(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)), 159#true, 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|) (+ 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)), 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| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, 176#(= |#race~datas~0| 0), threadThread3of3ForFork0InUse])
[2023-10-27 12:21:20,647 INFO  L383   tUnfolder$Statistics]: this new event has 52 ancestors and is cut-off event
[2023-10-27 12:21:20,648 INFO  L386   tUnfolder$Statistics]:   existing Event has 52 ancestors and is cut-off event
[2023-10-27 12:21:20,648 INFO  L386   tUnfolder$Statistics]:   existing Event has 52 ancestors and is cut-off event
[2023-10-27 12:21:20,648 INFO  L386   tUnfolder$Statistics]:   existing Event has 52 ancestors and is cut-off event
[2023-10-27 12:21:20,648 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([789] L1016-4-->L1016-6: Formula: (= (store |v_#race_176| v_~datas~0.base_115 (store (select |v_#race_176| v_~datas~0.base_115) (+ (* v_threadThread2of3ForFork0_~i~0_21 4) v_~datas~0.offset_103) |v_threadThread2of3ForFork0_#t~nondet4_21|)) |v_#race_175|)  InVars {#race=|v_#race_176|, ~datas~0.base=v_~datas~0.base_115, ~datas~0.offset=v_~datas~0.offset_103, threadThread2of3ForFork0_~i~0=v_threadThread2of3ForFork0_~i~0_21}  OutVars{#race=|v_#race_175|, threadThread2of3ForFork0_#t~nondet4=|v_threadThread2of3ForFork0_#t~nondet4_21|, ~datas~0.base=v_~datas~0.base_115, ~datas~0.offset=v_~datas~0.offset_103, threadThread2of3ForFork0_~i~0=v_threadThread2of3ForFork0_~i~0_21}  AuxVars[]  AssignedVars[#race, threadThread2of3ForFork0_#t~nondet4][92], [37#L1016-9true, 162#true, 2#ULTIMATE.startEXITtrue, Black: 164#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 165#(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)), 159#true, 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|) (+ 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)), 95#L1016-6true, 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| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, 176#(= |#race~datas~0| 0), 126#L1016-1true, threadThread3of3ForFork0InUse])
[2023-10-27 12:21:20,648 INFO  L383   tUnfolder$Statistics]: this new event has 52 ancestors and is cut-off event
[2023-10-27 12:21:20,649 INFO  L386   tUnfolder$Statistics]:   existing Event has 52 ancestors and is cut-off event
[2023-10-27 12:21:20,649 INFO  L386   tUnfolder$Statistics]:   existing Event has 52 ancestors and is cut-off event
[2023-10-27 12:21:20,649 INFO  L386   tUnfolder$Statistics]:   existing Event has 52 ancestors and is cut-off event
[2023-10-27 12:21:20,649 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([763] L1016-4-->L1016-6: Formula: (= |v_#race_161| (store |v_#race_162| v_~datas~0.base_105 (store (select |v_#race_162| v_~datas~0.base_105) (+ v_~datas~0.offset_93 (* v_threadThread3of3ForFork0_~i~0_19 4)) |v_threadThread3of3ForFork0_#t~nondet4_19|)))  InVars {#race=|v_#race_162|, ~datas~0.base=v_~datas~0.base_105, ~datas~0.offset=v_~datas~0.offset_93, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_19}  OutVars{#race=|v_#race_161|, ~datas~0.base=v_~datas~0.base_105, ~datas~0.offset=v_~datas~0.offset_93, threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_19|, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_19}  AuxVars[]  AssignedVars[#race, threadThread3of3ForFork0_#t~nondet4][126], [37#L1016-9true, 162#true, 2#ULTIMATE.startEXITtrue, 47#L1016-1true, Black: 164#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 165#(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)), 159#true, 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|) (+ 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)), 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| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), 51#L1016-6true, threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, 176#(= |#race~datas~0| 0), threadThread3of3ForFork0InUse])
[2023-10-27 12:21:20,649 INFO  L383   tUnfolder$Statistics]: this new event has 52 ancestors and is cut-off event
[2023-10-27 12:21:20,649 INFO  L386   tUnfolder$Statistics]:   existing Event has 52 ancestors and is cut-off event
[2023-10-27 12:21:20,650 INFO  L386   tUnfolder$Statistics]:   existing Event has 52 ancestors and is cut-off event
[2023-10-27 12:21:20,650 INFO  L386   tUnfolder$Statistics]:   existing Event has 52 ancestors and is cut-off event
[2023-10-27 12:21:20,923 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([789] L1016-4-->L1016-6: Formula: (= (store |v_#race_176| v_~datas~0.base_115 (store (select |v_#race_176| v_~datas~0.base_115) (+ (* v_threadThread2of3ForFork0_~i~0_21 4) v_~datas~0.offset_103) |v_threadThread2of3ForFork0_#t~nondet4_21|)) |v_#race_175|)  InVars {#race=|v_#race_176|, ~datas~0.base=v_~datas~0.base_115, ~datas~0.offset=v_~datas~0.offset_103, threadThread2of3ForFork0_~i~0=v_threadThread2of3ForFork0_~i~0_21}  OutVars{#race=|v_#race_175|, threadThread2of3ForFork0_#t~nondet4=|v_threadThread2of3ForFork0_#t~nondet4_21|, ~datas~0.base=v_~datas~0.base_115, ~datas~0.offset=v_~datas~0.offset_103, threadThread2of3ForFork0_~i~0=v_threadThread2of3ForFork0_~i~0_21}  AuxVars[]  AssignedVars[#race, threadThread2of3ForFork0_#t~nondet4][92], [37#L1016-9true, 162#true, 2#ULTIMATE.startEXITtrue, 79#L1016-3true, Black: 164#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 165#(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)), 159#true, 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|) (+ 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)), 95#L1016-6true, 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| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, 176#(= |#race~datas~0| 0), threadThread3of3ForFork0InUse])
[2023-10-27 12:21:20,923 INFO  L383   tUnfolder$Statistics]: this new event has 53 ancestors and is cut-off event
[2023-10-27 12:21:20,924 INFO  L386   tUnfolder$Statistics]:   existing Event has 53 ancestors and is cut-off event
[2023-10-27 12:21:20,924 INFO  L386   tUnfolder$Statistics]:   existing Event has 53 ancestors and is cut-off event
[2023-10-27 12:21:20,924 INFO  L386   tUnfolder$Statistics]:   existing Event has 53 ancestors and is cut-off event
[2023-10-27 12:21:20,924 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([763] L1016-4-->L1016-6: Formula: (= |v_#race_161| (store |v_#race_162| v_~datas~0.base_105 (store (select |v_#race_162| v_~datas~0.base_105) (+ v_~datas~0.offset_93 (* v_threadThread3of3ForFork0_~i~0_19 4)) |v_threadThread3of3ForFork0_#t~nondet4_19|)))  InVars {#race=|v_#race_162|, ~datas~0.base=v_~datas~0.base_105, ~datas~0.offset=v_~datas~0.offset_93, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_19}  OutVars{#race=|v_#race_161|, ~datas~0.base=v_~datas~0.base_105, ~datas~0.offset=v_~datas~0.offset_93, threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_19|, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_19}  AuxVars[]  AssignedVars[#race, threadThread3of3ForFork0_#t~nondet4][126], [120#L1016-3true, 37#L1016-9true, 162#true, 2#ULTIMATE.startEXITtrue, Black: 164#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 165#(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)), 159#true, 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|) (+ 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)), 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| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), 51#L1016-6true, threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, 176#(= |#race~datas~0| 0), threadThread3of3ForFork0InUse])
[2023-10-27 12:21:20,924 INFO  L383   tUnfolder$Statistics]: this new event has 53 ancestors and is cut-off event
[2023-10-27 12:21:20,924 INFO  L386   tUnfolder$Statistics]:   existing Event has 53 ancestors and is cut-off event
[2023-10-27 12:21:20,924 INFO  L386   tUnfolder$Statistics]:   existing Event has 53 ancestors and is cut-off event
[2023-10-27 12:21:20,924 INFO  L386   tUnfolder$Statistics]:   existing Event has 53 ancestors and is cut-off event
[2023-10-27 12:21:22,932 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([834] L1016-9-->threadEXIT: Formula: (let ((.cse0 (select |v_#race_183| v_~datas~0.base_131)) (.cse1 (* v_threadThread3of3ForFork0_~i~0_27 4))) (and (= 0 |v_threadThread3of3ForFork0_#res.offset_9|) (= |v_threadThread3of3ForFork0_#t~nondet4_28| (select .cse0 (+ .cse1 2 v_~datas~0.offset_115))) (= |v_threadThread3of3ForFork0_#t~nondet4_28| (select .cse0 (+ .cse1 3 v_~datas~0.offset_115))) (= |v_threadThread3of3ForFork0_#t~nondet4_28| (select .cse0 (+ .cse1 v_~datas~0.offset_115))) (= |v_threadThread3of3ForFork0_#res.base_9| 0) (= |v_threadThread3of3ForFork0_#t~nondet4_28| (select .cse0 (+ .cse1 1 v_~datas~0.offset_115)))))  InVars {#race=|v_#race_183|, ~datas~0.base=v_~datas~0.base_131, ~datas~0.offset=v_~datas~0.offset_115, threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_28|, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_27}  OutVars{#race=|v_#race_183|, ~datas~0.base=v_~datas~0.base_131, ~datas~0.offset=v_~datas~0.offset_115, threadThread3of3ForFork0_#res.base=|v_threadThread3of3ForFork0_#res.base_9|, threadThread3of3ForFork0_#res.offset=|v_threadThread3of3ForFork0_#res.offset_9|, threadThread3of3ForFork0_#t~nondet3=|v_threadThread3of3ForFork0_#t~nondet3_13|, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_27}  AuxVars[]  AssignedVars[threadThread3of3ForFork0_#res.base, threadThread3of3ForFork0_#res.offset, threadThread3of3ForFork0_#t~nondet4, threadThread3of3ForFork0_#t~nondet3][128], [83#threadEXITtrue, 162#true, 80#L1028-1true, 6#threadEXITtrue, Black: 164#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 165#(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)), 159#true, 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|) (+ 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)), 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| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), threadThread1of3ForFork0InUse, threadThread2of3ForFork0NotInUse, 176#(= |#race~datas~0| 0), threadThread3of3ForFork0InUse])
[2023-10-27 12:21:22,933 INFO  L383   tUnfolder$Statistics]: this new event has 72 ancestors and is cut-off event
[2023-10-27 12:21:22,933 INFO  L386   tUnfolder$Statistics]:   existing Event has 72 ancestors and is cut-off event
[2023-10-27 12:21:22,933 INFO  L386   tUnfolder$Statistics]:   existing Event has 72 ancestors and is cut-off event
[2023-10-27 12:21:22,933 INFO  L386   tUnfolder$Statistics]:   existing Event has 72 ancestors and is cut-off event
[2023-10-27 12:21:22,933 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([834] L1016-9-->threadEXIT: Formula: (let ((.cse0 (select |v_#race_183| v_~datas~0.base_131)) (.cse1 (* v_threadThread3of3ForFork0_~i~0_27 4))) (and (= 0 |v_threadThread3of3ForFork0_#res.offset_9|) (= |v_threadThread3of3ForFork0_#t~nondet4_28| (select .cse0 (+ .cse1 2 v_~datas~0.offset_115))) (= |v_threadThread3of3ForFork0_#t~nondet4_28| (select .cse0 (+ .cse1 3 v_~datas~0.offset_115))) (= |v_threadThread3of3ForFork0_#t~nondet4_28| (select .cse0 (+ .cse1 v_~datas~0.offset_115))) (= |v_threadThread3of3ForFork0_#res.base_9| 0) (= |v_threadThread3of3ForFork0_#t~nondet4_28| (select .cse0 (+ .cse1 1 v_~datas~0.offset_115)))))  InVars {#race=|v_#race_183|, ~datas~0.base=v_~datas~0.base_131, ~datas~0.offset=v_~datas~0.offset_115, threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_28|, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_27}  OutVars{#race=|v_#race_183|, ~datas~0.base=v_~datas~0.base_131, ~datas~0.offset=v_~datas~0.offset_115, threadThread3of3ForFork0_#res.base=|v_threadThread3of3ForFork0_#res.base_9|, threadThread3of3ForFork0_#res.offset=|v_threadThread3of3ForFork0_#res.offset_9|, threadThread3of3ForFork0_#t~nondet3=|v_threadThread3of3ForFork0_#t~nondet3_13|, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_27}  AuxVars[]  AssignedVars[threadThread3of3ForFork0_#res.base, threadThread3of3ForFork0_#res.offset, threadThread3of3ForFork0_#t~nondet4, threadThread3of3ForFork0_#t~nondet3][128], [83#threadEXITtrue, 162#true, 6#threadEXITtrue, Black: 164#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 165#(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)), 159#true, 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|) (+ 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)), 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| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), threadThread1of3ForFork0InUse, threadThread2of3ForFork0NotInUse, 176#(= |#race~datas~0| 0), threadThread3of3ForFork0InUse, 92#L1030true])
[2023-10-27 12:21:22,933 INFO  L383   tUnfolder$Statistics]: this new event has 72 ancestors and is cut-off event
[2023-10-27 12:21:22,933 INFO  L386   tUnfolder$Statistics]:   existing Event has 72 ancestors and is cut-off event
[2023-10-27 12:21:22,933 INFO  L386   tUnfolder$Statistics]:   existing Event has 72 ancestors and is cut-off event
[2023-10-27 12:21:22,934 INFO  L386   tUnfolder$Statistics]:   existing Event has 72 ancestors and is cut-off event
[2023-10-27 12:21:23,220 INFO  L130       PetriNetUnfolder]: 36197/69251 cut-off events.
[2023-10-27 12:21:23,220 INFO  L131       PetriNetUnfolder]: For 38254/44798 co-relation queries the response was YES.
[2023-10-27 12:21:23,397 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 166379 conditions, 69251 events. 36197/69251 cut-off events. For 38254/44798 co-relation queries the response was YES. Maximal size of possible extension queue 2423. Compared 691296 event pairs, 15592 based on Foata normal form. 967/64854 useless extension candidates. Maximal degree in co-relation 166368. Up to 32701 conditions per place. 
[2023-10-27 12:21:23,636 INFO  L137   encePairwiseOnDemand]: 237/245 looper letters, 50 selfloop transitions, 4 changer transitions 0/147 dead transitions.
[2023-10-27 12:21:23,636 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 147 transitions, 764 flow
[2023-10-27 12:21:23,636 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-10-27 12:21:23,637 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-10-27 12:21:23,637 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 443 transitions.
[2023-10-27 12:21:23,637 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6027210884353742
[2023-10-27 12:21:23,637 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 443 transitions.
[2023-10-27 12:21:23,637 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 443 transitions.
[2023-10-27 12:21:23,637 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-27 12:21:23,638 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 443 transitions.
[2023-10-27 12:21:23,638 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 147.66666666666666) internal successors, (443), 3 states have internal predecessors, (443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:21:23,639 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 245.0) internal successors, (980), 4 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:21:23,639 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 245.0) internal successors, (980), 4 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:21:23,639 INFO  L175             Difference]: Start difference. First operand has 90 places, 139 transitions, 626 flow. Second operand 3 states and 443 transitions.
[2023-10-27 12:21:23,639 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 147 transitions, 764 flow
[2023-10-27 12:21:24,337 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 147 transitions, 764 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-10-27 12:21:24,338 INFO  L231             Difference]: Finished difference. Result has 89 places, 139 transitions, 646 flow
[2023-10-27 12:21:24,338 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=618, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=646, PETRI_PLACES=89, PETRI_TRANSITIONS=139}
[2023-10-27 12:21:24,339 INFO  L288   CegarLoopForPetriNet]: 80 programPoint places, 9 predicate places.
[2023-10-27 12:21:24,339 INFO  L495      AbstractCegarLoop]: Abstraction has has 89 places, 139 transitions, 646 flow
[2023-10-27 12:21:24,340 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 135.0) internal successors, (405), 3 states have internal predecessors, (405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:21:24,340 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:21:24,340 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-27 12:21:24,340 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24
[2023-10-27 12:21:24,340 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] ===
[2023-10-27 12:21:24,340 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:21:24,341 INFO  L85        PathProgramCache]: Analyzing trace with hash 871548223, now seen corresponding path program 1 times
[2023-10-27 12:21:24,341 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-27 12:21:24,341 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436641856]
[2023-10-27 12:21:24,341 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:21:24,341 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-27 12:21:24,356 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:21:24,585 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-27 12:21:24,586 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-27 12:21:24,586 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436641856]
[2023-10-27 12:21:24,586 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436641856] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-27 12:21:24,586 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-27 12:21:24,586 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-10-27 12:21:24,586 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164445003]
[2023-10-27 12:21:24,587 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-27 12:21:24,587 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-10-27 12:21:24,588 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-27 12:21:24,588 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-10-27 12:21:24,588 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-10-27 12:21:24,850 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 123 out of 245
[2023-10-27 12:21:24,851 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 139 transitions, 646 flow. Second operand  has 6 states, 6 states have (on average 124.33333333333333) internal successors, (746), 6 states have internal predecessors, (746), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:21:24,851 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-27 12:21:24,851 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 245
[2023-10-27 12:21:24,851 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-27 12:21:38,862 INFO  L130       PetriNetUnfolder]: 78201/123586 cut-off events.
[2023-10-27 12:21:38,862 INFO  L131       PetriNetUnfolder]: For 93941/95137 co-relation queries the response was YES.
[2023-10-27 12:21:39,185 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 340505 conditions, 123586 events. 78201/123586 cut-off events. For 93941/95137 co-relation queries the response was YES. Maximal size of possible extension queue 2848. Compared 1012760 event pairs, 27187 based on Foata normal form. 0/117879 useless extension candidates. Maximal degree in co-relation 340493. Up to 88234 conditions per place. 
[2023-10-27 12:21:39,635 INFO  L137   encePairwiseOnDemand]: 226/245 looper letters, 148 selfloop transitions, 102 changer transitions 0/291 dead transitions.
[2023-10-27 12:21:39,635 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 291 transitions, 1807 flow
[2023-10-27 12:21:39,635 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-10-27 12:21:39,636 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-10-27 12:21:39,636 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 875 transitions.
[2023-10-27 12:21:39,636 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5952380952380952
[2023-10-27 12:21:39,636 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 875 transitions.
[2023-10-27 12:21:39,637 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 875 transitions.
[2023-10-27 12:21:39,643 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-27 12:21:39,643 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 875 transitions.
[2023-10-27 12:21:39,644 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 145.83333333333334) internal successors, (875), 6 states have internal predecessors, (875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:21:39,645 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 245.0) internal successors, (1715), 7 states have internal predecessors, (1715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:21:39,661 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 245.0) internal successors, (1715), 7 states have internal predecessors, (1715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:21:39,661 INFO  L175             Difference]: Start difference. First operand has 89 places, 139 transitions, 646 flow. Second operand 6 states and 875 transitions.
[2023-10-27 12:21:39,661 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 291 transitions, 1807 flow
[2023-10-27 12:21:40,010 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 291 transitions, 1807 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-10-27 12:21:40,013 INFO  L231             Difference]: Finished difference. Result has 99 places, 240 transitions, 1604 flow
[2023-10-27 12:21:40,013 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=646, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1604, PETRI_PLACES=99, PETRI_TRANSITIONS=240}
[2023-10-27 12:21:40,017 INFO  L288   CegarLoopForPetriNet]: 80 programPoint places, 19 predicate places.
[2023-10-27 12:21:40,017 INFO  L495      AbstractCegarLoop]: Abstraction has has 99 places, 240 transitions, 1604 flow
[2023-10-27 12:21:40,018 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 124.33333333333333) internal successors, (746), 6 states have internal predecessors, (746), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:21:40,018 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:21:40,018 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-27 12:21:40,018 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25
[2023-10-27 12:21:40,018 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] ===
[2023-10-27 12:21:40,018 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:21:40,019 INFO  L85        PathProgramCache]: Analyzing trace with hash 1259099398, now seen corresponding path program 1 times
[2023-10-27 12:21:40,019 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-27 12:21:40,019 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953833103]
[2023-10-27 12:21:40,019 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:21:40,019 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-27 12:21:40,049 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:21:40,279 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-27 12:21:40,280 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-27 12:21:40,280 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953833103]
[2023-10-27 12:21:40,280 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953833103] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-27 12:21:40,280 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-27 12:21:40,280 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-10-27 12:21:40,281 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692342018]
[2023-10-27 12:21:40,281 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-27 12:21:40,281 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-10-27 12:21:40,282 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-27 12:21:40,282 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-10-27 12:21:40,282 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-10-27 12:21:40,556 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 111 out of 245
[2023-10-27 12:21:40,557 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 240 transitions, 1604 flow. Second operand  has 6 states, 6 states have (on average 113.33333333333333) internal successors, (680), 6 states have internal predecessors, (680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:21:40,557 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-27 12:21:40,557 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 245
[2023-10-27 12:21:40,557 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-27 12:22:11,650 INFO  L130       PetriNetUnfolder]: 165587/252270 cut-off events.
[2023-10-27 12:22:11,650 INFO  L131       PetriNetUnfolder]: For 287960/290697 co-relation queries the response was YES.
[2023-10-27 12:22:12,510 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 817394 conditions, 252270 events. 165587/252270 cut-off events. For 287960/290697 co-relation queries the response was YES. Maximal size of possible extension queue 5144. Compared 2087933 event pairs, 47460 based on Foata normal form. 0/237885 useless extension candidates. Maximal degree in co-relation 817377. Up to 165386 conditions per place. 
[2023-10-27 12:22:13,550 INFO  L137   encePairwiseOnDemand]: 215/245 looper letters, 334 selfloop transitions, 162 changer transitions 0/517 dead transitions.
[2023-10-27 12:22:13,551 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 517 transitions, 4078 flow
[2023-10-27 12:22:13,551 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-10-27 12:22:13,551 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-10-27 12:22:13,552 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 906 transitions.
[2023-10-27 12:22:13,552 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6163265306122448
[2023-10-27 12:22:13,552 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 906 transitions.
[2023-10-27 12:22:13,552 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 906 transitions.
[2023-10-27 12:22:13,553 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-27 12:22:13,560 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 906 transitions.
[2023-10-27 12:22:13,561 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 151.0) internal successors, (906), 6 states have internal predecessors, (906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:22:13,562 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 245.0) internal successors, (1715), 7 states have internal predecessors, (1715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:22:13,562 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 245.0) internal successors, (1715), 7 states have internal predecessors, (1715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:22:13,562 INFO  L175             Difference]: Start difference. First operand has 99 places, 240 transitions, 1604 flow. Second operand 6 states and 906 transitions.
[2023-10-27 12:22:13,562 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 517 transitions, 4078 flow
[2023-10-27 12:22:15,909 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 517 transitions, 4078 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-10-27 12:22:15,921 INFO  L231             Difference]: Finished difference. Result has 108 places, 395 transitions, 3161 flow
[2023-10-27 12:22:15,922 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=1604, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=240, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=174, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3161, PETRI_PLACES=108, PETRI_TRANSITIONS=395}
[2023-10-27 12:22:15,922 INFO  L288   CegarLoopForPetriNet]: 80 programPoint places, 28 predicate places.
[2023-10-27 12:22:15,927 INFO  L495      AbstractCegarLoop]: Abstraction has has 108 places, 395 transitions, 3161 flow
[2023-10-27 12:22:15,928 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 113.33333333333333) internal successors, (680), 6 states have internal predecessors, (680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:22:15,928 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:22:15,928 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-27 12:22:15,928 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26
[2023-10-27 12:22:15,928 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] ===
[2023-10-27 12:22:15,928 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:22:15,929 INFO  L85        PathProgramCache]: Analyzing trace with hash -610559931, now seen corresponding path program 1 times
[2023-10-27 12:22:15,929 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-27 12:22:15,929 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46880437]
[2023-10-27 12:22:15,929 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:22:15,931 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-27 12:22:15,951 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:22:16,307 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2023-10-27 12:22:16,307 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-27 12:22:16,307 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46880437]
[2023-10-27 12:22:16,307 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46880437] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-27 12:22:16,308 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [279171121]
[2023-10-27 12:22:16,308 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:22:16,308 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-27 12:22:16,308 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-27 12:22:16,311 INFO  L229       MonitoredProcess]: Starting monitored process 9 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-10-27 12:22:16,353 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process
[2023-10-27 12:22:16,514 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:22:16,516 INFO  L263         TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 22 conjunts are in the unsatisfiable core
[2023-10-27 12:22:16,522 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-27 12:22:16,606 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2023-10-27 12:22:16,644 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:22:16,645 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20
[2023-10-27 12:22:16,691 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:22:16,692 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:22:16,692 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32
[2023-10-27 12:22:16,759 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:22:16,762 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:22:16,763 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:22:16,765 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44
[2023-10-27 12:22:16,828 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:22:16,829 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-10-27 12:22:16,856 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2023-10-27 12:22:16,856 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-27 12:22:16,907 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1312 (Array Int Int))) (= (select (select (store |c_#race| c_~datas~0.base v_ArrVal_1312) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0)) (forall ((v_ArrVal_1312 (Array Int Int))) (= (select (select (store |c_#race| c_~datas~0.base v_ArrVal_1312) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) 0)) (forall ((v_ArrVal_1312 (Array Int Int))) (= (select (select (store |c_#race| c_~datas~0.base v_ArrVal_1312) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) 0)) (forall ((v_ArrVal_1312 (Array Int Int))) (= (select (select (store |c_#race| c_~datas~0.base v_ArrVal_1312) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0))) is different from false
[2023-10-27 12:22:16,945 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1 0)))) (and (forall ((v_ArrVal_1312 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_1312) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (forall ((v_ArrVal_1312 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_1312) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) 0)) (forall ((v_ArrVal_1312 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_1312) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0)) (forall ((v_ArrVal_1312 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_1312) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1) 0))))) is different from false
[2023-10-27 12:22:16,960 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ 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 (select |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1 0) .cse2 0)))) (and (forall ((v_ArrVal_1312 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_1312) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (forall ((v_ArrVal_1312 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_1312) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0)) (forall ((v_ArrVal_1312 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_1312) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1312 (Array Int Int))) (= 0 (select (select (store .cse0 c_~datas~0.base v_ArrVal_1312) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse2)))))) is different from false
[2023-10-27 12:22:16,987 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) (.cse1 (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse3 (+ 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|) .cse2 0) .cse1 0) .cse3 0)))) (and (forall ((v_ArrVal_1312 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_1312) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (forall ((v_ArrVal_1312 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_1312) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1312 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_1312) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_1312 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_1312) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse3) 0))))) is different from false
[2023-10-27 12:22:17,000 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-27 12:22:17,001 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-27 12:22:17,006 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-27 12:22:17,007 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-27 12:22:17,012 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-27 12:22:17,018 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2023-10-27 12:22:17,019 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-27 12:22:17,037 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2023-10-27 12:22:17,037 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-27 12:22:17,042 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2023-10-27 12:22:17,042 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-27 12:22:17,060 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 3 not checked.
[2023-10-27 12:22:17,060 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [279171121] provided 0 perfect and 2 imperfect interpolant sequences
[2023-10-27 12:22:17,060 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-10-27 12:22:17,060 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 16
[2023-10-27 12:22:17,060 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360484182]
[2023-10-27 12:22:17,060 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-10-27 12:22:17,060 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 18 states
[2023-10-27 12:22:17,060 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-27 12:22:17,061 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants.
[2023-10-27 12:22:17,061 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=122, Unknown=4, NotChecked=108, Total=306
[2023-10-27 12:22:17,062 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 90 out of 245
[2023-10-27 12:22:17,063 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 395 transitions, 3161 flow. Second operand  has 18 states, 18 states have (on average 92.33333333333333) internal successors, (1662), 18 states have internal predecessors, (1662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:22:17,063 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-27 12:22:17,063 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 245
[2023-10-27 12:22:17,063 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
