./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-data-race.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/04-mutex_37-indirect_rc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/04-mutex_37-indirect_rc.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 91e4ed4bfe1f39ec65b13c41c6a7b6461aa954e8b5b654b0aa1c967848462a4b --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 13:44:53,098 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 13:44:53,166 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-20 13:44:53,172 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 13:44:53,173 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 13:44:53,202 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 13:44:53,204 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 13:44:53,205 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 13:44:53,206 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 13:44:53,207 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 13:44:53,208 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 13:44:53,208 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 13:44:53,209 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 13:44:53,211 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 13:44:53,211 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 13:44:53,211 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 13:44:53,212 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 13:44:53,212 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 13:44:53,214 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 13:44:53,215 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 13:44:53,215 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 13:44:53,216 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 13:44:53,216 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-20 13:44:53,216 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 13:44:53,216 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-20 13:44:53,217 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 13:44:53,217 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 13:44:53,217 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 13:44:53,217 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 13:44:53,218 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 13:44:53,218 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 13:44:53,218 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 13:44:53,218 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 13:44:53,219 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 13:44:53,219 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 13:44:53,221 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 13:44:53,235 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 13:44:53,235 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 13:44:53,235 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 13:44:53,235 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 13:44:53,236 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 13:44:53,236 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 -> 91e4ed4bfe1f39ec65b13c41c6a7b6461aa954e8b5b654b0aa1c967848462a4b [2024-11-20 13:44:53,515 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 13:44:53,539 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 13:44:53,543 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 13:44:53,544 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 13:44:53,544 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 13:44:53,546 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/04-mutex_37-indirect_rc.i [2024-11-20 13:44:54,943 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 13:44:55,179 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 13:44:55,183 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/04-mutex_37-indirect_rc.i [2024-11-20 13:44:55,197 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae3f94a0a/20d04bf9b75d40dc8807b167fdc6eb56/FLAGf96c7b593 [2024-11-20 13:44:55,525 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae3f94a0a/20d04bf9b75d40dc8807b167fdc6eb56 [2024-11-20 13:44:55,527 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 13:44:55,528 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 13:44:55,529 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 13:44:55,529 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 13:44:55,535 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 13:44:55,535 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 01:44:55" (1/1) ... [2024-11-20 13:44:55,536 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d6d088b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:44:55, skipping insertion in model container [2024-11-20 13:44:55,536 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 01:44:55" (1/1) ... [2024-11-20 13:44:55,586 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 13:44:55,939 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 13:44:55,962 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 13:44:56,007 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 13:44:56,045 INFO L204 MainTranslator]: Completed translation [2024-11-20 13:44:56,046 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:44:56 WrapperNode [2024-11-20 13:44:56,046 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 13:44:56,047 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 13:44:56,047 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 13:44:56,047 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 13:44:56,054 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:44:56" (1/1) ... [2024-11-20 13:44:56,067 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:44:56" (1/1) ... [2024-11-20 13:44:56,096 INFO L138 Inliner]: procedures = 162, calls = 17, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 58 [2024-11-20 13:44:56,097 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 13:44:56,098 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 13:44:56,098 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 13:44:56,099 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 13:44:56,107 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:44:56" (1/1) ... [2024-11-20 13:44:56,108 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:44:56" (1/1) ... [2024-11-20 13:44:56,110 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:44:56" (1/1) ... [2024-11-20 13:44:56,112 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:44:56" (1/1) ... [2024-11-20 13:44:56,123 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:44:56" (1/1) ... [2024-11-20 13:44:56,128 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:44:56" (1/1) ... [2024-11-20 13:44:56,129 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:44:56" (1/1) ... [2024-11-20 13:44:56,133 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:44:56" (1/1) ... [2024-11-20 13:44:56,135 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 13:44:56,136 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 13:44:56,140 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 13:44:56,140 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 13:44:56,141 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:44:56" (1/1) ... [2024-11-20 13:44:56,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 13:44:56,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 13:44:56,181 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-20 13:44:56,187 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-20 13:44:56,262 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-20 13:44:56,263 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-20 13:44:56,263 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-20 13:44:56,263 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 13:44:56,263 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-11-20 13:44:56,263 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-11-20 13:44:56,263 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-20 13:44:56,263 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-20 13:44:56,263 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 13:44:56,263 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 13:44:56,265 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-20 13:44:56,402 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 13:44:56,404 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 13:44:56,593 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-20 13:44:56,593 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 13:44:56,614 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 13:44:56,614 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-20 13:44:56,614 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 01:44:56 BoogieIcfgContainer [2024-11-20 13:44:56,615 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 13:44:56,617 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 13:44:56,617 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 13:44:56,620 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 13:44:56,620 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 01:44:55" (1/3) ... [2024-11-20 13:44:56,622 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e2a55d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 01:44:56, skipping insertion in model container [2024-11-20 13:44:56,622 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:44:56" (2/3) ... [2024-11-20 13:44:56,622 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e2a55d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 01:44:56, skipping insertion in model container [2024-11-20 13:44:56,622 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 01:44:56" (3/3) ... [2024-11-20 13:44:56,623 INFO L112 eAbstractionObserver]: Analyzing ICFG 04-mutex_37-indirect_rc.i [2024-11-20 13:44:56,639 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 13:44:56,640 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2024-11-20 13:44:56,641 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-20 13:44:56,698 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-11-20 13:44:56,732 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 96 transitions, 199 flow [2024-11-20 13:44:56,767 INFO L124 PetriNetUnfolderBase]: 0/95 cut-off events. [2024-11-20 13:44:56,767 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-20 13:44:56,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100 conditions, 95 events. 0/95 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 63 event pairs, 0 based on Foata normal form. 0/86 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2024-11-20 13:44:56,771 INFO L82 GeneralOperation]: Start removeDead. Operand has 100 places, 96 transitions, 199 flow [2024-11-20 13:44:56,775 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 94 places, 90 transitions, 183 flow [2024-11-20 13:44:56,788 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 13:44:56,797 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;@207a7c63, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 13:44:56,798 INFO L334 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2024-11-20 13:44:56,806 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-20 13:44:56,806 INFO L124 PetriNetUnfolderBase]: 0/21 cut-off events. [2024-11-20 13:44:56,807 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-20 13:44:56,807 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 13:44:56,807 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] [2024-11-20 13:44:56,808 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2024-11-20 13:44:56,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 13:44:56,815 INFO L85 PathProgramCache]: Analyzing trace with hash 458234348, now seen corresponding path program 1 times [2024-11-20 13:44:56,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 13:44:56,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682232595] [2024-11-20 13:44:56,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 13:44:56,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 13:44:56,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 13:44:57,056 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-20 13:44:57,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 13:44:57,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682232595] [2024-11-20 13:44:57,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682232595] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 13:44:57,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 13:44:57,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 13:44:57,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47292667] [2024-11-20 13:44:57,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 13:44:57,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 13:44:57,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 13:44:57,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 13:44:57,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 13:44:57,138 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 96 [2024-11-20 13:44:57,143 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 90 transitions, 183 flow. Second operand has 3 states, 3 states have (on average 84.33333333333333) internal successors, (253), 3 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 13:44:57,143 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 13:44:57,143 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 96 [2024-11-20 13:44:57,145 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 13:44:57,202 INFO L124 PetriNetUnfolderBase]: 2/119 cut-off events. [2024-11-20 13:44:57,203 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-20 13:44:57,205 INFO L83 FinitePrefix]: Finished finitePrefix Result has 138 conditions, 119 events. 2/119 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 181 event pairs, 2 based on Foata normal form. 0/107 useless extension candidates. Maximal degree in co-relation 90. Up to 13 conditions per place. [2024-11-20 13:44:57,208 INFO L140 encePairwiseOnDemand]: 93/96 looper letters, 8 selfloop transitions, 2 changer transitions 0/89 dead transitions. [2024-11-20 13:44:57,208 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 89 transitions, 201 flow [2024-11-20 13:44:57,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 13:44:57,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-20 13:44:57,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 260 transitions. [2024-11-20 13:44:57,220 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9027777777777778 [2024-11-20 13:44:57,222 INFO L175 Difference]: Start difference. First operand has 94 places, 90 transitions, 183 flow. Second operand 3 states and 260 transitions. [2024-11-20 13:44:57,222 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 89 transitions, 201 flow [2024-11-20 13:44:57,225 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 89 transitions, 200 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-20 13:44:57,228 INFO L231 Difference]: Finished difference. Result has 94 places, 89 transitions, 184 flow [2024-11-20 13:44:57,230 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=184, PETRI_PLACES=94, PETRI_TRANSITIONS=89} [2024-11-20 13:44:57,235 INFO L277 CegarLoopForPetriNet]: 94 programPoint places, 0 predicate places. [2024-11-20 13:44:57,236 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 89 transitions, 184 flow [2024-11-20 13:44:57,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 84.33333333333333) internal successors, (253), 3 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 13:44:57,236 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 13:44:57,237 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] [2024-11-20 13:44:57,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 13:44:57,237 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2024-11-20 13:44:57,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 13:44:57,238 INFO L85 PathProgramCache]: Analyzing trace with hash -2018417069, now seen corresponding path program 1 times [2024-11-20 13:44:57,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 13:44:57,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513990844] [2024-11-20 13:44:57,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 13:44:57,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 13:44:57,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 13:44:57,297 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-20 13:44:57,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 13:44:57,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513990844] [2024-11-20 13:44:57,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513990844] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 13:44:57,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 13:44:57,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 13:44:57,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771464516] [2024-11-20 13:44:57,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 13:44:57,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 13:44:57,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 13:44:57,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 13:44:57,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 13:44:57,315 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 96 [2024-11-20 13:44:57,316 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 89 transitions, 184 flow. Second operand has 3 states, 3 states have (on average 86.0) internal successors, (258), 3 states have internal predecessors, (258), 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-20 13:44:57,316 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 13:44:57,316 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 96 [2024-11-20 13:44:57,316 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 13:44:57,404 INFO L124 PetriNetUnfolderBase]: 4/159 cut-off events. [2024-11-20 13:44:57,404 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-20 13:44:57,407 INFO L83 FinitePrefix]: Finished finitePrefix Result has 182 conditions, 159 events. 4/159 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 312 event pairs, 4 based on Foata normal form. 0/144 useless extension candidates. Maximal degree in co-relation 152. Up to 15 conditions per place. [2024-11-20 13:44:57,408 INFO L140 encePairwiseOnDemand]: 93/96 looper letters, 7 selfloop transitions, 1 changer transitions 0/87 dead transitions. [2024-11-20 13:44:57,408 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 87 transitions, 196 flow [2024-11-20 13:44:57,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 13:44:57,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-20 13:44:57,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 265 transitions. [2024-11-20 13:44:57,411 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9201388888888888 [2024-11-20 13:44:57,411 INFO L175 Difference]: Start difference. First operand has 94 places, 89 transitions, 184 flow. Second operand 3 states and 265 transitions. [2024-11-20 13:44:57,411 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 87 transitions, 196 flow [2024-11-20 13:44:57,414 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 87 transitions, 192 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-20 13:44:57,415 INFO L231 Difference]: Finished difference. Result has 92 places, 87 transitions, 178 flow [2024-11-20 13:44:57,415 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=178, PETRI_PLACES=92, PETRI_TRANSITIONS=87} [2024-11-20 13:44:57,416 INFO L277 CegarLoopForPetriNet]: 94 programPoint places, -2 predicate places. [2024-11-20 13:44:57,417 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 87 transitions, 178 flow [2024-11-20 13:44:57,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 86.0) internal successors, (258), 3 states have internal predecessors, (258), 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-20 13:44:57,417 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 13:44:57,418 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] [2024-11-20 13:44:57,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-20 13:44:57,418 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2024-11-20 13:44:57,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 13:44:57,419 INFO L85 PathProgramCache]: Analyzing trace with hash -376810153, now seen corresponding path program 1 times [2024-11-20 13:44:57,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 13:44:57,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791225470] [2024-11-20 13:44:57,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 13:44:57,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 13:44:57,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 13:44:57,484 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-20 13:44:57,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 13:44:57,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791225470] [2024-11-20 13:44:57,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791225470] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 13:44:57,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 13:44:57,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 13:44:57,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193559869] [2024-11-20 13:44:57,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 13:44:57,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 13:44:57,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 13:44:57,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 13:44:57,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 13:44:57,501 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 96 [2024-11-20 13:44:57,502 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 87 transitions, 178 flow. Second operand has 3 states, 3 states have (on average 85.33333333333333) internal successors, (256), 3 states have internal predecessors, (256), 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-20 13:44:57,502 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 13:44:57,502 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 96 [2024-11-20 13:44:57,503 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 13:44:57,527 INFO L124 PetriNetUnfolderBase]: 0/86 cut-off events. [2024-11-20 13:44:57,528 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-20 13:44:57,528 INFO L83 FinitePrefix]: Finished finitePrefix Result has 101 conditions, 86 events. 0/86 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 59 event pairs, 0 based on Foata normal form. 0/81 useless extension candidates. Maximal degree in co-relation 0. Up to 8 conditions per place. [2024-11-20 13:44:57,529 INFO L140 encePairwiseOnDemand]: 93/96 looper letters, 7 selfloop transitions, 2 changer transitions 0/86 dead transitions. [2024-11-20 13:44:57,529 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 86 transitions, 194 flow [2024-11-20 13:44:57,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 13:44:57,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-20 13:44:57,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 262 transitions. [2024-11-20 13:44:57,533 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9097222222222222 [2024-11-20 13:44:57,533 INFO L175 Difference]: Start difference. First operand has 92 places, 87 transitions, 178 flow. Second operand 3 states and 262 transitions. [2024-11-20 13:44:57,533 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 86 transitions, 194 flow [2024-11-20 13:44:57,534 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 86 transitions, 193 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-20 13:44:57,537 INFO L231 Difference]: Finished difference. Result has 92 places, 86 transitions, 179 flow [2024-11-20 13:44:57,537 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=175, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=179, PETRI_PLACES=92, PETRI_TRANSITIONS=86} [2024-11-20 13:44:57,538 INFO L277 CegarLoopForPetriNet]: 94 programPoint places, -2 predicate places. [2024-11-20 13:44:57,538 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 86 transitions, 179 flow [2024-11-20 13:44:57,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 85.33333333333333) internal successors, (256), 3 states have internal predecessors, (256), 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-20 13:44:57,539 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 13:44:57,539 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] [2024-11-20 13:44:57,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-20 13:44:57,539 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2024-11-20 13:44:57,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 13:44:57,540 INFO L85 PathProgramCache]: Analyzing trace with hash 541669795, now seen corresponding path program 1 times [2024-11-20 13:44:57,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 13:44:57,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296201779] [2024-11-20 13:44:57,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 13:44:57,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 13:44:57,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 13:44:57,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-20 13:44:57,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 13:44:57,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296201779] [2024-11-20 13:44:57,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296201779] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 13:44:57,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 13:44:57,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 13:44:57,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230039292] [2024-11-20 13:44:57,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 13:44:57,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 13:44:57,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 13:44:57,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 13:44:57,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 13:44:57,614 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 96 [2024-11-20 13:44:57,615 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 86 transitions, 179 flow. Second operand has 3 states, 3 states have (on average 89.66666666666667) internal successors, (269), 3 states have internal predecessors, (269), 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-20 13:44:57,615 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 13:44:57,615 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 96 [2024-11-20 13:44:57,615 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 13:44:57,645 INFO L124 PetriNetUnfolderBase]: 0/85 cut-off events. [2024-11-20 13:44:57,645 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-20 13:44:57,646 INFO L83 FinitePrefix]: Finished finitePrefix Result has 99 conditions, 85 events. 0/85 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 56 event pairs, 0 based on Foata normal form. 0/81 useless extension candidates. Maximal degree in co-relation 0. Up to 4 conditions per place. [2024-11-20 13:44:57,646 INFO L140 encePairwiseOnDemand]: 94/96 looper letters, 5 selfloop transitions, 1 changer transitions 0/85 dead transitions. [2024-11-20 13:44:57,646 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 85 transitions, 189 flow [2024-11-20 13:44:57,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 13:44:57,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-20 13:44:57,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 271 transitions. [2024-11-20 13:44:57,648 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9409722222222222 [2024-11-20 13:44:57,648 INFO L175 Difference]: Start difference. First operand has 92 places, 86 transitions, 179 flow. Second operand 3 states and 271 transitions. [2024-11-20 13:44:57,648 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 85 transitions, 189 flow [2024-11-20 13:44:57,649 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 85 transitions, 185 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-20 13:44:57,651 INFO L231 Difference]: Finished difference. Result has 91 places, 85 transitions, 175 flow [2024-11-20 13:44:57,651 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=173, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=175, PETRI_PLACES=91, PETRI_TRANSITIONS=85} [2024-11-20 13:44:57,652 INFO L277 CegarLoopForPetriNet]: 94 programPoint places, -3 predicate places. [2024-11-20 13:44:57,652 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 85 transitions, 175 flow [2024-11-20 13:44:57,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 89.66666666666667) internal successors, (269), 3 states have internal predecessors, (269), 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-20 13:44:57,652 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 13:44:57,652 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] [2024-11-20 13:44:57,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-20 13:44:57,653 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2024-11-20 13:44:57,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 13:44:57,654 INFO L85 PathProgramCache]: Analyzing trace with hash -2018767922, now seen corresponding path program 1 times [2024-11-20 13:44:57,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 13:44:57,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343032417] [2024-11-20 13:44:57,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 13:44:57,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 13:44:57,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 13:44:58,215 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-20 13:44:58,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 13:44:58,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343032417] [2024-11-20 13:44:58,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343032417] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 13:44:58,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 13:44:58,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 13:44:58,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701137777] [2024-11-20 13:44:58,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 13:44:58,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 13:44:58,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 13:44:58,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 13:44:58,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-20 13:44:58,393 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 96 [2024-11-20 13:44:58,394 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 85 transitions, 175 flow. Second operand has 6 states, 6 states have (on average 76.33333333333333) internal successors, (458), 6 states have internal predecessors, (458), 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-20 13:44:58,394 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 13:44:58,394 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 96 [2024-11-20 13:44:58,394 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 13:44:58,510 INFO L124 PetriNetUnfolderBase]: 84/383 cut-off events. [2024-11-20 13:44:58,510 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-20 13:44:58,512 INFO L83 FinitePrefix]: Finished finitePrefix Result has 584 conditions, 383 events. 84/383 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1692 event pairs, 34 based on Foata normal form. 0/358 useless extension candidates. Maximal degree in co-relation 555. Up to 144 conditions per place. [2024-11-20 13:44:58,513 INFO L140 encePairwiseOnDemand]: 85/96 looper letters, 27 selfloop transitions, 22 changer transitions 0/114 dead transitions. [2024-11-20 13:44:58,514 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 114 transitions, 331 flow [2024-11-20 13:44:58,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 13:44:58,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-20 13:44:58,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 500 transitions. [2024-11-20 13:44:58,516 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8680555555555556 [2024-11-20 13:44:58,516 INFO L175 Difference]: Start difference. First operand has 91 places, 85 transitions, 175 flow. Second operand 6 states and 500 transitions. [2024-11-20 13:44:58,516 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 114 transitions, 331 flow [2024-11-20 13:44:58,517 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 114 transitions, 330 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-20 13:44:58,519 INFO L231 Difference]: Finished difference. Result has 100 places, 106 transitions, 324 flow [2024-11-20 13:44:58,519 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=324, PETRI_PLACES=100, PETRI_TRANSITIONS=106} [2024-11-20 13:44:58,520 INFO L277 CegarLoopForPetriNet]: 94 programPoint places, 6 predicate places. [2024-11-20 13:44:58,520 INFO L471 AbstractCegarLoop]: Abstraction has has 100 places, 106 transitions, 324 flow [2024-11-20 13:44:58,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 76.33333333333333) internal successors, (458), 6 states have internal predecessors, (458), 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-20 13:44:58,521 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 13:44:58,521 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 13:44:58,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-20 13:44:58,522 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2024-11-20 13:44:58,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 13:44:58,522 INFO L85 PathProgramCache]: Analyzing trace with hash -1752860697, now seen corresponding path program 1 times [2024-11-20 13:44:58,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 13:44:58,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313907994] [2024-11-20 13:44:58,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 13:44:58,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 13:44:58,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 13:44:58,840 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-20 13:44:58,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 13:44:58,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313907994] [2024-11-20 13:44:58,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313907994] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 13:44:58,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 13:44:58,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 13:44:58,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860160736] [2024-11-20 13:44:58,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 13:44:58,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 13:44:58,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 13:44:58,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 13:44:58,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-20 13:44:58,969 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 96 [2024-11-20 13:44:58,970 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 106 transitions, 324 flow. Second operand has 6 states, 6 states have (on average 76.5) internal successors, (459), 6 states have internal predecessors, (459), 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-20 13:44:58,970 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 13:44:58,970 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 96 [2024-11-20 13:44:58,971 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 13:44:59,083 INFO L124 PetriNetUnfolderBase]: 94/424 cut-off events. [2024-11-20 13:44:59,083 INFO L125 PetriNetUnfolderBase]: For 114/124 co-relation queries the response was YES. [2024-11-20 13:44:59,087 INFO L83 FinitePrefix]: Finished finitePrefix Result has 815 conditions, 424 events. 94/424 cut-off events. For 114/124 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 2102 event pairs, 25 based on Foata normal form. 0/404 useless extension candidates. Maximal degree in co-relation 783. Up to 180 conditions per place. [2024-11-20 13:44:59,089 INFO L140 encePairwiseOnDemand]: 85/96 looper letters, 32 selfloop transitions, 26 changer transitions 0/127 dead transitions. [2024-11-20 13:44:59,089 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 127 transitions, 500 flow [2024-11-20 13:44:59,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 13:44:59,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-20 13:44:59,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 492 transitions. [2024-11-20 13:44:59,091 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8541666666666666 [2024-11-20 13:44:59,091 INFO L175 Difference]: Start difference. First operand has 100 places, 106 transitions, 324 flow. Second operand 6 states and 492 transitions. [2024-11-20 13:44:59,091 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 127 transitions, 500 flow [2024-11-20 13:44:59,094 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 127 transitions, 500 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-20 13:44:59,098 INFO L231 Difference]: Finished difference. Result has 110 places, 127 transitions, 508 flow [2024-11-20 13:44:59,098 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=324, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=508, PETRI_PLACES=110, PETRI_TRANSITIONS=127} [2024-11-20 13:44:59,099 INFO L277 CegarLoopForPetriNet]: 94 programPoint places, 16 predicate places. [2024-11-20 13:44:59,100 INFO L471 AbstractCegarLoop]: Abstraction has has 110 places, 127 transitions, 508 flow [2024-11-20 13:44:59,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 76.5) internal successors, (459), 6 states have internal predecessors, (459), 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-20 13:44:59,100 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 13:44:59,100 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] [2024-11-20 13:44:59,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-20 13:44:59,101 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2024-11-20 13:44:59,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 13:44:59,102 INFO L85 PathProgramCache]: Analyzing trace with hash 1850069345, now seen corresponding path program 1 times [2024-11-20 13:44:59,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 13:44:59,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010440433] [2024-11-20 13:44:59,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 13:44:59,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 13:44:59,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 13:44:59,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 13:44:59,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 13:44:59,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010440433] [2024-11-20 13:44:59,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010440433] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 13:44:59,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 13:44:59,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 13:44:59,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717575852] [2024-11-20 13:44:59,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 13:44:59,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 13:44:59,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 13:44:59,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 13:44:59,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-20 13:44:59,453 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 96 [2024-11-20 13:44:59,454 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 127 transitions, 508 flow. Second operand has 6 states, 6 states have (on average 69.5) internal successors, (417), 6 states have internal predecessors, (417), 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-20 13:44:59,454 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 13:44:59,454 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 96 [2024-11-20 13:44:59,454 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 13:44:59,619 INFO L124 PetriNetUnfolderBase]: 232/774 cut-off events. [2024-11-20 13:44:59,620 INFO L125 PetriNetUnfolderBase]: For 471/486 co-relation queries the response was YES. [2024-11-20 13:44:59,623 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1926 conditions, 774 events. 232/774 cut-off events. For 471/486 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 4445 event pairs, 51 based on Foata normal form. 1/734 useless extension candidates. Maximal degree in co-relation 1887. Up to 406 conditions per place. [2024-11-20 13:44:59,627 INFO L140 encePairwiseOnDemand]: 81/96 looper letters, 66 selfloop transitions, 53 changer transitions 4/182 dead transitions. [2024-11-20 13:44:59,627 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 182 transitions, 998 flow [2024-11-20 13:44:59,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 13:44:59,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-20 13:44:59,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 475 transitions. [2024-11-20 13:44:59,629 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8246527777777778 [2024-11-20 13:44:59,629 INFO L175 Difference]: Start difference. First operand has 110 places, 127 transitions, 508 flow. Second operand 6 states and 475 transitions. [2024-11-20 13:44:59,629 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 182 transitions, 998 flow [2024-11-20 13:44:59,636 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 182 transitions, 998 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-20 13:44:59,640 INFO L231 Difference]: Finished difference. Result has 120 places, 174 transitions, 990 flow [2024-11-20 13:44:59,640 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=508, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=990, PETRI_PLACES=120, PETRI_TRANSITIONS=174} [2024-11-20 13:44:59,641 INFO L277 CegarLoopForPetriNet]: 94 programPoint places, 26 predicate places. [2024-11-20 13:44:59,642 INFO L471 AbstractCegarLoop]: Abstraction has has 120 places, 174 transitions, 990 flow [2024-11-20 13:44:59,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 69.5) internal successors, (417), 6 states have internal predecessors, (417), 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-20 13:44:59,642 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 13:44:59,643 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] [2024-11-20 13:44:59,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-20 13:44:59,644 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2024-11-20 13:44:59,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 13:44:59,644 INFO L85 PathProgramCache]: Analyzing trace with hash -1843486100, now seen corresponding path program 1 times [2024-11-20 13:44:59,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 13:44:59,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745953079] [2024-11-20 13:44:59,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 13:44:59,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 13:44:59,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 13:44:59,906 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-20 13:44:59,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 13:44:59,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745953079] [2024-11-20 13:44:59,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745953079] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 13:44:59,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 13:44:59,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 13:44:59,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970979724] [2024-11-20 13:44:59,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 13:44:59,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 13:44:59,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 13:44:59,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 13:44:59,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-20 13:45:00,018 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 96 [2024-11-20 13:45:00,019 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 174 transitions, 990 flow. Second operand has 6 states, 6 states have (on average 71.5) internal successors, (429), 6 states have internal predecessors, (429), 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-20 13:45:00,020 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 13:45:00,020 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 96 [2024-11-20 13:45:00,020 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 13:45:00,240 INFO L124 PetriNetUnfolderBase]: 315/1007 cut-off events. [2024-11-20 13:45:00,241 INFO L125 PetriNetUnfolderBase]: For 1383/1415 co-relation queries the response was YES. [2024-11-20 13:45:00,244 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3064 conditions, 1007 events. 315/1007 cut-off events. For 1383/1415 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 6202 event pairs, 57 based on Foata normal form. 3/978 useless extension candidates. Maximal degree in co-relation 3022. Up to 531 conditions per place. [2024-11-20 13:45:00,248 INFO L140 encePairwiseOnDemand]: 81/96 looper letters, 98 selfloop transitions, 61 changer transitions 6/227 dead transitions. [2024-11-20 13:45:00,249 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 227 transitions, 1650 flow [2024-11-20 13:45:00,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 13:45:00,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-20 13:45:00,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 478 transitions. [2024-11-20 13:45:00,251 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8298611111111112 [2024-11-20 13:45:00,251 INFO L175 Difference]: Start difference. First operand has 120 places, 174 transitions, 990 flow. Second operand 6 states and 478 transitions. [2024-11-20 13:45:00,251 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 227 transitions, 1650 flow [2024-11-20 13:45:00,260 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 227 transitions, 1586 flow, removed 32 selfloop flow, removed 0 redundant places. [2024-11-20 13:45:00,263 INFO L231 Difference]: Finished difference. Result has 130 places, 221 transitions, 1512 flow [2024-11-20 13:45:00,264 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=932, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=174, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1512, PETRI_PLACES=130, PETRI_TRANSITIONS=221} [2024-11-20 13:45:00,265 INFO L277 CegarLoopForPetriNet]: 94 programPoint places, 36 predicate places. [2024-11-20 13:45:00,266 INFO L471 AbstractCegarLoop]: Abstraction has has 130 places, 221 transitions, 1512 flow [2024-11-20 13:45:00,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 71.5) internal successors, (429), 6 states have internal predecessors, (429), 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-20 13:45:00,267 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 13:45:00,267 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 13:45:00,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-20 13:45:00,267 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2024-11-20 13:45:00,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 13:45:00,269 INFO L85 PathProgramCache]: Analyzing trace with hash -423558540, now seen corresponding path program 1 times [2024-11-20 13:45:00,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 13:45:00,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585048847] [2024-11-20 13:45:00,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 13:45:00,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 13:45:00,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 13:45:00,296 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 13:45:00,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 13:45:00,341 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 13:45:00,341 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-20 13:45:00,342 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location t_funErr1ASSERT_VIOLATIONDATA_RACE (12 of 13 remaining) [2024-11-20 13:45:00,345 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (11 of 13 remaining) [2024-11-20 13:45:00,345 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (10 of 13 remaining) [2024-11-20 13:45:00,345 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (9 of 13 remaining) [2024-11-20 13:45:00,346 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (8 of 13 remaining) [2024-11-20 13:45:00,346 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (7 of 13 remaining) [2024-11-20 13:45:00,346 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (6 of 13 remaining) [2024-11-20 13:45:00,346 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 13 remaining) [2024-11-20 13:45:00,346 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (4 of 13 remaining) [2024-11-20 13:45:00,346 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (3 of 13 remaining) [2024-11-20 13:45:00,346 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (2 of 13 remaining) [2024-11-20 13:45:00,347 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (1 of 13 remaining) [2024-11-20 13:45:00,347 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (0 of 13 remaining) [2024-11-20 13:45:00,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-20 13:45:00,347 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 13:45:00,416 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-20 13:45:00,416 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-20 13:45:00,421 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 01:45:00 BasicIcfg [2024-11-20 13:45:00,421 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-20 13:45:00,422 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-20 13:45:00,422 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-20 13:45:00,422 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-20 13:45:00,423 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 01:44:56" (3/4) ... [2024-11-20 13:45:00,424 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-20 13:45:00,493 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-20 13:45:00,493 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-20 13:45:00,494 INFO L158 Benchmark]: Toolchain (without parser) took 4965.67ms. Allocated memory was 148.9MB in the beginning and 192.9MB in the end (delta: 44.0MB). Free memory was 111.3MB in the beginning and 96.0MB in the end (delta: 15.4MB). Peak memory consumption was 60.2MB. Max. memory is 16.1GB. [2024-11-20 13:45:00,494 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 148.9MB. Free memory is still 116.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 13:45:00,494 INFO L158 Benchmark]: CACSL2BoogieTranslator took 516.93ms. Allocated memory is still 148.9MB. Free memory was 111.1MB in the beginning and 88.9MB in the end (delta: 22.2MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-11-20 13:45:00,497 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.67ms. Allocated memory is still 148.9MB. Free memory was 88.9MB in the beginning and 87.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-20 13:45:00,498 INFO L158 Benchmark]: Boogie Preprocessor took 37.55ms. Allocated memory is still 148.9MB. Free memory was 87.3MB in the beginning and 85.3MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-20 13:45:00,498 INFO L158 Benchmark]: RCFGBuilder took 478.54ms. Allocated memory is still 148.9MB. Free memory was 85.3MB in the beginning and 104.9MB in the end (delta: -19.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-20 13:45:00,499 INFO L158 Benchmark]: TraceAbstraction took 3804.71ms. Allocated memory was 148.9MB in the beginning and 192.9MB in the end (delta: 44.0MB). Free memory was 104.1MB in the beginning and 102.3MB in the end (delta: 1.8MB). Peak memory consumption was 48.6MB. Max. memory is 16.1GB. [2024-11-20 13:45:00,499 INFO L158 Benchmark]: Witness Printer took 71.28ms. Allocated memory is still 192.9MB. Free memory was 102.3MB in the beginning and 96.0MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-20 13:45:00,501 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24ms. Allocated memory is still 148.9MB. Free memory is still 116.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 516.93ms. Allocated memory is still 148.9MB. Free memory was 111.1MB in the beginning and 88.9MB in the end (delta: 22.2MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.67ms. Allocated memory is still 148.9MB. Free memory was 88.9MB in the beginning and 87.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 37.55ms. Allocated memory is still 148.9MB. Free memory was 87.3MB in the beginning and 85.3MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 478.54ms. Allocated memory is still 148.9MB. Free memory was 85.3MB in the beginning and 104.9MB in the end (delta: -19.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * TraceAbstraction took 3804.71ms. Allocated memory was 148.9MB in the beginning and 192.9MB in the end (delta: 44.0MB). Free memory was 104.1MB in the beginning and 102.3MB in the end (delta: 1.8MB). Peak memory consumption was 48.6MB. Max. memory is 16.1GB. * Witness Printer took 71.28ms. Allocated memory is still 192.9MB. Free memory was 102.3MB in the beginning and 96.0MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - DataRaceFoundResult [Line: 685]: Data race detected Data race detected The following path leads to a data race: [L679] 0 int g; VAL [g={1:0}] [L680] 0 int *g1; VAL [g1={0:0}, g={1:0}] [L681] 0 int *g2; VAL [g1={0:0}, g2={0:0}, g={1:0}] [L682] 0 pthread_mutex_t mutex = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; VAL [g1={0:0}, g2={0:0}, g={1:0}, mutex={2:0}] [L690] 0 pthread_t id; VAL [g1={0:0}, g2={0:0}, g={1:0}, mutex={2:0}] [L691] 0 int x; VAL [g1={0:0}, g2={0:0}, g={1:0}, mutex={2:0}] [L692] EXPR 0 g2 = &g VAL [g1={0:0}, g2={1:0}, g={1:0}, mutex={2:0}] [L692] 0 g1 = g2 = &g VAL [g1={1:0}, g2={1:0}, g={1:0}, mutex={2:0}] [L693] FCALL, FORK 0 pthread_create(&id, ((void *)0), t_fun, ((void *)0)) VAL [\old(arg)={0:0}, g1={1:0}, g2={1:0}, g={1:0}, id=-1, mutex={2:0}] [L694] EXPR 0 *g2 VAL [\old(arg)={0:0}, g1={1:0}, g2={1:0}, g={1:0}, id=-1, mutex={2:0}] [L694] EXPR 0 \read(*g2) VAL [\old(arg)={0:0}, g1={1:0}, g2={1:0}, g={1:0}, id=-1, mutex={2:0}] [L694] 0 (*g2)++ VAL [\old(arg)={0:0}, g1={1:0}, g2={1:0}, g={1:0}, id=-1, mutex={2:0}] [L685] EXPR 1 *g1 VAL [\old(arg)={0:0}, arg={0:0}, g1={1:0}, g2={1:0}, g={1:0}, mutex={2:0}] [L685] EXPR 1 \read(*g1) VAL [\old(arg)={0:0}, arg={0:0}, g1={1:0}, g2={1:0}, g={1:0}, mutex={2:0}] [L685] 1 (*g1)++ VAL [\old(arg)={0:0}, arg={0:0}, g1={1:0}, g2={1:0}, g={1:0}, mutex={2:0}] [L694] 0 (*g2)++ VAL [\old(arg)={0:0}, arg={0:0}, g1={1:0}, g2={1:0}, g={1:0}, id=-1, mutex={2:0}] [L685] 1 (*g1)++ VAL [\old(arg)={0:0}, arg={0:0}, g1={1:0}, g2={1:0}, g={1:0}, mutex={2:0}] [L694] 0 (*g2)++ VAL [\old(arg)={0:0}, arg={0:0}, g1={1:0}, g2={1:0}, g={1:0}, id=-1, mutex={2:0}] [L685] 1 (*g1)++ VAL [\old(arg)={0:0}, arg={0:0}, g1={1:0}, g2={1:0}, g={1:0}, mutex={2:0}] [L694] 0 (*g2)++ VAL [\old(arg)={0:0}, arg={0:0}, g1={1:0}, g2={1:0}, g={1:0}, id=-1, mutex={2:0}] [L685] 1 (*g1)++ VAL [\old(arg)={0:0}, arg={0:0}, g1={1:0}, g2={1:0}, g={1:0}, mutex={2:0}] [L694] 0 (*g2)++ VAL [\old(arg)={0:0}, arg={0:0}, g1={1:0}, g2={1:0}, g={1:0}, id=-1, mutex={2:0}] [L685] 1 (*g1)++ VAL [\old(arg)={0:0}, arg={0:0}, g1={1:0}, g2={1:0}, g={1:0}, mutex={2:0}] Now there is a data race, but we were unable to determine exactly which statements and variables are involved. There could be a race between one of the statements * C: (*g2)++ [694] * C: g1 = g2 = &g [692] * C: g2 = &g [692] and C: (*g1)++ [685] - UnprovableResult [Line: 692]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 692]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 692]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 694]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 694]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 694]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 693]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 685]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 685]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 128 locations, 13 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 3.6s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 316 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 171 mSDsluCounter, 34 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 86 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 776 IncrementalHoareTripleChecker+Invalid, 862 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 86 mSolverCounterUnsat, 34 mSDtfsCounter, 776 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 32 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1512occurred in iteration=8, InterpolantAutomatonStates: 36, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 366 NumberOfCodeBlocks, 366 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 299 ConstructedInterpolants, 0 QuantifiedInterpolants, 631 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-11-20 13:45:00,523 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE