./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_08-cond_racefree.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_08-cond_racefree.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b4439281d7e12bca3fd2bd39ebda4196e341f38fedf1c370a96bdabb4944cfe7 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 05:52:51,851 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 05:52:51,919 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:51,923 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 05:52:51,924 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 05:52:51,959 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 05:52:51,960 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 05:52:51,961 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 05:52:51,962 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 05:52:51,963 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 05:52:51,963 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 05:52:51,965 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 05:52:51,965 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 05:52:51,967 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 05:52:51,967 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 05:52:51,967 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 05:52:51,968 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 05:52:51,968 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 05:52:51,972 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 05:52:51,972 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 05:52:51,972 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 05:52:51,973 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 05:52:51,973 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-19 05:52:51,973 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 05:52:51,974 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 05:52:51,974 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 05:52:51,974 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 05:52:51,974 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 05:52:51,975 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 05:52:51,975 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 05:52:51,975 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 05:52:51,975 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 05:52:51,976 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 05:52:51,976 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 05:52:51,976 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 05:52:51,976 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 05:52:51,977 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 05:52:51,977 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 05:52:51,977 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 05:52:51,977 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 05:52:51,977 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 05:52:51,978 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 -> b4439281d7e12bca3fd2bd39ebda4196e341f38fedf1c370a96bdabb4944cfe7 [2024-11-19 05:52:52,269 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 05:52:52,288 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 05:52:52,290 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 05:52:52,292 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 05:52:52,292 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 05:52:52,293 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_08-cond_racefree.i [2024-11-19 05:52:53,796 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 05:52:54,046 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 05:52:54,047 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_08-cond_racefree.i [2024-11-19 05:52:54,064 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8aa2df9f/1284afc0d71748fdb6a69125d38732d0/FLAG6eae9874e [2024-11-19 05:52:54,079 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8aa2df9f/1284afc0d71748fdb6a69125d38732d0 [2024-11-19 05:52:54,081 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 05:52:54,083 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 05:52:54,085 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 05:52:54,085 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 05:52:54,090 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 05:52:54,091 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 05:52:54" (1/1) ... [2024-11-19 05:52:54,093 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10dfe672 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:52:54, skipping insertion in model container [2024-11-19 05:52:54,093 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 05:52:54" (1/1) ... [2024-11-19 05:52:54,135 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 05:52:54,492 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 05:52:54,516 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 05:52:54,624 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 05:52:54,672 INFO L204 MainTranslator]: Completed translation [2024-11-19 05:52:54,672 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:52:54 WrapperNode [2024-11-19 05:52:54,672 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 05:52:54,673 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 05:52:54,673 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 05:52:54,673 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 05:52:54,679 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:52:54" (1/1) ... [2024-11-19 05:52:54,693 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:52:54" (1/1) ... [2024-11-19 05:52:54,713 INFO L138 Inliner]: procedures = 271, calls = 36, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 157 [2024-11-19 05:52:54,713 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 05:52:54,714 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 05:52:54,714 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 05:52:54,714 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 05:52:54,721 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:52:54" (1/1) ... [2024-11-19 05:52:54,721 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:52:54" (1/1) ... [2024-11-19 05:52:54,725 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:52:54" (1/1) ... [2024-11-19 05:52:54,725 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:52:54" (1/1) ... [2024-11-19 05:52:54,732 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:52:54" (1/1) ... [2024-11-19 05:52:54,735 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:52:54" (1/1) ... [2024-11-19 05:52:54,736 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:52:54" (1/1) ... [2024-11-19 05:52:54,738 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:52:54" (1/1) ... [2024-11-19 05:52:54,740 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 05:52:54,741 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 05:52:54,741 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 05:52:54,741 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 05:52:54,742 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:52:54" (1/1) ... [2024-11-19 05:52:54,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 05:52:54,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 05:52:54,775 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:52:54,801 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:52:54,846 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-19 05:52:54,847 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-19 05:52:54,847 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-19 05:52:54,847 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-19 05:52:54,847 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-19 05:52:54,847 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-19 05:52:54,847 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 05:52:54,848 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-11-19 05:52:54,848 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-11-19 05:52:54,848 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-19 05:52:54,848 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 05:52:54,848 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 05:52:54,849 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:52:54,975 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 05:52:54,977 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 05:52:55,318 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-19 05:52:55,319 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 05:52:55,361 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 05:52:55,361 INFO L316 CfgBuilder]: Removed 10 assume(true) statements. [2024-11-19 05:52:55,363 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 05:52:55 BoogieIcfgContainer [2024-11-19 05:52:55,363 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 05:52:55,365 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 05:52:55,365 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 05:52:55,368 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 05:52:55,369 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 05:52:54" (1/3) ... [2024-11-19 05:52:55,370 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e2484da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 05:52:55, skipping insertion in model container [2024-11-19 05:52:55,370 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:52:54" (2/3) ... [2024-11-19 05:52:55,370 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e2484da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 05:52:55, skipping insertion in model container [2024-11-19 05:52:55,371 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 05:52:55" (3/3) ... [2024-11-19 05:52:55,372 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_08-cond_racefree.i [2024-11-19 05:52:55,387 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 05:52:55,388 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2024-11-19 05:52:55,388 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-19 05:52:55,463 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-11-19 05:52:55,497 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 198 places, 211 transitions, 429 flow [2024-11-19 05:52:55,568 INFO L124 PetriNetUnfolderBase]: 25/280 cut-off events. [2024-11-19 05:52:55,568 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-19 05:52:55,576 INFO L83 FinitePrefix]: Finished finitePrefix Result has 285 conditions, 280 events. 25/280 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 677 event pairs, 0 based on Foata normal form. 0/242 useless extension candidates. Maximal degree in co-relation 155. Up to 6 conditions per place. [2024-11-19 05:52:55,576 INFO L82 GeneralOperation]: Start removeDead. Operand has 198 places, 211 transitions, 429 flow [2024-11-19 05:52:55,581 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 198 places, 211 transitions, 429 flow [2024-11-19 05:52:55,588 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 05:52:55,594 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;@40f67b21, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 05:52:55,594 INFO L334 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2024-11-19 05:52:55,614 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-19 05:52:55,615 INFO L124 PetriNetUnfolderBase]: 3/110 cut-off events. [2024-11-19 05:52:55,615 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-19 05:52:55,615 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:52:55,616 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:55,616 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2024-11-19 05:52:55,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:52:55,621 INFO L85 PathProgramCache]: Analyzing trace with hash -605595689, now seen corresponding path program 1 times [2024-11-19 05:52:55,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:52:55,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376870746] [2024-11-19 05:52:55,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:52:55,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:52:55,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:52:56,663 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:52:56,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:52:56,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376870746] [2024-11-19 05:52:56,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376870746] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:52:56,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:52:56,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 05:52:56,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918764858] [2024-11-19 05:52:56,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:52:56,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 05:52:56,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:52:56,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 05:52:56,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-19 05:52:56,866 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 211 [2024-11-19 05:52:56,873 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 211 transitions, 429 flow. Second operand has 6 states, 6 states have (on average 169.5) internal successors, (1017), 6 states have internal predecessors, (1017), 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:52:56,874 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:52:56,874 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 211 [2024-11-19 05:52:56,875 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:52:57,128 INFO L124 PetriNetUnfolderBase]: 135/895 cut-off events. [2024-11-19 05:52:57,129 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-19 05:52:57,134 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1175 conditions, 895 events. 135/895 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 5199 event pairs, 60 based on Foata normal form. 106/896 useless extension candidates. Maximal degree in co-relation 989. Up to 198 conditions per place. [2024-11-19 05:52:57,140 INFO L140 encePairwiseOnDemand]: 193/211 looper letters, 48 selfloop transitions, 5 changer transitions 0/220 dead transitions. [2024-11-19 05:52:57,141 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 220 transitions, 553 flow [2024-11-19 05:52:57,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 05:52:57,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 05:52:57,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1098 transitions. [2024-11-19 05:52:57,162 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8672985781990521 [2024-11-19 05:52:57,166 INFO L175 Difference]: Start difference. First operand has 198 places, 211 transitions, 429 flow. Second operand 6 states and 1098 transitions. [2024-11-19 05:52:57,167 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 220 transitions, 553 flow [2024-11-19 05:52:57,173 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 220 transitions, 553 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-19 05:52:57,179 INFO L231 Difference]: Finished difference. Result has 200 places, 196 transitions, 409 flow [2024-11-19 05:52:57,181 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=211, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=196, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=409, PETRI_PLACES=200, PETRI_TRANSITIONS=196} [2024-11-19 05:52:57,185 INFO L277 CegarLoopForPetriNet]: 198 programPoint places, 2 predicate places. [2024-11-19 05:52:57,186 INFO L471 AbstractCegarLoop]: Abstraction has has 200 places, 196 transitions, 409 flow [2024-11-19 05:52:57,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 169.5) internal successors, (1017), 6 states have internal predecessors, (1017), 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:52:57,187 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:52:57,187 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:57,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 05:52:57,188 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2024-11-19 05:52:57,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:52:57,190 INFO L85 PathProgramCache]: Analyzing trace with hash -1901146632, now seen corresponding path program 1 times [2024-11-19 05:52:57,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:52:57,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916182858] [2024-11-19 05:52:57,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:52:57,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:52:57,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:52:57,281 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:52:57,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:52:57,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916182858] [2024-11-19 05:52:57,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916182858] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:52:57,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:52:57,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 05:52:57,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702329455] [2024-11-19 05:52:57,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:52:57,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:52:57,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:52:57,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:52:57,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:52:57,321 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 211 [2024-11-19 05:52:57,322 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 196 transitions, 409 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:52:57,324 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:52:57,325 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 211 [2024-11-19 05:52:57,325 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:52:57,435 INFO L124 PetriNetUnfolderBase]: 57/640 cut-off events. [2024-11-19 05:52:57,436 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2024-11-19 05:52:57,439 INFO L83 FinitePrefix]: Finished finitePrefix Result has 769 conditions, 640 events. 57/640 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 2923 event pairs, 25 based on Foata normal form. 1/572 useless extension candidates. Maximal degree in co-relation 634. Up to 96 conditions per place. [2024-11-19 05:52:57,442 INFO L140 encePairwiseOnDemand]: 208/211 looper letters, 22 selfloop transitions, 2 changer transitions 0/202 dead transitions. [2024-11-19 05:52:57,442 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 202 transitions, 469 flow [2024-11-19 05:52:57,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:52:57,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:52:57,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 565 transitions. [2024-11-19 05:52:57,445 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8925750394944708 [2024-11-19 05:52:57,446 INFO L175 Difference]: Start difference. First operand has 200 places, 196 transitions, 409 flow. Second operand 3 states and 565 transitions. [2024-11-19 05:52:57,446 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 202 transitions, 469 flow [2024-11-19 05:52:57,449 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 197 places, 202 transitions, 459 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-19 05:52:57,454 INFO L231 Difference]: Finished difference. Result has 198 places, 196 transitions, 407 flow [2024-11-19 05:52:57,455 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=211, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=196, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=194, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=407, PETRI_PLACES=198, PETRI_TRANSITIONS=196} [2024-11-19 05:52:57,456 INFO L277 CegarLoopForPetriNet]: 198 programPoint places, 0 predicate places. [2024-11-19 05:52:57,456 INFO L471 AbstractCegarLoop]: Abstraction has has 198 places, 196 transitions, 407 flow [2024-11-19 05:52:57,457 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:52:57,457 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:52:57,458 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:57,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 05:52:57,459 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2024-11-19 05:52:57,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:52:57,464 INFO L85 PathProgramCache]: Analyzing trace with hash -506205996, now seen corresponding path program 1 times [2024-11-19 05:52:57,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:52:57,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911157262] [2024-11-19 05:52:57,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:52:57,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:52:57,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:52:57,545 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:52:57,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:52:57,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911157262] [2024-11-19 05:52:57,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911157262] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:52:57,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:52:57,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:52:57,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458868009] [2024-11-19 05:52:57,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:52:57,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:52:57,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:52:57,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:52:57,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:52:57,566 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 211 [2024-11-19 05:52:57,567 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 196 transitions, 407 flow. Second operand has 3 states, 3 states have (on average 176.66666666666666) internal successors, (530), 3 states have internal predecessors, (530), 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:52:57,567 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:52:57,567 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 211 [2024-11-19 05:52:57,567 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:52:57,707 INFO L124 PetriNetUnfolderBase]: 134/935 cut-off events. [2024-11-19 05:52:57,707 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2024-11-19 05:52:57,708 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1198 conditions, 935 events. 134/935 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 5369 event pairs, 33 based on Foata normal form. 0/838 useless extension candidates. Maximal degree in co-relation 1088. Up to 130 conditions per place. [2024-11-19 05:52:57,710 INFO L140 encePairwiseOnDemand]: 202/211 looper letters, 30 selfloop transitions, 6 changer transitions 0/209 dead transitions. [2024-11-19 05:52:57,712 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 209 transitions, 508 flow [2024-11-19 05:52:57,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:52:57,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:52:57,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 564 transitions. [2024-11-19 05:52:57,713 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8909952606635071 [2024-11-19 05:52:57,713 INFO L175 Difference]: Start difference. First operand has 198 places, 196 transitions, 407 flow. Second operand 3 states and 564 transitions. [2024-11-19 05:52:57,713 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 209 transitions, 508 flow [2024-11-19 05:52:57,715 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 209 transitions, 504 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:52:57,718 INFO L231 Difference]: Finished difference. Result has 198 places, 198 transitions, 441 flow [2024-11-19 05:52:57,718 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=211, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=194, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=188, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=441, PETRI_PLACES=198, PETRI_TRANSITIONS=198} [2024-11-19 05:52:57,719 INFO L277 CegarLoopForPetriNet]: 198 programPoint places, 0 predicate places. [2024-11-19 05:52:57,719 INFO L471 AbstractCegarLoop]: Abstraction has has 198 places, 198 transitions, 441 flow [2024-11-19 05:52:57,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 176.66666666666666) internal successors, (530), 3 states have internal predecessors, (530), 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:52:57,720 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:52:57,720 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:57,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 05:52:57,720 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2024-11-19 05:52:57,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:52:57,721 INFO L85 PathProgramCache]: Analyzing trace with hash -1186278216, now seen corresponding path program 1 times [2024-11-19 05:52:57,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:52:57,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288368175] [2024-11-19 05:52:57,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:52:57,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:52:57,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:52:57,772 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:52:57,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:52:57,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288368175] [2024-11-19 05:52:57,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288368175] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:52:57,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:52:57,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:52:57,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280385556] [2024-11-19 05:52:57,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:52:57,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:52:57,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:52:57,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:52:57,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:52:57,795 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 211 [2024-11-19 05:52:57,795 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 198 transitions, 441 flow. Second operand has 3 states, 3 states have (on average 179.33333333333334) internal successors, (538), 3 states have internal predecessors, (538), 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:52:57,796 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:52:57,796 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 211 [2024-11-19 05:52:57,796 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:52:57,894 INFO L124 PetriNetUnfolderBase]: 139/1017 cut-off events. [2024-11-19 05:52:57,894 INFO L125 PetriNetUnfolderBase]: For 120/120 co-relation queries the response was YES. [2024-11-19 05:52:57,896 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1390 conditions, 1017 events. 139/1017 cut-off events. For 120/120 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 6283 event pairs, 51 based on Foata normal form. 0/905 useless extension candidates. Maximal degree in co-relation 1267. Up to 220 conditions per place. [2024-11-19 05:52:57,899 INFO L140 encePairwiseOnDemand]: 206/211 looper letters, 27 selfloop transitions, 4 changer transitions 0/205 dead transitions. [2024-11-19 05:52:57,899 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 205 transitions, 521 flow [2024-11-19 05:52:57,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:52:57,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:52:57,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 560 transitions. [2024-11-19 05:52:57,901 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8846761453396524 [2024-11-19 05:52:57,901 INFO L175 Difference]: Start difference. First operand has 198 places, 198 transitions, 441 flow. Second operand 3 states and 560 transitions. [2024-11-19 05:52:57,901 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 205 transitions, 521 flow [2024-11-19 05:52:57,904 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 205 transitions, 507 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:52:57,907 INFO L231 Difference]: Finished difference. Result has 200 places, 201 transitions, 461 flow [2024-11-19 05:52:57,907 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=211, PETRI_DIFFERENCE_MINUEND_FLOW=429, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=198, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=194, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=461, PETRI_PLACES=200, PETRI_TRANSITIONS=201} [2024-11-19 05:52:57,908 INFO L277 CegarLoopForPetriNet]: 198 programPoint places, 2 predicate places. [2024-11-19 05:52:57,908 INFO L471 AbstractCegarLoop]: Abstraction has has 200 places, 201 transitions, 461 flow [2024-11-19 05:52:57,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 179.33333333333334) internal successors, (538), 3 states have internal predecessors, (538), 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:52:57,909 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:52:57,909 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:57,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 05:52:57,909 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2024-11-19 05:52:57,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:52:57,910 INFO L85 PathProgramCache]: Analyzing trace with hash 83373136, now seen corresponding path program 1 times [2024-11-19 05:52:57,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:52:57,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221636920] [2024-11-19 05:52:57,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:52:57,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:52:57,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 05:52:57,946 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 05:52:57,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 05:52:58,013 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 05:52:58,013 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-19 05:52:58,016 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 12 remaining) [2024-11-19 05:52:58,018 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (10 of 12 remaining) [2024-11-19 05:52:58,018 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (9 of 12 remaining) [2024-11-19 05:52:58,019 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (8 of 12 remaining) [2024-11-19 05:52:58,019 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (7 of 12 remaining) [2024-11-19 05:52:58,019 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (6 of 12 remaining) [2024-11-19 05:52:58,019 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (5 of 12 remaining) [2024-11-19 05:52:58,019 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (4 of 12 remaining) [2024-11-19 05:52:58,020 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (3 of 12 remaining) [2024-11-19 05:52:58,020 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (2 of 12 remaining) [2024-11-19 05:52:58,020 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (1 of 12 remaining) [2024-11-19 05:52:58,020 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (0 of 12 remaining) [2024-11-19 05:52:58,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 05:52:58,021 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-11-19 05:52:58,023 WARN L244 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-19 05:52:58,023 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-11-19 05:52:58,053 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-19 05:52:58,061 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 242 places, 260 transitions, 536 flow [2024-11-19 05:52:58,101 INFO L124 PetriNetUnfolderBase]: 43/426 cut-off events. [2024-11-19 05:52:58,101 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-11-19 05:52:58,104 INFO L83 FinitePrefix]: Finished finitePrefix Result has 438 conditions, 426 events. 43/426 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1294 event pairs, 0 based on Foata normal form. 0/361 useless extension candidates. Maximal degree in co-relation 282. Up to 9 conditions per place. [2024-11-19 05:52:58,104 INFO L82 GeneralOperation]: Start removeDead. Operand has 242 places, 260 transitions, 536 flow [2024-11-19 05:52:58,107 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 242 places, 260 transitions, 536 flow [2024-11-19 05:52:58,109 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 05:52:58,110 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;@40f67b21, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 05:52:58,110 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2024-11-19 05:52:58,117 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-19 05:52:58,119 INFO L124 PetriNetUnfolderBase]: 3/110 cut-off events. [2024-11-19 05:52:58,119 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-19 05:52:58,120 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:52:58,120 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:58,120 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-19 05:52:58,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:52:58,120 INFO L85 PathProgramCache]: Analyzing trace with hash 2037411799, now seen corresponding path program 1 times [2024-11-19 05:52:58,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:52:58,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433196911] [2024-11-19 05:52:58,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:52:58,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:52:58,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:52:58,525 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:52:58,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:52:58,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433196911] [2024-11-19 05:52:58,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433196911] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:52:58,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:52:58,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 05:52:58,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841321279] [2024-11-19 05:52:58,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:52:58,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 05:52:58,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:52:58,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 05:52:58,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-19 05:52:58,644 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 203 out of 260 [2024-11-19 05:52:58,646 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 242 places, 260 transitions, 536 flow. Second operand has 6 states, 6 states have (on average 204.5) internal successors, (1227), 6 states have internal predecessors, (1227), 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:52:58,646 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:52:58,646 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 203 of 260 [2024-11-19 05:52:58,646 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:52:59,492 INFO L124 PetriNetUnfolderBase]: 1710/6555 cut-off events. [2024-11-19 05:52:59,492 INFO L125 PetriNetUnfolderBase]: For 69/69 co-relation queries the response was YES. [2024-11-19 05:52:59,517 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9270 conditions, 6555 events. 1710/6555 cut-off events. For 69/69 co-relation queries the response was YES. Maximal size of possible extension queue 196. Compared 64562 event pairs, 168 based on Foata normal form. 1344/7252 useless extension candidates. Maximal degree in co-relation 4690. Up to 1840 conditions per place. [2024-11-19 05:52:59,549 INFO L140 encePairwiseOnDemand]: 236/260 looper letters, 80 selfloop transitions, 5 changer transitions 0/287 dead transitions. [2024-11-19 05:52:59,549 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 244 places, 287 transitions, 760 flow [2024-11-19 05:52:59,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 05:52:59,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 05:52:59,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1370 transitions. [2024-11-19 05:52:59,552 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8782051282051282 [2024-11-19 05:52:59,552 INFO L175 Difference]: Start difference. First operand has 242 places, 260 transitions, 536 flow. Second operand 6 states and 1370 transitions. [2024-11-19 05:52:59,552 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 244 places, 287 transitions, 760 flow [2024-11-19 05:52:59,555 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 244 places, 287 transitions, 760 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-19 05:52:59,558 INFO L231 Difference]: Finished difference. Result has 244 places, 239 transitions, 504 flow [2024-11-19 05:52:59,558 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=260, PETRI_DIFFERENCE_MINUEND_FLOW=494, PETRI_DIFFERENCE_MINUEND_PLACES=239, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=239, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=234, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=504, PETRI_PLACES=244, PETRI_TRANSITIONS=239} [2024-11-19 05:52:59,559 INFO L277 CegarLoopForPetriNet]: 242 programPoint places, 2 predicate places. [2024-11-19 05:52:59,559 INFO L471 AbstractCegarLoop]: Abstraction has has 244 places, 239 transitions, 504 flow [2024-11-19 05:52:59,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 204.5) internal successors, (1227), 6 states have internal predecessors, (1227), 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:52:59,560 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:52:59,560 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:59,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 05:52:59,561 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-19 05:52:59,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:52:59,562 INFO L85 PathProgramCache]: Analyzing trace with hash -296614280, now seen corresponding path program 1 times [2024-11-19 05:52:59,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:52:59,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396488876] [2024-11-19 05:52:59,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:52:59,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:52:59,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:52:59,606 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:52:59,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:52:59,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396488876] [2024-11-19 05:52:59,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396488876] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:52:59,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:52:59,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 05:52:59,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776717497] [2024-11-19 05:52:59,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:52:59,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:52:59,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:52:59,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:52:59,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:52:59,630 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 215 out of 260 [2024-11-19 05:52:59,631 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 244 places, 239 transitions, 504 flow. Second operand has 3 states, 3 states have (on average 216.66666666666666) internal successors, (650), 3 states have internal predecessors, (650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:52:59,631 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:52:59,632 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 215 of 260 [2024-11-19 05:52:59,632 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:53:00,167 INFO L124 PetriNetUnfolderBase]: 938/4718 cut-off events. [2024-11-19 05:53:00,167 INFO L125 PetriNetUnfolderBase]: For 172/172 co-relation queries the response was YES. [2024-11-19 05:53:00,188 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6302 conditions, 4718 events. 938/4718 cut-off events. For 172/172 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 44976 event pairs, 334 based on Foata normal form. 1/4238 useless extension candidates. Maximal degree in co-relation 810. Up to 1404 conditions per place. [2024-11-19 05:53:00,208 INFO L140 encePairwiseOnDemand]: 257/260 looper letters, 31 selfloop transitions, 2 changer transitions 0/246 dead transitions. [2024-11-19 05:53:00,208 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 246 places, 246 transitions, 586 flow [2024-11-19 05:53:00,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:53:00,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:53:00,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 679 transitions. [2024-11-19 05:53:00,211 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8705128205128205 [2024-11-19 05:53:00,211 INFO L175 Difference]: Start difference. First operand has 244 places, 239 transitions, 504 flow. Second operand 3 states and 679 transitions. [2024-11-19 05:53:00,211 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 246 places, 246 transitions, 586 flow [2024-11-19 05:53:00,213 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 241 places, 246 transitions, 574 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-19 05:53:00,216 INFO L231 Difference]: Finished difference. Result has 242 places, 240 transitions, 506 flow [2024-11-19 05:53:00,217 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=260, PETRI_DIFFERENCE_MINUEND_FLOW=494, PETRI_DIFFERENCE_MINUEND_PLACES=239, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=239, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=237, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=506, PETRI_PLACES=242, PETRI_TRANSITIONS=240} [2024-11-19 05:53:00,217 INFO L277 CegarLoopForPetriNet]: 242 programPoint places, 0 predicate places. [2024-11-19 05:53:00,217 INFO L471 AbstractCegarLoop]: Abstraction has has 242 places, 240 transitions, 506 flow [2024-11-19 05:53:00,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 216.66666666666666) internal successors, (650), 3 states have internal predecessors, (650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:53:00,218 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:53:00,218 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:00,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 05:53:00,219 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-19 05:53:00,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:53:00,219 INFO L85 PathProgramCache]: Analyzing trace with hash 605204743, now seen corresponding path program 1 times [2024-11-19 05:53:00,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:53:00,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123894319] [2024-11-19 05:53:00,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:53:00,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:53:00,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:53:00,280 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:00,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:53:00,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123894319] [2024-11-19 05:53:00,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123894319] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:53:00,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:53:00,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:53:00,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162727466] [2024-11-19 05:53:00,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:53:00,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:53:00,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:53:00,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:53:00,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:53:00,312 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 202 out of 260 [2024-11-19 05:53:00,313 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 242 places, 240 transitions, 506 flow. Second operand has 3 states, 3 states have (on average 203.66666666666666) internal successors, (611), 3 states have internal predecessors, (611), 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:00,314 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:53:00,314 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 202 of 260 [2024-11-19 05:53:00,314 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:53:02,510 INFO L124 PetriNetUnfolderBase]: 4720/15525 cut-off events. [2024-11-19 05:53:02,511 INFO L125 PetriNetUnfolderBase]: For 453/453 co-relation queries the response was YES. [2024-11-19 05:53:02,545 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22832 conditions, 15525 events. 4720/15525 cut-off events. For 453/453 co-relation queries the response was YES. Maximal size of possible extension queue 533. Compared 173621 event pairs, 1586 based on Foata normal form. 0/13732 useless extension candidates. Maximal degree in co-relation 22721. Up to 3665 conditions per place. [2024-11-19 05:53:02,586 INFO L140 encePairwiseOnDemand]: 241/260 looper letters, 58 selfloop transitions, 14 changer transitions 0/273 dead transitions. [2024-11-19 05:53:02,587 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 244 places, 273 transitions, 727 flow [2024-11-19 05:53:02,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:53:02,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:53:02,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 683 transitions. [2024-11-19 05:53:02,589 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8756410256410256 [2024-11-19 05:53:02,589 INFO L175 Difference]: Start difference. First operand has 242 places, 240 transitions, 506 flow. Second operand 3 states and 683 transitions. [2024-11-19 05:53:02,589 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 244 places, 273 transitions, 727 flow [2024-11-19 05:53:02,591 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 243 places, 273 transitions, 725 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 05:53:02,593 INFO L231 Difference]: Finished difference. Result has 245 places, 254 transitions, 626 flow [2024-11-19 05:53:02,594 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=260, PETRI_DIFFERENCE_MINUEND_FLOW=504, PETRI_DIFFERENCE_MINUEND_PLACES=241, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=240, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=226, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=626, PETRI_PLACES=245, PETRI_TRANSITIONS=254} [2024-11-19 05:53:02,594 INFO L277 CegarLoopForPetriNet]: 242 programPoint places, 3 predicate places. [2024-11-19 05:53:02,595 INFO L471 AbstractCegarLoop]: Abstraction has has 245 places, 254 transitions, 626 flow [2024-11-19 05:53:02,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 203.66666666666666) internal successors, (611), 3 states have internal predecessors, (611), 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,595 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:53:02,595 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 05:53:02,596 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-19 05:53:02,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:53:02,596 INFO L85 PathProgramCache]: Analyzing trace with hash -589679511, now seen corresponding path program 1 times [2024-11-19 05:53:02,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:53:02,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961461357] [2024-11-19 05:53:02,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:53:02,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:53:02,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:53:02,699 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,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:53:02,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961461357] [2024-11-19 05:53:02,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961461357] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:53:02,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:53:02,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:53:02,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900192864] [2024-11-19 05:53:02,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:53:02,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:53:02,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:53:02,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:53:02,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:53:02,742 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 208 out of 260 [2024-11-19 05:53:02,744 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 245 places, 254 transitions, 626 flow. Second operand has 3 states, 3 states have (on average 210.33333333333334) internal successors, (631), 3 states have internal predecessors, (631), 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,744 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:53:02,744 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 208 of 260 [2024-11-19 05:53:02,744 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:53:04,954 INFO L124 PetriNetUnfolderBase]: 4870/17918 cut-off events. [2024-11-19 05:53:04,954 INFO L125 PetriNetUnfolderBase]: For 4444/4604 co-relation queries the response was YES. [2024-11-19 05:53:05,017 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29422 conditions, 17918 events. 4870/17918 cut-off events. For 4444/4604 co-relation queries the response was YES. Maximal size of possible extension queue 592. Compared 213661 event pairs, 2423 based on Foata normal form. 47/16111 useless extension candidates. Maximal degree in co-relation 27913. Up to 6155 conditions per place. [2024-11-19 05:53:05,070 INFO L140 encePairwiseOnDemand]: 251/260 looper letters, 52 selfloop transitions, 14 changer transitions 0/278 dead transitions. [2024-11-19 05:53:05,070 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 278 transitions, 844 flow [2024-11-19 05:53:05,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:53:05,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:53:05,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 677 transitions. [2024-11-19 05:53:05,075 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.867948717948718 [2024-11-19 05:53:05,075 INFO L175 Difference]: Start difference. First operand has 245 places, 254 transitions, 626 flow. Second operand 3 states and 677 transitions. [2024-11-19 05:53:05,076 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 247 places, 278 transitions, 844 flow [2024-11-19 05:53:05,099 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 245 places, 278 transitions, 806 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:53:05,107 INFO L231 Difference]: Finished difference. Result has 247 places, 266 transitions, 724 flow [2024-11-19 05:53:05,108 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=260, PETRI_DIFFERENCE_MINUEND_FLOW=598, PETRI_DIFFERENCE_MINUEND_PLACES=243, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=254, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=240, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=724, PETRI_PLACES=247, PETRI_TRANSITIONS=266} [2024-11-19 05:53:05,108 INFO L277 CegarLoopForPetriNet]: 242 programPoint places, 5 predicate places. [2024-11-19 05:53:05,108 INFO L471 AbstractCegarLoop]: Abstraction has has 247 places, 266 transitions, 724 flow [2024-11-19 05:53:05,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 210.33333333333334) internal successors, (631), 3 states have internal predecessors, (631), 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,109 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:53:05,109 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 05:53:05,109 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-19 05:53:05,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:53:05,110 INFO L85 PathProgramCache]: Analyzing trace with hash -2042612567, now seen corresponding path program 1 times [2024-11-19 05:53:05,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:53:05,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675089720] [2024-11-19 05:53:05,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:53:05,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:53:05,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:53:05,188 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:05,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:53:05,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675089720] [2024-11-19 05:53:05,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675089720] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 05:53:05,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1814078557] [2024-11-19 05:53:05,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:53:05,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 05:53:05,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 05:53:05,194 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:05,204 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:05,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:53:05,309 INFO L255 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 05:53:05,311 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 05:53:05,372 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:05,373 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 05:53:05,416 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:05,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1814078557] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 05:53:05,421 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 05:53:05,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2024-11-19 05:53:05,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984396829] [2024-11-19 05:53:05,421 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 05:53:05,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 05:53:05,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:53:05,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 05:53:05,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-19 05:53:05,517 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 260 [2024-11-19 05:53:05,519 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 247 places, 266 transitions, 724 flow. Second operand has 10 states, 10 states have (on average 214.1) internal successors, (2141), 10 states have internal predecessors, (2141), 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,519 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:53:05,519 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 260 [2024-11-19 05:53:05,519 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:53:06,041 INFO L124 PetriNetUnfolderBase]: 754/3648 cut-off events. [2024-11-19 05:53:06,041 INFO L125 PetriNetUnfolderBase]: For 490/524 co-relation queries the response was YES. [2024-11-19 05:53:06,050 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5618 conditions, 3648 events. 754/3648 cut-off events. For 490/524 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 32930 event pairs, 24 based on Foata normal form. 108/3526 useless extension candidates. Maximal degree in co-relation 2672. Up to 478 conditions per place. [2024-11-19 05:53:06,058 INFO L140 encePairwiseOnDemand]: 255/260 looper letters, 72 selfloop transitions, 7 changer transitions 0/263 dead transitions. [2024-11-19 05:53:06,058 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 263 transitions, 830 flow [2024-11-19 05:53:06,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 05:53:06,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-19 05:53:06,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1989 transitions. [2024-11-19 05:53:06,062 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.85 [2024-11-19 05:53:06,062 INFO L175 Difference]: Start difference. First operand has 247 places, 266 transitions, 724 flow. Second operand 9 states and 1989 transitions. [2024-11-19 05:53:06,062 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 263 transitions, 830 flow [2024-11-19 05:53:06,066 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 263 transitions, 810 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:53:06,069 INFO L231 Difference]: Finished difference. Result has 203 places, 207 transitions, 554 flow [2024-11-19 05:53:06,070 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=260, PETRI_DIFFERENCE_MINUEND_FLOW=536, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=205, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=200, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=554, PETRI_PLACES=203, PETRI_TRANSITIONS=207} [2024-11-19 05:53:06,071 INFO L277 CegarLoopForPetriNet]: 242 programPoint places, -39 predicate places. [2024-11-19 05:53:06,071 INFO L471 AbstractCegarLoop]: Abstraction has has 203 places, 207 transitions, 554 flow [2024-11-19 05:53:06,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 214.1) internal successors, (2141), 10 states have internal predecessors, (2141), 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,072 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:53:06,073 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,088 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:06,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-19 05:53:06,274 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-19 05:53:06,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:53:06,274 INFO L85 PathProgramCache]: Analyzing trace with hash -2083425951, now seen corresponding path program 1 times [2024-11-19 05:53:06,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:53:06,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147480816] [2024-11-19 05:53:06,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:53:06,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:53:06,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:53:06,339 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-19 05:53:06,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:53:06,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147480816] [2024-11-19 05:53:06,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147480816] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:53:06,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:53:06,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:53:06,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415677709] [2024-11-19 05:53:06,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:53:06,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:53:06,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:53:06,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:53:06,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:53:06,396 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 208 out of 260 [2024-11-19 05:53:06,397 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 207 transitions, 554 flow. Second operand has 3 states, 3 states have (on average 210.66666666666666) internal successors, (632), 3 states have internal predecessors, (632), 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,397 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:53:06,397 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 208 of 260 [2024-11-19 05:53:06,397 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:53:06,570 INFO L124 PetriNetUnfolderBase]: 260/1348 cut-off events. [2024-11-19 05:53:06,570 INFO L125 PetriNetUnfolderBase]: For 451/472 co-relation queries the response was YES. [2024-11-19 05:53:06,576 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2393 conditions, 1348 events. 260/1348 cut-off events. For 451/472 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 8691 event pairs, 132 based on Foata normal form. 7/1263 useless extension candidates. Maximal degree in co-relation 2262. Up to 459 conditions per place. [2024-11-19 05:53:06,580 INFO L140 encePairwiseOnDemand]: 252/260 looper letters, 42 selfloop transitions, 12 changer transitions 0/221 dead transitions. [2024-11-19 05:53:06,581 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 221 transitions, 706 flow [2024-11-19 05:53:06,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:53:06,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:53:06,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 663 transitions. [2024-11-19 05:53:06,585 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.85 [2024-11-19 05:53:06,586 INFO L175 Difference]: Start difference. First operand has 203 places, 207 transitions, 554 flow. Second operand 3 states and 663 transitions. [2024-11-19 05:53:06,586 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 221 transitions, 706 flow [2024-11-19 05:53:06,587 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 221 transitions, 691 flow, removed 1 selfloop flow, removed 5 redundant places. [2024-11-19 05:53:06,591 INFO L231 Difference]: Finished difference. Result has 202 places, 215 transitions, 637 flow [2024-11-19 05:53:06,591 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=260, PETRI_DIFFERENCE_MINUEND_FLOW=539, PETRI_DIFFERENCE_MINUEND_PLACES=198, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=207, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=195, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=637, PETRI_PLACES=202, PETRI_TRANSITIONS=215} [2024-11-19 05:53:06,592 INFO L277 CegarLoopForPetriNet]: 242 programPoint places, -40 predicate places. [2024-11-19 05:53:06,592 INFO L471 AbstractCegarLoop]: Abstraction has has 202 places, 215 transitions, 637 flow [2024-11-19 05:53:06,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 210.66666666666666) internal successors, (632), 3 states have internal predecessors, (632), 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,593 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:53:06,593 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-19 05:53:06,593 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-19 05:53:06,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:53:06,593 INFO L85 PathProgramCache]: Analyzing trace with hash 770767895, now seen corresponding path program 1 times [2024-11-19 05:53:06,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:53:06,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615165519] [2024-11-19 05:53:06,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:53:06,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:53:06,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:53:06,635 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,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:53:06,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615165519] [2024-11-19 05:53:06,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615165519] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:53:06,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:53:06,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:53:06,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398972782] [2024-11-19 05:53:06,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:53:06,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:53:06,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:53:06,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:53:06,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:53:06,703 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 208 out of 260 [2024-11-19 05:53:06,704 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 215 transitions, 637 flow. Second operand has 3 states, 3 states have (on average 211.66666666666666) internal successors, (635), 3 states have internal predecessors, (635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:53:06,704 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:53:06,704 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 208 of 260 [2024-11-19 05:53:06,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:53:06,940 INFO L124 PetriNetUnfolderBase]: 291/1420 cut-off events. [2024-11-19 05:53:06,940 INFO L125 PetriNetUnfolderBase]: For 1124/1159 co-relation queries the response was YES. [2024-11-19 05:53:06,946 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2847 conditions, 1420 events. 291/1420 cut-off events. For 1124/1159 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 9395 event pairs, 134 based on Foata normal form. 9/1353 useless extension candidates. Maximal degree in co-relation 2719. Up to 501 conditions per place. [2024-11-19 05:53:06,951 INFO L140 encePairwiseOnDemand]: 252/260 looper letters, 49 selfloop transitions, 12 changer transitions 0/230 dead transitions. [2024-11-19 05:53:06,951 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 230 transitions, 826 flow [2024-11-19 05:53:06,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:53:06,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:53:06,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 664 transitions. [2024-11-19 05:53:06,956 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8512820512820513 [2024-11-19 05:53:06,956 INFO L175 Difference]: Start difference. First operand has 202 places, 215 transitions, 637 flow. Second operand 3 states and 664 transitions. [2024-11-19 05:53:06,956 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 204 places, 230 transitions, 826 flow [2024-11-19 05:53:06,959 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 230 transitions, 798 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:53:06,961 INFO L231 Difference]: Finished difference. Result has 204 places, 223 transitions, 723 flow [2024-11-19 05:53:06,961 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=260, PETRI_DIFFERENCE_MINUEND_FLOW=613, PETRI_DIFFERENCE_MINUEND_PLACES=200, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=215, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=203, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=723, PETRI_PLACES=204, PETRI_TRANSITIONS=223} [2024-11-19 05:53:06,962 INFO L277 CegarLoopForPetriNet]: 242 programPoint places, -38 predicate places. [2024-11-19 05:53:06,962 INFO L471 AbstractCegarLoop]: Abstraction has has 204 places, 223 transitions, 723 flow [2024-11-19 05:53:06,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 211.66666666666666) internal successors, (635), 3 states have internal predecessors, (635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:53:06,963 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:53:06,963 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-19 05:53:06,964 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-19 05:53:06,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:53:06,964 INFO L85 PathProgramCache]: Analyzing trace with hash 1549554953, now seen corresponding path program 1 times [2024-11-19 05:53:06,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:53:06,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014517688] [2024-11-19 05:53:06,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:53:06,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:53:06,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 05:53:06,987 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 05:53:07,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 05:53:07,026 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 05:53:07,026 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-19 05:53:07,027 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (15 of 16 remaining) [2024-11-19 05:53:07,027 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (14 of 16 remaining) [2024-11-19 05:53:07,027 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (13 of 16 remaining) [2024-11-19 05:53:07,027 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (12 of 16 remaining) [2024-11-19 05:53:07,028 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (11 of 16 remaining) [2024-11-19 05:53:07,028 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (10 of 16 remaining) [2024-11-19 05:53:07,028 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (9 of 16 remaining) [2024-11-19 05:53:07,028 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (8 of 16 remaining) [2024-11-19 05:53:07,028 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (7 of 16 remaining) [2024-11-19 05:53:07,028 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (6 of 16 remaining) [2024-11-19 05:53:07,028 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (5 of 16 remaining) [2024-11-19 05:53:07,028 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (4 of 16 remaining) [2024-11-19 05:53:07,029 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (3 of 16 remaining) [2024-11-19 05:53:07,029 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (2 of 16 remaining) [2024-11-19 05:53:07,029 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (1 of 16 remaining) [2024-11-19 05:53:07,029 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (0 of 16 remaining) [2024-11-19 05:53:07,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-19 05:53:07,030 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:53:07,030 WARN L244 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-19 05:53:07,030 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-11-19 05:53:07,069 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-11-19 05:53:07,076 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 286 places, 309 transitions, 645 flow [2024-11-19 05:53:07,172 INFO L124 PetriNetUnfolderBase]: 66/617 cut-off events. [2024-11-19 05:53:07,173 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2024-11-19 05:53:07,179 INFO L83 FinitePrefix]: Finished finitePrefix Result has 642 conditions, 617 events. 66/617 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 2145 event pairs, 1 based on Foata normal form. 0/519 useless extension candidates. Maximal degree in co-relation 434. Up to 16 conditions per place. [2024-11-19 05:53:07,179 INFO L82 GeneralOperation]: Start removeDead. Operand has 286 places, 309 transitions, 645 flow [2024-11-19 05:53:07,186 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 286 places, 309 transitions, 645 flow [2024-11-19 05:53:07,187 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 05:53:07,188 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;@40f67b21, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 05:53:07,188 INFO L334 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2024-11-19 05:53:07,256 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-19 05:53:07,257 INFO L124 PetriNetUnfolderBase]: 3/110 cut-off events. [2024-11-19 05:53:07,257 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-19 05:53:07,257 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:53:07,257 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,258 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2024-11-19 05:53:07,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:53:07,258 INFO L85 PathProgramCache]: Analyzing trace with hash -883986985, now seen corresponding path program 1 times [2024-11-19 05:53:07,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:53:07,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193951666] [2024-11-19 05:53:07,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:53:07,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:53:07,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:53:07,603 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:07,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:53:07,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193951666] [2024-11-19 05:53:07,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193951666] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:53:07,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:53:07,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 05:53:07,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316958866] [2024-11-19 05:53:07,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:53:07,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 05:53:07,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:53:07,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 05:53:07,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-19 05:53:07,813 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 238 out of 309 [2024-11-19 05:53:07,815 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 286 places, 309 transitions, 645 flow. Second operand has 6 states, 6 states have (on average 239.5) internal successors, (1437), 6 states have internal predecessors, (1437), 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,816 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:53:07,816 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 238 of 309 [2024-11-19 05:53:07,816 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:53:17,612 INFO L124 PetriNetUnfolderBase]: 20344/68962 cut-off events. [2024-11-19 05:53:17,612 INFO L125 PetriNetUnfolderBase]: For 1107/1107 co-relation queries the response was YES. [2024-11-19 05:53:17,937 INFO L83 FinitePrefix]: Finished finitePrefix Result has 97569 conditions, 68962 events. 20344/68962 cut-off events. For 1107/1107 co-relation queries the response was YES. Maximal size of possible extension queue 1524. Compared 949215 event pairs, 6970 based on Foata normal form. 14560/76720 useless extension candidates. Maximal degree in co-relation 11497. Up to 20303 conditions per place. [2024-11-19 05:53:18,267 INFO L140 encePairwiseOnDemand]: 279/309 looper letters, 112 selfloop transitions, 5 changer transitions 0/354 dead transitions. [2024-11-19 05:53:18,268 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 288 places, 354 transitions, 969 flow [2024-11-19 05:53:18,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 05:53:18,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 05:53:18,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1642 transitions. [2024-11-19 05:53:18,273 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8856526429341963 [2024-11-19 05:53:18,273 INFO L175 Difference]: Start difference. First operand has 286 places, 309 transitions, 645 flow. Second operand 6 states and 1642 transitions. [2024-11-19 05:53:18,273 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 288 places, 354 transitions, 969 flow [2024-11-19 05:53:18,277 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 288 places, 354 transitions, 969 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-19 05:53:18,281 INFO L231 Difference]: Finished difference. Result has 288 places, 282 transitions, 601 flow [2024-11-19 05:53:18,281 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=309, PETRI_DIFFERENCE_MINUEND_FLOW=591, PETRI_DIFFERENCE_MINUEND_PLACES=283, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=282, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=277, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=601, PETRI_PLACES=288, PETRI_TRANSITIONS=282} [2024-11-19 05:53:18,282 INFO L277 CegarLoopForPetriNet]: 286 programPoint places, 2 predicate places. [2024-11-19 05:53:18,282 INFO L471 AbstractCegarLoop]: Abstraction has has 288 places, 282 transitions, 601 flow [2024-11-19 05:53:18,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 239.5) internal successors, (1437), 6 states have internal predecessors, (1437), 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:18,283 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:53:18,283 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-19 05:53:18,284 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2024-11-19 05:53:18,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:53:18,284 INFO L85 PathProgramCache]: Analyzing trace with hash 1147775768, now seen corresponding path program 1 times [2024-11-19 05:53:18,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:53:18,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208722593] [2024-11-19 05:53:18,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:53:18,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:53:18,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:53:18,355 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:18,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:53:18,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208722593] [2024-11-19 05:53:18,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208722593] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:53:18,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:53:18,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 05:53:18,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986351186] [2024-11-19 05:53:18,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:53:18,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:53:18,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:53:18,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:53:18,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:53:18,377 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 250 out of 309 [2024-11-19 05:53:18,379 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 288 places, 282 transitions, 601 flow. Second operand has 3 states, 3 states have (on average 251.66666666666666) internal successors, (755), 3 states have internal predecessors, (755), 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:18,379 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:53:18,379 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 250 of 309 [2024-11-19 05:53:18,379 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:53:23,627 INFO L124 PetriNetUnfolderBase]: 10246/37004 cut-off events. [2024-11-19 05:53:23,628 INFO L125 PetriNetUnfolderBase]: For 1825/1825 co-relation queries the response was YES. [2024-11-19 05:53:23,792 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52095 conditions, 37004 events. 10246/37004 cut-off events. For 1825/1825 co-relation queries the response was YES. Maximal size of possible extension queue 879. Compared 477034 event pairs, 5617 based on Foata normal form. 1/33441 useless extension candidates. Maximal degree in co-relation 6794. Up to 14009 conditions per place. [2024-11-19 05:53:23,948 INFO L140 encePairwiseOnDemand]: 306/309 looper letters, 39 selfloop transitions, 2 changer transitions 0/289 dead transitions. [2024-11-19 05:53:23,948 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 290 places, 289 transitions, 699 flow [2024-11-19 05:53:23,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:53:23,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:53:23,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 792 transitions. [2024-11-19 05:53:23,951 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8543689320388349 [2024-11-19 05:53:23,951 INFO L175 Difference]: Start difference. First operand has 288 places, 282 transitions, 601 flow. Second operand 3 states and 792 transitions. [2024-11-19 05:53:23,951 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 290 places, 289 transitions, 699 flow [2024-11-19 05:53:23,953 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 285 places, 289 transitions, 687 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-19 05:53:23,956 INFO L231 Difference]: Finished difference. Result has 286 places, 283 transitions, 603 flow [2024-11-19 05:53:23,956 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=309, PETRI_DIFFERENCE_MINUEND_FLOW=591, PETRI_DIFFERENCE_MINUEND_PLACES=283, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=282, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=280, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=603, PETRI_PLACES=286, PETRI_TRANSITIONS=283} [2024-11-19 05:53:23,957 INFO L277 CegarLoopForPetriNet]: 286 programPoint places, 0 predicate places. [2024-11-19 05:53:23,957 INFO L471 AbstractCegarLoop]: Abstraction has has 286 places, 283 transitions, 603 flow [2024-11-19 05:53:23,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 251.66666666666666) internal successors, (755), 3 states have internal predecessors, (755), 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:23,957 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:53:23,958 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-19 05:53:23,958 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2024-11-19 05:53:23,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:53:23,958 INFO L85 PathProgramCache]: Analyzing trace with hash -1377695253, now seen corresponding path program 1 times [2024-11-19 05:53:23,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:53:23,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816332410] [2024-11-19 05:53:23,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:53:23,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:53:23,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:53:23,999 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:24,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:53:24,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816332410] [2024-11-19 05:53:24,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816332410] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:53:24,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:53:24,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:53:24,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630220770] [2024-11-19 05:53:24,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:53:24,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:53:24,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:53:24,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:53:24,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:53:24,041 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 229 out of 309 [2024-11-19 05:53:24,042 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 286 places, 283 transitions, 603 flow. Second operand has 3 states, 3 states have (on average 230.66666666666666) internal successors, (692), 3 states have internal predecessors, (692), 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:24,042 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:53:24,042 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 229 of 309 [2024-11-19 05:53:24,042 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand