./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_02-simple_racefree.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/goblint-regression/28-race_reach_02-simple_racefree.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b3e7d0a2f10d1449a9a354d4032bafdd0ae7a7fd76aceb835acbee3134ec74e4 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 12:32:43,453 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 12:32:43,527 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-12 12:32:43,532 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 12:32:43,534 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 12:32:43,569 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 12:32:43,571 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 12:32:43,572 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 12:32:43,572 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 12:32:43,575 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 12:32:43,575 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 12:32:43,575 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 12:32:43,576 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 12:32:43,578 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 12:32:43,578 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 12:32:43,578 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 12:32:43,578 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 12:32:43,579 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 12:32:43,579 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 12:32:43,579 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 12:32:43,579 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 12:32:43,582 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 12:32:43,584 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-12 12:32:43,584 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 12:32:43,585 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-12 12:32:43,585 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 12:32:43,585 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 12:32:43,585 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 12:32:43,585 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 12:32:43,586 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 12:32:43,586 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 12:32:43,586 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 12:32:43,586 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 12:32:43,587 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 12:32:43,587 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 12:32:43,588 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 12:32:43,588 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 12:32:43,589 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 12:32:43,589 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 12:32:43,589 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 12:32:43,589 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 12:32:43,590 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b3e7d0a2f10d1449a9a354d4032bafdd0ae7a7fd76aceb835acbee3134ec74e4 [2024-11-12 12:32:43,859 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 12:32:43,885 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 12:32:43,889 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 12:32:43,890 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 12:32:43,891 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 12:32:43,892 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_02-simple_racefree.i [2024-11-12 12:32:45,326 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 12:32:45,575 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 12:32:45,576 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_02-simple_racefree.i [2024-11-12 12:32:45,595 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f0fe8fa7f/69a16f16ec6f4a22a0f7c50ddfd86349/FLAG3d3f63aa0 [2024-11-12 12:32:45,607 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f0fe8fa7f/69a16f16ec6f4a22a0f7c50ddfd86349 [2024-11-12 12:32:45,609 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 12:32:45,610 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 12:32:45,611 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 12:32:45,611 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 12:32:45,615 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 12:32:45,616 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:32:45" (1/1) ... [2024-11-12 12:32:45,616 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62595e8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:32:45, skipping insertion in model container [2024-11-12 12:32:45,616 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:32:45" (1/1) ... [2024-11-12 12:32:45,659 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 12:32:46,030 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 12:32:46,059 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 12:32:46,144 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 12:32:46,222 INFO L204 MainTranslator]: Completed translation [2024-11-12 12:32:46,222 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:32:46 WrapperNode [2024-11-12 12:32:46,223 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 12:32:46,224 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 12:32:46,224 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 12:32:46,224 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 12:32:46,230 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:32:46" (1/1) ... [2024-11-12 12:32:46,244 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:32:46" (1/1) ... [2024-11-12 12:32:46,269 INFO L138 Inliner]: procedures = 171, calls = 36, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 146 [2024-11-12 12:32:46,269 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 12:32:46,272 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 12:32:46,273 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 12:32:46,273 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 12:32:46,279 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:32:46" (1/1) ... [2024-11-12 12:32:46,280 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:32:46" (1/1) ... [2024-11-12 12:32:46,283 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:32:46" (1/1) ... [2024-11-12 12:32:46,284 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:32:46" (1/1) ... [2024-11-12 12:32:46,303 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:32:46" (1/1) ... [2024-11-12 12:32:46,310 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:32:46" (1/1) ... [2024-11-12 12:32:46,311 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:32:46" (1/1) ... [2024-11-12 12:32:46,314 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:32:46" (1/1) ... [2024-11-12 12:32:46,319 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 12:32:46,320 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 12:32:46,320 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 12:32:46,321 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 12:32:46,321 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:32:46" (1/1) ... [2024-11-12 12:32:46,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 12:32:46,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 12:32:46,356 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 12:32:46,359 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 12:32:46,405 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-12 12:32:46,406 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-12 12:32:46,406 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-12 12:32:46,406 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 12:32:46,406 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-12 12:32:46,406 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-11-12 12:32:46,407 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-11-12 12:32:46,407 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-12 12:32:46,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-12 12:32:46,407 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-12 12:32:46,407 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 12:32:46,407 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 12:32:46,408 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-12 12:32:46,563 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 12:32:46,567 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 12:32:46,899 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-12 12:32:46,900 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 12:32:46,942 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 12:32:46,944 INFO L316 CfgBuilder]: Removed 10 assume(true) statements. [2024-11-12 12:32:46,944 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:32:46 BoogieIcfgContainer [2024-11-12 12:32:46,945 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 12:32:46,947 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 12:32:46,948 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 12:32:46,951 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 12:32:46,951 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 12:32:45" (1/3) ... [2024-11-12 12:32:46,952 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51f880 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:32:46, skipping insertion in model container [2024-11-12 12:32:46,952 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:32:46" (2/3) ... [2024-11-12 12:32:46,952 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51f880 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:32:46, skipping insertion in model container [2024-11-12 12:32:46,953 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:32:46" (3/3) ... [2024-11-12 12:32:46,954 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_02-simple_racefree.i [2024-11-12 12:32:46,971 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 12:32:46,971 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2024-11-12 12:32:46,971 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-12 12:32:47,045 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-11-12 12:32:47,082 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 187 places, 197 transitions, 401 flow [2024-11-12 12:32:47,195 INFO L124 PetriNetUnfolderBase]: 19/256 cut-off events. [2024-11-12 12:32:47,195 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-12 12:32:47,203 INFO L83 FinitePrefix]: Finished finitePrefix Result has 261 conditions, 256 events. 19/256 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 620 event pairs, 0 based on Foata normal form. 0/224 useless extension candidates. Maximal degree in co-relation 141. Up to 4 conditions per place. [2024-11-12 12:32:47,204 INFO L82 GeneralOperation]: Start removeDead. Operand has 187 places, 197 transitions, 401 flow [2024-11-12 12:32:47,213 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 187 places, 197 transitions, 401 flow [2024-11-12 12:32:47,223 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 12:32:47,228 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;@1607d16e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 12:32:47,229 INFO L334 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2024-11-12 12:32:47,255 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-12 12:32:47,255 INFO L124 PetriNetUnfolderBase]: 2/103 cut-off events. [2024-11-12 12:32:47,255 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-12 12:32:47,256 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:32:47,256 INFO L206 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:32:47,257 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-11-12 12:32:47,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:32:47,269 INFO L85 PathProgramCache]: Analyzing trace with hash 72201746, now seen corresponding path program 1 times [2024-11-12 12:32:47,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:32:47,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700586071] [2024-11-12 12:32:47,281 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:32:47,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:32:47,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:32:47,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:32:47,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:32:47,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700586071] [2024-11-12 12:32:47,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700586071] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:32:47,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:32:47,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 12:32:47,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687662464] [2024-11-12 12:32:47,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:32:47,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:32:47,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:32:47,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:32:47,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:32:47,809 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 197 [2024-11-12 12:32:47,813 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 197 transitions, 401 flow. Second operand has 3 states, 3 states have (on average 168.0) internal successors, (504), 3 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:32:47,814 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:32:47,814 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 197 [2024-11-12 12:32:47,814 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:32:47,971 INFO L124 PetriNetUnfolderBase]: 48/581 cut-off events. [2024-11-12 12:32:47,971 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-12 12:32:47,974 INFO L83 FinitePrefix]: Finished finitePrefix Result has 702 conditions, 581 events. 48/581 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 2512 event pairs, 35 based on Foata normal form. 62/588 useless extension candidates. Maximal degree in co-relation 575. Up to 108 conditions per place. [2024-11-12 12:32:47,977 INFO L140 encePairwiseOnDemand]: 182/197 looper letters, 22 selfloop transitions, 2 changer transitions 0/189 dead transitions. [2024-11-12 12:32:47,977 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 189 transitions, 433 flow [2024-11-12 12:32:47,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:32:47,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:32:47,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 542 transitions. [2024-11-12 12:32:47,993 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9170896785109983 [2024-11-12 12:32:47,995 INFO L175 Difference]: Start difference. First operand has 187 places, 197 transitions, 401 flow. Second operand 3 states and 542 transitions. [2024-11-12 12:32:47,996 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 189 transitions, 433 flow [2024-11-12 12:32:47,998 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 189 transitions, 433 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-12 12:32:48,003 INFO L231 Difference]: Finished difference. Result has 188 places, 183 transitions, 381 flow [2024-11-12 12:32:48,005 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=373, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=183, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=181, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=381, PETRI_PLACES=188, PETRI_TRANSITIONS=183} [2024-11-12 12:32:48,008 INFO L279 CegarLoopForPetriNet]: 187 programPoint places, 1 predicate places. [2024-11-12 12:32:48,009 INFO L471 AbstractCegarLoop]: Abstraction has has 188 places, 183 transitions, 381 flow [2024-11-12 12:32:48,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 168.0) internal successors, (504), 3 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:32:48,009 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:32:48,010 INFO L206 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:32:48,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 12:32:48,010 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-11-12 12:32:48,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:32:48,011 INFO L85 PathProgramCache]: Analyzing trace with hash 890096676, now seen corresponding path program 1 times [2024-11-12 12:32:48,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:32:48,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481202606] [2024-11-12 12:32:48,012 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:32:48,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:32:48,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:32:48,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:32:48,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:32:48,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481202606] [2024-11-12 12:32:48,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481202606] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:32:48,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:32:48,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 12:32:48,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207952100] [2024-11-12 12:32:48,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:32:48,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 12:32:48,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:32:48,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 12:32:48,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-12 12:32:48,917 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 197 [2024-11-12 12:32:48,918 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 183 transitions, 381 flow. Second operand has 6 states, 6 states have (on average 155.5) internal successors, (933), 6 states have internal predecessors, (933), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:32:48,918 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:32:48,918 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 197 [2024-11-12 12:32:48,918 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:32:49,126 INFO L124 PetriNetUnfolderBase]: 108/720 cut-off events. [2024-11-12 12:32:49,127 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2024-11-12 12:32:49,130 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1002 conditions, 720 events. 108/720 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 3829 event pairs, 66 based on Foata normal form. 0/660 useless extension candidates. Maximal degree in co-relation 856. Up to 181 conditions per place. [2024-11-12 12:32:49,136 INFO L140 encePairwiseOnDemand]: 191/197 looper letters, 48 selfloop transitions, 5 changer transitions 0/206 dead transitions. [2024-11-12 12:32:49,136 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 206 transitions, 533 flow [2024-11-12 12:32:49,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 12:32:49,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-12 12:32:49,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 978 transitions. [2024-11-12 12:32:49,145 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8274111675126904 [2024-11-12 12:32:49,146 INFO L175 Difference]: Start difference. First operand has 188 places, 183 transitions, 381 flow. Second operand 6 states and 978 transitions. [2024-11-12 12:32:49,146 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 206 transitions, 533 flow [2024-11-12 12:32:49,149 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 206 transitions, 529 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 12:32:49,153 INFO L231 Difference]: Finished difference. Result has 190 places, 182 transitions, 385 flow [2024-11-12 12:32:49,154 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=375, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=182, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=177, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=385, PETRI_PLACES=190, PETRI_TRANSITIONS=182} [2024-11-12 12:32:49,156 INFO L279 CegarLoopForPetriNet]: 187 programPoint places, 3 predicate places. [2024-11-12 12:32:49,157 INFO L471 AbstractCegarLoop]: Abstraction has has 190 places, 182 transitions, 385 flow [2024-11-12 12:32:49,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 155.5) internal successors, (933), 6 states have internal predecessors, (933), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:32:49,158 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:32:49,158 INFO L206 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:32:49,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 12:32:49,158 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-11-12 12:32:49,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:32:49,159 INFO L85 PathProgramCache]: Analyzing trace with hash 1147473663, now seen corresponding path program 1 times [2024-11-12 12:32:49,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:32:49,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106304331] [2024-11-12 12:32:49,160 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:32:49,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:32:49,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:32:49,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:32:49,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:32:49,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106304331] [2024-11-12 12:32:49,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106304331] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:32:49,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:32:49,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:32:49,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455502998] [2024-11-12 12:32:49,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:32:49,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:32:49,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:32:49,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:32:49,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:32:49,279 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 197 [2024-11-12 12:32:49,280 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 182 transitions, 385 flow. Second operand has 3 states, 3 states have (on average 162.66666666666666) internal successors, (488), 3 states have internal predecessors, (488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:32:49,280 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:32:49,280 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 197 [2024-11-12 12:32:49,280 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:32:49,462 INFO L124 PetriNetUnfolderBase]: 91/845 cut-off events. [2024-11-12 12:32:49,463 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-11-12 12:32:49,465 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1081 conditions, 845 events. 91/845 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 4683 event pairs, 30 based on Foata normal form. 0/776 useless extension candidates. Maximal degree in co-relation 962. Up to 125 conditions per place. [2024-11-12 12:32:49,468 INFO L140 encePairwiseOnDemand]: 188/197 looper letters, 30 selfloop transitions, 6 changer transitions 0/195 dead transitions. [2024-11-12 12:32:49,469 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 195 transitions, 486 flow [2024-11-12 12:32:49,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:32:49,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:32:49,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 522 transitions. [2024-11-12 12:32:49,471 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.883248730964467 [2024-11-12 12:32:49,471 INFO L175 Difference]: Start difference. First operand has 190 places, 182 transitions, 385 flow. Second operand 3 states and 522 transitions. [2024-11-12 12:32:49,471 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 195 transitions, 486 flow [2024-11-12 12:32:49,473 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 195 transitions, 476 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-12 12:32:49,478 INFO L231 Difference]: Finished difference. Result has 187 places, 184 transitions, 413 flow [2024-11-12 12:32:49,479 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=371, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=180, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=174, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=413, PETRI_PLACES=187, PETRI_TRANSITIONS=184} [2024-11-12 12:32:49,479 INFO L279 CegarLoopForPetriNet]: 187 programPoint places, 0 predicate places. [2024-11-12 12:32:49,480 INFO L471 AbstractCegarLoop]: Abstraction has has 187 places, 184 transitions, 413 flow [2024-11-12 12:32:49,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 162.66666666666666) internal successors, (488), 3 states have internal predecessors, (488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:32:49,480 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:32:49,481 INFO L206 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:32:49,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 12:32:49,481 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-11-12 12:32:49,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:32:49,485 INFO L85 PathProgramCache]: Analyzing trace with hash 1755011909, now seen corresponding path program 1 times [2024-11-12 12:32:49,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:32:49,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931032255] [2024-11-12 12:32:49,485 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:32:49,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:32:49,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:32:49,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:32:49,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:32:49,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931032255] [2024-11-12 12:32:49,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931032255] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:32:49,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:32:49,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:32:49,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717676404] [2024-11-12 12:32:49,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:32:49,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:32:49,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:32:49,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:32:49,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:32:49,596 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 197 [2024-11-12 12:32:49,597 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 184 transitions, 413 flow. Second operand has 3 states, 3 states have (on average 165.33333333333334) internal successors, (496), 3 states have internal predecessors, (496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:32:49,597 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:32:49,597 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 197 [2024-11-12 12:32:49,597 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:32:49,737 INFO L124 PetriNetUnfolderBase]: 94/847 cut-off events. [2024-11-12 12:32:49,737 INFO L125 PetriNetUnfolderBase]: For 113/113 co-relation queries the response was YES. [2024-11-12 12:32:49,739 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1181 conditions, 847 events. 94/847 cut-off events. For 113/113 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 4785 event pairs, 60 based on Foata normal form. 0/778 useless extension candidates. Maximal degree in co-relation 1062. Up to 189 conditions per place. [2024-11-12 12:32:49,742 INFO L140 encePairwiseOnDemand]: 192/197 looper letters, 27 selfloop transitions, 4 changer transitions 0/191 dead transitions. [2024-11-12 12:32:49,742 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 191 transitions, 493 flow [2024-11-12 12:32:49,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:32:49,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:32:49,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 518 transitions. [2024-11-12 12:32:49,744 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8764805414551607 [2024-11-12 12:32:49,744 INFO L175 Difference]: Start difference. First operand has 187 places, 184 transitions, 413 flow. Second operand 3 states and 518 transitions. [2024-11-12 12:32:49,744 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 191 transitions, 493 flow [2024-11-12 12:32:49,746 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 191 transitions, 479 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 12:32:49,748 INFO L231 Difference]: Finished difference. Result has 189 places, 187 transitions, 433 flow [2024-11-12 12:32:49,749 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=401, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=180, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=433, PETRI_PLACES=189, PETRI_TRANSITIONS=187} [2024-11-12 12:32:49,749 INFO L279 CegarLoopForPetriNet]: 187 programPoint places, 2 predicate places. [2024-11-12 12:32:49,750 INFO L471 AbstractCegarLoop]: Abstraction has has 189 places, 187 transitions, 433 flow [2024-11-12 12:32:49,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 165.33333333333334) internal successors, (496), 3 states have internal predecessors, (496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:32:49,750 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:32:49,750 INFO L206 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:32:49,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 12:32:49,751 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-11-12 12:32:49,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:32:49,752 INFO L85 PathProgramCache]: Analyzing trace with hash -524792943, now seen corresponding path program 1 times [2024-11-12 12:32:49,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:32:49,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174856033] [2024-11-12 12:32:49,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:32:49,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:32:49,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 12:32:49,783 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 12:32:49,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 12:32:49,850 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 12:32:49,851 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-12 12:32:49,852 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 12 remaining) [2024-11-12 12:32:49,856 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (10 of 12 remaining) [2024-11-12 12:32:49,857 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (9 of 12 remaining) [2024-11-12 12:32:49,857 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (8 of 12 remaining) [2024-11-12 12:32:49,857 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (7 of 12 remaining) [2024-11-12 12:32:49,857 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (6 of 12 remaining) [2024-11-12 12:32:49,858 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (5 of 12 remaining) [2024-11-12 12:32:49,858 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (4 of 12 remaining) [2024-11-12 12:32:49,858 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (3 of 12 remaining) [2024-11-12 12:32:49,858 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (2 of 12 remaining) [2024-11-12 12:32:49,858 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (1 of 12 remaining) [2024-11-12 12:32:49,858 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (0 of 12 remaining) [2024-11-12 12:32:49,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-12 12:32:49,859 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-11-12 12:32:49,862 WARN L244 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-12 12:32:49,862 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-11-12 12:32:49,920 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-12 12:32:49,930 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 231 places, 246 transitions, 508 flow [2024-11-12 12:32:49,995 INFO L124 PetriNetUnfolderBase]: 34/392 cut-off events. [2024-11-12 12:32:49,996 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-11-12 12:32:50,000 INFO L83 FinitePrefix]: Finished finitePrefix Result has 404 conditions, 392 events. 34/392 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1173 event pairs, 0 based on Foata normal form. 0/336 useless extension candidates. Maximal degree in co-relation 258. Up to 8 conditions per place. [2024-11-12 12:32:50,000 INFO L82 GeneralOperation]: Start removeDead. Operand has 231 places, 246 transitions, 508 flow [2024-11-12 12:32:50,005 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 231 places, 246 transitions, 508 flow [2024-11-12 12:32:50,007 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 12:32:50,008 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;@1607d16e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 12:32:50,009 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2024-11-12 12:32:50,021 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-12 12:32:50,022 INFO L124 PetriNetUnfolderBase]: 2/103 cut-off events. [2024-11-12 12:32:50,022 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-12 12:32:50,022 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:32:50,022 INFO L206 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:32:50,023 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-11-12 12:32:50,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:32:50,023 INFO L85 PathProgramCache]: Analyzing trace with hash -1012236846, now seen corresponding path program 1 times [2024-11-12 12:32:50,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:32:50,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84227497] [2024-11-12 12:32:50,024 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:32:50,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:32:50,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:32:50,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:32:50,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:32:50,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84227497] [2024-11-12 12:32:50,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84227497] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:32:50,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:32:50,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 12:32:50,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367037640] [2024-11-12 12:32:50,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:32:50,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:32:50,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:32:50,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:32:50,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:32:50,119 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 201 out of 246 [2024-11-12 12:32:50,120 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 231 places, 246 transitions, 508 flow. Second operand has 3 states, 3 states have (on average 203.0) internal successors, (609), 3 states have internal predecessors, (609), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:32:50,120 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:32:50,120 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 201 of 246 [2024-11-12 12:32:50,120 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:32:50,746 INFO L124 PetriNetUnfolderBase]: 788/4355 cut-off events. [2024-11-12 12:32:50,747 INFO L125 PetriNetUnfolderBase]: For 77/77 co-relation queries the response was YES. [2024-11-12 12:32:50,761 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5708 conditions, 4355 events. 788/4355 cut-off events. For 77/77 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 41161 event pairs, 348 based on Foata normal form. 749/4718 useless extension candidates. Maximal degree in co-relation 721. Up to 1303 conditions per place. [2024-11-12 12:32:50,779 INFO L140 encePairwiseOnDemand]: 225/246 looper letters, 31 selfloop transitions, 2 changer transitions 0/233 dead transitions. [2024-11-12 12:32:50,780 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 233 transitions, 548 flow [2024-11-12 12:32:50,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:32:50,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:32:50,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 662 transitions. [2024-11-12 12:32:50,782 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8970189701897019 [2024-11-12 12:32:50,782 INFO L175 Difference]: Start difference. First operand has 231 places, 246 transitions, 508 flow. Second operand 3 states and 662 transitions. [2024-11-12 12:32:50,782 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 231 places, 233 transitions, 548 flow [2024-11-12 12:32:50,784 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 231 places, 233 transitions, 548 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-12 12:32:50,787 INFO L231 Difference]: Finished difference. Result has 232 places, 227 transitions, 480 flow [2024-11-12 12:32:50,787 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=468, PETRI_DIFFERENCE_MINUEND_PLACES=229, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=226, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=224, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=480, PETRI_PLACES=232, PETRI_TRANSITIONS=227} [2024-11-12 12:32:50,790 INFO L279 CegarLoopForPetriNet]: 231 programPoint places, 1 predicate places. [2024-11-12 12:32:50,790 INFO L471 AbstractCegarLoop]: Abstraction has has 232 places, 227 transitions, 480 flow [2024-11-12 12:32:50,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 203.0) internal successors, (609), 3 states have internal predecessors, (609), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:32:50,791 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:32:50,791 INFO L206 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:32:50,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-12 12:32:50,792 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-11-12 12:32:50,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:32:50,792 INFO L85 PathProgramCache]: Analyzing trace with hash -1873296732, now seen corresponding path program 1 times [2024-11-12 12:32:50,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:32:50,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952674587] [2024-11-12 12:32:50,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:32:50,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:32:50,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:32:51,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:32:51,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:32:51,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952674587] [2024-11-12 12:32:51,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952674587] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:32:51,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:32:51,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 12:32:51,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702430697] [2024-11-12 12:32:51,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:32:51,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 12:32:51,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:32:51,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 12:32:51,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-12 12:32:51,331 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 189 out of 246 [2024-11-12 12:32:51,333 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 232 places, 227 transitions, 480 flow. Second operand has 6 states, 6 states have (on average 190.5) internal successors, (1143), 6 states have internal predecessors, (1143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:32:51,333 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:32:51,333 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 189 of 246 [2024-11-12 12:32:51,333 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:32:52,252 INFO L124 PetriNetUnfolderBase]: 1718/5999 cut-off events. [2024-11-12 12:32:52,253 INFO L125 PetriNetUnfolderBase]: For 130/130 co-relation queries the response was YES. [2024-11-12 12:32:52,272 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9011 conditions, 5999 events. 1718/5999 cut-off events. For 130/130 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 57109 event pairs, 168 based on Foata normal form. 0/5548 useless extension candidates. Maximal degree in co-relation 4233. Up to 2015 conditions per place. [2024-11-12 12:32:52,302 INFO L140 encePairwiseOnDemand]: 240/246 looper letters, 80 selfloop transitions, 6 changer transitions 0/274 dead transitions. [2024-11-12 12:32:52,302 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 236 places, 274 transitions, 746 flow [2024-11-12 12:32:52,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 12:32:52,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-12 12:32:52,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1220 transitions. [2024-11-12 12:32:52,306 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8265582655826558 [2024-11-12 12:32:52,306 INFO L175 Difference]: Start difference. First operand has 232 places, 227 transitions, 480 flow. Second operand 6 states and 1220 transitions. [2024-11-12 12:32:52,306 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 236 places, 274 transitions, 746 flow [2024-11-12 12:32:52,309 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 235 places, 274 transitions, 744 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-12 12:32:52,312 INFO L231 Difference]: Finished difference. Result has 235 places, 226 transitions, 488 flow [2024-11-12 12:32:52,313 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=476, PETRI_DIFFERENCE_MINUEND_PLACES=230, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=226, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=220, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=488, PETRI_PLACES=235, PETRI_TRANSITIONS=226} [2024-11-12 12:32:52,314 INFO L279 CegarLoopForPetriNet]: 231 programPoint places, 4 predicate places. [2024-11-12 12:32:52,314 INFO L471 AbstractCegarLoop]: Abstraction has has 235 places, 226 transitions, 488 flow [2024-11-12 12:32:52,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 190.5) internal successors, (1143), 6 states have internal predecessors, (1143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:32:52,315 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:32:52,315 INFO L206 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:32:52,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-12 12:32:52,316 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-11-12 12:32:52,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:32:52,316 INFO L85 PathProgramCache]: Analyzing trace with hash 1314901924, now seen corresponding path program 1 times [2024-11-12 12:32:52,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:32:52,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750155076] [2024-11-12 12:32:52,317 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:32:52,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:32:52,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:32:52,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:32:52,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:32:52,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750155076] [2024-11-12 12:32:52,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750155076] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:32:52,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:32:52,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:32:52,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709654812] [2024-11-12 12:32:52,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:32:52,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:32:52,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:32:52,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:32:52,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:32:52,415 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 188 out of 246 [2024-11-12 12:32:52,416 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 235 places, 226 transitions, 488 flow. Second operand has 3 states, 3 states have (on average 189.66666666666666) internal successors, (569), 3 states have internal predecessors, (569), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:32:52,416 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:32:52,416 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 188 of 246 [2024-11-12 12:32:52,416 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:32:54,444 INFO L124 PetriNetUnfolderBase]: 3893/14653 cut-off events. [2024-11-12 12:32:54,444 INFO L125 PetriNetUnfolderBase]: For 238/238 co-relation queries the response was YES. [2024-11-12 12:32:54,487 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21204 conditions, 14653 events. 3893/14653 cut-off events. For 238/238 co-relation queries the response was YES. Maximal size of possible extension queue 383. Compared 164301 event pairs, 1530 based on Foata normal form. 0/13110 useless extension candidates. Maximal degree in co-relation 20044. Up to 3516 conditions per place. [2024-11-12 12:32:54,549 INFO L140 encePairwiseOnDemand]: 227/246 looper letters, 58 selfloop transitions, 14 changer transitions 0/259 dead transitions. [2024-11-12 12:32:54,550 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 259 transitions, 709 flow [2024-11-12 12:32:54,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:32:54,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:32:54,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 641 transitions. [2024-11-12 12:32:54,552 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8685636856368564 [2024-11-12 12:32:54,552 INFO L175 Difference]: Start difference. First operand has 235 places, 226 transitions, 488 flow. Second operand 3 states and 641 transitions. [2024-11-12 12:32:54,552 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 237 places, 259 transitions, 709 flow [2024-11-12 12:32:54,557 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 232 places, 259 transitions, 697 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-12 12:32:54,560 INFO L231 Difference]: Finished difference. Result has 234 places, 240 transitions, 598 flow [2024-11-12 12:32:54,561 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=476, PETRI_DIFFERENCE_MINUEND_PLACES=230, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=226, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=212, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=598, PETRI_PLACES=234, PETRI_TRANSITIONS=240} [2024-11-12 12:32:54,561 INFO L279 CegarLoopForPetriNet]: 231 programPoint places, 3 predicate places. [2024-11-12 12:32:54,562 INFO L471 AbstractCegarLoop]: Abstraction has has 234 places, 240 transitions, 598 flow [2024-11-12 12:32:54,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 189.66666666666666) internal successors, (569), 3 states have internal predecessors, (569), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:32:54,562 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:32:54,563 INFO L206 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:32:54,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-12 12:32:54,563 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-11-12 12:32:54,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:32:54,564 INFO L85 PathProgramCache]: Analyzing trace with hash 1424383286, now seen corresponding path program 1 times [2024-11-12 12:32:54,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:32:54,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519070861] [2024-11-12 12:32:54,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:32:54,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:32:54,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:32:54,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:32:54,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:32:54,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519070861] [2024-11-12 12:32:54,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519070861] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:32:54,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:32:54,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:32:54,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132134817] [2024-11-12 12:32:54,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:32:54,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:32:54,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:32:54,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:32:54,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:32:54,793 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 194 out of 246 [2024-11-12 12:32:54,794 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 234 places, 240 transitions, 598 flow. Second operand has 3 states, 3 states have (on average 196.33333333333334) internal successors, (589), 3 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:32:54,794 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:32:54,794 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 194 of 246 [2024-11-12 12:32:54,794 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:32:56,886 INFO L124 PetriNetUnfolderBase]: 4020/16506 cut-off events. [2024-11-12 12:32:56,887 INFO L125 PetriNetUnfolderBase]: For 4310/4479 co-relation queries the response was YES. [2024-11-12 12:32:56,924 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27194 conditions, 16506 events. 4020/16506 cut-off events. For 4310/4479 co-relation queries the response was YES. Maximal size of possible extension queue 424. Compared 194152 event pairs, 2411 based on Foata normal form. 46/15009 useless extension candidates. Maximal degree in co-relation 13739. Up to 5498 conditions per place. [2024-11-12 12:32:56,989 INFO L140 encePairwiseOnDemand]: 237/246 looper letters, 52 selfloop transitions, 14 changer transitions 0/264 dead transitions. [2024-11-12 12:32:56,989 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 236 places, 264 transitions, 816 flow [2024-11-12 12:32:56,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:32:56,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:32:56,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 635 transitions. [2024-11-12 12:32:56,992 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8604336043360433 [2024-11-12 12:32:56,992 INFO L175 Difference]: Start difference. First operand has 234 places, 240 transitions, 598 flow. Second operand 3 states and 635 transitions. [2024-11-12 12:32:56,992 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 236 places, 264 transitions, 816 flow [2024-11-12 12:32:57,004 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 234 places, 264 transitions, 778 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 12:32:57,007 INFO L231 Difference]: Finished difference. Result has 236 places, 252 transitions, 696 flow [2024-11-12 12:32:57,008 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=570, PETRI_DIFFERENCE_MINUEND_PLACES=232, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=240, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=226, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=696, PETRI_PLACES=236, PETRI_TRANSITIONS=252} [2024-11-12 12:32:57,009 INFO L279 CegarLoopForPetriNet]: 231 programPoint places, 5 predicate places. [2024-11-12 12:32:57,009 INFO L471 AbstractCegarLoop]: Abstraction has has 236 places, 252 transitions, 696 flow [2024-11-12 12:32:57,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 196.33333333333334) internal successors, (589), 3 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:32:57,010 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:32:57,010 INFO L206 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:32:57,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-12 12:32:57,010 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-11-12 12:32:57,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:32:57,011 INFO L85 PathProgramCache]: Analyzing trace with hash -1886521457, now seen corresponding path program 1 times [2024-11-12 12:32:57,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:32:57,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919515360] [2024-11-12 12:32:57,012 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:32:57,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:32:57,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:32:57,135 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-12 12:32:57,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:32:57,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919515360] [2024-11-12 12:32:57,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919515360] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:32:57,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:32:57,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 12:32:57,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079800298] [2024-11-12 12:32:57,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:32:57,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 12:32:57,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:32:57,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 12:32:57,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-12 12:32:57,175 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 199 out of 246 [2024-11-12 12:32:57,177 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 236 places, 252 transitions, 696 flow. Second operand has 5 states, 5 states have (on average 201.4) internal successors, (1007), 5 states have internal predecessors, (1007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:32:57,177 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:32:57,178 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 199 of 246 [2024-11-12 12:32:57,178 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:32:59,664 INFO L124 PetriNetUnfolderBase]: 3255/19114 cut-off events. [2024-11-12 12:32:59,664 INFO L125 PetriNetUnfolderBase]: For 1896/2185 co-relation queries the response was YES. [2024-11-12 12:32:59,699 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27770 conditions, 19114 events. 3255/19114 cut-off events. For 1896/2185 co-relation queries the response was YES. Maximal size of possible extension queue 503. Compared 249297 event pairs, 1346 based on Foata normal form. 24/17143 useless extension candidates. Maximal degree in co-relation 12618. Up to 3703 conditions per place. [2024-11-12 12:32:59,751 INFO L140 encePairwiseOnDemand]: 241/246 looper letters, 56 selfloop transitions, 5 changer transitions 0/284 dead transitions. [2024-11-12 12:32:59,751 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 241 places, 284 transitions, 882 flow [2024-11-12 12:32:59,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 12:32:59,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-12 12:32:59,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1256 transitions. [2024-11-12 12:32:59,755 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8509485094850948 [2024-11-12 12:32:59,755 INFO L175 Difference]: Start difference. First operand has 236 places, 252 transitions, 696 flow. Second operand 6 states and 1256 transitions. [2024-11-12 12:32:59,755 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 241 places, 284 transitions, 882 flow [2024-11-12 12:32:59,764 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 239 places, 284 transitions, 854 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 12:32:59,768 INFO L231 Difference]: Finished difference. Result has 242 places, 254 transitions, 694 flow [2024-11-12 12:32:59,768 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=668, PETRI_DIFFERENCE_MINUEND_PLACES=234, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=252, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=247, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=694, PETRI_PLACES=242, PETRI_TRANSITIONS=254} [2024-11-12 12:32:59,769 INFO L279 CegarLoopForPetriNet]: 231 programPoint places, 11 predicate places. [2024-11-12 12:32:59,769 INFO L471 AbstractCegarLoop]: Abstraction has has 242 places, 254 transitions, 694 flow [2024-11-12 12:32:59,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 201.4) internal successors, (1007), 5 states have internal predecessors, (1007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:32:59,770 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:32:59,770 INFO L206 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:32:59,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-12 12:32:59,771 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-11-12 12:32:59,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:32:59,773 INFO L85 PathProgramCache]: Analyzing trace with hash -1179756648, now seen corresponding path program 1 times [2024-11-12 12:32:59,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:32:59,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194512428] [2024-11-12 12:32:59,773 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:32:59,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:32:59,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:32:59,832 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-12 12:32:59,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:32:59,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194512428] [2024-11-12 12:32:59,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194512428] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:32:59,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:32:59,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:32:59,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204040020] [2024-11-12 12:32:59,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:32:59,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:32:59,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:32:59,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:32:59,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:32:59,870 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 194 out of 246 [2024-11-12 12:32:59,871 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 242 places, 254 transitions, 694 flow. Second operand has 3 states, 3 states have (on average 196.66666666666666) internal successors, (590), 3 states have internal predecessors, (590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:32:59,872 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:32:59,872 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 194 of 246 [2024-11-12 12:32:59,872 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:33:02,133 INFO L124 PetriNetUnfolderBase]: 4656/19970 cut-off events. [2024-11-12 12:33:02,133 INFO L125 PetriNetUnfolderBase]: For 5170/5372 co-relation queries the response was YES. [2024-11-12 12:33:02,180 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32495 conditions, 19970 events. 4656/19970 cut-off events. For 5170/5372 co-relation queries the response was YES. Maximal size of possible extension queue 563. Compared 247795 event pairs, 2716 based on Foata normal form. 35/17953 useless extension candidates. Maximal degree in co-relation 32254. Up to 6266 conditions per place. [2024-11-12 12:33:02,241 INFO L140 encePairwiseOnDemand]: 237/246 looper letters, 59 selfloop transitions, 17 changer transitions 0/278 dead transitions. [2024-11-12 12:33:02,241 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 244 places, 278 transitions, 929 flow [2024-11-12 12:33:02,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:33:02,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:33:02,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 634 transitions. [2024-11-12 12:33:02,243 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8590785907859079 [2024-11-12 12:33:02,244 INFO L175 Difference]: Start difference. First operand has 242 places, 254 transitions, 694 flow. Second operand 3 states and 634 transitions. [2024-11-12 12:33:02,244 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 244 places, 278 transitions, 929 flow [2024-11-12 12:33:02,247 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 242 places, 278 transitions, 923 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-11-12 12:33:02,251 INFO L231 Difference]: Finished difference. Result has 244 places, 267 transitions, 842 flow [2024-11-12 12:33:02,253 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=688, PETRI_DIFFERENCE_MINUEND_PLACES=240, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=254, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=237, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=842, PETRI_PLACES=244, PETRI_TRANSITIONS=267} [2024-11-12 12:33:02,254 INFO L279 CegarLoopForPetriNet]: 231 programPoint places, 13 predicate places. [2024-11-12 12:33:02,254 INFO L471 AbstractCegarLoop]: Abstraction has has 244 places, 267 transitions, 842 flow [2024-11-12 12:33:02,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 196.66666666666666) internal successors, (590), 3 states have internal predecessors, (590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:33:02,255 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:33:02,255 INFO L206 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:33:02,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-12 12:33:02,256 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-11-12 12:33:02,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:33:02,256 INFO L85 PathProgramCache]: Analyzing trace with hash -1561101596, now seen corresponding path program 1 times [2024-11-12 12:33:02,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:33:02,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389741144] [2024-11-12 12:33:02,257 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:33:02,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:33:02,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:33:02,317 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-12 12:33:02,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:33:02,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389741144] [2024-11-12 12:33:02,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389741144] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:33:02,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:33:02,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:33:02,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964440716] [2024-11-12 12:33:02,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:33:02,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:33:02,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:33:02,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:33:02,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:33:02,361 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 194 out of 246 [2024-11-12 12:33:02,362 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 244 places, 267 transitions, 842 flow. Second operand has 3 states, 3 states have (on average 197.66666666666666) internal successors, (593), 3 states have internal predecessors, (593), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:33:02,362 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:33:02,362 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 194 of 246 [2024-11-12 12:33:02,362 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:33:05,004 INFO L124 PetriNetUnfolderBase]: 5232/22480 cut-off events. [2024-11-12 12:33:05,004 INFO L125 PetriNetUnfolderBase]: For 12960/13384 co-relation queries the response was YES. [2024-11-12 12:33:05,050 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39688 conditions, 22480 events. 5232/22480 cut-off events. For 12960/13384 co-relation queries the response was YES. Maximal size of possible extension queue 620. Compared 284452 event pairs, 2910 based on Foata normal form. 60/20251 useless extension candidates. Maximal degree in co-relation 39426. Up to 7048 conditions per place. [2024-11-12 12:33:05,121 INFO L140 encePairwiseOnDemand]: 237/246 looper letters, 71 selfloop transitions, 17 changer transitions 0/292 dead transitions. [2024-11-12 12:33:05,121 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 246 places, 292 transitions, 1136 flow [2024-11-12 12:33:05,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:33:05,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:33:05,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 635 transitions. [2024-11-12 12:33:05,123 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8604336043360433 [2024-11-12 12:33:05,123 INFO L175 Difference]: Start difference. First operand has 244 places, 267 transitions, 842 flow. Second operand 3 states and 635 transitions. [2024-11-12 12:33:05,123 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 246 places, 292 transitions, 1136 flow [2024-11-12 12:33:05,144 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 244 places, 292 transitions, 1096 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 12:33:05,147 INFO L231 Difference]: Finished difference. Result has 246 places, 280 transitions, 984 flow [2024-11-12 12:33:05,148 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=808, PETRI_DIFFERENCE_MINUEND_PLACES=242, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=267, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=250, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=984, PETRI_PLACES=246, PETRI_TRANSITIONS=280} [2024-11-12 12:33:05,149 INFO L279 CegarLoopForPetriNet]: 231 programPoint places, 15 predicate places. [2024-11-12 12:33:05,149 INFO L471 AbstractCegarLoop]: Abstraction has has 246 places, 280 transitions, 984 flow [2024-11-12 12:33:05,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 197.66666666666666) internal successors, (593), 3 states have internal predecessors, (593), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:33:05,149 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:33:05,150 INFO L206 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:33:05,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-12 12:33:05,150 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-11-12 12:33:05,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:33:05,151 INFO L85 PathProgramCache]: Analyzing trace with hash -2095314478, now seen corresponding path program 1 times [2024-11-12 12:33:05,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:33:05,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816173076] [2024-11-12 12:33:05,151 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:33:05,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:33:05,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 12:33:05,179 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 12:33:05,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 12:33:05,212 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 12:33:05,212 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-12 12:33:05,212 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (15 of 16 remaining) [2024-11-12 12:33:05,212 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (14 of 16 remaining) [2024-11-12 12:33:05,213 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (13 of 16 remaining) [2024-11-12 12:33:05,213 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (12 of 16 remaining) [2024-11-12 12:33:05,213 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (11 of 16 remaining) [2024-11-12 12:33:05,213 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (10 of 16 remaining) [2024-11-12 12:33:05,213 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (9 of 16 remaining) [2024-11-12 12:33:05,213 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (8 of 16 remaining) [2024-11-12 12:33:05,214 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (7 of 16 remaining) [2024-11-12 12:33:05,214 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (6 of 16 remaining) [2024-11-12 12:33:05,214 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (5 of 16 remaining) [2024-11-12 12:33:05,214 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (4 of 16 remaining) [2024-11-12 12:33:05,214 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (3 of 16 remaining) [2024-11-12 12:33:05,214 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (2 of 16 remaining) [2024-11-12 12:33:05,214 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (1 of 16 remaining) [2024-11-12 12:33:05,215 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (0 of 16 remaining) [2024-11-12 12:33:05,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-12 12:33:05,215 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:33:05,216 WARN L244 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-12 12:33:05,216 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-11-12 12:33:05,237 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-11-12 12:33:05,240 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 275 places, 295 transitions, 617 flow [2024-11-12 12:33:05,319 INFO L124 PetriNetUnfolderBase]: 54/573 cut-off events. [2024-11-12 12:33:05,320 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2024-11-12 12:33:05,324 INFO L83 FinitePrefix]: Finished finitePrefix Result has 598 conditions, 573 events. 54/573 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1969 event pairs, 1 based on Foata normal form. 0/487 useless extension candidates. Maximal degree in co-relation 400. Up to 16 conditions per place. [2024-11-12 12:33:05,325 INFO L82 GeneralOperation]: Start removeDead. Operand has 275 places, 295 transitions, 617 flow [2024-11-12 12:33:05,328 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 275 places, 295 transitions, 617 flow [2024-11-12 12:33:05,330 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 12:33:05,331 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;@1607d16e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 12:33:05,331 INFO L334 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2024-11-12 12:33:05,336 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-12 12:33:05,337 INFO L124 PetriNetUnfolderBase]: 2/103 cut-off events. [2024-11-12 12:33:05,337 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-12 12:33:05,337 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:33:05,337 INFO L206 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:33:05,337 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-11-12 12:33:05,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:33:05,339 INFO L85 PathProgramCache]: Analyzing trace with hash 183986482, now seen corresponding path program 1 times [2024-11-12 12:33:05,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:33:05,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891254136] [2024-11-12 12:33:05,340 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:33:05,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:33:05,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:33:05,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:33:05,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:33:05,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891254136] [2024-11-12 12:33:05,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891254136] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:33:05,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:33:05,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 12:33:05,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030401636] [2024-11-12 12:33:05,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:33:05,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:33:05,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:33:05,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:33:05,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:33:05,420 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 236 out of 295 [2024-11-12 12:33:05,421 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 275 places, 295 transitions, 617 flow. Second operand has 3 states, 3 states have (on average 238.0) internal successors, (714), 3 states have internal predecessors, (714), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:33:05,421 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:33:05,421 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 236 of 295 [2024-11-12 12:33:05,421 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:33:10,184 INFO L124 PetriNetUnfolderBase]: 8948/35399 cut-off events. [2024-11-12 12:33:10,185 INFO L125 PetriNetUnfolderBase]: For 937/937 co-relation queries the response was YES. [2024-11-12 12:33:10,269 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48637 conditions, 35399 events. 8948/35399 cut-off events. For 937/937 co-relation queries the response was YES. Maximal size of possible extension queue 770. Compared 457588 event pairs, 8324 based on Foata normal form. 7648/39665 useless extension candidates. Maximal degree in co-relation 35526. Up to 12802 conditions per place. [2024-11-12 12:33:10,411 INFO L140 encePairwiseOnDemand]: 268/295 looper letters, 39 selfloop transitions, 2 changer transitions 0/276 dead transitions. [2024-11-12 12:33:10,411 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 275 places, 276 transitions, 661 flow [2024-11-12 12:33:10,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:33:10,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:33:10,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 781 transitions. [2024-11-12 12:33:10,414 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8824858757062147 [2024-11-12 12:33:10,414 INFO L175 Difference]: Start difference. First operand has 275 places, 295 transitions, 617 flow. Second operand 3 states and 781 transitions. [2024-11-12 12:33:10,414 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 275 places, 276 transitions, 661 flow [2024-11-12 12:33:10,418 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 275 places, 276 transitions, 661 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-12 12:33:10,421 INFO L231 Difference]: Finished difference. Result has 276 places, 270 transitions, 577 flow [2024-11-12 12:33:10,421 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=295, PETRI_DIFFERENCE_MINUEND_FLOW=565, PETRI_DIFFERENCE_MINUEND_PLACES=273, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=269, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=267, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=577, PETRI_PLACES=276, PETRI_TRANSITIONS=270} [2024-11-12 12:33:10,422 INFO L279 CegarLoopForPetriNet]: 275 programPoint places, 1 predicate places. [2024-11-12 12:33:10,422 INFO L471 AbstractCegarLoop]: Abstraction has has 276 places, 270 transitions, 577 flow [2024-11-12 12:33:10,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 238.0) internal successors, (714), 3 states have internal predecessors, (714), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:33:10,423 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:33:10,423 INFO L206 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:33:10,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-12 12:33:10,424 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-11-12 12:33:10,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:33:10,424 INFO L85 PathProgramCache]: Analyzing trace with hash 941062884, now seen corresponding path program 1 times [2024-11-12 12:33:10,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:33:10,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102385230] [2024-11-12 12:33:10,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:33:10,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:33:10,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:33:10,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:33:10,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:33:10,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102385230] [2024-11-12 12:33:10,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102385230] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:33:10,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:33:10,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 12:33:10,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236778027] [2024-11-12 12:33:10,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:33:10,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 12:33:10,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:33:10,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 12:33:10,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-12 12:33:10,907 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 224 out of 295 [2024-11-12 12:33:10,909 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 276 places, 270 transitions, 577 flow. Second operand has 6 states, 6 states have (on average 225.5) internal successors, (1353), 6 states have internal predecessors, (1353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:33:10,909 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:33:10,910 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 224 of 295 [2024-11-12 12:33:10,910 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:33:18,928 INFO L124 PetriNetUnfolderBase]: 19590/65817 cut-off events. [2024-11-12 12:33:18,928 INFO L125 PetriNetUnfolderBase]: For 1505/1505 co-relation queries the response was YES. [2024-11-12 12:33:19,136 INFO L83 FinitePrefix]: Finished finitePrefix Result has 94742 conditions, 65817 events. 19590/65817 cut-off events. For 1505/1505 co-relation queries the response was YES. Maximal size of possible extension queue 1358. Compared 890564 event pairs, 7382 based on Foata normal form. 0/60163 useless extension candidates. Maximal degree in co-relation 81487. Up to 20118 conditions per place. [2024-11-12 12:33:19,421 INFO L140 encePairwiseOnDemand]: 289/295 looper letters, 112 selfloop transitions, 6 changer transitions 0/341 dead transitions. [2024-11-12 12:33:19,421 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 280 places, 341 transitions, 955 flow [2024-11-12 12:33:19,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 12:33:19,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-12 12:33:19,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1462 transitions. [2024-11-12 12:33:19,425 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8259887005649718 [2024-11-12 12:33:19,425 INFO L175 Difference]: Start difference. First operand has 276 places, 270 transitions, 577 flow. Second operand 6 states and 1462 transitions. [2024-11-12 12:33:19,425 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 280 places, 341 transitions, 955 flow [2024-11-12 12:33:19,433 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 279 places, 341 transitions, 953 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-12 12:33:19,436 INFO L231 Difference]: Finished difference. Result has 279 places, 269 transitions, 585 flow [2024-11-12 12:33:19,437 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=295, PETRI_DIFFERENCE_MINUEND_FLOW=573, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=269, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=263, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=585, PETRI_PLACES=279, PETRI_TRANSITIONS=269} [2024-11-12 12:33:19,438 INFO L279 CegarLoopForPetriNet]: 275 programPoint places, 4 predicate places. [2024-11-12 12:33:19,438 INFO L471 AbstractCegarLoop]: Abstraction has has 279 places, 269 transitions, 585 flow [2024-11-12 12:33:19,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 225.5) internal successors, (1353), 6 states have internal predecessors, (1353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:33:19,439 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:33:19,439 INFO L206 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:33:19,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-12 12:33:19,439 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-11-12 12:33:19,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:33:19,440 INFO L85 PathProgramCache]: Analyzing trace with hash -981041862, now seen corresponding path program 1 times [2024-11-12 12:33:19,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:33:19,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843944582] [2024-11-12 12:33:19,440 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:33:19,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:33:19,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:33:19,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:33:19,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:33:19,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843944582] [2024-11-12 12:33:19,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843944582] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:33:19,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:33:19,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:33:19,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585379006] [2024-11-12 12:33:19,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:33:19,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:33:19,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:33:19,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:33:19,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:33:19,564 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 215 out of 295 [2024-11-12 12:33:19,566 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 279 places, 269 transitions, 585 flow. Second operand has 3 states, 3 states have (on average 216.66666666666666) internal successors, (650), 3 states have internal predecessors, (650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:33:19,566 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:33:19,566 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 215 of 295 [2024-11-12 12:33:19,567 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand