./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-nondet/nondet-array-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-nondet/nondet-array-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --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 e22e1beeef18edf77effe210ae0122c1338eccee79cdab905e0b74599361bc08 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 23:34:29,260 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 23:34:29,327 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-16 23:34:29,330 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 23:34:29,331 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 23:34:29,361 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 23:34:29,362 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 23:34:29,362 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 23:34:29,363 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 23:34:29,363 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 23:34:29,364 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 23:34:29,364 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 23:34:29,364 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 23:34:29,364 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 23:34:29,364 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 23:34:29,365 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 23:34:29,365 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 23:34:29,367 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 23:34:29,367 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 23:34:29,367 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 23:34:29,369 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 23:34:29,369 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 23:34:29,369 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-16 23:34:29,369 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 23:34:29,370 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-16 23:34:29,370 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 23:34:29,370 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 23:34:29,370 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 23:34:29,370 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 23:34:29,370 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 23:34:29,370 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 23:34:29,371 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 23:34:29,371 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 23:34:29,371 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 23:34:29,371 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 23:34:29,371 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 23:34:29,371 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 23:34:29,371 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 23:34:29,371 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 23:34:29,372 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 23:34:29,372 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 23:34:29,373 INFO L153 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:/storage/repos/ultimate/releaseScripts/default/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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> e22e1beeef18edf77effe210ae0122c1338eccee79cdab905e0b74599361bc08 [2024-11-16 23:34:29,561 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 23:34:29,581 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 23:34:29,584 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 23:34:29,585 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 23:34:29,585 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 23:34:29,586 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-nondet/nondet-array-1.i [2024-11-16 23:34:30,780 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 23:34:30,974 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 23:34:30,975 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-nondet/nondet-array-1.i [2024-11-16 23:34:30,989 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/037a3e281/53e0db46b3f14784ad5f4d29c293604c/FLAGdba5fd6fe [2024-11-16 23:34:31,002 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/037a3e281/53e0db46b3f14784ad5f4d29c293604c [2024-11-16 23:34:31,005 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 23:34:31,006 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 23:34:31,009 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 23:34:31,009 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 23:34:31,013 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 23:34:31,014 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:34:31" (1/1) ... [2024-11-16 23:34:31,014 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69ccfdf9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:34:31, skipping insertion in model container [2024-11-16 23:34:31,016 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:34:31" (1/1) ... [2024-11-16 23:34:31,052 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 23:34:31,333 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 23:34:31,345 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 23:34:31,388 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 23:34:31,419 INFO L204 MainTranslator]: Completed translation [2024-11-16 23:34:31,420 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:34:31 WrapperNode [2024-11-16 23:34:31,420 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 23:34:31,421 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 23:34:31,421 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 23:34:31,421 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 23:34:31,426 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:34:31" (1/1) ... [2024-11-16 23:34:31,437 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:34:31" (1/1) ... [2024-11-16 23:34:31,453 INFO L138 Inliner]: procedures = 169, calls = 28, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 96 [2024-11-16 23:34:31,453 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 23:34:31,454 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 23:34:31,454 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 23:34:31,454 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 23:34:31,460 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:34:31" (1/1) ... [2024-11-16 23:34:31,460 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:34:31" (1/1) ... [2024-11-16 23:34:31,463 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:34:31" (1/1) ... [2024-11-16 23:34:31,463 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:34:31" (1/1) ... [2024-11-16 23:34:31,468 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:34:31" (1/1) ... [2024-11-16 23:34:31,468 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:34:31" (1/1) ... [2024-11-16 23:34:31,470 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:34:31" (1/1) ... [2024-11-16 23:34:31,470 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:34:31" (1/1) ... [2024-11-16 23:34:31,472 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 23:34:31,473 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 23:34:31,473 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 23:34:31,473 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 23:34:31,474 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:34:31" (1/1) ... [2024-11-16 23:34:31,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 23:34:31,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 23:34:31,502 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-16 23:34:31,503 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-16 23:34:31,533 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-16 23:34:31,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-16 23:34:31,533 INFO L130 BoogieDeclarations]: Found specification of procedure thr [2024-11-16 23:34:31,533 INFO L138 BoogieDeclarations]: Found implementation of procedure thr [2024-11-16 23:34:31,533 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 23:34:31,533 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-16 23:34:31,533 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-16 23:34:31,534 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-16 23:34:31,534 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 23:34:31,534 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 23:34:31,535 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-16 23:34:31,634 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 23:34:31,636 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 23:34:31,785 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L698: havoc main_~#t~1#1.base, main_~#t~1#1.offset; [2024-11-16 23:34:31,786 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L698-1: SUMMARY for call ULTIMATE.dealloc(main_~#t~1#1.base, main_~#t~1#1.offset); srcloc: null [2024-11-16 23:34:31,816 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-16 23:34:31,816 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 23:34:31,829 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 23:34:31,829 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 23:34:31,830 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 11:34:31 BoogieIcfgContainer [2024-11-16 23:34:31,830 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 23:34:31,832 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 23:34:31,832 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 23:34:31,834 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 23:34:31,834 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 11:34:31" (1/3) ... [2024-11-16 23:34:31,835 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a995300 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:34:31, skipping insertion in model container [2024-11-16 23:34:31,835 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:34:31" (2/3) ... [2024-11-16 23:34:31,836 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a995300 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:34:31, skipping insertion in model container [2024-11-16 23:34:31,836 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 11:34:31" (3/3) ... [2024-11-16 23:34:31,839 INFO L112 eAbstractionObserver]: Analyzing ICFG nondet-array-1.i [2024-11-16 23:34:31,853 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 23:34:31,853 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2024-11-16 23:34:31,853 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-16 23:34:31,918 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-11-16 23:34:31,952 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 130 places, 135 transitions, 277 flow [2024-11-16 23:34:32,010 INFO L124 PetriNetUnfolderBase]: 14/199 cut-off events. [2024-11-16 23:34:32,010 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-16 23:34:32,014 INFO L83 FinitePrefix]: Finished finitePrefix Result has 204 conditions, 199 events. 14/199 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 486 event pairs, 0 based on Foata normal form. 0/173 useless extension candidates. Maximal degree in co-relation 101. Up to 4 conditions per place. [2024-11-16 23:34:32,015 INFO L82 GeneralOperation]: Start removeDead. Operand has 130 places, 135 transitions, 277 flow [2024-11-16 23:34:32,018 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 130 places, 135 transitions, 277 flow [2024-11-16 23:34:32,025 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 23:34:32,033 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@511b1f49, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 23:34:32,033 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2024-11-16 23:34:32,050 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-16 23:34:32,050 INFO L124 PetriNetUnfolderBase]: 4/71 cut-off events. [2024-11-16 23:34:32,050 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-16 23:34:32,051 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:34:32,051 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:34:32,051 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2024-11-16 23:34:32,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:34:32,055 INFO L85 PathProgramCache]: Analyzing trace with hash -691685029, now seen corresponding path program 1 times [2024-11-16 23:34:32,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:34:32,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850253864] [2024-11-16 23:34:32,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:34:32,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:34:32,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:34:32,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:34:32,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:34:32,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850253864] [2024-11-16 23:34:32,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850253864] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:34:32,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:34:32,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:34:32,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977230633] [2024-11-16 23:34:32,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:34:32,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 23:34:32,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:34:32,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 23:34:32,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 23:34:32,320 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 135 [2024-11-16 23:34:32,322 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 135 transitions, 277 flow. Second operand has 2 states, 2 states have (on average 126.5) internal successors, (253), 2 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:34:32,322 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:34:32,322 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 135 [2024-11-16 23:34:32,323 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:34:32,369 INFO L124 PetriNetUnfolderBase]: 3/184 cut-off events. [2024-11-16 23:34:32,369 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-16 23:34:32,371 INFO L83 FinitePrefix]: Finished finitePrefix Result has 192 conditions, 184 events. 3/184 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 439 event pairs, 0 based on Foata normal form. 11/177 useless extension candidates. Maximal degree in co-relation 93. Up to 4 conditions per place. [2024-11-16 23:34:32,372 INFO L140 encePairwiseOnDemand]: 129/135 looper letters, 2 selfloop transitions, 0 changer transitions 1/127 dead transitions. [2024-11-16 23:34:32,372 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 127 transitions, 265 flow [2024-11-16 23:34:32,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 23:34:32,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-11-16 23:34:32,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 260 transitions. [2024-11-16 23:34:32,384 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9629629629629629 [2024-11-16 23:34:32,385 INFO L175 Difference]: Start difference. First operand has 130 places, 135 transitions, 277 flow. Second operand 2 states and 260 transitions. [2024-11-16 23:34:32,386 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 127 transitions, 265 flow [2024-11-16 23:34:32,388 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 127 transitions, 265 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-16 23:34:32,391 INFO L231 Difference]: Finished difference. Result has 129 places, 126 transitions, 259 flow [2024-11-16 23:34:32,393 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=135, PETRI_DIFFERENCE_MINUEND_FLOW=261, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=259, PETRI_PLACES=129, PETRI_TRANSITIONS=126} [2024-11-16 23:34:32,396 INFO L277 CegarLoopForPetriNet]: 130 programPoint places, -1 predicate places. [2024-11-16 23:34:32,396 INFO L471 AbstractCegarLoop]: Abstraction has has 129 places, 126 transitions, 259 flow [2024-11-16 23:34:32,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 126.5) internal successors, (253), 2 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:34:32,397 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:34:32,397 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:34:32,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 23:34:32,397 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2024-11-16 23:34:32,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:34:32,398 INFO L85 PathProgramCache]: Analyzing trace with hash -519804303, now seen corresponding path program 1 times [2024-11-16 23:34:32,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:34:32,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091564546] [2024-11-16 23:34:32,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:34:32,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:34:32,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:34:32,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:34:32,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:34:32,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091564546] [2024-11-16 23:34:32,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091564546] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:34:32,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:34:32,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 23:34:32,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730153142] [2024-11-16 23:34:32,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:34:32,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 23:34:32,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:34:32,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 23:34:32,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-16 23:34:32,722 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 135 [2024-11-16 23:34:32,723 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 126 transitions, 259 flow. Second operand has 5 states, 5 states have (on average 111.4) internal successors, (557), 5 states have internal predecessors, (557), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:34:32,725 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:34:32,725 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 135 [2024-11-16 23:34:32,726 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:34:32,786 INFO L124 PetriNetUnfolderBase]: 3/204 cut-off events. [2024-11-16 23:34:32,786 INFO L125 PetriNetUnfolderBase]: For 12/20 co-relation queries the response was YES. [2024-11-16 23:34:32,789 INFO L83 FinitePrefix]: Finished finitePrefix Result has 244 conditions, 204 events. 3/204 cut-off events. For 12/20 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 319 event pairs, 0 based on Foata normal form. 2/188 useless extension candidates. Maximal degree in co-relation 240. Up to 17 conditions per place. [2024-11-16 23:34:32,790 INFO L140 encePairwiseOnDemand]: 123/135 looper letters, 16 selfloop transitions, 8 changer transitions 6/138 dead transitions. [2024-11-16 23:34:32,790 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 138 transitions, 343 flow [2024-11-16 23:34:32,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 23:34:32,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-16 23:34:32,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 472 transitions. [2024-11-16 23:34:32,794 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8740740740740741 [2024-11-16 23:34:32,794 INFO L175 Difference]: Start difference. First operand has 129 places, 126 transitions, 259 flow. Second operand 4 states and 472 transitions. [2024-11-16 23:34:32,794 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 138 transitions, 343 flow [2024-11-16 23:34:32,798 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 138 transitions, 343 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-16 23:34:32,801 INFO L231 Difference]: Finished difference. Result has 134 places, 129 transitions, 311 flow [2024-11-16 23:34:32,801 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=135, PETRI_DIFFERENCE_MINUEND_FLOW=259, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=311, PETRI_PLACES=134, PETRI_TRANSITIONS=129} [2024-11-16 23:34:32,803 INFO L277 CegarLoopForPetriNet]: 130 programPoint places, 4 predicate places. [2024-11-16 23:34:32,803 INFO L471 AbstractCegarLoop]: Abstraction has has 134 places, 129 transitions, 311 flow [2024-11-16 23:34:32,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 111.4) internal successors, (557), 5 states have internal predecessors, (557), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:34:32,804 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:34:32,804 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:34:32,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 23:34:32,804 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2024-11-16 23:34:32,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:34:32,805 INFO L85 PathProgramCache]: Analyzing trace with hash -1350261608, now seen corresponding path program 1 times [2024-11-16 23:34:32,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:34:32,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504750076] [2024-11-16 23:34:32,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:34:32,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:34:32,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:34:33,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:34:33,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:34:33,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504750076] [2024-11-16 23:34:33,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504750076] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:34:33,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:34:33,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 23:34:33,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827485743] [2024-11-16 23:34:33,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:34:33,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 23:34:33,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:34:33,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 23:34:33,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-16 23:34:33,338 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 135 [2024-11-16 23:34:33,339 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 129 transitions, 311 flow. Second operand has 6 states, 6 states have (on average 95.66666666666667) internal successors, (574), 6 states have internal predecessors, (574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:34:33,339 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:34:33,339 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 135 [2024-11-16 23:34:33,339 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:34:33,460 INFO L124 PetriNetUnfolderBase]: 83/516 cut-off events. [2024-11-16 23:34:33,460 INFO L125 PetriNetUnfolderBase]: For 65/70 co-relation queries the response was YES. [2024-11-16 23:34:33,461 INFO L83 FinitePrefix]: Finished finitePrefix Result has 810 conditions, 516 events. 83/516 cut-off events. For 65/70 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 2511 event pairs, 44 based on Foata normal form. 0/462 useless extension candidates. Maximal degree in co-relation 803. Up to 191 conditions per place. [2024-11-16 23:34:33,464 INFO L140 encePairwiseOnDemand]: 124/135 looper letters, 35 selfloop transitions, 22 changer transitions 0/150 dead transitions. [2024-11-16 23:34:33,464 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 150 transitions, 467 flow [2024-11-16 23:34:33,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 23:34:33,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-16 23:34:33,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 620 transitions. [2024-11-16 23:34:33,467 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7654320987654321 [2024-11-16 23:34:33,467 INFO L175 Difference]: Start difference. First operand has 134 places, 129 transitions, 311 flow. Second operand 6 states and 620 transitions. [2024-11-16 23:34:33,467 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 150 transitions, 467 flow [2024-11-16 23:34:33,469 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 150 transitions, 465 flow, removed 1 selfloop flow, removed 0 redundant places. [2024-11-16 23:34:33,472 INFO L231 Difference]: Finished difference. Result has 144 places, 150 transitions, 459 flow [2024-11-16 23:34:33,472 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=135, PETRI_DIFFERENCE_MINUEND_FLOW=309, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=459, PETRI_PLACES=144, PETRI_TRANSITIONS=150} [2024-11-16 23:34:33,473 INFO L277 CegarLoopForPetriNet]: 130 programPoint places, 14 predicate places. [2024-11-16 23:34:33,473 INFO L471 AbstractCegarLoop]: Abstraction has has 144 places, 150 transitions, 459 flow [2024-11-16 23:34:33,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 95.66666666666667) internal successors, (574), 6 states have internal predecessors, (574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:34:33,474 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:34:33,474 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:34:33,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 23:34:33,474 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thrErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2024-11-16 23:34:33,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:34:33,475 INFO L85 PathProgramCache]: Analyzing trace with hash 1567345955, now seen corresponding path program 1 times [2024-11-16 23:34:33,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:34:33,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828997110] [2024-11-16 23:34:33,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:34:33,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:34:33,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:34:33,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:34:33,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:34:33,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828997110] [2024-11-16 23:34:33,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828997110] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:34:33,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:34:33,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:34:33,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571244119] [2024-11-16 23:34:33,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:34:33,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:34:33,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:34:33,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:34:33,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:34:33,520 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 135 [2024-11-16 23:34:33,520 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 150 transitions, 459 flow. Second operand has 3 states, 3 states have (on average 123.0) internal successors, (369), 3 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:34:33,520 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:34:33,520 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 135 [2024-11-16 23:34:33,520 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:34:33,550 INFO L124 PetriNetUnfolderBase]: 33/319 cut-off events. [2024-11-16 23:34:33,550 INFO L125 PetriNetUnfolderBase]: For 35/35 co-relation queries the response was YES. [2024-11-16 23:34:33,551 INFO L83 FinitePrefix]: Finished finitePrefix Result has 514 conditions, 319 events. 33/319 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1041 event pairs, 0 based on Foata normal form. 0/296 useless extension candidates. Maximal degree in co-relation 502. Up to 45 conditions per place. [2024-11-16 23:34:33,553 INFO L140 encePairwiseOnDemand]: 132/135 looper letters, 3 selfloop transitions, 2 changer transitions 0/149 dead transitions. [2024-11-16 23:34:33,553 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 149 transitions, 467 flow [2024-11-16 23:34:33,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:34:33,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:34:33,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 372 transitions. [2024-11-16 23:34:33,555 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9185185185185185 [2024-11-16 23:34:33,555 INFO L175 Difference]: Start difference. First operand has 144 places, 150 transitions, 459 flow. Second operand 3 states and 372 transitions. [2024-11-16 23:34:33,555 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 149 transitions, 467 flow [2024-11-16 23:34:33,557 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 149 transitions, 467 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-16 23:34:33,559 INFO L231 Difference]: Finished difference. Result has 145 places, 149 transitions, 461 flow [2024-11-16 23:34:33,560 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=135, PETRI_DIFFERENCE_MINUEND_FLOW=457, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=461, PETRI_PLACES=145, PETRI_TRANSITIONS=149} [2024-11-16 23:34:33,561 INFO L277 CegarLoopForPetriNet]: 130 programPoint places, 15 predicate places. [2024-11-16 23:34:33,561 INFO L471 AbstractCegarLoop]: Abstraction has has 145 places, 149 transitions, 461 flow [2024-11-16 23:34:33,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 123.0) internal successors, (369), 3 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:34:33,561 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:34:33,561 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:34:33,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-16 23:34:33,562 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thrErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2024-11-16 23:34:33,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:34:33,562 INFO L85 PathProgramCache]: Analyzing trace with hash -939549529, now seen corresponding path program 1 times [2024-11-16 23:34:33,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:34:33,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840481528] [2024-11-16 23:34:33,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:34:33,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:34:33,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:34:33,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:34:33,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:34:33,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840481528] [2024-11-16 23:34:33,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840481528] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:34:33,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:34:33,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 23:34:33,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598046754] [2024-11-16 23:34:33,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:34:33,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 23:34:33,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:34:33,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 23:34:33,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-16 23:34:33,944 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 135 [2024-11-16 23:34:33,945 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 149 transitions, 461 flow. Second operand has 6 states, 6 states have (on average 106.16666666666667) internal successors, (637), 6 states have internal predecessors, (637), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:34:33,945 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:34:33,945 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 135 [2024-11-16 23:34:33,945 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:34:34,088 INFO L124 PetriNetUnfolderBase]: 131/558 cut-off events. [2024-11-16 23:34:34,088 INFO L125 PetriNetUnfolderBase]: For 150/173 co-relation queries the response was YES. [2024-11-16 23:34:34,090 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1196 conditions, 558 events. 131/558 cut-off events. For 150/173 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2637 event pairs, 23 based on Foata normal form. 0/518 useless extension candidates. Maximal degree in co-relation 1183. Up to 247 conditions per place. [2024-11-16 23:34:34,092 INFO L140 encePairwiseOnDemand]: 120/135 looper letters, 38 selfloop transitions, 48 changer transitions 0/192 dead transitions. [2024-11-16 23:34:34,092 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 192 transitions, 789 flow [2024-11-16 23:34:34,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 23:34:34,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-16 23:34:34,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 686 transitions. [2024-11-16 23:34:34,094 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8469135802469135 [2024-11-16 23:34:34,094 INFO L175 Difference]: Start difference. First operand has 145 places, 149 transitions, 461 flow. Second operand 6 states and 686 transitions. [2024-11-16 23:34:34,094 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 192 transitions, 789 flow [2024-11-16 23:34:34,098 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 192 transitions, 785 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 23:34:34,100 INFO L231 Difference]: Finished difference. Result has 153 places, 192 transitions, 845 flow [2024-11-16 23:34:34,100 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=135, PETRI_DIFFERENCE_MINUEND_FLOW=457, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=845, PETRI_PLACES=153, PETRI_TRANSITIONS=192} [2024-11-16 23:34:34,101 INFO L277 CegarLoopForPetriNet]: 130 programPoint places, 23 predicate places. [2024-11-16 23:34:34,101 INFO L471 AbstractCegarLoop]: Abstraction has has 153 places, 192 transitions, 845 flow [2024-11-16 23:34:34,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 106.16666666666667) internal successors, (637), 6 states have internal predecessors, (637), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:34:34,102 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:34:34,102 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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] [2024-11-16 23:34:34,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-16 23:34:34,102 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thrErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2024-11-16 23:34:34,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:34:34,102 INFO L85 PathProgramCache]: Analyzing trace with hash -1093774983, now seen corresponding path program 1 times [2024-11-16 23:34:34,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:34:34,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809933284] [2024-11-16 23:34:34,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:34:34,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:34:34,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:34:34,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:34:34,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:34:34,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809933284] [2024-11-16 23:34:34,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809933284] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:34:34,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:34:34,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:34:34,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309581795] [2024-11-16 23:34:34,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:34:34,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:34:34,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:34:34,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:34:34,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:34:34,144 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 135 [2024-11-16 23:34:34,144 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 192 transitions, 845 flow. Second operand has 3 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:34:34,144 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:34:34,144 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 135 [2024-11-16 23:34:34,145 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:34:34,197 INFO L124 PetriNetUnfolderBase]: 103/497 cut-off events. [2024-11-16 23:34:34,197 INFO L125 PetriNetUnfolderBase]: For 247/261 co-relation queries the response was YES. [2024-11-16 23:34:34,198 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1192 conditions, 497 events. 103/497 cut-off events. For 247/261 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2301 event pairs, 7 based on Foata normal form. 0/485 useless extension candidates. Maximal degree in co-relation 1175. Up to 105 conditions per place. [2024-11-16 23:34:34,199 INFO L140 encePairwiseOnDemand]: 132/135 looper letters, 5 selfloop transitions, 2 changer transitions 19/191 dead transitions. [2024-11-16 23:34:34,199 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 191 transitions, 857 flow [2024-11-16 23:34:34,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:34:34,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:34:34,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 368 transitions. [2024-11-16 23:34:34,200 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.908641975308642 [2024-11-16 23:34:34,201 INFO L175 Difference]: Start difference. First operand has 153 places, 192 transitions, 845 flow. Second operand 3 states and 368 transitions. [2024-11-16 23:34:34,201 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 191 transitions, 857 flow [2024-11-16 23:34:34,205 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 191 transitions, 839 flow, removed 9 selfloop flow, removed 0 redundant places. [2024-11-16 23:34:34,206 INFO L231 Difference]: Finished difference. Result has 154 places, 172 transitions, 779 flow [2024-11-16 23:34:34,207 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=135, PETRI_DIFFERENCE_MINUEND_FLOW=825, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=191, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=189, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=779, PETRI_PLACES=154, PETRI_TRANSITIONS=172} [2024-11-16 23:34:34,208 INFO L277 CegarLoopForPetriNet]: 130 programPoint places, 24 predicate places. [2024-11-16 23:34:34,208 INFO L471 AbstractCegarLoop]: Abstraction has has 154 places, 172 transitions, 779 flow [2024-11-16 23:34:34,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:34:34,208 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:34:34,209 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:34:34,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-16 23:34:34,209 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2024-11-16 23:34:34,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:34:34,209 INFO L85 PathProgramCache]: Analyzing trace with hash -276700851, now seen corresponding path program 1 times [2024-11-16 23:34:34,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:34:34,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360838755] [2024-11-16 23:34:34,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:34:34,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:34:34,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:34:34,418 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-16 23:34:34,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:34:34,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360838755] [2024-11-16 23:34:34,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360838755] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:34:34,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:34:34,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 23:34:34,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249535758] [2024-11-16 23:34:34,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:34:34,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 23:34:34,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:34:34,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 23:34:34,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-16 23:34:34,625 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 135 [2024-11-16 23:34:34,626 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 172 transitions, 779 flow. Second operand has 6 states, 6 states have (on average 102.83333333333333) internal successors, (617), 6 states have internal predecessors, (617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:34:34,627 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:34:34,627 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 135 [2024-11-16 23:34:34,627 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:34:34,732 INFO L124 PetriNetUnfolderBase]: 147/610 cut-off events. [2024-11-16 23:34:34,733 INFO L125 PetriNetUnfolderBase]: For 527/608 co-relation queries the response was YES. [2024-11-16 23:34:34,734 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1782 conditions, 610 events. 147/610 cut-off events. For 527/608 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 3141 event pairs, 14 based on Foata normal form. 0/595 useless extension candidates. Maximal degree in co-relation 1764. Up to 272 conditions per place. [2024-11-16 23:34:34,736 INFO L140 encePairwiseOnDemand]: 124/135 looper letters, 84 selfloop transitions, 32 changer transitions 0/200 dead transitions. [2024-11-16 23:34:34,736 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 200 transitions, 1182 flow [2024-11-16 23:34:34,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 23:34:34,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-16 23:34:34,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 649 transitions. [2024-11-16 23:34:34,738 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8012345679012346 [2024-11-16 23:34:34,738 INFO L175 Difference]: Start difference. First operand has 154 places, 172 transitions, 779 flow. Second operand 6 states and 649 transitions. [2024-11-16 23:34:34,738 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 200 transitions, 1182 flow [2024-11-16 23:34:34,741 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 200 transitions, 1162 flow, removed 1 selfloop flow, removed 5 redundant places. [2024-11-16 23:34:34,743 INFO L231 Difference]: Finished difference. Result has 141 places, 199 transitions, 1085 flow [2024-11-16 23:34:34,743 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=135, PETRI_DIFFERENCE_MINUEND_FLOW=761, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=172, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1085, PETRI_PLACES=141, PETRI_TRANSITIONS=199} [2024-11-16 23:34:34,744 INFO L277 CegarLoopForPetriNet]: 130 programPoint places, 11 predicate places. [2024-11-16 23:34:34,744 INFO L471 AbstractCegarLoop]: Abstraction has has 141 places, 199 transitions, 1085 flow [2024-11-16 23:34:34,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 102.83333333333333) internal successors, (617), 6 states have internal predecessors, (617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:34:34,745 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:34:34,745 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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] [2024-11-16 23:34:34,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-16 23:34:34,745 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2024-11-16 23:34:34,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:34:34,745 INFO L85 PathProgramCache]: Analyzing trace with hash 37835793, now seen corresponding path program 1 times [2024-11-16 23:34:34,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:34:34,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587105785] [2024-11-16 23:34:34,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:34:34,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:34:34,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 23:34:34,764 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-16 23:34:34,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 23:34:34,796 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-16 23:34:34,797 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-16 23:34:34,797 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 10 remaining) [2024-11-16 23:34:34,799 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (8 of 10 remaining) [2024-11-16 23:34:34,799 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (7 of 10 remaining) [2024-11-16 23:34:34,799 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (6 of 10 remaining) [2024-11-16 23:34:34,799 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONDATA_RACE (5 of 10 remaining) [2024-11-16 23:34:34,799 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1ASSERT_VIOLATIONDATA_RACE (4 of 10 remaining) [2024-11-16 23:34:34,799 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONDATA_RACE (3 of 10 remaining) [2024-11-16 23:34:34,800 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONDATA_RACE (2 of 10 remaining) [2024-11-16 23:34:34,800 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1ASSERT_VIOLATIONDATA_RACE (1 of 10 remaining) [2024-11-16 23:34:34,800 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONDATA_RACE (0 of 10 remaining) [2024-11-16 23:34:34,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-16 23:34:34,800 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:34:34,802 WARN L244 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-16 23:34:34,802 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-11-16 23:34:34,817 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-16 23:34:34,822 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 154 places, 158 transitions, 332 flow [2024-11-16 23:34:34,840 INFO L124 PetriNetUnfolderBase]: 27/351 cut-off events. [2024-11-16 23:34:34,841 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-11-16 23:34:34,841 INFO L83 FinitePrefix]: Finished finitePrefix Result has 363 conditions, 351 events. 27/351 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1001 event pairs, 0 based on Foata normal form. 0/303 useless extension candidates. Maximal degree in co-relation 201. Up to 8 conditions per place. [2024-11-16 23:34:34,841 INFO L82 GeneralOperation]: Start removeDead. Operand has 154 places, 158 transitions, 332 flow [2024-11-16 23:34:34,843 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 154 places, 158 transitions, 332 flow [2024-11-16 23:34:34,844 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 23:34:34,844 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@511b1f49, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 23:34:34,844 INFO L334 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2024-11-16 23:34:34,847 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-16 23:34:34,847 INFO L124 PetriNetUnfolderBase]: 4/71 cut-off events. [2024-11-16 23:34:34,847 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-16 23:34:34,848 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:34:34,848 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:34:34,848 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2024-11-16 23:34:34,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:34:34,848 INFO L85 PathProgramCache]: Analyzing trace with hash -624695431, now seen corresponding path program 1 times [2024-11-16 23:34:34,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:34:34,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587345850] [2024-11-16 23:34:34,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:34:34,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:34:34,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:34:34,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:34:34,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:34:34,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587345850] [2024-11-16 23:34:34,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587345850] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:34:34,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:34:34,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:34:34,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796576093] [2024-11-16 23:34:34,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:34:34,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 23:34:34,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:34:34,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 23:34:34,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 23:34:34,865 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 158 [2024-11-16 23:34:34,866 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 158 transitions, 332 flow. Second operand has 2 states, 2 states have (on average 147.5) internal successors, (295), 2 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:34:34,866 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:34:34,866 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 158 [2024-11-16 23:34:34,866 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:34:34,891 INFO L124 PetriNetUnfolderBase]: 7/323 cut-off events. [2024-11-16 23:34:34,891 INFO L125 PetriNetUnfolderBase]: For 17/19 co-relation queries the response was YES. [2024-11-16 23:34:34,892 INFO L83 FinitePrefix]: Finished finitePrefix Result has 342 conditions, 323 events. 7/323 cut-off events. For 17/19 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 908 event pairs, 0 based on Foata normal form. 20/310 useless extension candidates. Maximal degree in co-relation 188. Up to 8 conditions per place. [2024-11-16 23:34:34,893 INFO L140 encePairwiseOnDemand]: 152/158 looper letters, 4 selfloop transitions, 0 changer transitions 1/150 dead transitions. [2024-11-16 23:34:34,893 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 150 transitions, 324 flow [2024-11-16 23:34:34,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 23:34:34,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-11-16 23:34:34,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 304 transitions. [2024-11-16 23:34:34,894 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9620253164556962 [2024-11-16 23:34:34,895 INFO L175 Difference]: Start difference. First operand has 154 places, 158 transitions, 332 flow. Second operand 2 states and 304 transitions. [2024-11-16 23:34:34,895 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 150 transitions, 324 flow [2024-11-16 23:34:34,895 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 150 transitions, 324 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-16 23:34:34,896 INFO L231 Difference]: Finished difference. Result has 153 places, 149 transitions, 314 flow [2024-11-16 23:34:34,897 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=158, PETRI_DIFFERENCE_MINUEND_FLOW=316, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=150, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=314, PETRI_PLACES=153, PETRI_TRANSITIONS=149} [2024-11-16 23:34:34,898 INFO L277 CegarLoopForPetriNet]: 154 programPoint places, -1 predicate places. [2024-11-16 23:34:34,898 INFO L471 AbstractCegarLoop]: Abstraction has has 153 places, 149 transitions, 314 flow [2024-11-16 23:34:34,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 147.5) internal successors, (295), 2 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:34:34,899 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:34:34,899 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:34:34,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-16 23:34:34,899 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2024-11-16 23:34:34,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:34:34,900 INFO L85 PathProgramCache]: Analyzing trace with hash 1556873393, now seen corresponding path program 1 times [2024-11-16 23:34:34,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:34:34,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155673273] [2024-11-16 23:34:34,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:34:34,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:34:34,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:34:34,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:34:34,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:34:34,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155673273] [2024-11-16 23:34:34,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155673273] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:34:34,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:34:34,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 23:34:34,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60094374] [2024-11-16 23:34:34,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:34:34,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 23:34:34,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:34:34,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 23:34:34,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-16 23:34:35,022 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 158 [2024-11-16 23:34:35,023 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 149 transitions, 314 flow. Second operand has 5 states, 5 states have (on average 132.4) internal successors, (662), 5 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) [2024-11-16 23:34:35,023 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:34:35,023 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 158 [2024-11-16 23:34:35,023 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:34:35,070 INFO L124 PetriNetUnfolderBase]: 10/417 cut-off events. [2024-11-16 23:34:35,070 INFO L125 PetriNetUnfolderBase]: For 37/64 co-relation queries the response was YES. [2024-11-16 23:34:35,071 INFO L83 FinitePrefix]: Finished finitePrefix Result has 503 conditions, 417 events. 10/417 cut-off events. For 37/64 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1352 event pairs, 0 based on Foata normal form. 4/380 useless extension candidates. Maximal degree in co-relation 498. Up to 42 conditions per place. [2024-11-16 23:34:35,072 INFO L140 encePairwiseOnDemand]: 146/158 looper letters, 24 selfloop transitions, 9 changer transitions 3/165 dead transitions. [2024-11-16 23:34:35,072 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 165 transitions, 424 flow [2024-11-16 23:34:35,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 23:34:35,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-16 23:34:35,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 562 transitions. [2024-11-16 23:34:35,074 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8892405063291139 [2024-11-16 23:34:35,074 INFO L175 Difference]: Start difference. First operand has 153 places, 149 transitions, 314 flow. Second operand 4 states and 562 transitions. [2024-11-16 23:34:35,074 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 165 transitions, 424 flow [2024-11-16 23:34:35,074 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 165 transitions, 424 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-16 23:34:35,076 INFO L231 Difference]: Finished difference. Result has 158 places, 156 transitions, 384 flow [2024-11-16 23:34:35,076 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=158, PETRI_DIFFERENCE_MINUEND_FLOW=314, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=384, PETRI_PLACES=158, PETRI_TRANSITIONS=156} [2024-11-16 23:34:35,077 INFO L277 CegarLoopForPetriNet]: 154 programPoint places, 4 predicate places. [2024-11-16 23:34:35,077 INFO L471 AbstractCegarLoop]: Abstraction has has 158 places, 156 transitions, 384 flow [2024-11-16 23:34:35,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 132.4) internal successors, (662), 5 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) [2024-11-16 23:34:35,077 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:34:35,077 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:34:35,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-16 23:34:35,078 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2024-11-16 23:34:35,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:34:35,078 INFO L85 PathProgramCache]: Analyzing trace with hash 726416088, now seen corresponding path program 1 times [2024-11-16 23:34:35,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:34:35,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681165391] [2024-11-16 23:34:35,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:34:35,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:34:35,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:34:35,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:34:35,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:34:35,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681165391] [2024-11-16 23:34:35,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681165391] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:34:35,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:34:35,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 23:34:35,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893248545] [2024-11-16 23:34:35,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:34:35,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 23:34:35,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:34:35,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 23:34:35,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-16 23:34:35,405 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 158 [2024-11-16 23:34:35,406 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 156 transitions, 384 flow. Second operand has 6 states, 6 states have (on average 112.66666666666667) internal successors, (676), 6 states have internal predecessors, (676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:34:35,406 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:34:35,406 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 158 [2024-11-16 23:34:35,406 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:34:35,869 INFO L124 PetriNetUnfolderBase]: 1178/4350 cut-off events. [2024-11-16 23:34:35,869 INFO L125 PetriNetUnfolderBase]: For 450/465 co-relation queries the response was YES. [2024-11-16 23:34:35,876 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6919 conditions, 4350 events. 1178/4350 cut-off events. For 450/465 co-relation queries the response was YES. Maximal size of possible extension queue 166. Compared 37388 event pairs, 786 based on Foata normal form. 0/3907 useless extension candidates. Maximal degree in co-relation 6911. Up to 1921 conditions per place. [2024-11-16 23:34:35,889 INFO L140 encePairwiseOnDemand]: 143/158 looper letters, 45 selfloop transitions, 38 changer transitions 0/194 dead transitions. [2024-11-16 23:34:35,889 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 194 transitions, 631 flow [2024-11-16 23:34:35,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 23:34:35,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-16 23:34:35,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 745 transitions. [2024-11-16 23:34:35,891 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7858649789029536 [2024-11-16 23:34:35,891 INFO L175 Difference]: Start difference. First operand has 158 places, 156 transitions, 384 flow. Second operand 6 states and 745 transitions. [2024-11-16 23:34:35,891 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 194 transitions, 631 flow [2024-11-16 23:34:35,893 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 194 transitions, 629 flow, removed 1 selfloop flow, removed 0 redundant places. [2024-11-16 23:34:35,896 INFO L231 Difference]: Finished difference. Result has 168 places, 193 transitions, 636 flow [2024-11-16 23:34:35,896 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=158, PETRI_DIFFERENCE_MINUEND_FLOW=382, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=636, PETRI_PLACES=168, PETRI_TRANSITIONS=193} [2024-11-16 23:34:35,896 INFO L277 CegarLoopForPetriNet]: 154 programPoint places, 14 predicate places. [2024-11-16 23:34:35,897 INFO L471 AbstractCegarLoop]: Abstraction has has 168 places, 193 transitions, 636 flow [2024-11-16 23:34:35,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 112.66666666666667) internal successors, (676), 6 states have internal predecessors, (676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:34:35,897 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:34:35,897 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:34:35,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-16 23:34:35,897 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thrErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2024-11-16 23:34:35,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:34:35,898 INFO L85 PathProgramCache]: Analyzing trace with hash -481142749, now seen corresponding path program 1 times [2024-11-16 23:34:35,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:34:35,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596218035] [2024-11-16 23:34:35,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:34:35,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:34:35,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:34:35,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:34:35,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:34:35,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596218035] [2024-11-16 23:34:35,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596218035] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:34:35,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:34:35,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:34:35,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956088473] [2024-11-16 23:34:35,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:34:35,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:34:35,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:34:35,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:34:35,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:34:35,941 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 158 [2024-11-16 23:34:35,942 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 193 transitions, 636 flow. Second operand has 3 states, 3 states have (on average 140.0) internal successors, (420), 3 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:34:35,942 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:34:35,942 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 158 [2024-11-16 23:34:35,942 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:34:36,230 INFO L124 PetriNetUnfolderBase]: 660/3618 cut-off events. [2024-11-16 23:34:36,231 INFO L125 PetriNetUnfolderBase]: For 586/623 co-relation queries the response was YES. [2024-11-16 23:34:36,238 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5960 conditions, 3618 events. 660/3618 cut-off events. For 586/623 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 31857 event pairs, 120 based on Foata normal form. 0/3297 useless extension candidates. Maximal degree in co-relation 5947. Up to 759 conditions per place. [2024-11-16 23:34:36,248 INFO L140 encePairwiseOnDemand]: 150/158 looper letters, 15 selfloop transitions, 6 changer transitions 0/202 dead transitions. [2024-11-16 23:34:36,248 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 202 transitions, 707 flow [2024-11-16 23:34:36,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:34:36,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:34:36,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 440 transitions. [2024-11-16 23:34:36,250 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9282700421940928 [2024-11-16 23:34:36,251 INFO L175 Difference]: Start difference. First operand has 168 places, 193 transitions, 636 flow. Second operand 3 states and 440 transitions. [2024-11-16 23:34:36,251 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 202 transitions, 707 flow [2024-11-16 23:34:36,255 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 202 transitions, 707 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-16 23:34:36,257 INFO L231 Difference]: Finished difference. Result has 172 places, 199 transitions, 688 flow [2024-11-16 23:34:36,257 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=158, PETRI_DIFFERENCE_MINUEND_FLOW=636, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=193, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=187, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=688, PETRI_PLACES=172, PETRI_TRANSITIONS=199} [2024-11-16 23:34:36,258 INFO L277 CegarLoopForPetriNet]: 154 programPoint places, 18 predicate places. [2024-11-16 23:34:36,258 INFO L471 AbstractCegarLoop]: Abstraction has has 172 places, 199 transitions, 688 flow [2024-11-16 23:34:36,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 140.0) internal successors, (420), 3 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:34:36,258 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:34:36,258 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:34:36,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-16 23:34:36,259 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thrErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2024-11-16 23:34:36,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:34:36,259 INFO L85 PathProgramCache]: Analyzing trace with hash 188412199, now seen corresponding path program 1 times [2024-11-16 23:34:36,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:34:36,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062477925] [2024-11-16 23:34:36,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:34:36,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:34:36,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:34:36,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:34:36,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:34:36,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062477925] [2024-11-16 23:34:36,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062477925] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:34:36,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:34:36,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 23:34:36,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455472999] [2024-11-16 23:34:36,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:34:36,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 23:34:36,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:34:36,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 23:34:36,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-16 23:34:36,601 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 158 [2024-11-16 23:34:36,602 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 199 transitions, 688 flow. Second operand has 6 states, 6 states have (on average 123.16666666666667) internal successors, (739), 6 states have internal predecessors, (739), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:34:36,602 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:34:36,602 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 158 [2024-11-16 23:34:36,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:34:37,754 INFO L124 PetriNetUnfolderBase]: 3404/12483 cut-off events. [2024-11-16 23:34:37,754 INFO L125 PetriNetUnfolderBase]: For 2977/3212 co-relation queries the response was YES. [2024-11-16 23:34:37,775 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24753 conditions, 12483 events. 3404/12483 cut-off events. For 2977/3212 co-relation queries the response was YES. Maximal size of possible extension queue 355. Compared 130414 event pairs, 797 based on Foata normal form. 1/11308 useless extension candidates. Maximal degree in co-relation 24738. Up to 4280 conditions per place. [2024-11-16 23:34:37,806 INFO L140 encePairwiseOnDemand]: 135/158 looper letters, 95 selfloop transitions, 96 changer transitions 0/325 dead transitions. [2024-11-16 23:34:37,806 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 325 transitions, 1586 flow [2024-11-16 23:34:37,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 23:34:37,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-16 23:34:37,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 846 transitions. [2024-11-16 23:34:37,808 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8924050632911392 [2024-11-16 23:34:37,808 INFO L175 Difference]: Start difference. First operand has 172 places, 199 transitions, 688 flow. Second operand 6 states and 846 transitions. [2024-11-16 23:34:37,808 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 325 transitions, 1586 flow [2024-11-16 23:34:37,822 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 325 transitions, 1574 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 23:34:37,825 INFO L231 Difference]: Finished difference. Result has 179 places, 293 transitions, 1472 flow [2024-11-16 23:34:37,825 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=158, PETRI_DIFFERENCE_MINUEND_FLOW=676, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=151, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1472, PETRI_PLACES=179, PETRI_TRANSITIONS=293} [2024-11-16 23:34:37,826 INFO L277 CegarLoopForPetriNet]: 154 programPoint places, 25 predicate places. [2024-11-16 23:34:37,826 INFO L471 AbstractCegarLoop]: Abstraction has has 179 places, 293 transitions, 1472 flow [2024-11-16 23:34:37,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 123.16666666666667) internal successors, (739), 6 states have internal predecessors, (739), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:34:37,826 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:34:37,826 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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] [2024-11-16 23:34:37,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-16 23:34:37,827 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thrErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2024-11-16 23:34:37,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:34:37,827 INFO L85 PathProgramCache]: Analyzing trace with hash -2078125844, now seen corresponding path program 1 times [2024-11-16 23:34:37,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:34:37,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696373202] [2024-11-16 23:34:37,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:34:37,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:34:37,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:34:37,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:34:37,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:34:37,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696373202] [2024-11-16 23:34:37,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696373202] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:34:37,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:34:37,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:34:37,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862661400] [2024-11-16 23:34:37,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:34:37,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:34:37,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:34:37,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:34:37,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:34:37,866 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 158 [2024-11-16 23:34:37,866 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 293 transitions, 1472 flow. Second operand has 3 states, 3 states have (on average 140.66666666666666) internal successors, (422), 3 states have internal predecessors, (422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:34:37,867 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:34:37,867 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 158 [2024-11-16 23:34:37,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:34:39,053 INFO L124 PetriNetUnfolderBase]: 2656/12373 cut-off events. [2024-11-16 23:34:39,053 INFO L125 PetriNetUnfolderBase]: For 4538/4749 co-relation queries the response was YES. [2024-11-16 23:34:39,083 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25514 conditions, 12373 events. 2656/12373 cut-off events. For 4538/4749 co-relation queries the response was YES. Maximal size of possible extension queue 422. Compared 140633 event pairs, 455 based on Foata normal form. 16/11324 useless extension candidates. Maximal degree in co-relation 25495. Up to 2322 conditions per place. [2024-11-16 23:34:39,113 INFO L140 encePairwiseOnDemand]: 152/158 looper letters, 16 selfloop transitions, 7 changer transitions 0/300 dead transitions. [2024-11-16 23:34:39,113 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 300 transitions, 1546 flow [2024-11-16 23:34:39,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:34:39,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:34:39,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 436 transitions. [2024-11-16 23:34:39,116 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.919831223628692 [2024-11-16 23:34:39,116 INFO L175 Difference]: Start difference. First operand has 179 places, 293 transitions, 1472 flow. Second operand 3 states and 436 transitions. [2024-11-16 23:34:39,117 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 300 transitions, 1546 flow [2024-11-16 23:34:39,150 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 300 transitions, 1528 flow, removed 9 selfloop flow, removed 0 redundant places. [2024-11-16 23:34:39,153 INFO L231 Difference]: Finished difference. Result has 183 places, 298 transitions, 1510 flow [2024-11-16 23:34:39,153 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=158, PETRI_DIFFERENCE_MINUEND_FLOW=1454, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=293, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=286, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1510, PETRI_PLACES=183, PETRI_TRANSITIONS=298} [2024-11-16 23:34:39,154 INFO L277 CegarLoopForPetriNet]: 154 programPoint places, 29 predicate places. [2024-11-16 23:34:39,155 INFO L471 AbstractCegarLoop]: Abstraction has has 183 places, 298 transitions, 1510 flow [2024-11-16 23:34:39,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 140.66666666666666) internal successors, (422), 3 states have internal predecessors, (422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:34:39,155 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:34:39,155 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:34:39,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-16 23:34:39,155 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2024-11-16 23:34:39,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:34:39,156 INFO L85 PathProgramCache]: Analyzing trace with hash 830137816, now seen corresponding path program 1 times [2024-11-16 23:34:39,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:34:39,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141156870] [2024-11-16 23:34:39,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:34:39,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:34:39,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:34:39,339 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-16 23:34:39,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:34:39,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141156870] [2024-11-16 23:34:39,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141156870] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:34:39,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:34:39,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 23:34:39,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058382245] [2024-11-16 23:34:39,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:34:39,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 23:34:39,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:34:39,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 23:34:39,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-16 23:34:39,502 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 158 [2024-11-16 23:34:39,503 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 298 transitions, 1510 flow. Second operand has 6 states, 6 states have (on average 119.83333333333333) internal successors, (719), 6 states have internal predecessors, (719), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:34:39,504 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:34:39,504 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 158 [2024-11-16 23:34:39,504 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:34:41,450 INFO L124 PetriNetUnfolderBase]: 5123/18898 cut-off events. [2024-11-16 23:34:41,450 INFO L125 PetriNetUnfolderBase]: For 13619/14755 co-relation queries the response was YES. [2024-11-16 23:34:41,496 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47709 conditions, 18898 events. 5123/18898 cut-off events. For 13619/14755 co-relation queries the response was YES. Maximal size of possible extension queue 657. Compared 219617 event pairs, 1055 based on Foata normal form. 83/17111 useless extension candidates. Maximal degree in co-relation 47688. Up to 7080 conditions per place. [2024-11-16 23:34:41,546 INFO L140 encePairwiseOnDemand]: 143/158 looper letters, 147 selfloop transitions, 72 changer transitions 0/367 dead transitions. [2024-11-16 23:34:41,547 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 367 transitions, 2400 flow [2024-11-16 23:34:41,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 23:34:41,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-16 23:34:41,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 776 transitions. [2024-11-16 23:34:41,548 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8185654008438819 [2024-11-16 23:34:41,549 INFO L175 Difference]: Start difference. First operand has 183 places, 298 transitions, 1510 flow. Second operand 6 states and 776 transitions. [2024-11-16 23:34:41,549 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 367 transitions, 2400 flow [2024-11-16 23:34:41,601 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 367 transitions, 2386 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 23:34:41,605 INFO L231 Difference]: Finished difference. Result has 191 places, 365 transitions, 2290 flow [2024-11-16 23:34:41,605 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=158, PETRI_DIFFERENCE_MINUEND_FLOW=1496, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=298, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=262, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2290, PETRI_PLACES=191, PETRI_TRANSITIONS=365} [2024-11-16 23:34:41,606 INFO L277 CegarLoopForPetriNet]: 154 programPoint places, 37 predicate places. [2024-11-16 23:34:41,606 INFO L471 AbstractCegarLoop]: Abstraction has has 191 places, 365 transitions, 2290 flow [2024-11-16 23:34:41,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 119.83333333333333) internal successors, (719), 6 states have internal predecessors, (719), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:34:41,606 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:34:41,606 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:34:41,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-16 23:34:41,607 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2024-11-16 23:34:41,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:34:41,607 INFO L85 PathProgramCache]: Analyzing trace with hash 114274824, now seen corresponding path program 1 times [2024-11-16 23:34:41,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:34:41,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303608238] [2024-11-16 23:34:41,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:34:41,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:34:41,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:34:41,873 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-16 23:34:41,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:34:41,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303608238] [2024-11-16 23:34:41,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303608238] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 23:34:41,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [474329315] [2024-11-16 23:34:41,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:34:41,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 23:34:41,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 23:34:41,877 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 23:34:41,879 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-16 23:34:41,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:34:41,952 INFO L255 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-16 23:34:41,955 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 23:34:42,052 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-16 23:34:42,053 INFO L378 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 11 treesize of output 11 [2024-11-16 23:34:42,199 INFO L378 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 [2024-11-16 23:34:42,227 INFO L378 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 [2024-11-16 23:34:42,270 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 23:34:42,271 INFO L378 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 [2024-11-16 23:34:42,316 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 23:34:42,316 INFO L378 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 [2024-11-16 23:34:42,436 INFO L378 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 56 treesize of output 45 [2024-11-16 23:34:42,464 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-16 23:34:42,464 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 23:34:42,497 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (and (forall ((v_ArrVal_297 (Array Int Int))) (= (select (select (store |c_#race| |c_~#a~0.base| v_ArrVal_297) |c_ULTIMATE.start_main_~#t~1#1.base|) (+ .cse0 |c_ULTIMATE.start_main_~#t~1#1.offset|)) |c_ULTIMATE.start_main_#t~nondet7#1|)) (forall ((v_ArrVal_297 (Array Int Int))) (= (select (select (store |c_#race| |c_~#a~0.base| v_ArrVal_297) |c_ULTIMATE.start_main_~#t~1#1.base|) (+ .cse0 2 |c_ULTIMATE.start_main_~#t~1#1.offset|)) |c_ULTIMATE.start_main_#t~nondet7#1|)) (forall ((v_ArrVal_297 (Array Int Int))) (= (select (select (store |c_#race| |c_~#a~0.base| v_ArrVal_297) |c_ULTIMATE.start_main_~#t~1#1.base|) (+ .cse0 3 |c_ULTIMATE.start_main_~#t~1#1.offset|)) |c_ULTIMATE.start_main_#t~nondet7#1|)) (forall ((v_ArrVal_297 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet7#1| (select (select (store |c_#race| |c_~#a~0.base| v_ArrVal_297) |c_ULTIMATE.start_main_~#t~1#1.base|) (+ .cse0 |c_ULTIMATE.start_main_~#t~1#1.offset| 1)))))) is different from false [2024-11-16 23:34:42,645 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse2 (+ .cse1 3 |c_ULTIMATE.start_main_~#t~1#1.offset|))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#t~1#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#t~1#1.base|) .cse2 |c_ULTIMATE.start_main_#t~nondet7#1|)))) (and (forall ((v_ArrVal_297 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet7#1| (select (select (store .cse0 |c_~#a~0.base| v_ArrVal_297) |c_ULTIMATE.start_main_~#t~1#1.base|) (+ .cse1 |c_ULTIMATE.start_main_~#t~1#1.offset|)))) (forall ((v_ArrVal_297 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet7#1| (select (select (store .cse0 |c_~#a~0.base| v_ArrVal_297) |c_ULTIMATE.start_main_~#t~1#1.base|) (+ .cse1 |c_ULTIMATE.start_main_~#t~1#1.offset| 1)))) (forall ((v_ArrVal_297 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet7#1| (select (select (store .cse0 |c_~#a~0.base| v_ArrVal_297) |c_ULTIMATE.start_main_~#t~1#1.base|) .cse2))) (forall ((v_ArrVal_297 (Array Int Int))) (= (select (select (store .cse0 |c_~#a~0.base| v_ArrVal_297) |c_ULTIMATE.start_main_~#t~1#1.base|) (+ .cse1 2 |c_ULTIMATE.start_main_~#t~1#1.offset|)) |c_ULTIMATE.start_main_#t~nondet7#1|)))))) is different from false [2024-11-16 23:34:42,666 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse3 (+ .cse1 2 |c_ULTIMATE.start_main_~#t~1#1.offset|)) (.cse2 (+ .cse1 3 |c_ULTIMATE.start_main_~#t~1#1.offset|))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#t~1#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~#t~1#1.base|) .cse3 |c_ULTIMATE.start_main_#t~nondet7#1|) .cse2 |c_ULTIMATE.start_main_#t~nondet7#1|)))) (and (forall ((v_ArrVal_297 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet7#1| (select (select (store .cse0 |c_~#a~0.base| v_ArrVal_297) |c_ULTIMATE.start_main_~#t~1#1.base|) (+ .cse1 |c_ULTIMATE.start_main_~#t~1#1.offset| 1)))) (forall ((v_ArrVal_297 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet7#1| (select (select (store .cse0 |c_~#a~0.base| v_ArrVal_297) |c_ULTIMATE.start_main_~#t~1#1.base|) (+ .cse1 |c_ULTIMATE.start_main_~#t~1#1.offset|)))) (forall ((v_ArrVal_297 (Array Int Int))) (= (select (select (store .cse0 |c_~#a~0.base| v_ArrVal_297) |c_ULTIMATE.start_main_~#t~1#1.base|) .cse2) |c_ULTIMATE.start_main_#t~nondet7#1|)) (forall ((v_ArrVal_297 (Array Int Int))) (= (select (select (store .cse0 |c_~#a~0.base| v_ArrVal_297) |c_ULTIMATE.start_main_~#t~1#1.base|) .cse3) |c_ULTIMATE.start_main_#t~nondet7#1|)))))) is different from false [2024-11-16 23:34:44,618 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 23:34:44,618 INFO L378 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 50 treesize of output 66 [2024-11-16 23:34:44,624 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 23:34:44,625 INFO L378 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 113 treesize of output 34 [2024-11-16 23:34:44,635 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-11-16 23:34:44,635 INFO L378 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 51 treesize of output 1 [2024-11-16 23:34:44,640 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-11-16 23:34:44,640 INFO L378 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 51 treesize of output 1 [2024-11-16 23:34:44,645 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-11-16 23:34:44,645 INFO L378 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 51 treesize of output 1 [2024-11-16 23:34:44,722 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 1 times theorem prover too weak. 7 trivial. 2 not checked. [2024-11-16 23:34:44,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [474329315] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 23:34:44,723 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 23:34:44,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 21 [2024-11-16 23:34:44,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192576448] [2024-11-16 23:34:44,723 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 23:34:44,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-16 23:34:44,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:34:44,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-16 23:34:44,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=252, Unknown=10, NotChecked=108, Total=462 [2024-11-16 23:34:44,834 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 158 [2024-11-16 23:34:44,836 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 365 transitions, 2290 flow. Second operand has 22 states, 22 states have (on average 77.63636363636364) internal successors, (1708), 22 states have internal predecessors, (1708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:34:44,836 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:34:44,836 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 158 [2024-11-16 23:34:44,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:34:49,426 INFO L124 PetriNetUnfolderBase]: 14082/37686 cut-off events. [2024-11-16 23:34:49,426 INFO L125 PetriNetUnfolderBase]: For 44409/44557 co-relation queries the response was YES. [2024-11-16 23:34:49,544 INFO L83 FinitePrefix]: Finished finitePrefix Result has 108353 conditions, 37686 events. 14082/37686 cut-off events. For 44409/44557 co-relation queries the response was YES. Maximal size of possible extension queue 1153. Compared 432973 event pairs, 5901 based on Foata normal form. 264/34851 useless extension candidates. Maximal degree in co-relation 108328. Up to 17395 conditions per place. [2024-11-16 23:34:49,694 INFO L140 encePairwiseOnDemand]: 148/158 looper letters, 405 selfloop transitions, 32 changer transitions 0/524 dead transitions. [2024-11-16 23:34:49,694 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 524 transitions, 4360 flow [2024-11-16 23:34:49,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-16 23:34:49,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-16 23:34:49,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 813 transitions. [2024-11-16 23:34:49,697 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5717299578059072 [2024-11-16 23:34:49,697 INFO L175 Difference]: Start difference. First operand has 191 places, 365 transitions, 2290 flow. Second operand 9 states and 813 transitions. [2024-11-16 23:34:49,698 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 524 transitions, 4360 flow [2024-11-16 23:34:50,054 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 524 transitions, 4220 flow, removed 70 selfloop flow, removed 0 redundant places. [2024-11-16 23:34:50,060 INFO L231 Difference]: Finished difference. Result has 198 places, 364 transitions, 2210 flow [2024-11-16 23:34:50,061 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=158, PETRI_DIFFERENCE_MINUEND_FLOW=2146, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=364, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=332, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2210, PETRI_PLACES=198, PETRI_TRANSITIONS=364} [2024-11-16 23:34:50,062 INFO L277 CegarLoopForPetriNet]: 154 programPoint places, 44 predicate places. [2024-11-16 23:34:50,062 INFO L471 AbstractCegarLoop]: Abstraction has has 198 places, 364 transitions, 2210 flow [2024-11-16 23:34:50,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 77.63636363636364) internal successors, (1708), 22 states have internal predecessors, (1708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:34:50,063 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:34:50,063 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:34:50,077 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-16 23:34:50,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-16 23:34:50,264 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thrErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2024-11-16 23:34:50,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:34:50,264 INFO L85 PathProgramCache]: Analyzing trace with hash -922543609, now seen corresponding path program 1 times [2024-11-16 23:34:50,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:34:50,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610282399] [2024-11-16 23:34:50,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:34:50,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:34:50,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:34:50,522 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:34:50,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:34:50,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610282399] [2024-11-16 23:34:50,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610282399] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:34:50,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:34:50,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-16 23:34:50,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419563605] [2024-11-16 23:34:50,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:34:50,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-16 23:34:50,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:34:50,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-16 23:34:50,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-16 23:34:50,917 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 158 [2024-11-16 23:34:50,919 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 364 transitions, 2210 flow. Second operand has 10 states, 10 states have (on average 116.7) internal successors, (1167), 10 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) [2024-11-16 23:34:50,919 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:34:50,919 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 158 [2024-11-16 23:34:50,919 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:34:53,744 INFO L124 PetriNetUnfolderBase]: 7009/22264 cut-off events. [2024-11-16 23:34:53,745 INFO L125 PetriNetUnfolderBase]: For 25197/26496 co-relation queries the response was YES. [2024-11-16 23:34:53,798 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67385 conditions, 22264 events. 7009/22264 cut-off events. For 25197/26496 co-relation queries the response was YES. Maximal size of possible extension queue 913. Compared 254080 event pairs, 890 based on Foata normal form. 375/21141 useless extension candidates. Maximal degree in co-relation 67359. Up to 5007 conditions per place. [2024-11-16 23:34:53,852 INFO L140 encePairwiseOnDemand]: 139/158 looper letters, 326 selfloop transitions, 238 changer transitions 1/699 dead transitions. [2024-11-16 23:34:53,852 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 699 transitions, 5822 flow [2024-11-16 23:34:53,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-16 23:34:53,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-16 23:34:53,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1305 transitions. [2024-11-16 23:34:53,855 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8259493670886076 [2024-11-16 23:34:53,855 INFO L175 Difference]: Start difference. First operand has 198 places, 364 transitions, 2210 flow. Second operand 10 states and 1305 transitions. [2024-11-16 23:34:53,855 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 207 places, 699 transitions, 5822 flow [2024-11-16 23:34:53,955 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 699 transitions, 5694 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-11-16 23:34:53,963 INFO L231 Difference]: Finished difference. Result has 206 places, 537 transitions, 4597 flow [2024-11-16 23:34:53,963 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=158, PETRI_DIFFERENCE_MINUEND_FLOW=2146, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=364, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=100, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=204, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4597, PETRI_PLACES=206, PETRI_TRANSITIONS=537} [2024-11-16 23:34:53,963 INFO L277 CegarLoopForPetriNet]: 154 programPoint places, 52 predicate places. [2024-11-16 23:34:53,964 INFO L471 AbstractCegarLoop]: Abstraction has has 206 places, 537 transitions, 4597 flow [2024-11-16 23:34:53,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 116.7) internal successors, (1167), 10 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) [2024-11-16 23:34:53,964 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:34:53,964 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:34:53,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-16 23:34:53,965 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2024-11-16 23:34:53,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:34:53,965 INFO L85 PathProgramCache]: Analyzing trace with hash -1697036539, now seen corresponding path program 1 times [2024-11-16 23:34:53,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:34:53,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451294564] [2024-11-16 23:34:53,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:34:53,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:34:53,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:34:54,211 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-16 23:34:54,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:34:54,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451294564] [2024-11-16 23:34:54,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451294564] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:34:54,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:34:54,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-16 23:34:54,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607034133] [2024-11-16 23:34:54,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:34:54,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-16 23:34:54,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:34:54,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-16 23:34:54,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-16 23:34:54,856 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 158 [2024-11-16 23:34:54,858 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 537 transitions, 4597 flow. Second operand has 10 states, 10 states have (on average 116.0) internal successors, (1160), 10 states have internal predecessors, (1160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:34:54,858 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:34:54,858 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 158 [2024-11-16 23:34:54,858 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:34:57,799 INFO L124 PetriNetUnfolderBase]: 6467/22348 cut-off events. [2024-11-16 23:34:57,800 INFO L125 PetriNetUnfolderBase]: For 48699/50262 co-relation queries the response was YES. [2024-11-16 23:34:57,883 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76253 conditions, 22348 events. 6467/22348 cut-off events. For 48699/50262 co-relation queries the response was YES. Maximal size of possible extension queue 847. Compared 262314 event pairs, 938 based on Foata normal form. 360/20838 useless extension candidates. Maximal degree in co-relation 76220. Up to 5192 conditions per place. [2024-11-16 23:34:58,095 INFO L140 encePairwiseOnDemand]: 148/158 looper letters, 476 selfloop transitions, 38 changer transitions 0/682 dead transitions. [2024-11-16 23:34:58,096 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 682 transitions, 7433 flow [2024-11-16 23:34:58,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-16 23:34:58,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-16 23:34:58,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1103 transitions. [2024-11-16 23:34:58,098 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7756680731364276 [2024-11-16 23:34:58,098 INFO L175 Difference]: Start difference. First operand has 206 places, 537 transitions, 4597 flow. Second operand 9 states and 1103 transitions. [2024-11-16 23:34:58,098 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 213 places, 682 transitions, 7433 flow [2024-11-16 23:34:58,268 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 211 places, 682 transitions, 7396 flow, removed 17 selfloop flow, removed 2 redundant places. [2024-11-16 23:34:58,274 INFO L231 Difference]: Finished difference. Result has 211 places, 536 transitions, 4640 flow [2024-11-16 23:34:58,274 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=158, PETRI_DIFFERENCE_MINUEND_FLOW=4564, PETRI_DIFFERENCE_MINUEND_PLACES=203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=536, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=498, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4640, PETRI_PLACES=211, PETRI_TRANSITIONS=536} [2024-11-16 23:34:58,275 INFO L277 CegarLoopForPetriNet]: 154 programPoint places, 57 predicate places. [2024-11-16 23:34:58,275 INFO L471 AbstractCegarLoop]: Abstraction has has 211 places, 536 transitions, 4640 flow [2024-11-16 23:34:58,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 116.0) internal successors, (1160), 10 states have internal predecessors, (1160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:34:58,275 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:34:58,275 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:34:58,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-16 23:34:58,276 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thrErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2024-11-16 23:34:58,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:34:58,276 INFO L85 PathProgramCache]: Analyzing trace with hash 1905840696, now seen corresponding path program 1 times [2024-11-16 23:34:58,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:34:58,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058287990] [2024-11-16 23:34:58,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:34:58,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:34:58,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:34:58,445 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-16 23:34:58,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:34:58,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058287990] [2024-11-16 23:34:58,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058287990] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:34:58,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:34:58,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 23:34:58,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482917501] [2024-11-16 23:34:58,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:34:58,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 23:34:58,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:34:58,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 23:34:58,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-16 23:34:58,600 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 158 [2024-11-16 23:34:58,601 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 536 transitions, 4640 flow. Second operand has 6 states, 6 states have (on average 123.33333333333333) internal successors, (740), 6 states have internal predecessors, (740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:34:58,601 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:34:58,601 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 158 [2024-11-16 23:34:58,602 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:35:01,908 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([474] thrEXIT-->L706: Formula: (= |v_ULTIMATE.start_main_#t~mem10#1_8| v_thrThread1of2ForFork0_thidvar0_4) InVars {thrThread1of2ForFork0_thidvar0=v_thrThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_8|} OutVars{thrThread1of2ForFork0_thidvar0=v_thrThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_8|} AuxVars[] AssignedVars[][216], [Black: 188#(and (= |thrThread1of2ForFork0_#t~nondet3| (select (select |#race| |~#a~0.base|) (+ 3 (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|))) (= (select (select |#race| |~#a~0.base|) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread1of2ForFork0_#t~nondet3|) (= |thrThread1of2ForFork0_#t~nondet3| (select (select |#race| |~#a~0.base|) (+ 2 (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|))) (= (select (select |#race| |~#a~0.base|) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset| 1)) |thrThread1of2ForFork0_#t~nondet3|)), 161#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 195#(= |thrThread1of2ForFork0_#t~nondet4| |#race~x~0|), 157#true, 675#(and (= (select |#valid| 3) 1) (= 3 |~#a~0.base|) (not (= |ULTIMATE.start_main_~#t~1#1.base| 3))), 152#true, Black: 201#(and (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 0)), Black: 200#(= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 0), 155#true, Black: 198#true, 167#true, Black: 202#(and (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ 2 |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 0)), 183#true, 124#L706true, 15#L695-4true, Black: 159#true, Black: 163#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~n~0#1| 0)), 712#(and (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ 3 |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 0) (= (select |#valid| 3) 1) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ 2 |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 0) (= 3 |~#a~0.base|) (not (= |ULTIMATE.start_main_~#t~1#1.base| 3)) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 0)), Black: 171#(and (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ 2 |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet7#1|)), Black: 679#(and (= (select (select |#race| 3) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset| 1)) |thrThread1of2ForFork0_#t~nondet3|) (= (select |#valid| 3) 1) (= 3 |~#a~0.base|) (not (= |ULTIMATE.start_main_~#t~1#1.base| 3)) (= (select (select |#race| 3) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread1of2ForFork0_#t~nondet3|)), 203#(and (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ 3 |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ 2 |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 0)), Black: 170#(and (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet7#1|)), Black: 681#(and (= (select (select |#race| 3) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset| 1)) |thrThread1of2ForFork0_#t~nondet3|) (= (select |#valid| 3) 1) (= |thrThread1of2ForFork0_#t~nondet3| (select (select |#race| 3) (+ 2 (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|))) (= 3 |~#a~0.base|) (not (= |ULTIMATE.start_main_~#t~1#1.base| 3)) (= (select (select |#race| 3) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread1of2ForFork0_#t~nondet3|)), Black: 172#(and (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ 2 |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ 3 |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet7#1|)), Black: 169#(= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|), Black: 667#(and (= (select |#valid| 3) 1) (= 3 |~#a~0.base|)), Black: 677#(and (= (select |#valid| 3) 1) (= 3 |~#a~0.base|) (not (= |ULTIMATE.start_main_~#t~1#1.base| 3)) (= (select (select |#race| 3) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread1of2ForFork0_#t~nondet3|)), Black: 685#(and (= (select (select |#race| 3) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset| 1)) |thrThread1of2ForFork0_#t~nondet3|) (= (select |#valid| 3) 1) (= |thrThread1of2ForFork0_#t~nondet3| (select (select |#race| 3) (+ 2 (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|))) (= |thrThread1of2ForFork0_#t~nondet3| (select (select |#race| 3) (+ 3 (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|))) (= 3 |~#a~0.base|) (= (select (select |#race| 3) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread1of2ForFork0_#t~nondet3|)), Black: 683#(and (= (select (select |#race| 3) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset| 1)) |thrThread1of2ForFork0_#t~nondet3|) (= (select |#valid| 3) 1) (= |thrThread1of2ForFork0_#t~nondet3| (select (select |#race| 3) (+ 2 (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|))) (= |thrThread1of2ForFork0_#t~nondet3| (select (select |#race| 3) (+ 3 (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|))) (= 3 |~#a~0.base|) (not (= |ULTIMATE.start_main_~#t~1#1.base| 3)) (= (select (select |#race| 3) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread1of2ForFork0_#t~nondet3|)), Black: 178#true, Black: 185#(= (select (select |#race| |~#a~0.base|) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread1of2ForFork0_#t~nondet3|), Black: 186#(and (= (select (select |#race| |~#a~0.base|) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread1of2ForFork0_#t~nondet3|) (= (select (select |#race| |~#a~0.base|) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset| 1)) |thrThread1of2ForFork0_#t~nondet3|)), 713#true, Black: 187#(and (= (select (select |#race| |~#a~0.base|) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread1of2ForFork0_#t~nondet3|) (= |thrThread1of2ForFork0_#t~nondet3| (select (select |#race| |~#a~0.base|) (+ 2 (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|))) (= (select (select |#race| |~#a~0.base|) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset| 1)) |thrThread1of2ForFork0_#t~nondet3|))]) [2024-11-16 23:35:01,910 INFO L294 olderBase$Statistics]: this new event has 113 ancestors and is not cut-off event [2024-11-16 23:35:01,910 INFO L297 olderBase$Statistics]: existing Event has 113 ancestors and is not cut-off event [2024-11-16 23:35:01,910 INFO L297 olderBase$Statistics]: existing Event has 113 ancestors and is not cut-off event [2024-11-16 23:35:01,910 INFO L297 olderBase$Statistics]: existing Event has 113 ancestors and is not cut-off event [2024-11-16 23:35:02,729 INFO L124 PetriNetUnfolderBase]: 11965/33026 cut-off events. [2024-11-16 23:35:02,730 INFO L125 PetriNetUnfolderBase]: For 86789/89077 co-relation queries the response was YES. [2024-11-16 23:35:02,859 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120437 conditions, 33026 events. 11965/33026 cut-off events. For 86789/89077 co-relation queries the response was YES. Maximal size of possible extension queue 1403. Compared 373964 event pairs, 1377 based on Foata normal form. 41/30911 useless extension candidates. Maximal degree in co-relation 120404. Up to 14387 conditions per place. [2024-11-16 23:35:02,956 INFO L140 encePairwiseOnDemand]: 135/158 looper letters, 367 selfloop transitions, 354 changer transitions 0/893 dead transitions. [2024-11-16 23:35:02,957 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 893 transitions, 9356 flow [2024-11-16 23:35:02,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 23:35:02,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-16 23:35:02,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 842 transitions. [2024-11-16 23:35:02,958 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8881856540084389 [2024-11-16 23:35:02,958 INFO L175 Difference]: Start difference. First operand has 211 places, 536 transitions, 4640 flow. Second operand 6 states and 842 transitions. [2024-11-16 23:35:02,958 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 216 places, 893 transitions, 9356 flow [2024-11-16 23:35:03,406 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 208 places, 893 transitions, 9132 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-11-16 23:35:03,417 INFO L231 Difference]: Finished difference. Result has 212 places, 824 transitions, 8457 flow [2024-11-16 23:35:03,417 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=158, PETRI_DIFFERENCE_MINUEND_FLOW=4564, PETRI_DIFFERENCE_MINUEND_PLACES=203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=536, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=121, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=311, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=8457, PETRI_PLACES=212, PETRI_TRANSITIONS=824} [2024-11-16 23:35:03,418 INFO L277 CegarLoopForPetriNet]: 154 programPoint places, 58 predicate places. [2024-11-16 23:35:03,418 INFO L471 AbstractCegarLoop]: Abstraction has has 212 places, 824 transitions, 8457 flow [2024-11-16 23:35:03,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 123.33333333333333) internal successors, (740), 6 states have internal predecessors, (740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:35:03,418 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:35:03,418 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:35:03,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-16 23:35:03,418 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thrErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2024-11-16 23:35:03,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:35:03,419 INFO L85 PathProgramCache]: Analyzing trace with hash -1642485850, now seen corresponding path program 1 times [2024-11-16 23:35:03,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:35:03,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106324145] [2024-11-16 23:35:03,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:35:03,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:35:03,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:35:03,451 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-16 23:35:03,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:35:03,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106324145] [2024-11-16 23:35:03,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106324145] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:35:03,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:35:03,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:35:03,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929043778] [2024-11-16 23:35:03,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:35:03,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:35:03,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:35:03,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:35:03,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:35:03,468 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 158 [2024-11-16 23:35:03,469 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 212 places, 824 transitions, 8457 flow. Second operand has 3 states, 3 states have (on average 141.0) internal successors, (423), 3 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:35:03,469 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:35:03,469 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 158 [2024-11-16 23:35:03,469 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:35:06,648 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([474] thrEXIT-->L706: Formula: (= |v_ULTIMATE.start_main_#t~mem10#1_8| v_thrThread1of2ForFork0_thidvar0_4) InVars {thrThread1of2ForFork0_thidvar0=v_thrThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_8|} OutVars{thrThread1of2ForFork0_thidvar0=v_thrThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_8|} AuxVars[] AssignedVars[][220], [723#true, Black: 188#(and (= |thrThread1of2ForFork0_#t~nondet3| (select (select |#race| |~#a~0.base|) (+ 3 (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|))) (= (select (select |#race| |~#a~0.base|) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread1of2ForFork0_#t~nondet3|) (= |thrThread1of2ForFork0_#t~nondet3| (select (select |#race| |~#a~0.base|) (+ 2 (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|))) (= (select (select |#race| |~#a~0.base|) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset| 1)) |thrThread1of2ForFork0_#t~nondet3|)), 161#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 195#(= |thrThread1of2ForFork0_#t~nondet4| |#race~x~0|), 157#true, 675#(and (= (select |#valid| 3) 1) (= 3 |~#a~0.base|) (not (= |ULTIMATE.start_main_~#t~1#1.base| 3))), 152#true, Black: 201#(and (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 0)), 155#true, Black: 200#(= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 0), Black: 198#true, 167#true, Black: 715#(= (select (select |#race| |~#a~0.base|) (+ (* thrThread2of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread2of2ForFork0_#t~nondet3|), Black: 202#(and (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ 2 |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 0)), Black: 718#(and (= |thrThread2of2ForFork0_#t~nondet3| (select (select |#race| |~#a~0.base|) (+ 3 (* thrThread2of2ForFork0_~t~0 4) |~#a~0.offset|))) (= |thrThread2of2ForFork0_#t~nondet3| (select (select |#race| |~#a~0.base|) (+ 2 (* thrThread2of2ForFork0_~t~0 4) |~#a~0.offset|))) (= |thrThread2of2ForFork0_#t~nondet3| (select (select |#race| |~#a~0.base|) (+ (* thrThread2of2ForFork0_~t~0 4) |~#a~0.offset| 1))) (= (select (select |#race| |~#a~0.base|) (+ (* thrThread2of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread2of2ForFork0_#t~nondet3|)), Black: 716#(and (= |thrThread2of2ForFork0_#t~nondet3| (select (select |#race| |~#a~0.base|) (+ (* thrThread2of2ForFork0_~t~0 4) |~#a~0.offset| 1))) (= (select (select |#race| |~#a~0.base|) (+ (* thrThread2of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread2of2ForFork0_#t~nondet3|)), 183#true, Black: 717#(and (= |thrThread2of2ForFork0_#t~nondet3| (select (select |#race| |~#a~0.base|) (+ 2 (* thrThread2of2ForFork0_~t~0 4) |~#a~0.offset|))) (= |thrThread2of2ForFork0_#t~nondet3| (select (select |#race| |~#a~0.base|) (+ (* thrThread2of2ForFork0_~t~0 4) |~#a~0.offset| 1))) (= (select (select |#race| |~#a~0.base|) (+ (* thrThread2of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread2of2ForFork0_#t~nondet3|)), 124#L706true, 59#L695-2true, Black: 159#true, Black: 163#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~n~0#1| 0)), Black: 171#(and (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ 2 |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet7#1|)), Black: 170#(and (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet7#1|)), 203#(and (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ 3 |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ 2 |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 0)), Black: 679#(and (= (select (select |#race| 3) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset| 1)) |thrThread1of2ForFork0_#t~nondet3|) (= (select |#valid| 3) 1) (= 3 |~#a~0.base|) (not (= |ULTIMATE.start_main_~#t~1#1.base| 3)) (= (select (select |#race| 3) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread1of2ForFork0_#t~nondet3|)), Black: 681#(and (= (select (select |#race| 3) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset| 1)) |thrThread1of2ForFork0_#t~nondet3|) (= (select |#valid| 3) 1) (= |thrThread1of2ForFork0_#t~nondet3| (select (select |#race| 3) (+ 2 (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|))) (= 3 |~#a~0.base|) (not (= |ULTIMATE.start_main_~#t~1#1.base| 3)) (= (select (select |#race| 3) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread1of2ForFork0_#t~nondet3|)), Black: 172#(and (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ 2 |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ 3 |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet7#1|)), Black: 169#(= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|), Black: 667#(and (= (select |#valid| 3) 1) (= 3 |~#a~0.base|)), Black: 677#(and (= (select |#valid| 3) 1) (= 3 |~#a~0.base|) (not (= |ULTIMATE.start_main_~#t~1#1.base| 3)) (= (select (select |#race| 3) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread1of2ForFork0_#t~nondet3|)), Black: 685#(and (= (select (select |#race| 3) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset| 1)) |thrThread1of2ForFork0_#t~nondet3|) (= (select |#valid| 3) 1) (= |thrThread1of2ForFork0_#t~nondet3| (select (select |#race| 3) (+ 2 (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|))) (= |thrThread1of2ForFork0_#t~nondet3| (select (select |#race| 3) (+ 3 (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|))) (= 3 |~#a~0.base|) (= (select (select |#race| 3) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread1of2ForFork0_#t~nondet3|)), Black: 683#(and (= (select (select |#race| 3) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset| 1)) |thrThread1of2ForFork0_#t~nondet3|) (= (select |#valid| 3) 1) (= |thrThread1of2ForFork0_#t~nondet3| (select (select |#race| 3) (+ 2 (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|))) (= |thrThread1of2ForFork0_#t~nondet3| (select (select |#race| 3) (+ 3 (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|))) (= 3 |~#a~0.base|) (not (= |ULTIMATE.start_main_~#t~1#1.base| 3)) (= (select (select |#race| 3) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread1of2ForFork0_#t~nondet3|)), Black: 178#true, Black: 185#(= (select (select |#race| |~#a~0.base|) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread1of2ForFork0_#t~nondet3|), Black: 186#(and (= (select (select |#race| |~#a~0.base|) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread1of2ForFork0_#t~nondet3|) (= (select (select |#race| |~#a~0.base|) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset| 1)) |thrThread1of2ForFork0_#t~nondet3|)), Black: 187#(and (= (select (select |#race| |~#a~0.base|) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread1of2ForFork0_#t~nondet3|) (= |thrThread1of2ForFork0_#t~nondet3| (select (select |#race| |~#a~0.base|) (+ 2 (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|))) (= (select (select |#race| |~#a~0.base|) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset| 1)) |thrThread1of2ForFork0_#t~nondet3|)), 713#true]) [2024-11-16 23:35:06,648 INFO L294 olderBase$Statistics]: this new event has 115 ancestors and is cut-off event [2024-11-16 23:35:06,648 INFO L297 olderBase$Statistics]: existing Event has 115 ancestors and is cut-off event [2024-11-16 23:35:06,648 INFO L297 olderBase$Statistics]: existing Event has 115 ancestors and is cut-off event [2024-11-16 23:35:06,648 INFO L297 olderBase$Statistics]: existing Event has 115 ancestors and is cut-off event [2024-11-16 23:35:06,714 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([474] thrEXIT-->L706: Formula: (= |v_ULTIMATE.start_main_#t~mem10#1_8| v_thrThread1of2ForFork0_thidvar0_4) InVars {thrThread1of2ForFork0_thidvar0=v_thrThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_8|} OutVars{thrThread1of2ForFork0_thidvar0=v_thrThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_8|} AuxVars[] AssignedVars[][780], [Black: 188#(and (= |thrThread1of2ForFork0_#t~nondet3| (select (select |#race| |~#a~0.base|) (+ 3 (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|))) (= (select (select |#race| |~#a~0.base|) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread1of2ForFork0_#t~nondet3|) (= |thrThread1of2ForFork0_#t~nondet3| (select (select |#race| |~#a~0.base|) (+ 2 (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|))) (= (select (select |#race| |~#a~0.base|) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset| 1)) |thrThread1of2ForFork0_#t~nondet3|)), 161#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 195#(= |thrThread1of2ForFork0_#t~nondet4| |#race~x~0|), 157#true, 675#(and (= (select |#valid| 3) 1) (= 3 |~#a~0.base|) (not (= |ULTIMATE.start_main_~#t~1#1.base| 3))), 152#true, Black: 201#(and (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 0)), 155#true, Black: 200#(= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 0), Black: 198#true, 167#true, Black: 715#(= (select (select |#race| |~#a~0.base|) (+ (* thrThread2of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread2of2ForFork0_#t~nondet3|), Black: 202#(and (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ 2 |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 0)), Black: 718#(and (= |thrThread2of2ForFork0_#t~nondet3| (select (select |#race| |~#a~0.base|) (+ 3 (* thrThread2of2ForFork0_~t~0 4) |~#a~0.offset|))) (= |thrThread2of2ForFork0_#t~nondet3| (select (select |#race| |~#a~0.base|) (+ 2 (* thrThread2of2ForFork0_~t~0 4) |~#a~0.offset|))) (= |thrThread2of2ForFork0_#t~nondet3| (select (select |#race| |~#a~0.base|) (+ (* thrThread2of2ForFork0_~t~0 4) |~#a~0.offset| 1))) (= (select (select |#race| |~#a~0.base|) (+ (* thrThread2of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread2of2ForFork0_#t~nondet3|)), Black: 716#(and (= |thrThread2of2ForFork0_#t~nondet3| (select (select |#race| |~#a~0.base|) (+ (* thrThread2of2ForFork0_~t~0 4) |~#a~0.offset| 1))) (= (select (select |#race| |~#a~0.base|) (+ (* thrThread2of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread2of2ForFork0_#t~nondet3|)), 183#true, Black: 717#(and (= |thrThread2of2ForFork0_#t~nondet3| (select (select |#race| |~#a~0.base|) (+ 2 (* thrThread2of2ForFork0_~t~0 4) |~#a~0.offset|))) (= |thrThread2of2ForFork0_#t~nondet3| (select (select |#race| |~#a~0.base|) (+ (* thrThread2of2ForFork0_~t~0 4) |~#a~0.offset| 1))) (= (select (select |#race| |~#a~0.base|) (+ (* thrThread2of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread2of2ForFork0_#t~nondet3|)), 124#L706true, Black: 159#true, Black: 163#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~n~0#1| 0)), Black: 171#(and (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ 2 |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet7#1|)), Black: 170#(and (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet7#1|)), 203#(and (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ 3 |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ 2 |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 0)), Black: 679#(and (= (select (select |#race| 3) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset| 1)) |thrThread1of2ForFork0_#t~nondet3|) (= (select |#valid| 3) 1) (= 3 |~#a~0.base|) (not (= |ULTIMATE.start_main_~#t~1#1.base| 3)) (= (select (select |#race| 3) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread1of2ForFork0_#t~nondet3|)), Black: 681#(and (= (select (select |#race| 3) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset| 1)) |thrThread1of2ForFork0_#t~nondet3|) (= (select |#valid| 3) 1) (= |thrThread1of2ForFork0_#t~nondet3| (select (select |#race| 3) (+ 2 (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|))) (= 3 |~#a~0.base|) (not (= |ULTIMATE.start_main_~#t~1#1.base| 3)) (= (select (select |#race| 3) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread1of2ForFork0_#t~nondet3|)), Black: 172#(and (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ 2 |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ 3 |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet7#1|)), Black: 169#(= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|), Black: 667#(and (= (select |#valid| 3) 1) (= 3 |~#a~0.base|)), 40#L695true, Black: 677#(and (= (select |#valid| 3) 1) (= 3 |~#a~0.base|) (not (= |ULTIMATE.start_main_~#t~1#1.base| 3)) (= (select (select |#race| 3) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread1of2ForFork0_#t~nondet3|)), Black: 685#(and (= (select (select |#race| 3) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset| 1)) |thrThread1of2ForFork0_#t~nondet3|) (= (select |#valid| 3) 1) (= |thrThread1of2ForFork0_#t~nondet3| (select (select |#race| 3) (+ 2 (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|))) (= |thrThread1of2ForFork0_#t~nondet3| (select (select |#race| 3) (+ 3 (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|))) (= 3 |~#a~0.base|) (= (select (select |#race| 3) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread1of2ForFork0_#t~nondet3|)), Black: 683#(and (= (select (select |#race| 3) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset| 1)) |thrThread1of2ForFork0_#t~nondet3|) (= (select |#valid| 3) 1) (= |thrThread1of2ForFork0_#t~nondet3| (select (select |#race| 3) (+ 2 (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|))) (= |thrThread1of2ForFork0_#t~nondet3| (select (select |#race| 3) (+ 3 (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|))) (= 3 |~#a~0.base|) (not (= |ULTIMATE.start_main_~#t~1#1.base| 3)) (= (select (select |#race| 3) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread1of2ForFork0_#t~nondet3|)), Black: 180#(= |#race~x~0| 0), Black: 185#(= (select (select |#race| |~#a~0.base|) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread1of2ForFork0_#t~nondet3|), Black: 186#(and (= (select (select |#race| |~#a~0.base|) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread1of2ForFork0_#t~nondet3|) (= (select (select |#race| |~#a~0.base|) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset| 1)) |thrThread1of2ForFork0_#t~nondet3|)), 725#(= |thrThread2of2ForFork0_#t~nondet4| |#race~x~0|), Black: 187#(and (= (select (select |#race| |~#a~0.base|) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread1of2ForFork0_#t~nondet3|) (= |thrThread1of2ForFork0_#t~nondet3| (select (select |#race| |~#a~0.base|) (+ 2 (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|))) (= (select (select |#race| |~#a~0.base|) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset| 1)) |thrThread1of2ForFork0_#t~nondet3|)), 713#true]) [2024-11-16 23:35:06,714 INFO L294 olderBase$Statistics]: this new event has 117 ancestors and is cut-off event [2024-11-16 23:35:06,714 INFO L297 olderBase$Statistics]: existing Event has 117 ancestors and is cut-off event [2024-11-16 23:35:06,714 INFO L297 olderBase$Statistics]: existing Event has 117 ancestors and is cut-off event [2024-11-16 23:35:06,714 INFO L297 olderBase$Statistics]: existing Event has 117 ancestors and is cut-off event [2024-11-16 23:35:07,618 INFO L124 PetriNetUnfolderBase]: 10368/30695 cut-off events. [2024-11-16 23:35:07,618 INFO L125 PetriNetUnfolderBase]: For 86385/88570 co-relation queries the response was YES. [2024-11-16 23:35:07,766 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114948 conditions, 30695 events. 10368/30695 cut-off events. For 86385/88570 co-relation queries the response was YES. Maximal size of possible extension queue 1492. Compared 359742 event pairs, 739 based on Foata normal form. 84/29791 useless extension candidates. Maximal degree in co-relation 114911. Up to 7284 conditions per place. [2024-11-16 23:35:07,888 INFO L140 encePairwiseOnDemand]: 152/158 looper letters, 16 selfloop transitions, 9 changer transitions 0/830 dead transitions. [2024-11-16 23:35:07,888 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 830 transitions, 8532 flow [2024-11-16 23:35:07,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:35:07,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:35:07,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 435 transitions. [2024-11-16 23:35:07,890 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9177215189873418 [2024-11-16 23:35:07,890 INFO L175 Difference]: Start difference. First operand has 212 places, 824 transitions, 8457 flow. Second operand 3 states and 435 transitions. [2024-11-16 23:35:07,890 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 214 places, 830 transitions, 8532 flow [2024-11-16 23:35:08,644 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 214 places, 830 transitions, 8448 flow, removed 42 selfloop flow, removed 0 redundant places. [2024-11-16 23:35:08,653 INFO L231 Difference]: Finished difference. Result has 216 places, 829 transitions, 8441 flow [2024-11-16 23:35:08,653 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=158, PETRI_DIFFERENCE_MINUEND_FLOW=8373, PETRI_DIFFERENCE_MINUEND_PLACES=212, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=824, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=815, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=8441, PETRI_PLACES=216, PETRI_TRANSITIONS=829} [2024-11-16 23:35:08,654 INFO L277 CegarLoopForPetriNet]: 154 programPoint places, 62 predicate places. [2024-11-16 23:35:08,654 INFO L471 AbstractCegarLoop]: Abstraction has has 216 places, 829 transitions, 8441 flow [2024-11-16 23:35:08,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 141.0) internal successors, (423), 3 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:35:08,654 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:35:08,654 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:35:08,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-16 23:35:08,654 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2024-11-16 23:35:08,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:35:08,655 INFO L85 PathProgramCache]: Analyzing trace with hash 1007675091, now seen corresponding path program 1 times [2024-11-16 23:35:08,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:35:08,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970897005] [2024-11-16 23:35:08,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:35:08,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:35:08,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 23:35:08,673 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-16 23:35:08,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 23:35:08,690 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-16 23:35:08,690 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-16 23:35:08,691 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 13 remaining) [2024-11-16 23:35:08,691 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (11 of 13 remaining) [2024-11-16 23:35:08,691 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (10 of 13 remaining) [2024-11-16 23:35:08,694 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (9 of 13 remaining) [2024-11-16 23:35:08,694 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONDATA_RACE (8 of 13 remaining) [2024-11-16 23:35:08,694 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1ASSERT_VIOLATIONDATA_RACE (7 of 13 remaining) [2024-11-16 23:35:08,695 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONDATA_RACE (6 of 13 remaining) [2024-11-16 23:35:08,695 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONDATA_RACE (5 of 13 remaining) [2024-11-16 23:35:08,695 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1ASSERT_VIOLATIONDATA_RACE (4 of 13 remaining) [2024-11-16 23:35:08,695 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONDATA_RACE (3 of 13 remaining) [2024-11-16 23:35:08,695 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONDATA_RACE (2 of 13 remaining) [2024-11-16 23:35:08,695 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1ASSERT_VIOLATIONDATA_RACE (1 of 13 remaining) [2024-11-16 23:35:08,695 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONDATA_RACE (0 of 13 remaining) [2024-11-16 23:35:08,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-16 23:35:08,696 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:35:08,696 WARN L244 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-16 23:35:08,696 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-11-16 23:35:08,721 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-11-16 23:35:08,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 178 places, 181 transitions, 389 flow [2024-11-16 23:35:08,771 INFO L124 PetriNetUnfolderBase]: 53/614 cut-off events. [2024-11-16 23:35:08,771 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2024-11-16 23:35:08,772 INFO L83 FinitePrefix]: Finished finitePrefix Result has 639 conditions, 614 events. 53/614 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2103 event pairs, 1 based on Foata normal form. 0/528 useless extension candidates. Maximal degree in co-relation 359. Up to 16 conditions per place. [2024-11-16 23:35:08,772 INFO L82 GeneralOperation]: Start removeDead. Operand has 178 places, 181 transitions, 389 flow [2024-11-16 23:35:08,774 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 178 places, 181 transitions, 389 flow [2024-11-16 23:35:08,775 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 23:35:08,775 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@511b1f49, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 23:35:08,775 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2024-11-16 23:35:08,780 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-16 23:35:08,780 INFO L124 PetriNetUnfolderBase]: 4/71 cut-off events. [2024-11-16 23:35:08,780 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-16 23:35:08,780 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:35:08,780 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:35:08,780 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-16 23:35:08,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:35:08,781 INFO L85 PathProgramCache]: Analyzing trace with hash 539379310, now seen corresponding path program 1 times [2024-11-16 23:35:08,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:35:08,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718749679] [2024-11-16 23:35:08,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:35:08,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:35:08,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:35:08,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:35:08,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:35:08,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718749679] [2024-11-16 23:35:08,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718749679] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:35:08,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:35:08,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:35:08,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140866229] [2024-11-16 23:35:08,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:35:08,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 23:35:08,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:35:08,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 23:35:08,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 23:35:08,795 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 181 [2024-11-16 23:35:08,796 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 181 transitions, 389 flow. Second operand has 2 states, 2 states have (on average 168.5) internal successors, (337), 2 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:35:08,796 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:35:08,796 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 181 [2024-11-16 23:35:08,796 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:35:08,855 INFO L124 PetriNetUnfolderBase]: 16/561 cut-off events. [2024-11-16 23:35:08,856 INFO L125 PetriNetUnfolderBase]: For 49/53 co-relation queries the response was YES. [2024-11-16 23:35:08,857 INFO L83 FinitePrefix]: Finished finitePrefix Result has 602 conditions, 561 events. 16/561 cut-off events. For 49/53 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1880 event pairs, 1 based on Foata normal form. 37/540 useless extension candidates. Maximal degree in co-relation 337. Up to 16 conditions per place. [2024-11-16 23:35:08,858 INFO L140 encePairwiseOnDemand]: 175/181 looper letters, 6 selfloop transitions, 0 changer transitions 1/173 dead transitions. [2024-11-16 23:35:08,858 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 173 transitions, 385 flow [2024-11-16 23:35:08,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 23:35:08,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-11-16 23:35:08,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 348 transitions. [2024-11-16 23:35:08,859 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9613259668508287 [2024-11-16 23:35:08,859 INFO L175 Difference]: Start difference. First operand has 178 places, 181 transitions, 389 flow. Second operand 2 states and 348 transitions. [2024-11-16 23:35:08,860 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 173 transitions, 385 flow [2024-11-16 23:35:08,860 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 173 transitions, 385 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-16 23:35:08,862 INFO L231 Difference]: Finished difference. Result has 177 places, 172 transitions, 371 flow [2024-11-16 23:35:08,862 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=181, PETRI_DIFFERENCE_MINUEND_FLOW=373, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=173, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=173, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=371, PETRI_PLACES=177, PETRI_TRANSITIONS=172} [2024-11-16 23:35:08,863 INFO L277 CegarLoopForPetriNet]: 178 programPoint places, -1 predicate places. [2024-11-16 23:35:08,863 INFO L471 AbstractCegarLoop]: Abstraction has has 177 places, 172 transitions, 371 flow [2024-11-16 23:35:08,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 168.5) internal successors, (337), 2 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:35:08,863 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:35:08,863 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:35:08,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-16 23:35:08,863 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-16 23:35:08,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:35:08,864 INFO L85 PathProgramCache]: Analyzing trace with hash -1011515119, now seen corresponding path program 1 times [2024-11-16 23:35:08,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:35:08,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119772196] [2024-11-16 23:35:08,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:35:08,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:35:08,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:35:08,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:35:08,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:35:08,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119772196] [2024-11-16 23:35:08,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119772196] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:35:08,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:35:08,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 23:35:08,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361753903] [2024-11-16 23:35:08,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:35:08,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 23:35:08,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:35:08,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 23:35:08,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-16 23:35:09,004 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 181 [2024-11-16 23:35:09,005 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 172 transitions, 371 flow. Second operand has 5 states, 5 states have (on average 153.4) internal successors, (767), 5 states have internal predecessors, (767), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:35:09,005 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:35:09,005 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 181 [2024-11-16 23:35:09,005 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:35:09,215 INFO L124 PetriNetUnfolderBase]: 25/789 cut-off events. [2024-11-16 23:35:09,215 INFO L125 PetriNetUnfolderBase]: For 58/86 co-relation queries the response was YES. [2024-11-16 23:35:09,217 INFO L83 FinitePrefix]: Finished finitePrefix Result has 959 conditions, 789 events. 25/789 cut-off events. For 58/86 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 3493 event pairs, 0 based on Foata normal form. 6/715 useless extension candidates. Maximal degree in co-relation 953. Up to 91 conditions per place. [2024-11-16 23:35:09,218 INFO L140 encePairwiseOnDemand]: 169/181 looper letters, 27 selfloop transitions, 9 changer transitions 3/189 dead transitions. [2024-11-16 23:35:09,218 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 189 transitions, 492 flow [2024-11-16 23:35:09,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 23:35:09,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-16 23:35:09,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 649 transitions. [2024-11-16 23:35:09,219 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8964088397790055 [2024-11-16 23:35:09,219 INFO L175 Difference]: Start difference. First operand has 177 places, 172 transitions, 371 flow. Second operand 4 states and 649 transitions. [2024-11-16 23:35:09,219 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 189 transitions, 492 flow [2024-11-16 23:35:09,220 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 189 transitions, 492 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-16 23:35:09,221 INFO L231 Difference]: Finished difference. Result has 182 places, 179 transitions, 441 flow [2024-11-16 23:35:09,222 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=181, PETRI_DIFFERENCE_MINUEND_FLOW=371, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=172, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=163, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=441, PETRI_PLACES=182, PETRI_TRANSITIONS=179} [2024-11-16 23:35:09,222 INFO L277 CegarLoopForPetriNet]: 178 programPoint places, 4 predicate places. [2024-11-16 23:35:09,222 INFO L471 AbstractCegarLoop]: Abstraction has has 182 places, 179 transitions, 441 flow [2024-11-16 23:35:09,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 153.4) internal successors, (767), 5 states have internal predecessors, (767), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:35:09,222 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:35:09,222 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:35:09,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-16 23:35:09,223 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-16 23:35:09,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:35:09,223 INFO L85 PathProgramCache]: Analyzing trace with hash -1841972424, now seen corresponding path program 1 times [2024-11-16 23:35:09,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:35:09,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756162274] [2024-11-16 23:35:09,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:35:09,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:35:09,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:35:09,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:35:09,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:35:09,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756162274] [2024-11-16 23:35:09,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756162274] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:35:09,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:35:09,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 23:35:09,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779583917] [2024-11-16 23:35:09,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:35:09,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 23:35:09,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:35:09,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 23:35:09,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-16 23:35:09,494 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 181 [2024-11-16 23:35:09,495 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 179 transitions, 441 flow. Second operand has 6 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) [2024-11-16 23:35:09,495 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:35:09,495 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 181 [2024-11-16 23:35:09,495 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:35:12,198 INFO L124 PetriNetUnfolderBase]: 10841/30771 cut-off events. [2024-11-16 23:35:12,199 INFO L125 PetriNetUnfolderBase]: For 3276/3356 co-relation queries the response was YES. [2024-11-16 23:35:12,257 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49862 conditions, 30771 events. 10841/30771 cut-off events. For 3276/3356 co-relation queries the response was YES. Maximal size of possible extension queue 918. Compared 342931 event pairs, 7924 based on Foata normal form. 0/27720 useless extension candidates. Maximal degree in co-relation 49853. Up to 15381 conditions per place. [2024-11-16 23:35:12,332 INFO L140 encePairwiseOnDemand]: 162/181 looper letters, 52 selfloop transitions, 54 changer transitions 0/234 dead transitions. [2024-11-16 23:35:12,332 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 234 transitions, 775 flow [2024-11-16 23:35:12,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 23:35:12,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-16 23:35:12,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 870 transitions. [2024-11-16 23:35:12,333 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8011049723756906 [2024-11-16 23:35:12,333 INFO L175 Difference]: Start difference. First operand has 182 places, 179 transitions, 441 flow. Second operand 6 states and 870 transitions. [2024-11-16 23:35:12,333 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 234 transitions, 775 flow [2024-11-16 23:35:12,337 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 234 transitions, 773 flow, removed 1 selfloop flow, removed 0 redundant places. [2024-11-16 23:35:12,338 INFO L231 Difference]: Finished difference. Result has 192 places, 232 transitions, 797 flow [2024-11-16 23:35:12,338 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=181, PETRI_DIFFERENCE_MINUEND_FLOW=439, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=179, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=161, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=797, PETRI_PLACES=192, PETRI_TRANSITIONS=232} [2024-11-16 23:35:12,339 INFO L277 CegarLoopForPetriNet]: 178 programPoint places, 14 predicate places. [2024-11-16 23:35:12,339 INFO L471 AbstractCegarLoop]: Abstraction has has 192 places, 232 transitions, 797 flow [2024-11-16 23:35:12,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 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) [2024-11-16 23:35:12,339 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:35:12,339 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:35:12,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-16 23:35:12,339 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thrErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-16 23:35:12,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:35:12,339 INFO L85 PathProgramCache]: Analyzing trace with hash -1088231399, now seen corresponding path program 1 times [2024-11-16 23:35:12,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:35:12,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331452970] [2024-11-16 23:35:12,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:35:12,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:35:12,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:35:12,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:35:12,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:35:12,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331452970] [2024-11-16 23:35:12,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331452970] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:35:12,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:35:12,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:35:12,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641088711] [2024-11-16 23:35:12,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:35:12,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:35:12,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:35:12,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:35:12,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:35:12,377 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 156 out of 181 [2024-11-16 23:35:12,377 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 232 transitions, 797 flow. Second operand has 3 states, 3 states have (on average 157.0) internal successors, (471), 3 states have internal predecessors, (471), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:35:12,377 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:35:12,377 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 181 [2024-11-16 23:35:12,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:35:16,141 INFO L124 PetriNetUnfolderBase]: 9419/38670 cut-off events. [2024-11-16 23:35:16,141 INFO L125 PetriNetUnfolderBase]: For 7634/8039 co-relation queries the response was YES. [2024-11-16 23:35:16,262 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64994 conditions, 38670 events. 9419/38670 cut-off events. For 7634/8039 co-relation queries the response was YES. Maximal size of possible extension queue 1306. Compared 519939 event pairs, 2773 based on Foata normal form. 1/34983 useless extension candidates. Maximal degree in co-relation 64980. Up to 9515 conditions per place. [2024-11-16 23:35:16,360 INFO L140 encePairwiseOnDemand]: 169/181 looper letters, 23 selfloop transitions, 9 changer transitions 0/246 dead transitions. [2024-11-16 23:35:16,361 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 246 transitions, 910 flow [2024-11-16 23:35:16,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:35:16,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:35:16,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 503 transitions. [2024-11-16 23:35:16,362 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9263351749539595 [2024-11-16 23:35:16,362 INFO L175 Difference]: Start difference. First operand has 192 places, 232 transitions, 797 flow. Second operand 3 states and 503 transitions. [2024-11-16 23:35:16,362 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 246 transitions, 910 flow [2024-11-16 23:35:16,437 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 246 transitions, 910 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-16 23:35:16,439 INFO L231 Difference]: Finished difference. Result has 196 places, 241 transitions, 875 flow [2024-11-16 23:35:16,439 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=181, PETRI_DIFFERENCE_MINUEND_FLOW=797, PETRI_DIFFERENCE_MINUEND_PLACES=192, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=232, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=223, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=875, PETRI_PLACES=196, PETRI_TRANSITIONS=241} [2024-11-16 23:35:16,439 INFO L277 CegarLoopForPetriNet]: 178 programPoint places, 18 predicate places. [2024-11-16 23:35:16,440 INFO L471 AbstractCegarLoop]: Abstraction has has 196 places, 241 transitions, 875 flow [2024-11-16 23:35:16,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 157.0) internal successors, (471), 3 states have internal predecessors, (471), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:35:16,440 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:35:16,440 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:35:16,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-16 23:35:16,440 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thrErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-16 23:35:16,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:35:16,440 INFO L85 PathProgramCache]: Analyzing trace with hash -510559459, now seen corresponding path program 1 times [2024-11-16 23:35:16,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:35:16,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477099088] [2024-11-16 23:35:16,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:35:16,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:35:16,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:35:16,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:35:16,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:35:16,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477099088] [2024-11-16 23:35:16,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477099088] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:35:16,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:35:16,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 23:35:16,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193800261] [2024-11-16 23:35:16,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:35:16,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 23:35:16,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:35:16,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 23:35:16,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-16 23:35:16,762 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 181 [2024-11-16 23:35:16,763 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 241 transitions, 875 flow. Second operand has 6 states, 6 states have (on average 140.16666666666666) internal successors, (841), 6 states have internal predecessors, (841), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:35:16,763 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:35:16,763 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 181 [2024-11-16 23:35:16,763 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand