./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_19-callback_racing.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 3061b6dc 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_19-callback_racing.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 a178b12ba1b75e8e390c539a1b1599b5e56cbe73098e0c8e7ca0eeb62a619e80 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 05:52:57,600 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 05:52:57,699 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-19 05:52:57,704 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 05:52:57,705 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 05:52:57,734 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 05:52:57,735 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 05:52:57,735 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 05:52:57,736 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 05:52:57,736 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 05:52:57,737 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 05:52:57,737 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 05:52:57,738 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 05:52:57,738 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 05:52:57,738 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 05:52:57,739 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 05:52:57,739 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 05:52:57,739 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 05:52:57,740 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 05:52:57,740 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 05:52:57,740 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 05:52:57,741 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 05:52:57,741 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-19 05:52:57,742 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 05:52:57,742 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 05:52:57,742 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 05:52:57,743 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 05:52:57,743 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 05:52:57,747 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 05:52:57,747 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 05:52:57,747 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 05:52:57,748 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 05:52:57,748 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 05:52:57,748 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 05:52:57,748 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 05:52:57,749 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 05:52:57,749 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 05:52:57,749 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 05:52:57,749 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 05:52:57,749 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 05:52:57,750 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 05:52:57,751 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 -> a178b12ba1b75e8e390c539a1b1599b5e56cbe73098e0c8e7ca0eeb62a619e80 [2024-11-19 05:52:57,999 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 05:52:58,024 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 05:52:58,029 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 05:52:58,030 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 05:52:58,031 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 05:52:58,033 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_19-callback_racing.i [2024-11-19 05:52:59,591 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 05:52:59,885 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 05:52:59,886 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_19-callback_racing.i [2024-11-19 05:52:59,909 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bdcdf10e9/d2f987ac99a54fa892ec5c96fe5822f0/FLAGcbd064527 [2024-11-19 05:52:59,923 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bdcdf10e9/d2f987ac99a54fa892ec5c96fe5822f0 [2024-11-19 05:52:59,925 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 05:52:59,927 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 05:52:59,928 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 05:52:59,929 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 05:52:59,934 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 05:52:59,934 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 05:52:59" (1/1) ... [2024-11-19 05:52:59,935 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44d1bb07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:52:59, skipping insertion in model container [2024-11-19 05:52:59,935 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 05:52:59" (1/1) ... [2024-11-19 05:52:59,981 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 05:53:00,367 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 05:53:00,387 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 05:53:00,504 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 05:53:00,545 INFO L204 MainTranslator]: Completed translation [2024-11-19 05:53:00,546 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:53:00 WrapperNode [2024-11-19 05:53:00,546 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 05:53:00,547 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 05:53:00,547 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 05:53:00,547 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 05:53:00,555 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:53:00" (1/1) ... [2024-11-19 05:53:00,573 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:53:00" (1/1) ... [2024-11-19 05:53:00,603 INFO L138 Inliner]: procedures = 174, calls = 45, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 174 [2024-11-19 05:53:00,604 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 05:53:00,605 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 05:53:00,605 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 05:53:00,605 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 05:53:00,614 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:53:00" (1/1) ... [2024-11-19 05:53:00,615 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:53:00" (1/1) ... [2024-11-19 05:53:00,622 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:53:00" (1/1) ... [2024-11-19 05:53:00,625 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:53:00" (1/1) ... [2024-11-19 05:53:00,641 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:53:00" (1/1) ... [2024-11-19 05:53:00,649 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:53:00" (1/1) ... [2024-11-19 05:53:00,655 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:53:00" (1/1) ... [2024-11-19 05:53:00,656 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:53:00" (1/1) ... [2024-11-19 05:53:00,663 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 05:53:00,668 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 05:53:00,668 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 05:53:00,668 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 05:53:00,669 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:53:00" (1/1) ... [2024-11-19 05:53:00,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 05:53:00,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 05:53:00,715 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-19 05:53:00,720 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-19 05:53:00,761 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-19 05:53:00,761 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-19 05:53:00,761 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-19 05:53:00,761 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 05:53:00,762 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-19 05:53:00,762 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-11-19 05:53:00,762 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-11-19 05:53:00,762 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-19 05:53:00,762 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-19 05:53:00,762 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-19 05:53:00,762 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 05:53:00,762 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 05:53:00,764 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-19 05:53:00,891 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 05:53:00,895 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 05:53:01,233 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-19 05:53:01,234 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 05:53:01,285 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 05:53:01,285 INFO L316 CfgBuilder]: Removed 11 assume(true) statements. [2024-11-19 05:53:01,285 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 05:53:01 BoogieIcfgContainer [2024-11-19 05:53:01,286 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 05:53:01,288 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 05:53:01,288 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 05:53:01,292 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 05:53:01,292 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 05:52:59" (1/3) ... [2024-11-19 05:53:01,293 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60043537 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 05:53:01, skipping insertion in model container [2024-11-19 05:53:01,293 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:53:00" (2/3) ... [2024-11-19 05:53:01,294 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60043537 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 05:53:01, skipping insertion in model container [2024-11-19 05:53:01,294 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 05:53:01" (3/3) ... [2024-11-19 05:53:01,295 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_19-callback_racing.i [2024-11-19 05:53:01,312 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 05:53:01,313 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2024-11-19 05:53:01,313 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-19 05:53:01,382 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-11-19 05:53:01,432 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 168 places, 181 transitions, 369 flow [2024-11-19 05:53:01,544 INFO L124 PetriNetUnfolderBase]: 27/291 cut-off events. [2024-11-19 05:53:01,544 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-19 05:53:01,554 INFO L83 FinitePrefix]: Finished finitePrefix Result has 296 conditions, 291 events. 27/291 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 962 event pairs, 0 based on Foata normal form. 0/248 useless extension candidates. Maximal degree in co-relation 143. Up to 6 conditions per place. [2024-11-19 05:53:01,556 INFO L82 GeneralOperation]: Start removeDead. Operand has 168 places, 181 transitions, 369 flow [2024-11-19 05:53:01,565 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 168 places, 181 transitions, 369 flow [2024-11-19 05:53:01,579 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 05:53:01,586 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;@1495a6f1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 05:53:01,587 INFO L334 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2024-11-19 05:53:01,603 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-19 05:53:01,605 INFO L124 PetriNetUnfolderBase]: 2/55 cut-off events. [2024-11-19 05:53:01,605 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-19 05:53:01,605 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:53:01,606 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:53:01,606 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-19 05:53:01,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:53:01,611 INFO L85 PathProgramCache]: Analyzing trace with hash -274697999, now seen corresponding path program 1 times [2024-11-19 05:53:01,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:53:01,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824547604] [2024-11-19 05:53:01,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:53:01,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:53:01,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:53:02,573 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-19 05:53:02,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:53:02,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824547604] [2024-11-19 05:53:02,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824547604] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:53:02,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:53:02,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 05:53:02,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317937226] [2024-11-19 05:53:02,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:53:02,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 05:53:02,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:53:02,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 05:53:02,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-19 05:53:02,838 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 181 [2024-11-19 05:53:02,845 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 181 transitions, 369 flow. Second operand has 6 states, 6 states have (on average 138.5) internal successors, (831), 6 states have internal predecessors, (831), 0 states have call successors, (0), 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-19 05:53:02,845 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:53:02,845 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 181 [2024-11-19 05:53:02,846 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:53:03,067 INFO L124 PetriNetUnfolderBase]: 93/755 cut-off events. [2024-11-19 05:53:03,068 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-19 05:53:03,072 INFO L83 FinitePrefix]: Finished finitePrefix Result has 969 conditions, 755 events. 93/755 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 4186 event pairs, 33 based on Foata normal form. 101/800 useless extension candidates. Maximal degree in co-relation 798. Up to 154 conditions per place. [2024-11-19 05:53:03,077 INFO L140 encePairwiseOnDemand]: 162/181 looper letters, 40 selfloop transitions, 5 changer transitions 0/181 dead transitions. [2024-11-19 05:53:03,077 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 181 transitions, 459 flow [2024-11-19 05:53:03,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 05:53:03,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 05:53:03,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 897 transitions. [2024-11-19 05:53:03,098 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8259668508287292 [2024-11-19 05:53:03,103 INFO L175 Difference]: Start difference. First operand has 168 places, 181 transitions, 369 flow. Second operand 6 states and 897 transitions. [2024-11-19 05:53:03,104 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 181 transitions, 459 flow [2024-11-19 05:53:03,108 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 181 transitions, 459 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-19 05:53:03,114 INFO L231 Difference]: Finished difference. Result has 170 places, 165 transitions, 347 flow [2024-11-19 05:53:03,117 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=181, PETRI_DIFFERENCE_MINUEND_FLOW=337, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=165, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=347, PETRI_PLACES=170, PETRI_TRANSITIONS=165} [2024-11-19 05:53:03,124 INFO L277 CegarLoopForPetriNet]: 168 programPoint places, 2 predicate places. [2024-11-19 05:53:03,124 INFO L471 AbstractCegarLoop]: Abstraction has has 170 places, 165 transitions, 347 flow [2024-11-19 05:53:03,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 138.5) internal successors, (831), 6 states have internal predecessors, (831), 0 states have call successors, (0), 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-19 05:53:03,126 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:53:03,126 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:53:03,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 05:53:03,127 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-19 05:53:03,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:53:03,128 INFO L85 PathProgramCache]: Analyzing trace with hash -311166184, now seen corresponding path program 1 times [2024-11-19 05:53:03,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:53:03,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166252003] [2024-11-19 05:53:03,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:53:03,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:53:03,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:53:03,180 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-19 05:53:03,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:53:03,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166252003] [2024-11-19 05:53:03,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166252003] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:53:03,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:53:03,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:53:03,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61962722] [2024-11-19 05:53:03,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:53:03,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:53:03,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:53:03,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:53:03,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:53:03,213 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 181 [2024-11-19 05:53:03,214 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 165 transitions, 347 flow. Second operand has 3 states, 3 states have (on average 145.66666666666666) internal successors, (437), 3 states have internal predecessors, (437), 0 states have call successors, (0), 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-19 05:53:03,215 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:53:03,215 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 181 [2024-11-19 05:53:03,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:53:03,378 INFO L124 PetriNetUnfolderBase]: 113/926 cut-off events. [2024-11-19 05:53:03,379 INFO L125 PetriNetUnfolderBase]: For 7/13 co-relation queries the response was YES. [2024-11-19 05:53:03,382 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1196 conditions, 926 events. 113/926 cut-off events. For 7/13 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 4855 event pairs, 34 based on Foata normal form. 1/849 useless extension candidates. Maximal degree in co-relation 1029. Up to 137 conditions per place. [2024-11-19 05:53:03,386 INFO L140 encePairwiseOnDemand]: 172/181 looper letters, 30 selfloop transitions, 6 changer transitions 0/178 dead transitions. [2024-11-19 05:53:03,386 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 178 transitions, 448 flow [2024-11-19 05:53:03,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:53:03,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:53:03,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 471 transitions. [2024-11-19 05:53:03,388 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8674033149171271 [2024-11-19 05:53:03,388 INFO L175 Difference]: Start difference. First operand has 170 places, 165 transitions, 347 flow. Second operand 3 states and 471 transitions. [2024-11-19 05:53:03,388 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 178 transitions, 448 flow [2024-11-19 05:53:03,390 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 178 transitions, 438 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-19 05:53:03,393 INFO L231 Difference]: Finished difference. Result has 167 places, 167 transitions, 375 flow [2024-11-19 05:53:03,394 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=181, PETRI_DIFFERENCE_MINUEND_FLOW=333, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=375, PETRI_PLACES=167, PETRI_TRANSITIONS=167} [2024-11-19 05:53:03,395 INFO L277 CegarLoopForPetriNet]: 168 programPoint places, -1 predicate places. [2024-11-19 05:53:03,395 INFO L471 AbstractCegarLoop]: Abstraction has has 167 places, 167 transitions, 375 flow [2024-11-19 05:53:03,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 145.66666666666666) internal successors, (437), 3 states have internal predecessors, (437), 0 states have call successors, (0), 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-19 05:53:03,396 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:53:03,396 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:53:03,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 05:53:03,396 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-19 05:53:03,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:53:03,397 INFO L85 PathProgramCache]: Analyzing trace with hash 2001203335, now seen corresponding path program 1 times [2024-11-19 05:53:03,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:53:03,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888319134] [2024-11-19 05:53:03,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:53:03,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:53:03,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:53:03,450 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-19 05:53:03,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:53:03,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888319134] [2024-11-19 05:53:03,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888319134] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:53:03,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:53:03,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 05:53:03,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731106908] [2024-11-19 05:53:03,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:53:03,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:53:03,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:53:03,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:53:03,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:53:03,482 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 181 [2024-11-19 05:53:03,483 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 167 transitions, 375 flow. Second operand has 3 states, 3 states have (on average 150.33333333333334) internal successors, (451), 3 states have internal predecessors, (451), 0 states have call successors, (0), 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-19 05:53:03,483 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:53:03,483 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 181 [2024-11-19 05:53:03,483 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:53:03,620 INFO L124 PetriNetUnfolderBase]: 82/908 cut-off events. [2024-11-19 05:53:03,621 INFO L125 PetriNetUnfolderBase]: For 32/34 co-relation queries the response was YES. [2024-11-19 05:53:03,624 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1143 conditions, 908 events. 82/908 cut-off events. For 32/34 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 4757 event pairs, 38 based on Foata normal form. 1/843 useless extension candidates. Maximal degree in co-relation 1041. Up to 146 conditions per place. [2024-11-19 05:53:03,629 INFO L140 encePairwiseOnDemand]: 178/181 looper letters, 20 selfloop transitions, 2 changer transitions 0/171 dead transitions. [2024-11-19 05:53:03,629 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 171 transitions, 427 flow [2024-11-19 05:53:03,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:53:03,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:53:03,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 470 transitions. [2024-11-19 05:53:03,631 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8655616942909761 [2024-11-19 05:53:03,631 INFO L175 Difference]: Start difference. First operand has 167 places, 167 transitions, 375 flow. Second operand 3 states and 470 transitions. [2024-11-19 05:53:03,631 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 171 transitions, 427 flow [2024-11-19 05:53:03,635 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 171 transitions, 415 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:53:03,638 INFO L231 Difference]: Finished difference. Result has 168 places, 167 transitions, 371 flow [2024-11-19 05:53:03,639 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=181, PETRI_DIFFERENCE_MINUEND_FLOW=363, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=165, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=371, PETRI_PLACES=168, PETRI_TRANSITIONS=167} [2024-11-19 05:53:03,640 INFO L277 CegarLoopForPetriNet]: 168 programPoint places, 0 predicate places. [2024-11-19 05:53:03,640 INFO L471 AbstractCegarLoop]: Abstraction has has 168 places, 167 transitions, 371 flow [2024-11-19 05:53:03,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 150.33333333333334) internal successors, (451), 3 states have internal predecessors, (451), 0 states have call successors, (0), 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-19 05:53:03,642 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:53:03,642 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:53:03,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 05:53:03,642 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-19 05:53:03,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:53:03,644 INFO L85 PathProgramCache]: Analyzing trace with hash -964947795, now seen corresponding path program 1 times [2024-11-19 05:53:03,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:53:03,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770924827] [2024-11-19 05:53:03,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:53:03,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:53:03,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 05:53:03,681 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 05:53:03,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 05:53:03,743 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 05:53:03,744 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-19 05:53:03,745 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 9 remaining) [2024-11-19 05:53:03,747 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (7 of 9 remaining) [2024-11-19 05:53:03,748 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (6 of 9 remaining) [2024-11-19 05:53:03,748 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (5 of 9 remaining) [2024-11-19 05:53:03,748 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (4 of 9 remaining) [2024-11-19 05:53:03,750 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (3 of 9 remaining) [2024-11-19 05:53:03,751 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (2 of 9 remaining) [2024-11-19 05:53:03,751 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (1 of 9 remaining) [2024-11-19 05:53:03,751 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (0 of 9 remaining) [2024-11-19 05:53:03,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 05:53:03,753 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-19 05:53:03,757 WARN L244 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-19 05:53:03,757 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-11-19 05:53:03,788 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-19 05:53:03,792 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 197 places, 213 transitions, 442 flow [2024-11-19 05:53:03,840 INFO L124 PetriNetUnfolderBase]: 45/461 cut-off events. [2024-11-19 05:53:03,840 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-11-19 05:53:03,845 INFO L83 FinitePrefix]: Finished finitePrefix Result has 473 conditions, 461 events. 45/461 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1835 event pairs, 0 based on Foata normal form. 0/391 useless extension candidates. Maximal degree in co-relation 293. Up to 9 conditions per place. [2024-11-19 05:53:03,846 INFO L82 GeneralOperation]: Start removeDead. Operand has 197 places, 213 transitions, 442 flow [2024-11-19 05:53:03,849 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 197 places, 213 transitions, 442 flow [2024-11-19 05:53:03,850 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 05:53:03,851 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;@1495a6f1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 05:53:03,851 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2024-11-19 05:53:03,856 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-19 05:53:03,856 INFO L124 PetriNetUnfolderBase]: 2/55 cut-off events. [2024-11-19 05:53:03,856 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-19 05:53:03,856 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:53:03,856 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:53:03,857 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2024-11-19 05:53:03,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:53:03,857 INFO L85 PathProgramCache]: Analyzing trace with hash 834523153, now seen corresponding path program 1 times [2024-11-19 05:53:03,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:53:03,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540189464] [2024-11-19 05:53:03,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:53:03,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:53:03,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:53:04,172 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-19 05:53:04,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:53:04,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540189464] [2024-11-19 05:53:04,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540189464] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:53:04,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:53:04,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 05:53:04,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775173022] [2024-11-19 05:53:04,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:53:04,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 05:53:04,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:53:04,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 05:53:04,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-19 05:53:04,287 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 213 [2024-11-19 05:53:04,289 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 213 transitions, 442 flow. Second operand has 6 states, 6 states have (on average 159.5) internal successors, (957), 6 states have internal predecessors, (957), 0 states have call successors, (0), 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-19 05:53:04,289 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:53:04,289 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 213 [2024-11-19 05:53:04,290 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:53:04,919 INFO L124 PetriNetUnfolderBase]: 1001/4600 cut-off events. [2024-11-19 05:53:04,920 INFO L125 PetriNetUnfolderBase]: For 46/46 co-relation queries the response was YES. [2024-11-19 05:53:04,938 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6259 conditions, 4600 events. 1001/4600 cut-off events. For 46/46 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 43093 event pairs, 108 based on Foata normal form. 915/5182 useless extension candidates. Maximal degree in co-relation 1068. Up to 1202 conditions per place. [2024-11-19 05:53:04,959 INFO L140 encePairwiseOnDemand]: 190/213 looper letters, 62 selfloop transitions, 5 changer transitions 0/223 dead transitions. [2024-11-19 05:53:04,959 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 223 transitions, 596 flow [2024-11-19 05:53:04,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 05:53:04,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 05:53:04,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1065 transitions. [2024-11-19 05:53:04,962 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8333333333333334 [2024-11-19 05:53:04,962 INFO L175 Difference]: Start difference. First operand has 197 places, 213 transitions, 442 flow. Second operand 6 states and 1065 transitions. [2024-11-19 05:53:04,962 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 223 transitions, 596 flow [2024-11-19 05:53:04,964 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 197 places, 223 transitions, 596 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-19 05:53:04,967 INFO L231 Difference]: Finished difference. Result has 197 places, 191 transitions, 408 flow [2024-11-19 05:53:04,967 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=398, PETRI_DIFFERENCE_MINUEND_PLACES=192, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=191, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=186, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=408, PETRI_PLACES=197, PETRI_TRANSITIONS=191} [2024-11-19 05:53:04,968 INFO L277 CegarLoopForPetriNet]: 197 programPoint places, 0 predicate places. [2024-11-19 05:53:04,968 INFO L471 AbstractCegarLoop]: Abstraction has has 197 places, 191 transitions, 408 flow [2024-11-19 05:53:04,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 159.5) internal successors, (957), 6 states have internal predecessors, (957), 0 states have call successors, (0), 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-19 05:53:04,969 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:53:04,969 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:53:04,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 05:53:04,970 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2024-11-19 05:53:04,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:53:04,970 INFO L85 PathProgramCache]: Analyzing trace with hash -969738534, now seen corresponding path program 1 times [2024-11-19 05:53:04,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:53:04,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410175648] [2024-11-19 05:53:04,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:53:04,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:53:04,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:53:05,013 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-19 05:53:05,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:53:05,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410175648] [2024-11-19 05:53:05,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410175648] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:53:05,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:53:05,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:53:05,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282516774] [2024-11-19 05:53:05,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:53:05,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:53:05,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:53:05,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:53:05,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:53:05,044 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 213 [2024-11-19 05:53:05,045 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 191 transitions, 408 flow. Second operand has 3 states, 3 states have (on average 163.66666666666666) internal successors, (491), 3 states have internal predecessors, (491), 0 states have call successors, (0), 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-19 05:53:05,045 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:53:05,045 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 213 [2024-11-19 05:53:05,045 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:53:06,201 INFO L124 PetriNetUnfolderBase]: 2104/8794 cut-off events. [2024-11-19 05:53:06,201 INFO L125 PetriNetUnfolderBase]: For 261/449 co-relation queries the response was YES. [2024-11-19 05:53:06,219 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12323 conditions, 8794 events. 2104/8794 cut-off events. For 261/449 co-relation queries the response was YES. Maximal size of possible extension queue 210. Compared 87246 event pairs, 758 based on Foata normal form. 7/7967 useless extension candidates. Maximal degree in co-relation 10535. Up to 2127 conditions per place. [2024-11-19 05:53:06,251 INFO L140 encePairwiseOnDemand]: 201/213 looper letters, 45 selfloop transitions, 8 changer transitions 0/212 dead transitions. [2024-11-19 05:53:06,251 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 212 transitions, 567 flow [2024-11-19 05:53:06,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:53:06,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:53:06,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 543 transitions. [2024-11-19 05:53:06,253 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8497652582159625 [2024-11-19 05:53:06,253 INFO L175 Difference]: Start difference. First operand has 197 places, 191 transitions, 408 flow. Second operand 3 states and 543 transitions. [2024-11-19 05:53:06,253 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 212 transitions, 567 flow [2024-11-19 05:53:06,256 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 192 places, 212 transitions, 557 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-19 05:53:06,258 INFO L231 Difference]: Finished difference. Result has 194 places, 195 transitions, 454 flow [2024-11-19 05:53:06,259 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=394, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=189, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=181, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=454, PETRI_PLACES=194, PETRI_TRANSITIONS=195} [2024-11-19 05:53:06,260 INFO L277 CegarLoopForPetriNet]: 197 programPoint places, -3 predicate places. [2024-11-19 05:53:06,260 INFO L471 AbstractCegarLoop]: Abstraction has has 194 places, 195 transitions, 454 flow [2024-11-19 05:53:06,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 163.66666666666666) internal successors, (491), 3 states have internal predecessors, (491), 0 states have call successors, (0), 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-19 05:53:06,261 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:53:06,261 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:53:06,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 05:53:06,261 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2024-11-19 05:53:06,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:53:06,262 INFO L85 PathProgramCache]: Analyzing trace with hash 597928487, now seen corresponding path program 1 times [2024-11-19 05:53:06,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:53:06,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110176351] [2024-11-19 05:53:06,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:53:06,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:53:06,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:53:06,319 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-19 05:53:06,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:53:06,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110176351] [2024-11-19 05:53:06,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110176351] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:53:06,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:53:06,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 05:53:06,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634563139] [2024-11-19 05:53:06,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:53:06,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:53:06,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:53:06,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:53:06,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:53:06,346 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 170 out of 213 [2024-11-19 05:53:06,347 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 195 transitions, 454 flow. Second operand has 3 states, 3 states have (on average 171.33333333333334) internal successors, (514), 3 states have internal predecessors, (514), 0 states have call successors, (0), 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-19 05:53:06,348 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:53:06,348 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 170 of 213 [2024-11-19 05:53:06,348 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:53:07,315 INFO L124 PetriNetUnfolderBase]: 1362/7534 cut-off events. [2024-11-19 05:53:07,316 INFO L125 PetriNetUnfolderBase]: For 419/500 co-relation queries the response was YES. [2024-11-19 05:53:07,343 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10348 conditions, 7534 events. 1362/7534 cut-off events. For 419/500 co-relation queries the response was YES. Maximal size of possible extension queue 167. Compared 76545 event pairs, 874 based on Foata normal form. 1/6886 useless extension candidates. Maximal degree in co-relation 6779. Up to 1911 conditions per place. [2024-11-19 05:53:07,373 INFO L140 encePairwiseOnDemand]: 210/213 looper letters, 27 selfloop transitions, 2 changer transitions 0/200 dead transitions. [2024-11-19 05:53:07,374 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 200 transitions, 522 flow [2024-11-19 05:53:07,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:53:07,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:53:07,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 540 transitions. [2024-11-19 05:53:07,376 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8450704225352113 [2024-11-19 05:53:07,377 INFO L175 Difference]: Start difference. First operand has 194 places, 195 transitions, 454 flow. Second operand 3 states and 540 transitions. [2024-11-19 05:53:07,377 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 200 transitions, 522 flow [2024-11-19 05:53:07,381 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 200 transitions, 506 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:53:07,384 INFO L231 Difference]: Finished difference. Result has 195 places, 196 transitions, 450 flow [2024-11-19 05:53:07,384 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=438, PETRI_DIFFERENCE_MINUEND_PLACES=192, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=195, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=193, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=450, PETRI_PLACES=195, PETRI_TRANSITIONS=196} [2024-11-19 05:53:07,385 INFO L277 CegarLoopForPetriNet]: 197 programPoint places, -2 predicate places. [2024-11-19 05:53:07,385 INFO L471 AbstractCegarLoop]: Abstraction has has 195 places, 196 transitions, 450 flow [2024-11-19 05:53:07,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 171.33333333333334) internal successors, (514), 3 states have internal predecessors, (514), 0 states have call successors, (0), 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-19 05:53:07,386 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:53:07,386 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:53:07,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 05:53:07,387 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2024-11-19 05:53:07,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:53:07,388 INFO L85 PathProgramCache]: Analyzing trace with hash -1915331391, now seen corresponding path program 1 times [2024-11-19 05:53:07,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:53:07,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410575666] [2024-11-19 05:53:07,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:53:07,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:53:07,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:53:07,503 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:53:07,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:53:07,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410575666] [2024-11-19 05:53:07,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410575666] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 05:53:07,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1294737265] [2024-11-19 05:53:07,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:53:07,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 05:53:07,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 05:53:07,508 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 05:53:07,512 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-19 05:53:07,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:53:07,624 INFO L255 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 05:53:07,627 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 05:53:07,653 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-19 05:53:07,653 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 05:53:07,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1294737265] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:53:07,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 05:53:07,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2024-11-19 05:53:07,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391149503] [2024-11-19 05:53:07,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:53:07,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:53:07,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:53:07,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:53:07,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 05:53:07,666 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 170 out of 213 [2024-11-19 05:53:07,667 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 196 transitions, 450 flow. Second operand has 3 states, 3 states have (on average 172.0) internal successors, (516), 3 states have internal predecessors, (516), 0 states have call successors, (0), 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-19 05:53:07,667 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:53:07,667 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 170 of 213 [2024-11-19 05:53:07,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:53:09,102 INFO L124 PetriNetUnfolderBase]: 2343/13191 cut-off events. [2024-11-19 05:53:09,103 INFO L125 PetriNetUnfolderBase]: For 117/117 co-relation queries the response was YES. [2024-11-19 05:53:09,142 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17693 conditions, 13191 events. 2343/13191 cut-off events. For 117/117 co-relation queries the response was YES. Maximal size of possible extension queue 287. Compared 154880 event pairs, 1363 based on Foata normal form. 36/12104 useless extension candidates. Maximal degree in co-relation 17635. Up to 2189 conditions per place. [2024-11-19 05:53:09,178 INFO L140 encePairwiseOnDemand]: 210/213 looper letters, 37 selfloop transitions, 2 changer transitions 0/211 dead transitions. [2024-11-19 05:53:09,179 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 211 transitions, 558 flow [2024-11-19 05:53:09,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:53:09,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:53:09,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 550 transitions. [2024-11-19 05:53:09,181 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8607198748043818 [2024-11-19 05:53:09,181 INFO L175 Difference]: Start difference. First operand has 195 places, 196 transitions, 450 flow. Second operand 3 states and 550 transitions. [2024-11-19 05:53:09,181 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 211 transitions, 558 flow [2024-11-19 05:53:09,184 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 211 transitions, 556 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 05:53:09,186 INFO L231 Difference]: Finished difference. Result has 197 places, 197 transitions, 460 flow [2024-11-19 05:53:09,187 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=448, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=196, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=194, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=460, PETRI_PLACES=197, PETRI_TRANSITIONS=197} [2024-11-19 05:53:09,188 INFO L277 CegarLoopForPetriNet]: 197 programPoint places, 0 predicate places. [2024-11-19 05:53:09,189 INFO L471 AbstractCegarLoop]: Abstraction has has 197 places, 197 transitions, 460 flow [2024-11-19 05:53:09,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 172.0) internal successors, (516), 3 states have internal predecessors, (516), 0 states have call successors, (0), 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-19 05:53:09,190 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:53:09,190 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:53:09,210 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-19 05:53:09,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 05:53:09,396 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2024-11-19 05:53:09,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:53:09,397 INFO L85 PathProgramCache]: Analyzing trace with hash -1193848283, now seen corresponding path program 1 times [2024-11-19 05:53:09,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:53:09,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31951882] [2024-11-19 05:53:09,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:53:09,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:53:09,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 05:53:09,428 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 05:53:09,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 05:53:09,462 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 05:53:09,463 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-19 05:53:09,463 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 10 remaining) [2024-11-19 05:53:09,463 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (8 of 10 remaining) [2024-11-19 05:53:09,463 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (7 of 10 remaining) [2024-11-19 05:53:09,463 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (6 of 10 remaining) [2024-11-19 05:53:09,464 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (5 of 10 remaining) [2024-11-19 05:53:09,464 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (4 of 10 remaining) [2024-11-19 05:53:09,464 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (3 of 10 remaining) [2024-11-19 05:53:09,464 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (2 of 10 remaining) [2024-11-19 05:53:09,465 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (1 of 10 remaining) [2024-11-19 05:53:09,465 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (0 of 10 remaining) [2024-11-19 05:53:09,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 05:53:09,465 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-11-19 05:53:09,466 WARN L244 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-19 05:53:09,466 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-11-19 05:53:09,494 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-11-19 05:53:09,497 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 226 places, 245 transitions, 517 flow [2024-11-19 05:53:09,557 INFO L124 PetriNetUnfolderBase]: 68/676 cut-off events. [2024-11-19 05:53:09,558 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2024-11-19 05:53:09,562 INFO L83 FinitePrefix]: Finished finitePrefix Result has 701 conditions, 676 events. 68/676 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 2933 event pairs, 1 based on Foata normal form. 0/573 useless extension candidates. Maximal degree in co-relation 469. Up to 16 conditions per place. [2024-11-19 05:53:09,562 INFO L82 GeneralOperation]: Start removeDead. Operand has 226 places, 245 transitions, 517 flow [2024-11-19 05:53:09,566 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 226 places, 245 transitions, 517 flow [2024-11-19 05:53:09,567 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 05:53:09,568 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;@1495a6f1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 05:53:09,568 INFO L334 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2024-11-19 05:53:09,571 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-19 05:53:09,571 INFO L124 PetriNetUnfolderBase]: 2/55 cut-off events. [2024-11-19 05:53:09,571 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-19 05:53:09,571 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:53:09,572 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:53:09,572 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-11-19 05:53:09,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:53:09,572 INFO L85 PathProgramCache]: Analyzing trace with hash -1398176975, now seen corresponding path program 1 times [2024-11-19 05:53:09,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:53:09,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28225246] [2024-11-19 05:53:09,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:53:09,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:53:09,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:53:09,845 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-19 05:53:09,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:53:09,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28225246] [2024-11-19 05:53:09,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28225246] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:53:09,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:53:09,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 05:53:09,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255905413] [2024-11-19 05:53:09,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:53:09,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 05:53:09,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:53:09,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 05:53:09,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-19 05:53:10,016 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 179 out of 245 [2024-11-19 05:53:10,018 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 226 places, 245 transitions, 517 flow. Second operand has 6 states, 6 states have (on average 180.5) internal successors, (1083), 6 states have internal predecessors, (1083), 0 states have call successors, (0), 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-19 05:53:10,018 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:53:10,018 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 179 of 245 [2024-11-19 05:53:10,019 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:53:13,060 INFO L124 PetriNetUnfolderBase]: 8120/26912 cut-off events. [2024-11-19 05:53:13,060 INFO L125 PetriNetUnfolderBase]: For 557/557 co-relation queries the response was YES. [2024-11-19 05:53:13,126 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38647 conditions, 26912 events. 8120/26912 cut-off events. For 557/557 co-relation queries the response was YES. Maximal size of possible extension queue 744. Compared 324086 event pairs, 1746 based on Foata normal form. 6819/31993 useless extension candidates. Maximal degree in co-relation 6247. Up to 8631 conditions per place. [2024-11-19 05:53:13,245 INFO L140 encePairwiseOnDemand]: 218/245 looper letters, 84 selfloop transitions, 5 changer transitions 0/265 dead transitions. [2024-11-19 05:53:13,245 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 265 transitions, 735 flow [2024-11-19 05:53:13,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 05:53:13,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 05:53:13,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1233 transitions. [2024-11-19 05:53:13,249 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8387755102040816 [2024-11-19 05:53:13,249 INFO L175 Difference]: Start difference. First operand has 226 places, 245 transitions, 517 flow. Second operand 6 states and 1233 transitions. [2024-11-19 05:53:13,250 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 265 transitions, 735 flow [2024-11-19 05:53:13,252 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 224 places, 265 transitions, 735 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-19 05:53:13,255 INFO L231 Difference]: Finished difference. Result has 224 places, 217 transitions, 471 flow [2024-11-19 05:53:13,255 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=461, PETRI_DIFFERENCE_MINUEND_PLACES=219, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=217, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=212, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=471, PETRI_PLACES=224, PETRI_TRANSITIONS=217} [2024-11-19 05:53:13,258 INFO L277 CegarLoopForPetriNet]: 226 programPoint places, -2 predicate places. [2024-11-19 05:53:13,259 INFO L471 AbstractCegarLoop]: Abstraction has has 224 places, 217 transitions, 471 flow [2024-11-19 05:53:13,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 180.5) internal successors, (1083), 6 states have internal predecessors, (1083), 0 states have call successors, (0), 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-19 05:53:13,260 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:53:13,261 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:53:13,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-19 05:53:13,261 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-11-19 05:53:13,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:53:13,261 INFO L85 PathProgramCache]: Analyzing trace with hash 1061728344, now seen corresponding path program 1 times [2024-11-19 05:53:13,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:53:13,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263035650] [2024-11-19 05:53:13,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:53:13,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:53:13,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:53:13,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:53:13,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:53:13,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263035650] [2024-11-19 05:53:13,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263035650] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:53:13,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:53:13,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:53:13,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173529391] [2024-11-19 05:53:13,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:53:13,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:53:13,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:53:13,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:53:13,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:53:13,355 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 245 [2024-11-19 05:53:13,356 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 224 places, 217 transitions, 471 flow. Second operand has 3 states, 3 states have (on average 181.66666666666666) internal successors, (545), 3 states have internal predecessors, (545), 0 states have call successors, (0), 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-19 05:53:13,360 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:53:13,360 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 245 [2024-11-19 05:53:13,360 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:53:22,193 INFO L124 PetriNetUnfolderBase]: 27267/82221 cut-off events. [2024-11-19 05:53:22,193 INFO L125 PetriNetUnfolderBase]: For 2339/4240 co-relation queries the response was YES. [2024-11-19 05:53:22,446 INFO L83 FinitePrefix]: Finished finitePrefix Result has 121859 conditions, 82221 events. 27267/82221 cut-off events. For 2339/4240 co-relation queries the response was YES. Maximal size of possible extension queue 1773. Compared 1093440 event pairs, 10774 based on Foata normal form. 32/74548 useless extension candidates. Maximal degree in co-relation 109328. Up to 25188 conditions per place. [2024-11-19 05:53:22,796 INFO L140 encePairwiseOnDemand]: 230/245 looper letters, 60 selfloop transitions, 10 changer transitions 0/246 dead transitions. [2024-11-19 05:53:22,796 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 246 transitions, 690 flow [2024-11-19 05:53:22,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:53:22,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:53:22,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 615 transitions. [2024-11-19 05:53:22,799 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8367346938775511 [2024-11-19 05:53:22,799 INFO L175 Difference]: Start difference. First operand has 224 places, 217 transitions, 471 flow. Second operand 3 states and 615 transitions. [2024-11-19 05:53:22,799 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 246 transitions, 690 flow [2024-11-19 05:53:22,812 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 219 places, 246 transitions, 680 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-19 05:53:22,815 INFO L231 Difference]: Finished difference. Result has 221 places, 223 transitions, 535 flow [2024-11-19 05:53:22,816 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=457, PETRI_DIFFERENCE_MINUEND_PLACES=217, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=215, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=205, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=535, PETRI_PLACES=221, PETRI_TRANSITIONS=223} [2024-11-19 05:53:22,817 INFO L277 CegarLoopForPetriNet]: 226 programPoint places, -5 predicate places. [2024-11-19 05:53:22,817 INFO L471 AbstractCegarLoop]: Abstraction has has 221 places, 223 transitions, 535 flow [2024-11-19 05:53:22,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 181.66666666666666) internal successors, (545), 3 states have internal predecessors, (545), 0 states have call successors, (0), 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-19 05:53:22,817 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:53:22,818 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:53:22,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-19 05:53:22,818 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-11-19 05:53:22,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:53:22,819 INFO L85 PathProgramCache]: Analyzing trace with hash -1600927801, now seen corresponding path program 1 times [2024-11-19 05:53:22,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:53:22,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285945606] [2024-11-19 05:53:22,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:53:22,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:53:22,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:53:22,857 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-19 05:53:22,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:53:22,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285945606] [2024-11-19 05:53:22,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285945606] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:53:22,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:53:22,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 05:53:22,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219637075] [2024-11-19 05:53:22,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:53:22,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:53:22,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:53:22,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:53:22,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:53:22,884 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 191 out of 245 [2024-11-19 05:53:22,885 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 221 places, 223 transitions, 535 flow. Second operand has 3 states, 3 states have (on average 192.33333333333334) internal successors, (577), 3 states have internal predecessors, (577), 0 states have call successors, (0), 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-19 05:53:22,886 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:53:22,886 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 191 of 245 [2024-11-19 05:53:22,886 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:53:30,697 INFO L124 PetriNetUnfolderBase]: 16710/68707 cut-off events. [2024-11-19 05:53:30,698 INFO L125 PetriNetUnfolderBase]: For 4051/5311 co-relation queries the response was YES. [2024-11-19 05:53:30,963 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98145 conditions, 68707 events. 16710/68707 cut-off events. For 4051/5311 co-relation queries the response was YES. Maximal size of possible extension queue 1361. Compared 986987 event pairs, 11681 based on Foata normal form. 1/62403 useless extension candidates. Maximal degree in co-relation 64880. Up to 20086 conditions per place. [2024-11-19 05:53:31,212 INFO L140 encePairwiseOnDemand]: 242/245 looper letters, 33 selfloop transitions, 2 changer transitions 0/228 dead transitions. [2024-11-19 05:53:31,212 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 228 transitions, 615 flow [2024-11-19 05:53:31,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:53:31,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:53:31,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 609 transitions. [2024-11-19 05:53:31,214 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8285714285714286 [2024-11-19 05:53:31,215 INFO L175 Difference]: Start difference. First operand has 221 places, 223 transitions, 535 flow. Second operand 3 states and 609 transitions. [2024-11-19 05:53:31,215 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 223 places, 228 transitions, 615 flow [2024-11-19 05:53:31,225 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 221 places, 228 transitions, 595 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:53:31,228 INFO L231 Difference]: Finished difference. Result has 222 places, 224 transitions, 527 flow [2024-11-19 05:53:31,228 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=515, PETRI_DIFFERENCE_MINUEND_PLACES=219, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=223, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=221, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=527, PETRI_PLACES=222, PETRI_TRANSITIONS=224} [2024-11-19 05:53:31,229 INFO L277 CegarLoopForPetriNet]: 226 programPoint places, -4 predicate places. [2024-11-19 05:53:31,229 INFO L471 AbstractCegarLoop]: Abstraction has has 222 places, 224 transitions, 527 flow [2024-11-19 05:53:31,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 192.33333333333334) internal successors, (577), 3 states have internal predecessors, (577), 0 states have call successors, (0), 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-19 05:53:31,230 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:53:31,230 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:53:31,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-19 05:53:31,230 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-11-19 05:53:31,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:53:31,231 INFO L85 PathProgramCache]: Analyzing trace with hash 566792035, now seen corresponding path program 1 times [2024-11-19 05:53:31,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:53:31,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037429993] [2024-11-19 05:53:31,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:53:31,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:53:31,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:53:31,326 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:53:31,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:53:31,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037429993] [2024-11-19 05:53:31,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037429993] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 05:53:31,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1841517247] [2024-11-19 05:53:31,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:53:31,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 05:53:31,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 05:53:31,332 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 05:53:31,333 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-19 05:53:31,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:53:31,439 INFO L255 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 05:53:31,441 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 05:53:31,460 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-19 05:53:31,460 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 05:53:31,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1841517247] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:53:31,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 05:53:31,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2024-11-19 05:53:31,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357110648] [2024-11-19 05:53:31,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:53:31,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:53:31,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:53:31,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:53:31,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 05:53:31,473 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 191 out of 245 [2024-11-19 05:53:31,475 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 224 transitions, 527 flow. Second operand has 3 states, 3 states have (on average 193.0) internal successors, (579), 3 states have internal predecessors, (579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:53:31,475 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:53:31,475 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 191 of 245 [2024-11-19 05:53:31,475 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:53:43,795 INFO L124 PetriNetUnfolderBase]: 28232/111669 cut-off events. [2024-11-19 05:53:43,795 INFO L125 PetriNetUnfolderBase]: For 1400/1400 co-relation queries the response was YES. [2024-11-19 05:53:44,295 INFO L83 FinitePrefix]: Finished finitePrefix Result has 157869 conditions, 111669 events. 28232/111669 cut-off events. For 1400/1400 co-relation queries the response was YES. Maximal size of possible extension queue 2383. Compared 1723443 event pairs, 17335 based on Foata normal form. 247/102323 useless extension candidates. Maximal degree in co-relation 157810. Up to 22843 conditions per place. [2024-11-19 05:53:44,623 INFO L140 encePairwiseOnDemand]: 242/245 looper letters, 47 selfloop transitions, 2 changer transitions 0/243 dead transitions. [2024-11-19 05:53:44,623 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 243 transitions, 663 flow [2024-11-19 05:53:44,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:53:44,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:53:44,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 623 transitions. [2024-11-19 05:53:44,625 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8476190476190476 [2024-11-19 05:53:44,625 INFO L175 Difference]: Start difference. First operand has 222 places, 224 transitions, 527 flow. Second operand 3 states and 623 transitions. [2024-11-19 05:53:44,625 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 243 transitions, 663 flow [2024-11-19 05:53:44,630 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 223 places, 243 transitions, 661 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 05:53:44,633 INFO L231 Difference]: Finished difference. Result has 224 places, 225 transitions, 537 flow [2024-11-19 05:53:44,634 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=525, PETRI_DIFFERENCE_MINUEND_PLACES=221, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=224, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=222, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=537, PETRI_PLACES=224, PETRI_TRANSITIONS=225} [2024-11-19 05:53:44,634 INFO L277 CegarLoopForPetriNet]: 226 programPoint places, -2 predicate places. [2024-11-19 05:53:44,634 INFO L471 AbstractCegarLoop]: Abstraction has has 224 places, 225 transitions, 537 flow [2024-11-19 05:53:44,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 193.0) internal successors, (579), 3 states have internal predecessors, (579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:53:44,635 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:53:44,635 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:53:44,649 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-19 05:53:44,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-19 05:53:44,840 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-11-19 05:53:44,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:53:44,840 INFO L85 PathProgramCache]: Analyzing trace with hash 827485695, now seen corresponding path program 1 times [2024-11-19 05:53:44,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:53:44,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748265454] [2024-11-19 05:53:44,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:53:44,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:53:44,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:53:44,933 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 05:53:44,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:53:44,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748265454] [2024-11-19 05:53:44,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748265454] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 05:53:44,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1200641685] [2024-11-19 05:53:44,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:53:44,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 05:53:44,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 05:53:44,935 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 05:53:44,937 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-19 05:53:45,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:53:45,035 INFO L255 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 05:53:45,037 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 05:53:45,092 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 05:53:45,093 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 05:53:45,149 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 05:53:45,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1200641685] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 05:53:45,150 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 05:53:45,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2024-11-19 05:53:45,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449332747] [2024-11-19 05:53:45,150 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 05:53:45,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 05:53:45,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:53:45,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 05:53:45,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-19 05:53:45,239 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 188 out of 245 [2024-11-19 05:53:45,241 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 224 places, 225 transitions, 537 flow. Second operand has 10 states, 10 states have (on average 190.1) internal successors, (1901), 10 states have internal predecessors, (1901), 0 states have call successors, (0), 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-19 05:53:45,242 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:53:45,242 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 188 of 245 [2024-11-19 05:53:45,242 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand