./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-data-race.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_02-simple_racefree.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_02-simple_racefree.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 b3e7d0a2f10d1449a9a354d4032bafdd0ae7a7fd76aceb835acbee3134ec74e4 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 17:09:55,853 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 17:09:55,899 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-10-11 17:09:55,902 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 17:09:55,903 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 17:09:55,927 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 17:09:55,927 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 17:09:55,928 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 17:09:55,928 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 17:09:55,928 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 17:09:55,929 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 17:09:55,929 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 17:09:55,929 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 17:09:55,930 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 17:09:55,930 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 17:09:55,931 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 17:09:55,932 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 17:09:55,934 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 17:09:55,934 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 17:09:55,935 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 17:09:55,935 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 17:09:55,935 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 17:09:55,935 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-10-11 17:09:55,936 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 17:09:55,937 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 17:09:55,937 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 17:09:55,937 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 17:09:55,938 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 17:09:55,938 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 17:09:55,938 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 17:09:55,938 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 17:09:55,939 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 17:09:55,939 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 17:09:55,940 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 17:09:55,940 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 17:09:55,940 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 17:09:55,940 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 17:09:55,941 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 17:09:55,941 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 17:09:55,941 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 17:09:55,941 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 17:09:55,941 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-clean/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-clean/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 -> b3e7d0a2f10d1449a9a354d4032bafdd0ae7a7fd76aceb835acbee3134ec74e4 [2024-10-11 17:09:56,168 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 17:09:56,189 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 17:09:56,192 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 17:09:56,193 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 17:09:56,193 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 17:09:56,194 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_02-simple_racefree.i [2024-10-11 17:09:57,553 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 17:09:57,722 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 17:09:57,722 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_02-simple_racefree.i [2024-10-11 17:09:57,739 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/fd12a10a0/9810e3e4167449f9b2d5848f606a36bf/FLAG3e0886633 [2024-10-11 17:09:58,098 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/fd12a10a0/9810e3e4167449f9b2d5848f606a36bf [2024-10-11 17:09:58,100 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 17:09:58,102 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 17:09:58,105 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 17:09:58,105 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 17:09:58,109 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 17:09:58,110 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:09:58" (1/1) ... [2024-10-11 17:09:58,110 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3cc34896 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:09:58, skipping insertion in model container [2024-10-11 17:09:58,112 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:09:58" (1/1) ... [2024-10-11 17:09:58,143 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 17:09:58,481 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 17:09:58,492 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 17:09:58,546 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 17:09:58,590 INFO L204 MainTranslator]: Completed translation [2024-10-11 17:09:58,590 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:09:58 WrapperNode [2024-10-11 17:09:58,590 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 17:09:58,591 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 17:09:58,592 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 17:09:58,592 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 17:09:58,598 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:09:58" (1/1) ... [2024-10-11 17:09:58,612 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:09:58" (1/1) ... [2024-10-11 17:09:58,631 INFO L138 Inliner]: procedures = 171, calls = 36, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 99 [2024-10-11 17:09:58,631 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 17:09:58,632 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 17:09:58,632 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 17:09:58,632 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 17:09:58,639 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:09:58" (1/1) ... [2024-10-11 17:09:58,639 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:09:58" (1/1) ... [2024-10-11 17:09:58,645 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:09:58" (1/1) ... [2024-10-11 17:09:58,646 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:09:58" (1/1) ... [2024-10-11 17:09:58,651 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:09:58" (1/1) ... [2024-10-11 17:09:58,657 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:09:58" (1/1) ... [2024-10-11 17:09:58,658 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:09:58" (1/1) ... [2024-10-11 17:09:58,659 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:09:58" (1/1) ... [2024-10-11 17:09:58,663 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 17:09:58,664 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 17:09:58,664 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 17:09:58,664 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 17:09:58,665 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:09:58" (1/1) ... [2024-10-11 17:09:58,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 17:09:58,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:09:58,713 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 17:09:58,718 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 17:09:58,775 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-10-11 17:09:58,776 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-10-11 17:09:58,776 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-10-11 17:09:58,776 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 17:09:58,776 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-11 17:09:58,776 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-10-11 17:09:58,776 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-10-11 17:09:58,777 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 17:09:58,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-11 17:09:58,777 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-10-11 17:09:58,780 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 17:09:58,780 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 17:09:58,781 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-11 17:09:58,931 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 17:09:58,941 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 17:09:59,350 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-11 17:09:59,350 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 17:09:59,403 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 17:09:59,409 INFO L314 CfgBuilder]: Removed 10 assume(true) statements. [2024-10-11 17:09:59,410 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:09:59 BoogieIcfgContainer [2024-10-11 17:09:59,410 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 17:09:59,411 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 17:09:59,415 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 17:09:59,418 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 17:09:59,422 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 05:09:58" (1/3) ... [2024-10-11 17:09:59,423 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49c0cd13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:09:59, skipping insertion in model container [2024-10-11 17:09:59,423 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:09:58" (2/3) ... [2024-10-11 17:09:59,423 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49c0cd13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:09:59, skipping insertion in model container [2024-10-11 17:09:59,423 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:09:59" (3/3) ... [2024-10-11 17:09:59,424 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_02-simple_racefree.i [2024-10-11 17:09:59,448 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 17:09:59,448 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2024-10-11 17:09:59,449 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-11 17:09:59,538 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-10-11 17:09:59,600 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 140 places, 150 transitions, 307 flow [2024-10-11 17:09:59,645 INFO L124 PetriNetUnfolderBase]: 19/209 cut-off events. [2024-10-11 17:09:59,646 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-10-11 17:09:59,651 INFO L83 FinitePrefix]: Finished finitePrefix Result has 214 conditions, 209 events. 19/209 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 624 event pairs, 0 based on Foata normal form. 0/177 useless extension candidates. Maximal degree in co-relation 109. Up to 4 conditions per place. [2024-10-11 17:09:59,652 INFO L82 GeneralOperation]: Start removeDead. Operand has 140 places, 150 transitions, 307 flow [2024-10-11 17:09:59,656 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 140 places, 150 transitions, 307 flow [2024-10-11 17:09:59,667 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 17:09:59,672 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;@246524b9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 17:09:59,672 INFO L334 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2024-10-11 17:09:59,685 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-11 17:09:59,685 INFO L124 PetriNetUnfolderBase]: 2/56 cut-off events. [2024-10-11 17:09:59,685 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 17:09:59,685 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:09:59,686 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] [2024-10-11 17:09:59,686 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2024-10-11 17:09:59,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:09:59,691 INFO L85 PathProgramCache]: Analyzing trace with hash -1835825106, now seen corresponding path program 1 times [2024-10-11 17:09:59,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:09:59,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082858026] [2024-10-11 17:09:59,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:09:59,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:09:59,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:10:00,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:10:00,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:10:00,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082858026] [2024-10-11 17:10:00,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082858026] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:10:00,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:10:00,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 17:10:00,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373616722] [2024-10-11 17:10:00,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:10:00,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:10:00,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:10:00,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:10:00,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:10:00,172 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 150 [2024-10-11 17:10:00,175 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 150 transitions, 307 flow. Second operand has 3 states, 3 states have (on average 121.0) internal successors, (363), 3 states have internal predecessors, (363), 0 states have call successors, (0), 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-10-11 17:10:00,175 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:10:00,175 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 150 [2024-10-11 17:10:00,176 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:10:00,303 INFO L124 PetriNetUnfolderBase]: 48/534 cut-off events. [2024-10-11 17:10:00,303 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-10-11 17:10:00,305 INFO L83 FinitePrefix]: Finished finitePrefix Result has 655 conditions, 534 events. 48/534 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 2495 event pairs, 35 based on Foata normal form. 62/541 useless extension candidates. Maximal degree in co-relation 575. Up to 108 conditions per place. [2024-10-11 17:10:00,308 INFO L140 encePairwiseOnDemand]: 135/150 looper letters, 22 selfloop transitions, 2 changer transitions 0/142 dead transitions. [2024-10-11 17:10:00,309 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 142 transitions, 339 flow [2024-10-11 17:10:00,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:10:00,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:10:00,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 401 transitions. [2024-10-11 17:10:00,321 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8911111111111111 [2024-10-11 17:10:00,322 INFO L175 Difference]: Start difference. First operand has 140 places, 150 transitions, 307 flow. Second operand 3 states and 401 transitions. [2024-10-11 17:10:00,323 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 142 transitions, 339 flow [2024-10-11 17:10:00,326 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 142 transitions, 339 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-11 17:10:00,330 INFO L231 Difference]: Finished difference. Result has 141 places, 136 transitions, 287 flow [2024-10-11 17:10:00,332 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=150, PETRI_DIFFERENCE_MINUEND_FLOW=279, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=287, PETRI_PLACES=141, PETRI_TRANSITIONS=136} [2024-10-11 17:10:00,339 INFO L277 CegarLoopForPetriNet]: 140 programPoint places, 1 predicate places. [2024-10-11 17:10:00,339 INFO L471 AbstractCegarLoop]: Abstraction has has 141 places, 136 transitions, 287 flow [2024-10-11 17:10:00,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 121.0) internal successors, (363), 3 states have internal predecessors, (363), 0 states have call successors, (0), 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-10-11 17:10:00,339 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:10:00,340 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-10-11 17:10:00,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 17:10:00,340 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2024-10-11 17:10:00,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:10:00,341 INFO L85 PathProgramCache]: Analyzing trace with hash -817552428, now seen corresponding path program 1 times [2024-10-11 17:10:00,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:10:00,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717575852] [2024-10-11 17:10:00,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:10:00,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:10:00,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:10:00,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:10:00,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:10:00,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717575852] [2024-10-11 17:10:00,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717575852] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:10:00,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:10:00,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:10:00,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542853552] [2024-10-11 17:10:00,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:10:00,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:10:00,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:10:00,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:10:00,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:10:00,952 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 150 [2024-10-11 17:10:00,953 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 136 transitions, 287 flow. Second operand has 6 states, 6 states have (on average 108.5) internal successors, (651), 6 states have internal predecessors, (651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:10:00,953 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:10:00,954 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 150 [2024-10-11 17:10:00,954 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:10:01,093 INFO L124 PetriNetUnfolderBase]: 108/673 cut-off events. [2024-10-11 17:10:01,094 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2024-10-11 17:10:01,097 INFO L83 FinitePrefix]: Finished finitePrefix Result has 955 conditions, 673 events. 108/673 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 3805 event pairs, 66 based on Foata normal form. 0/613 useless extension candidates. Maximal degree in co-relation 856. Up to 181 conditions per place. [2024-10-11 17:10:01,101 INFO L140 encePairwiseOnDemand]: 144/150 looper letters, 48 selfloop transitions, 5 changer transitions 0/159 dead transitions. [2024-10-11 17:10:01,101 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 159 transitions, 439 flow [2024-10-11 17:10:01,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:10:01,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 17:10:01,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 696 transitions. [2024-10-11 17:10:01,105 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7733333333333333 [2024-10-11 17:10:01,105 INFO L175 Difference]: Start difference. First operand has 141 places, 136 transitions, 287 flow. Second operand 6 states and 696 transitions. [2024-10-11 17:10:01,105 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 159 transitions, 439 flow [2024-10-11 17:10:01,109 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 159 transitions, 435 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:10:01,112 INFO L231 Difference]: Finished difference. Result has 143 places, 135 transitions, 291 flow [2024-10-11 17:10:01,113 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=150, PETRI_DIFFERENCE_MINUEND_FLOW=281, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=291, PETRI_PLACES=143, PETRI_TRANSITIONS=135} [2024-10-11 17:10:01,114 INFO L277 CegarLoopForPetriNet]: 140 programPoint places, 3 predicate places. [2024-10-11 17:10:01,114 INFO L471 AbstractCegarLoop]: Abstraction has has 143 places, 135 transitions, 291 flow [2024-10-11 17:10:01,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 108.5) internal successors, (651), 6 states have internal predecessors, (651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:10:01,115 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:10:01,115 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] [2024-10-11 17:10:01,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 17:10:01,116 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2024-10-11 17:10:01,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:10:01,116 INFO L85 PathProgramCache]: Analyzing trace with hash 2011433969, now seen corresponding path program 1 times [2024-10-11 17:10:01,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:10:01,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661035805] [2024-10-11 17:10:01,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:10:01,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:10:01,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:10:01,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:10:01,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:10:01,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661035805] [2024-10-11 17:10:01,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661035805] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:10:01,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:10:01,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:10:01,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539139149] [2024-10-11 17:10:01,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:10:01,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:10:01,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:10:01,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:10:01,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:10:01,179 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 150 [2024-10-11 17:10:01,179 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 135 transitions, 291 flow. Second operand has 3 states, 3 states have (on average 115.66666666666667) internal successors, (347), 3 states have internal predecessors, (347), 0 states have call successors, (0), 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-10-11 17:10:01,179 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:10:01,180 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 150 [2024-10-11 17:10:01,180 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:10:01,266 INFO L124 PetriNetUnfolderBase]: 91/798 cut-off events. [2024-10-11 17:10:01,267 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-10-11 17:10:01,268 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1034 conditions, 798 events. 91/798 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 4696 event pairs, 30 based on Foata normal form. 0/729 useless extension candidates. Maximal degree in co-relation 962. Up to 125 conditions per place. [2024-10-11 17:10:01,271 INFO L140 encePairwiseOnDemand]: 141/150 looper letters, 30 selfloop transitions, 6 changer transitions 0/148 dead transitions. [2024-10-11 17:10:01,272 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 148 transitions, 392 flow [2024-10-11 17:10:01,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:10:01,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:10:01,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 381 transitions. [2024-10-11 17:10:01,274 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8466666666666667 [2024-10-11 17:10:01,274 INFO L175 Difference]: Start difference. First operand has 143 places, 135 transitions, 291 flow. Second operand 3 states and 381 transitions. [2024-10-11 17:10:01,274 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 148 transitions, 392 flow [2024-10-11 17:10:01,276 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 148 transitions, 382 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-10-11 17:10:01,278 INFO L231 Difference]: Finished difference. Result has 140 places, 137 transitions, 319 flow [2024-10-11 17:10:01,278 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=150, PETRI_DIFFERENCE_MINUEND_FLOW=277, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=319, PETRI_PLACES=140, PETRI_TRANSITIONS=137} [2024-10-11 17:10:01,279 INFO L277 CegarLoopForPetriNet]: 140 programPoint places, 0 predicate places. [2024-10-11 17:10:01,279 INFO L471 AbstractCegarLoop]: Abstraction has has 140 places, 137 transitions, 319 flow [2024-10-11 17:10:01,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 115.66666666666667) internal successors, (347), 3 states have internal predecessors, (347), 0 states have call successors, (0), 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-10-11 17:10:01,280 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:10:01,280 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] [2024-10-11 17:10:01,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 17:10:01,280 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2024-10-11 17:10:01,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:10:01,281 INFO L85 PathProgramCache]: Analyzing trace with hash 1354095797, now seen corresponding path program 1 times [2024-10-11 17:10:01,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:10:01,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064967196] [2024-10-11 17:10:01,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:10:01,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:10:01,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:10:01,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:10:01,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:10:01,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064967196] [2024-10-11 17:10:01,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064967196] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:10:01,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:10:01,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:10:01,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055901817] [2024-10-11 17:10:01,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:10:01,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:10:01,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:10:01,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:10:01,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:10:01,339 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 150 [2024-10-11 17:10:01,340 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 137 transitions, 319 flow. Second operand has 3 states, 3 states have (on average 118.33333333333333) internal successors, (355), 3 states have internal predecessors, (355), 0 states have call successors, (0), 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-10-11 17:10:01,340 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:10:01,340 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 150 [2024-10-11 17:10:01,340 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:10:01,422 INFO L124 PetriNetUnfolderBase]: 94/800 cut-off events. [2024-10-11 17:10:01,423 INFO L125 PetriNetUnfolderBase]: For 113/113 co-relation queries the response was YES. [2024-10-11 17:10:01,424 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1134 conditions, 800 events. 94/800 cut-off events. For 113/113 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 4789 event pairs, 60 based on Foata normal form. 0/731 useless extension candidates. Maximal degree in co-relation 1062. Up to 189 conditions per place. [2024-10-11 17:10:01,426 INFO L140 encePairwiseOnDemand]: 145/150 looper letters, 27 selfloop transitions, 4 changer transitions 0/144 dead transitions. [2024-10-11 17:10:01,426 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 144 transitions, 399 flow [2024-10-11 17:10:01,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:10:01,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:10:01,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 377 transitions. [2024-10-11 17:10:01,427 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8377777777777777 [2024-10-11 17:10:01,427 INFO L175 Difference]: Start difference. First operand has 140 places, 137 transitions, 319 flow. Second operand 3 states and 377 transitions. [2024-10-11 17:10:01,428 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 144 transitions, 399 flow [2024-10-11 17:10:01,431 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 144 transitions, 385 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:10:01,432 INFO L231 Difference]: Finished difference. Result has 142 places, 140 transitions, 339 flow [2024-10-11 17:10:01,432 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=150, PETRI_DIFFERENCE_MINUEND_FLOW=307, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=339, PETRI_PLACES=142, PETRI_TRANSITIONS=140} [2024-10-11 17:10:01,434 INFO L277 CegarLoopForPetriNet]: 140 programPoint places, 2 predicate places. [2024-10-11 17:10:01,434 INFO L471 AbstractCegarLoop]: Abstraction has has 142 places, 140 transitions, 339 flow [2024-10-11 17:10:01,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 118.33333333333333) internal successors, (355), 3 states have internal predecessors, (355), 0 states have call successors, (0), 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-10-11 17:10:01,435 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:10:01,435 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] [2024-10-11 17:10:01,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 17:10:01,437 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2024-10-11 17:10:01,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:10:01,437 INFO L85 PathProgramCache]: Analyzing trace with hash 1644884915, now seen corresponding path program 1 times [2024-10-11 17:10:01,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:10:01,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354816964] [2024-10-11 17:10:01,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:10:01,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:10:01,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 17:10:01,464 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 17:10:01,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 17:10:01,501 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 17:10:01,502 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 17:10:01,503 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 12 remaining) [2024-10-11 17:10:01,505 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (10 of 12 remaining) [2024-10-11 17:10:01,505 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (9 of 12 remaining) [2024-10-11 17:10:01,505 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (8 of 12 remaining) [2024-10-11 17:10:01,505 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (7 of 12 remaining) [2024-10-11 17:10:01,505 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (6 of 12 remaining) [2024-10-11 17:10:01,506 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (5 of 12 remaining) [2024-10-11 17:10:01,506 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (4 of 12 remaining) [2024-10-11 17:10:01,506 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (3 of 12 remaining) [2024-10-11 17:10:01,506 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (2 of 12 remaining) [2024-10-11 17:10:01,506 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (1 of 12 remaining) [2024-10-11 17:10:01,506 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (0 of 12 remaining) [2024-10-11 17:10:01,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 17:10:01,507 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-10-11 17:10:01,509 WARN L239 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-11 17:10:01,509 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-10-11 17:10:01,533 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-10-11 17:10:01,538 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 184 places, 199 transitions, 414 flow [2024-10-11 17:10:01,577 INFO L124 PetriNetUnfolderBase]: 34/345 cut-off events. [2024-10-11 17:10:01,578 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-10-11 17:10:01,580 INFO L83 FinitePrefix]: Finished finitePrefix Result has 357 conditions, 345 events. 34/345 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1163 event pairs, 0 based on Foata normal form. 0/289 useless extension candidates. Maximal degree in co-relation 211. Up to 8 conditions per place. [2024-10-11 17:10:01,580 INFO L82 GeneralOperation]: Start removeDead. Operand has 184 places, 199 transitions, 414 flow [2024-10-11 17:10:01,582 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 184 places, 199 transitions, 414 flow [2024-10-11 17:10:01,586 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 17:10:01,587 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;@246524b9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 17:10:01,587 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2024-10-11 17:10:01,590 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-11 17:10:01,590 INFO L124 PetriNetUnfolderBase]: 2/56 cut-off events. [2024-10-11 17:10:01,590 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 17:10:01,590 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:10:01,590 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] [2024-10-11 17:10:01,594 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-10-11 17:10:01,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:10:01,594 INFO L85 PathProgramCache]: Analyzing trace with hash -1045185899, now seen corresponding path program 1 times [2024-10-11 17:10:01,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:10:01,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37968757] [2024-10-11 17:10:01,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:10:01,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:10:01,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:10:01,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:10:01,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:10:01,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37968757] [2024-10-11 17:10:01,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37968757] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:10:01,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:10:01,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 17:10:01,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098971619] [2024-10-11 17:10:01,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:10:01,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:10:01,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:10:01,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:10:01,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:10:01,640 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 199 [2024-10-11 17:10:01,641 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 199 transitions, 414 flow. Second operand has 3 states, 3 states have (on average 156.0) internal successors, (468), 3 states have internal predecessors, (468), 0 states have call successors, (0), 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-10-11 17:10:01,641 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:10:01,641 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 199 [2024-10-11 17:10:01,641 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:10:02,065 INFO L124 PetriNetUnfolderBase]: 788/4308 cut-off events. [2024-10-11 17:10:02,066 INFO L125 PetriNetUnfolderBase]: For 77/77 co-relation queries the response was YES. [2024-10-11 17:10:02,075 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5661 conditions, 4308 events. 788/4308 cut-off events. For 77/77 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 41171 event pairs, 348 based on Foata normal form. 749/4671 useless extension candidates. Maximal degree in co-relation 721. Up to 1303 conditions per place. [2024-10-11 17:10:02,087 INFO L140 encePairwiseOnDemand]: 178/199 looper letters, 31 selfloop transitions, 2 changer transitions 0/186 dead transitions. [2024-10-11 17:10:02,087 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 186 transitions, 454 flow [2024-10-11 17:10:02,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:10:02,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:10:02,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 521 transitions. [2024-10-11 17:10:02,089 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8726968174204355 [2024-10-11 17:10:02,089 INFO L175 Difference]: Start difference. First operand has 184 places, 199 transitions, 414 flow. Second operand 3 states and 521 transitions. [2024-10-11 17:10:02,089 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 186 transitions, 454 flow [2024-10-11 17:10:02,090 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 186 transitions, 454 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-11 17:10:02,091 INFO L231 Difference]: Finished difference. Result has 185 places, 180 transitions, 386 flow [2024-10-11 17:10:02,092 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=374, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=179, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=177, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=386, PETRI_PLACES=185, PETRI_TRANSITIONS=180} [2024-10-11 17:10:02,092 INFO L277 CegarLoopForPetriNet]: 184 programPoint places, 1 predicate places. [2024-10-11 17:10:02,092 INFO L471 AbstractCegarLoop]: Abstraction has has 185 places, 180 transitions, 386 flow [2024-10-11 17:10:02,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 156.0) internal successors, (468), 3 states have internal predecessors, (468), 0 states have call successors, (0), 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-10-11 17:10:02,093 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:10:02,093 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-10-11 17:10:02,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 17:10:02,093 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-10-11 17:10:02,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:10:02,094 INFO L85 PathProgramCache]: Analyzing trace with hash -1222479525, now seen corresponding path program 1 times [2024-10-11 17:10:02,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:10:02,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820465258] [2024-10-11 17:10:02,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:10:02,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:10:02,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:10:02,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:10:02,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:10:02,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820465258] [2024-10-11 17:10:02,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820465258] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:10:02,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:10:02,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:10:02,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624778237] [2024-10-11 17:10:02,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:10:02,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:10:02,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:10:02,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:10:02,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:10:02,446 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 199 [2024-10-11 17:10:02,447 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 180 transitions, 386 flow. Second operand has 6 states, 6 states have (on average 143.5) internal successors, (861), 6 states have internal predecessors, (861), 0 states have call successors, (0), 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-10-11 17:10:02,447 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:10:02,447 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 199 [2024-10-11 17:10:02,448 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:10:03,190 INFO L124 PetriNetUnfolderBase]: 1718/6808 cut-off events. [2024-10-11 17:10:03,190 INFO L125 PetriNetUnfolderBase]: For 138/138 co-relation queries the response was YES. [2024-10-11 17:10:03,205 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9778 conditions, 6808 events. 1718/6808 cut-off events. For 138/138 co-relation queries the response was YES. Maximal size of possible extension queue 190. Compared 68098 event pairs, 760 based on Foata normal form. 0/6127 useless extension candidates. Maximal degree in co-relation 8302. Up to 2015 conditions per place. [2024-10-11 17:10:03,230 INFO L140 encePairwiseOnDemand]: 193/199 looper letters, 80 selfloop transitions, 6 changer transitions 0/227 dead transitions. [2024-10-11 17:10:03,231 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 227 transitions, 652 flow [2024-10-11 17:10:03,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:10:03,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 17:10:03,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 938 transitions. [2024-10-11 17:10:03,233 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7855946398659966 [2024-10-11 17:10:03,233 INFO L175 Difference]: Start difference. First operand has 185 places, 180 transitions, 386 flow. Second operand 6 states and 938 transitions. [2024-10-11 17:10:03,234 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 227 transitions, 652 flow [2024-10-11 17:10:03,235 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 227 transitions, 650 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 17:10:03,237 INFO L231 Difference]: Finished difference. Result has 188 places, 179 transitions, 394 flow [2024-10-11 17:10:03,238 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=382, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=179, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=173, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=394, PETRI_PLACES=188, PETRI_TRANSITIONS=179} [2024-10-11 17:10:03,239 INFO L277 CegarLoopForPetriNet]: 184 programPoint places, 4 predicate places. [2024-10-11 17:10:03,240 INFO L471 AbstractCegarLoop]: Abstraction has has 188 places, 179 transitions, 394 flow [2024-10-11 17:10:03,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 143.5) internal successors, (861), 6 states have internal predecessors, (861), 0 states have call successors, (0), 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-10-11 17:10:03,240 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:10:03,241 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] [2024-10-11 17:10:03,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 17:10:03,241 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-10-11 17:10:03,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:10:03,242 INFO L85 PathProgramCache]: Analyzing trace with hash -1173175104, now seen corresponding path program 1 times [2024-10-11 17:10:03,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:10:03,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250139103] [2024-10-11 17:10:03,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:10:03,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:10:03,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:10:03,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:10:03,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:10:03,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250139103] [2024-10-11 17:10:03,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250139103] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:10:03,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:10:03,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:10:03,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714329238] [2024-10-11 17:10:03,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:10:03,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:10:03,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:10:03,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:10:03,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:10:03,302 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 199 [2024-10-11 17:10:03,303 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 179 transitions, 394 flow. Second operand has 3 states, 3 states have (on average 142.66666666666666) internal successors, (428), 3 states have internal predecessors, (428), 0 states have call successors, (0), 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-10-11 17:10:03,303 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:10:03,303 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 199 [2024-10-11 17:10:03,303 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:10:04,611 INFO L124 PetriNetUnfolderBase]: 3895/14518 cut-off events. [2024-10-11 17:10:04,611 INFO L125 PetriNetUnfolderBase]: For 240/240 co-relation queries the response was YES. [2024-10-11 17:10:04,651 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21076 conditions, 14518 events. 3895/14518 cut-off events. For 240/240 co-relation queries the response was YES. Maximal size of possible extension queue 387. Compared 162453 event pairs, 1409 based on Foata normal form. 0/13033 useless extension candidates. Maximal degree in co-relation 14585. Up to 3516 conditions per place. [2024-10-11 17:10:04,704 INFO L140 encePairwiseOnDemand]: 180/199 looper letters, 58 selfloop transitions, 14 changer transitions 0/212 dead transitions. [2024-10-11 17:10:04,705 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 212 transitions, 615 flow [2024-10-11 17:10:04,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:10:04,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:10:04,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 500 transitions. [2024-10-11 17:10:04,707 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8375209380234506 [2024-10-11 17:10:04,707 INFO L175 Difference]: Start difference. First operand has 188 places, 179 transitions, 394 flow. Second operand 3 states and 500 transitions. [2024-10-11 17:10:04,707 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 212 transitions, 615 flow [2024-10-11 17:10:04,709 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 212 transitions, 603 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-10-11 17:10:04,711 INFO L231 Difference]: Finished difference. Result has 187 places, 193 transitions, 504 flow [2024-10-11 17:10:04,711 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=382, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=179, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=165, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=504, PETRI_PLACES=187, PETRI_TRANSITIONS=193} [2024-10-11 17:10:04,712 INFO L277 CegarLoopForPetriNet]: 184 programPoint places, 3 predicate places. [2024-10-11 17:10:04,712 INFO L471 AbstractCegarLoop]: Abstraction has has 187 places, 193 transitions, 504 flow [2024-10-11 17:10:04,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 142.66666666666666) internal successors, (428), 3 states have internal predecessors, (428), 0 states have call successors, (0), 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-10-11 17:10:04,713 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:10:04,713 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] [2024-10-11 17:10:04,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 17:10:04,713 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-10-11 17:10:04,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:10:04,714 INFO L85 PathProgramCache]: Analyzing trace with hash -1551430579, now seen corresponding path program 1 times [2024-10-11 17:10:04,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:10:04,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403361857] [2024-10-11 17:10:04,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:10:04,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:10:04,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:10:04,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:10:04,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:10:04,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403361857] [2024-10-11 17:10:04,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403361857] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:10:04,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:10:04,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:10:04,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887390207] [2024-10-11 17:10:04,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:10:04,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:10:04,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:10:04,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:10:04,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:10:04,783 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 199 [2024-10-11 17:10:04,784 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 193 transitions, 504 flow. Second operand has 3 states, 3 states have (on average 149.33333333333334) internal successors, (448), 3 states have internal predecessors, (448), 0 states have call successors, (0), 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-10-11 17:10:04,785 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:10:04,785 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 199 [2024-10-11 17:10:04,785 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:10:06,319 INFO L124 PetriNetUnfolderBase]: 4045/16487 cut-off events. [2024-10-11 17:10:06,319 INFO L125 PetriNetUnfolderBase]: For 4294/4458 co-relation queries the response was YES. [2024-10-11 17:10:06,367 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27242 conditions, 16487 events. 4045/16487 cut-off events. For 4294/4458 co-relation queries the response was YES. Maximal size of possible extension queue 425. Compared 194586 event pairs, 2517 based on Foata normal form. 46/14989 useless extension candidates. Maximal degree in co-relation 25959. Up to 5540 conditions per place. [2024-10-11 17:10:06,417 INFO L140 encePairwiseOnDemand]: 190/199 looper letters, 52 selfloop transitions, 14 changer transitions 0/217 dead transitions. [2024-10-11 17:10:06,417 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 217 transitions, 722 flow [2024-10-11 17:10:06,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:10:06,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:10:06,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 494 transitions. [2024-10-11 17:10:06,419 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8274706867671692 [2024-10-11 17:10:06,419 INFO L175 Difference]: Start difference. First operand has 187 places, 193 transitions, 504 flow. Second operand 3 states and 494 transitions. [2024-10-11 17:10:06,419 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 217 transitions, 722 flow [2024-10-11 17:10:06,427 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 217 transitions, 684 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:10:06,429 INFO L231 Difference]: Finished difference. Result has 189 places, 205 transitions, 602 flow [2024-10-11 17:10:06,429 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=476, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=193, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=179, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=602, PETRI_PLACES=189, PETRI_TRANSITIONS=205} [2024-10-11 17:10:06,429 INFO L277 CegarLoopForPetriNet]: 184 programPoint places, 5 predicate places. [2024-10-11 17:10:06,430 INFO L471 AbstractCegarLoop]: Abstraction has has 189 places, 205 transitions, 602 flow [2024-10-11 17:10:06,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 149.33333333333334) internal successors, (448), 3 states have internal predecessors, (448), 0 states have call successors, (0), 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-10-11 17:10:06,430 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:10:06,430 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, 1, 1, 1, 1, 1, 1] [2024-10-11 17:10:06,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 17:10:06,430 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-10-11 17:10:06,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:10:06,431 INFO L85 PathProgramCache]: Analyzing trace with hash 224192502, now seen corresponding path program 1 times [2024-10-11 17:10:06,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:10:06,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456290144] [2024-10-11 17:10:06,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:10:06,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:10:06,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:10:06,668 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:10:06,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:10:06,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456290144] [2024-10-11 17:10:06,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456290144] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:10:06,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [921720175] [2024-10-11 17:10:06,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:10:06,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:10:06,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:10:06,671 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:10:06,680 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 17:10:06,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:10:06,767 INFO L255 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 17:10:06,769 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:10:06,841 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:10:06,841 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:10:06,888 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:10:06,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [921720175] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:10:06,888 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 17:10:06,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2024-10-11 17:10:06,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737334615] [2024-10-11 17:10:06,889 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 17:10:06,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 17:10:06,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:10:06,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 17:10:06,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-10-11 17:10:06,958 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 199 [2024-10-11 17:10:06,960 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 205 transitions, 602 flow. Second operand has 10 states, 10 states have (on average 153.5) internal successors, (1535), 10 states have internal predecessors, (1535), 0 states have call successors, (0), 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-10-11 17:10:06,960 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:10:06,960 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 199 [2024-10-11 17:10:06,960 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:10:07,387 INFO L124 PetriNetUnfolderBase]: 768/3587 cut-off events. [2024-10-11 17:10:07,388 INFO L125 PetriNetUnfolderBase]: For 429/463 co-relation queries the response was YES. [2024-10-11 17:10:07,400 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5571 conditions, 3587 events. 768/3587 cut-off events. For 429/463 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 32414 event pairs, 77 based on Foata normal form. 108/3453 useless extension candidates. Maximal degree in co-relation 2632. Up to 478 conditions per place. [2024-10-11 17:10:07,412 INFO L140 encePairwiseOnDemand]: 194/199 looper letters, 72 selfloop transitions, 7 changer transitions 0/212 dead transitions. [2024-10-11 17:10:07,412 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 212 transitions, 728 flow [2024-10-11 17:10:07,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 17:10:07,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-10-11 17:10:07,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1440 transitions. [2024-10-11 17:10:07,415 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8040201005025126 [2024-10-11 17:10:07,415 INFO L175 Difference]: Start difference. First operand has 189 places, 205 transitions, 602 flow. Second operand 9 states and 1440 transitions. [2024-10-11 17:10:07,416 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 212 transitions, 728 flow [2024-10-11 17:10:07,419 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 212 transitions, 708 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:10:07,421 INFO L231 Difference]: Finished difference. Result has 152 places, 156 transitions, 452 flow [2024-10-11 17:10:07,421 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=434, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=452, PETRI_PLACES=152, PETRI_TRANSITIONS=156} [2024-10-11 17:10:07,421 INFO L277 CegarLoopForPetriNet]: 184 programPoint places, -32 predicate places. [2024-10-11 17:10:07,421 INFO L471 AbstractCegarLoop]: Abstraction has has 152 places, 156 transitions, 452 flow [2024-10-11 17:10:07,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 153.5) internal successors, (1535), 10 states have internal predecessors, (1535), 0 states have call successors, (0), 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-10-11 17:10:07,423 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:10:07,423 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, 1, 1] [2024-10-11 17:10:07,437 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 17:10:07,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-10-11 17:10:07,628 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-10-11 17:10:07,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:10:07,628 INFO L85 PathProgramCache]: Analyzing trace with hash 267176223, now seen corresponding path program 1 times [2024-10-11 17:10:07,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:10:07,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670388903] [2024-10-11 17:10:07,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:10:07,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:10:07,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:10:07,701 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-11 17:10:07,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:10:07,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670388903] [2024-10-11 17:10:07,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670388903] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:10:07,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:10:07,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:10:07,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183791783] [2024-10-11 17:10:07,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:10:07,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:10:07,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:10:07,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:10:07,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:10:07,777 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 199 [2024-10-11 17:10:07,778 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 156 transitions, 452 flow. Second operand has 3 states, 3 states have (on average 149.66666666666666) internal successors, (449), 3 states have internal predecessors, (449), 0 states have call successors, (0), 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-10-11 17:10:07,778 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:10:07,778 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 199 [2024-10-11 17:10:07,778 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:10:08,000 INFO L124 PetriNetUnfolderBase]: 260/1297 cut-off events. [2024-10-11 17:10:08,000 INFO L125 PetriNetUnfolderBase]: For 459/480 co-relation queries the response was YES. [2024-10-11 17:10:08,002 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2342 conditions, 1297 events. 260/1297 cut-off events. For 459/480 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 8716 event pairs, 132 based on Foata normal form. 7/1212 useless extension candidates. Maximal degree in co-relation 2262. Up to 459 conditions per place. [2024-10-11 17:10:08,005 INFO L140 encePairwiseOnDemand]: 191/199 looper letters, 42 selfloop transitions, 12 changer transitions 0/170 dead transitions. [2024-10-11 17:10:08,005 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 170 transitions, 604 flow [2024-10-11 17:10:08,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:10:08,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:10:08,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 480 transitions. [2024-10-11 17:10:08,006 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8040201005025126 [2024-10-11 17:10:08,007 INFO L175 Difference]: Start difference. First operand has 152 places, 156 transitions, 452 flow. Second operand 3 states and 480 transitions. [2024-10-11 17:10:08,007 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 170 transitions, 604 flow [2024-10-11 17:10:08,008 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 170 transitions, 589 flow, removed 1 selfloop flow, removed 5 redundant places. [2024-10-11 17:10:08,010 INFO L231 Difference]: Finished difference. Result has 151 places, 164 transitions, 535 flow [2024-10-11 17:10:08,010 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=437, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=535, PETRI_PLACES=151, PETRI_TRANSITIONS=164} [2024-10-11 17:10:08,010 INFO L277 CegarLoopForPetriNet]: 184 programPoint places, -33 predicate places. [2024-10-11 17:10:08,010 INFO L471 AbstractCegarLoop]: Abstraction has has 151 places, 164 transitions, 535 flow [2024-10-11 17:10:08,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 149.66666666666666) internal successors, (449), 3 states have internal predecessors, (449), 0 states have call successors, (0), 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-10-11 17:10:08,011 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:10:08,011 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:10:08,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 17:10:08,011 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-10-11 17:10:08,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:10:08,012 INFO L85 PathProgramCache]: Analyzing trace with hash 1563558491, now seen corresponding path program 1 times [2024-10-11 17:10:08,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:10:08,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297598793] [2024-10-11 17:10:08,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:10:08,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:10:08,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:10:08,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:10:08,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:10:08,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297598793] [2024-10-11 17:10:08,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297598793] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:10:08,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:10:08,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:10:08,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130383808] [2024-10-11 17:10:08,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:10:08,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:10:08,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:10:08,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:10:08,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:10:08,070 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 199 [2024-10-11 17:10:08,071 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 164 transitions, 535 flow. Second operand has 3 states, 3 states have (on average 150.66666666666666) internal successors, (452), 3 states have internal predecessors, (452), 0 states have call successors, (0), 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-10-11 17:10:08,071 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:10:08,071 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 199 [2024-10-11 17:10:08,071 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:10:08,227 INFO L124 PetriNetUnfolderBase]: 291/1369 cut-off events. [2024-10-11 17:10:08,227 INFO L125 PetriNetUnfolderBase]: For 1139/1174 co-relation queries the response was YES. [2024-10-11 17:10:08,232 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2796 conditions, 1369 events. 291/1369 cut-off events. For 1139/1174 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 9339 event pairs, 134 based on Foata normal form. 9/1302 useless extension candidates. Maximal degree in co-relation 2719. Up to 501 conditions per place. [2024-10-11 17:10:08,236 INFO L140 encePairwiseOnDemand]: 191/199 looper letters, 49 selfloop transitions, 12 changer transitions 0/179 dead transitions. [2024-10-11 17:10:08,237 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 179 transitions, 724 flow [2024-10-11 17:10:08,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:10:08,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:10:08,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 481 transitions. [2024-10-11 17:10:08,238 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8056951423785594 [2024-10-11 17:10:08,238 INFO L175 Difference]: Start difference. First operand has 151 places, 164 transitions, 535 flow. Second operand 3 states and 481 transitions. [2024-10-11 17:10:08,238 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 179 transitions, 724 flow [2024-10-11 17:10:08,240 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 179 transitions, 696 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:10:08,242 INFO L231 Difference]: Finished difference. Result has 153 places, 172 transitions, 621 flow [2024-10-11 17:10:08,242 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=511, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=164, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=621, PETRI_PLACES=153, PETRI_TRANSITIONS=172} [2024-10-11 17:10:08,243 INFO L277 CegarLoopForPetriNet]: 184 programPoint places, -31 predicate places. [2024-10-11 17:10:08,243 INFO L471 AbstractCegarLoop]: Abstraction has has 153 places, 172 transitions, 621 flow [2024-10-11 17:10:08,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 150.66666666666666) internal successors, (452), 3 states have internal predecessors, (452), 0 states have call successors, (0), 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-10-11 17:10:08,243 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:10:08,244 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-10-11 17:10:08,244 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 17:10:08,244 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-10-11 17:10:08,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:10:08,244 INFO L85 PathProgramCache]: Analyzing trace with hash 1523106958, now seen corresponding path program 1 times [2024-10-11 17:10:08,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:10:08,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491991980] [2024-10-11 17:10:08,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:10:08,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:10:08,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 17:10:08,261 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 17:10:08,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 17:10:08,280 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 17:10:08,280 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 17:10:08,280 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (15 of 16 remaining) [2024-10-11 17:10:08,281 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (14 of 16 remaining) [2024-10-11 17:10:08,281 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (13 of 16 remaining) [2024-10-11 17:10:08,281 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (12 of 16 remaining) [2024-10-11 17:10:08,281 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (11 of 16 remaining) [2024-10-11 17:10:08,281 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (10 of 16 remaining) [2024-10-11 17:10:08,281 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (9 of 16 remaining) [2024-10-11 17:10:08,281 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (8 of 16 remaining) [2024-10-11 17:10:08,281 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (7 of 16 remaining) [2024-10-11 17:10:08,282 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (6 of 16 remaining) [2024-10-11 17:10:08,282 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (5 of 16 remaining) [2024-10-11 17:10:08,282 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (4 of 16 remaining) [2024-10-11 17:10:08,282 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (3 of 16 remaining) [2024-10-11 17:10:08,282 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (2 of 16 remaining) [2024-10-11 17:10:08,282 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (1 of 16 remaining) [2024-10-11 17:10:08,282 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (0 of 16 remaining) [2024-10-11 17:10:08,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 17:10:08,282 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:10:08,283 WARN L239 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-11 17:10:08,283 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-10-11 17:10:08,310 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-10-11 17:10:08,312 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 228 places, 248 transitions, 523 flow [2024-10-11 17:10:08,387 INFO L124 PetriNetUnfolderBase]: 54/526 cut-off events. [2024-10-11 17:10:08,388 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2024-10-11 17:10:08,397 INFO L83 FinitePrefix]: Finished finitePrefix Result has 551 conditions, 526 events. 54/526 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1977 event pairs, 1 based on Foata normal form. 0/440 useless extension candidates. Maximal degree in co-relation 353. Up to 16 conditions per place. [2024-10-11 17:10:08,400 INFO L82 GeneralOperation]: Start removeDead. Operand has 228 places, 248 transitions, 523 flow [2024-10-11 17:10:08,408 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 228 places, 248 transitions, 523 flow [2024-10-11 17:10:08,409 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 17:10:08,409 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;@246524b9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 17:10:08,409 INFO L334 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2024-10-11 17:10:08,412 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-11 17:10:08,415 INFO L124 PetriNetUnfolderBase]: 2/56 cut-off events. [2024-10-11 17:10:08,415 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 17:10:08,415 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:10:08,415 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] [2024-10-11 17:10:08,416 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2024-10-11 17:10:08,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:10:08,416 INFO L85 PathProgramCache]: Analyzing trace with hash 1364594829, now seen corresponding path program 1 times [2024-10-11 17:10:08,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:10:08,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261695127] [2024-10-11 17:10:08,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:10:08,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:10:08,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:10:08,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:10:08,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:10:08,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261695127] [2024-10-11 17:10:08,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261695127] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:10:08,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:10:08,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 17:10:08,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975402615] [2024-10-11 17:10:08,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:10:08,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:10:08,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:10:08,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:10:08,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:10:08,476 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 189 out of 248 [2024-10-11 17:10:08,477 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 228 places, 248 transitions, 523 flow. Second operand has 3 states, 3 states have (on average 191.0) internal successors, (573), 3 states have internal predecessors, (573), 0 states have call successors, (0), 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-10-11 17:10:08,477 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:10:08,477 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 189 of 248 [2024-10-11 17:10:08,478 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:10:12,819 INFO L124 PetriNetUnfolderBase]: 8948/35448 cut-off events. [2024-10-11 17:10:12,820 INFO L125 PetriNetUnfolderBase]: For 937/937 co-relation queries the response was YES. [2024-10-11 17:10:12,952 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48686 conditions, 35448 events. 8948/35448 cut-off events. For 937/937 co-relation queries the response was YES. Maximal size of possible extension queue 770. Compared 459062 event pairs, 8324 based on Foata normal form. 7648/39701 useless extension candidates. Maximal degree in co-relation 35558. Up to 12802 conditions per place. [2024-10-11 17:10:13,085 INFO L140 encePairwiseOnDemand]: 221/248 looper letters, 39 selfloop transitions, 2 changer transitions 0/229 dead transitions. [2024-10-11 17:10:13,085 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 229 transitions, 567 flow [2024-10-11 17:10:13,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:10:13,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:10:13,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 640 transitions. [2024-10-11 17:10:13,087 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8602150537634409 [2024-10-11 17:10:13,088 INFO L175 Difference]: Start difference. First operand has 228 places, 248 transitions, 523 flow. Second operand 3 states and 640 transitions. [2024-10-11 17:10:13,088 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 229 transitions, 567 flow [2024-10-11 17:10:13,090 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 229 transitions, 567 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-11 17:10:13,092 INFO L231 Difference]: Finished difference. Result has 229 places, 223 transitions, 483 flow [2024-10-11 17:10:13,092 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=471, PETRI_DIFFERENCE_MINUEND_PLACES=226, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=222, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=220, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=483, PETRI_PLACES=229, PETRI_TRANSITIONS=223} [2024-10-11 17:10:13,094 INFO L277 CegarLoopForPetriNet]: 228 programPoint places, 1 predicate places. [2024-10-11 17:10:13,094 INFO L471 AbstractCegarLoop]: Abstraction has has 229 places, 223 transitions, 483 flow [2024-10-11 17:10:13,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 191.0) internal successors, (573), 3 states have internal predecessors, (573), 0 states have call successors, (0), 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-10-11 17:10:13,095 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:10:13,095 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-10-11 17:10:13,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 17:10:13,095 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2024-10-11 17:10:13,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:10:13,096 INFO L85 PathProgramCache]: Analyzing trace with hash -410564525, now seen corresponding path program 1 times [2024-10-11 17:10:13,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:10:13,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778756755] [2024-10-11 17:10:13,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:10:13,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:10:13,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:10:13,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:10:13,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:10:13,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778756755] [2024-10-11 17:10:13,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778756755] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:10:13,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:10:13,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:10:13,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746436777] [2024-10-11 17:10:13,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:10:13,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:10:13,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:10:13,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:10:13,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:10:13,525 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 248 [2024-10-11 17:10:13,527 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 223 transitions, 483 flow. Second operand has 6 states, 6 states have (on average 178.5) internal successors, (1071), 6 states have internal predecessors, (1071), 0 states have call successors, (0), 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-10-11 17:10:13,527 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:10:13,528 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 248 [2024-10-11 17:10:13,528 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:10:20,386 INFO L124 PetriNetUnfolderBase]: 19590/65774 cut-off events. [2024-10-11 17:10:20,386 INFO L125 PetriNetUnfolderBase]: For 1507/1507 co-relation queries the response was YES. [2024-10-11 17:10:20,640 INFO L83 FinitePrefix]: Finished finitePrefix Result has 94699 conditions, 65774 events. 19590/65774 cut-off events. For 1507/1507 co-relation queries the response was YES. Maximal size of possible extension queue 1361. Compared 891023 event pairs, 7382 based on Foata normal form. 0/60119 useless extension candidates. Maximal degree in co-relation 89186. Up to 20118 conditions per place. [2024-10-11 17:10:20,855 INFO L140 encePairwiseOnDemand]: 242/248 looper letters, 112 selfloop transitions, 6 changer transitions 0/294 dead transitions. [2024-10-11 17:10:20,855 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 294 transitions, 861 flow [2024-10-11 17:10:20,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:10:20,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 17:10:20,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1180 transitions. [2024-10-11 17:10:20,860 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.793010752688172 [2024-10-11 17:10:20,860 INFO L175 Difference]: Start difference. First operand has 229 places, 223 transitions, 483 flow. Second operand 6 states and 1180 transitions. [2024-10-11 17:10:20,860 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 294 transitions, 861 flow [2024-10-11 17:10:20,863 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 232 places, 294 transitions, 859 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 17:10:20,865 INFO L231 Difference]: Finished difference. Result has 232 places, 222 transitions, 491 flow [2024-10-11 17:10:20,866 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=479, PETRI_DIFFERENCE_MINUEND_PLACES=227, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=222, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=216, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=491, PETRI_PLACES=232, PETRI_TRANSITIONS=222} [2024-10-11 17:10:20,866 INFO L277 CegarLoopForPetriNet]: 228 programPoint places, 4 predicate places. [2024-10-11 17:10:20,866 INFO L471 AbstractCegarLoop]: Abstraction has has 232 places, 222 transitions, 491 flow [2024-10-11 17:10:20,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 178.5) internal successors, (1071), 6 states have internal predecessors, (1071), 0 states have call successors, (0), 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-10-11 17:10:20,867 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:10:20,867 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] [2024-10-11 17:10:20,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 17:10:20,867 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2024-10-11 17:10:20,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:10:20,868 INFO L85 PathProgramCache]: Analyzing trace with hash 1848818159, now seen corresponding path program 1 times [2024-10-11 17:10:20,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:10:20,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627006265] [2024-10-11 17:10:20,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:10:20,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:10:20,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:10:20,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:10:20,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:10:20,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627006265] [2024-10-11 17:10:20,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627006265] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:10:20,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:10:20,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:10:20,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456671046] [2024-10-11 17:10:20,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:10:20,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:10:20,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:10:20,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:10:20,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:10:20,923 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 248 [2024-10-11 17:10:20,924 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 232 places, 222 transitions, 491 flow. Second operand has 3 states, 3 states have (on average 169.66666666666666) internal successors, (509), 3 states have internal predecessors, (509), 0 states have call successors, (0), 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-10-11 17:10:20,924 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:10:20,924 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 248 [2024-10-11 17:10:20,924 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand