./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_19-callback_racing.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/goblint-regression/28-race_reach_19-callback_racing.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a178b12ba1b75e8e390c539a1b1599b5e56cbe73098e0c8e7ca0eeb62a619e80 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 14:32:48,717 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 14:32:48,767 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-10 14:32:48,772 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 14:32:48,772 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 14:32:48,800 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 14:32:48,800 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 14:32:48,801 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 14:32:48,801 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 14:32:48,802 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 14:32:48,802 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 14:32:48,802 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 14:32:48,803 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 14:32:48,803 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 14:32:48,803 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 14:32:48,803 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 14:32:48,804 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 14:32:48,804 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 14:32:48,804 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 14:32:48,804 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 14:32:48,805 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 14:32:48,805 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 14:32:48,805 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-10 14:32:48,806 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 14:32:48,806 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 14:32:48,806 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 14:32:48,806 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 14:32:48,806 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 14:32:48,807 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 14:32:48,807 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 14:32:48,807 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 14:32:48,807 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 14:32:48,808 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 14:32:48,808 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 14:32:48,808 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 14:32:48,808 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 14:32:48,809 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 14:32:48,809 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 14:32:48,809 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 14:32:48,809 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 14:32:48,809 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 14:32:48,810 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a178b12ba1b75e8e390c539a1b1599b5e56cbe73098e0c8e7ca0eeb62a619e80 [2024-11-10 14:32:48,998 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 14:32:49,020 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 14:32:49,022 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 14:32:49,023 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 14:32:49,023 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 14:32:49,025 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_19-callback_racing.i [2024-11-10 14:32:50,426 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 14:32:50,643 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 14:32:50,643 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_19-callback_racing.i [2024-11-10 14:32:50,656 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a55ec5306/daadceee898a45d2998f6cc0db21c024/FLAG089682378 [2024-11-10 14:32:50,675 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a55ec5306/daadceee898a45d2998f6cc0db21c024 [2024-11-10 14:32:50,678 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 14:32:50,681 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 14:32:50,681 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 14:32:50,681 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 14:32:50,687 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 14:32:50,688 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:32:50" (1/1) ... [2024-11-10 14:32:50,689 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ec98ce4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:32:50, skipping insertion in model container [2024-11-10 14:32:50,689 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:32:50" (1/1) ... [2024-11-10 14:32:50,734 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 14:32:51,047 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 14:32:51,071 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 14:32:51,110 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 14:32:51,142 INFO L204 MainTranslator]: Completed translation [2024-11-10 14:32:51,143 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:32:51 WrapperNode [2024-11-10 14:32:51,143 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 14:32:51,144 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 14:32:51,144 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 14:32:51,144 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 14:32:51,149 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:32:51" (1/1) ... [2024-11-10 14:32:51,164 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:32:51" (1/1) ... [2024-11-10 14:32:51,187 INFO L138 Inliner]: procedures = 174, calls = 45, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 167 [2024-11-10 14:32:51,188 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 14:32:51,189 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 14:32:51,189 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 14:32:51,189 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 14:32:51,195 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:32:51" (1/1) ... [2024-11-10 14:32:51,196 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:32:51" (1/1) ... [2024-11-10 14:32:51,198 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:32:51" (1/1) ... [2024-11-10 14:32:51,199 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:32:51" (1/1) ... [2024-11-10 14:32:51,204 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:32:51" (1/1) ... [2024-11-10 14:32:51,205 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:32:51" (1/1) ... [2024-11-10 14:32:51,207 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:32:51" (1/1) ... [2024-11-10 14:32:51,207 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:32:51" (1/1) ... [2024-11-10 14:32:51,211 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 14:32:51,212 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 14:32:51,212 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 14:32:51,212 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 14:32:51,213 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:32:51" (1/1) ... [2024-11-10 14:32:51,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 14:32:51,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 14:32:51,251 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-10 14:32:51,253 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-10 14:32:51,289 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-10 14:32:51,289 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-10 14:32:51,289 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-10 14:32:51,290 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 14:32:51,290 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-10 14:32:51,290 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-11-10 14:32:51,290 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-11-10 14:32:51,290 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-10 14:32:51,290 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-10 14:32:51,290 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-10 14:32:51,290 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 14:32:51,290 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 14:32:51,294 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-10 14:32:51,390 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 14:32:51,392 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 14:32:51,614 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L720: havoc main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset; [2024-11-10 14:32:51,615 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L720-1: SUMMARY for call ULTIMATE.dealloc(main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset); srcloc: null [2024-11-10 14:32:51,653 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-10 14:32:51,653 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 14:32:51,691 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 14:32:51,692 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 14:32:51,693 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 02:32:51 BoogieIcfgContainer [2024-11-10 14:32:51,694 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 14:32:51,695 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 14:32:51,696 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 14:32:51,700 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 14:32:51,700 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 02:32:50" (1/3) ... [2024-11-10 14:32:51,701 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55e5399 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 02:32:51, skipping insertion in model container [2024-11-10 14:32:51,701 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:32:51" (2/3) ... [2024-11-10 14:32:51,702 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55e5399 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 02:32:51, skipping insertion in model container [2024-11-10 14:32:51,702 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 02:32:51" (3/3) ... [2024-11-10 14:32:51,703 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_19-callback_racing.i [2024-11-10 14:32:51,717 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 14:32:51,717 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2024-11-10 14:32:51,718 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-10 14:32:51,766 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-11-10 14:32:51,804 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 174 places, 187 transitions, 381 flow [2024-11-10 14:32:51,878 INFO L124 PetriNetUnfolderBase]: 27/302 cut-off events. [2024-11-10 14:32:51,878 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-10 14:32:51,885 INFO L83 FinitePrefix]: Finished finitePrefix Result has 307 conditions, 302 events. 27/302 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1014 event pairs, 0 based on Foata normal form. 0/259 useless extension candidates. Maximal degree in co-relation 149. Up to 6 conditions per place. [2024-11-10 14:32:51,886 INFO L82 GeneralOperation]: Start removeDead. Operand has 174 places, 187 transitions, 381 flow [2024-11-10 14:32:51,892 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 174 places, 187 transitions, 381 flow [2024-11-10 14:32:51,904 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 14:32:51,911 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;@1359713, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 14:32:51,911 INFO L334 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2024-11-10 14:32:51,922 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-10 14:32:51,923 INFO L124 PetriNetUnfolderBase]: 2/59 cut-off events. [2024-11-10 14:32:51,923 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 14:32:51,923 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:32:51,924 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:32:51,924 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-10 14:32:51,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:32:51,928 INFO L85 PathProgramCache]: Analyzing trace with hash 11071731, now seen corresponding path program 1 times [2024-11-10 14:32:51,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:32:51,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466278371] [2024-11-10 14:32:51,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:32:51,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:32:52,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:32:52,726 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-10 14:32:52,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:32:52,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466278371] [2024-11-10 14:32:52,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466278371] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:32:52,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:32:52,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 14:32:52,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410430630] [2024-11-10 14:32:52,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:32:52,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 14:32:52,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:32:52,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 14:32:52,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-10 14:32:52,912 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 143 out of 187 [2024-11-10 14:32:52,916 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 187 transitions, 381 flow. Second operand has 6 states, 6 states have (on average 144.5) internal successors, (867), 6 states have internal predecessors, (867), 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-10 14:32:52,916 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:32:52,916 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 187 [2024-11-10 14:32:52,917 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:32:53,140 INFO L124 PetriNetUnfolderBase]: 93/784 cut-off events. [2024-11-10 14:32:53,140 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-10 14:32:53,143 INFO L83 FinitePrefix]: Finished finitePrefix Result has 998 conditions, 784 events. 93/784 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 4355 event pairs, 33 based on Foata normal form. 135/863 useless extension candidates. Maximal degree in co-relation 822. Up to 154 conditions per place. [2024-11-10 14:32:53,148 INFO L140 encePairwiseOnDemand]: 168/187 looper letters, 40 selfloop transitions, 5 changer transitions 0/187 dead transitions. [2024-11-10 14:32:53,149 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 187 transitions, 471 flow [2024-11-10 14:32:53,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 14:32:53,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 14:32:53,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 933 transitions. [2024-11-10 14:32:53,164 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8315508021390374 [2024-11-10 14:32:53,166 INFO L175 Difference]: Start difference. First operand has 174 places, 187 transitions, 381 flow. Second operand 6 states and 933 transitions. [2024-11-10 14:32:53,170 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 187 transitions, 471 flow [2024-11-10 14:32:53,174 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 187 transitions, 471 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 14:32:53,178 INFO L231 Difference]: Finished difference. Result has 176 places, 171 transitions, 359 flow [2024-11-10 14:32:53,180 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=349, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=171, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=166, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=359, PETRI_PLACES=176, PETRI_TRANSITIONS=171} [2024-11-10 14:32:53,183 INFO L277 CegarLoopForPetriNet]: 174 programPoint places, 2 predicate places. [2024-11-10 14:32:53,183 INFO L471 AbstractCegarLoop]: Abstraction has has 176 places, 171 transitions, 359 flow [2024-11-10 14:32:53,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 144.5) internal successors, (867), 6 states have internal predecessors, (867), 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-10 14:32:53,184 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:32:53,184 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-10 14:32:53,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 14:32:53,185 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-10 14:32:53,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:32:53,185 INFO L85 PathProgramCache]: Analyzing trace with hash -2005736234, now seen corresponding path program 1 times [2024-11-10 14:32:53,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:32:53,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312231790] [2024-11-10 14:32:53,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:32:53,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:32:53,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:32:53,236 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-10 14:32:53,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:32:53,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312231790] [2024-11-10 14:32:53,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312231790] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:32:53,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:32:53,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:32:53,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428995525] [2024-11-10 14:32:53,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:32:53,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:32:53,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:32:53,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:32:53,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:32:53,261 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 187 [2024-11-10 14:32:53,262 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 171 transitions, 359 flow. Second operand has 3 states, 3 states have (on average 151.66666666666666) internal successors, (455), 3 states have internal predecessors, (455), 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-10 14:32:53,262 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:32:53,262 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 187 [2024-11-10 14:32:53,262 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:32:53,375 INFO L124 PetriNetUnfolderBase]: 113/962 cut-off events. [2024-11-10 14:32:53,375 INFO L125 PetriNetUnfolderBase]: For 7/13 co-relation queries the response was YES. [2024-11-10 14:32:53,379 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1232 conditions, 962 events. 113/962 cut-off events. For 7/13 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 5035 event pairs, 34 based on Foata normal form. 1/885 useless extension candidates. Maximal degree in co-relation 1060. Up to 137 conditions per place. [2024-11-10 14:32:53,382 INFO L140 encePairwiseOnDemand]: 178/187 looper letters, 30 selfloop transitions, 6 changer transitions 0/184 dead transitions. [2024-11-10 14:32:53,382 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 184 transitions, 460 flow [2024-11-10 14:32:53,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:32:53,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:32:53,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 489 transitions. [2024-11-10 14:32:53,384 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8716577540106952 [2024-11-10 14:32:53,384 INFO L175 Difference]: Start difference. First operand has 176 places, 171 transitions, 359 flow. Second operand 3 states and 489 transitions. [2024-11-10 14:32:53,384 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 184 transitions, 460 flow [2024-11-10 14:32:53,386 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 184 transitions, 450 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-10 14:32:53,389 INFO L231 Difference]: Finished difference. Result has 173 places, 173 transitions, 387 flow [2024-11-10 14:32:53,390 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=345, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=169, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=163, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=387, PETRI_PLACES=173, PETRI_TRANSITIONS=173} [2024-11-10 14:32:53,390 INFO L277 CegarLoopForPetriNet]: 174 programPoint places, -1 predicate places. [2024-11-10 14:32:53,391 INFO L471 AbstractCegarLoop]: Abstraction has has 173 places, 173 transitions, 387 flow [2024-11-10 14:32:53,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 151.66666666666666) internal successors, (455), 3 states have internal predecessors, (455), 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-10 14:32:53,391 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:32:53,391 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-10 14:32:53,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 14:32:53,392 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-10 14:32:53,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:32:53,393 INFO L85 PathProgramCache]: Analyzing trace with hash -1072083921, now seen corresponding path program 1 times [2024-11-10 14:32:53,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:32:53,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097304618] [2024-11-10 14:32:53,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:32:53,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:32:53,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:32:53,453 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-10 14:32:53,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:32:53,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097304618] [2024-11-10 14:32:53,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097304618] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:32:53,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:32:53,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 14:32:53,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701950579] [2024-11-10 14:32:53,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:32:53,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:32:53,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:32:53,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:32:53,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:32:53,474 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 187 [2024-11-10 14:32:53,475 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 173 transitions, 387 flow. Second operand has 3 states, 3 states have (on average 156.33333333333334) internal successors, (469), 3 states have internal predecessors, (469), 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-10 14:32:53,475 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:32:53,475 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 187 [2024-11-10 14:32:53,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:32:53,589 INFO L124 PetriNetUnfolderBase]: 86/1075 cut-off events. [2024-11-10 14:32:53,589 INFO L125 PetriNetUnfolderBase]: For 40/40 co-relation queries the response was YES. [2024-11-10 14:32:53,591 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1324 conditions, 1075 events. 86/1075 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 5828 event pairs, 10 based on Foata normal form. 1/1005 useless extension candidates. Maximal degree in co-relation 1217. Up to 144 conditions per place. [2024-11-10 14:32:53,595 INFO L140 encePairwiseOnDemand]: 184/187 looper letters, 20 selfloop transitions, 2 changer transitions 0/177 dead transitions. [2024-11-10 14:32:53,595 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 177 transitions, 439 flow [2024-11-10 14:32:53,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:32:53,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:32:53,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 488 transitions. [2024-11-10 14:32:53,596 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8698752228163993 [2024-11-10 14:32:53,596 INFO L175 Difference]: Start difference. First operand has 173 places, 173 transitions, 387 flow. Second operand 3 states and 488 transitions. [2024-11-10 14:32:53,596 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 177 transitions, 439 flow [2024-11-10 14:32:53,599 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 177 transitions, 427 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:32:53,601 INFO L231 Difference]: Finished difference. Result has 174 places, 173 transitions, 383 flow [2024-11-10 14:32:53,601 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=375, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=173, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=171, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=383, PETRI_PLACES=174, PETRI_TRANSITIONS=173} [2024-11-10 14:32:53,602 INFO L277 CegarLoopForPetriNet]: 174 programPoint places, 0 predicate places. [2024-11-10 14:32:53,602 INFO L471 AbstractCegarLoop]: Abstraction has has 174 places, 173 transitions, 383 flow [2024-11-10 14:32:53,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 156.33333333333334) internal successors, (469), 3 states have internal predecessors, (469), 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-10 14:32:53,602 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:32:53,602 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:32:53,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 14:32:53,603 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-10 14:32:53,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:32:53,603 INFO L85 PathProgramCache]: Analyzing trace with hash -1298159464, now seen corresponding path program 1 times [2024-11-10 14:32:53,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:32:53,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916053485] [2024-11-10 14:32:53,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:32:53,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:32:53,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 14:32:53,629 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 14:32:53,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 14:32:53,671 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 14:32:53,672 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 14:32:53,672 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 9 remaining) [2024-11-10 14:32:53,674 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (7 of 9 remaining) [2024-11-10 14:32:53,674 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (6 of 9 remaining) [2024-11-10 14:32:53,675 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (5 of 9 remaining) [2024-11-10 14:32:53,675 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (4 of 9 remaining) [2024-11-10 14:32:53,675 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (3 of 9 remaining) [2024-11-10 14:32:53,675 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (2 of 9 remaining) [2024-11-10 14:32:53,676 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (1 of 9 remaining) [2024-11-10 14:32:53,676 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (0 of 9 remaining) [2024-11-10 14:32:53,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 14:32:53,676 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-10 14:32:53,680 WARN L244 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-10 14:32:53,680 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-11-10 14:32:53,704 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-10 14:32:53,710 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 204 places, 220 transitions, 456 flow [2024-11-10 14:32:53,747 INFO L124 PetriNetUnfolderBase]: 45/479 cut-off events. [2024-11-10 14:32:53,747 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-11-10 14:32:53,750 INFO L83 FinitePrefix]: Finished finitePrefix Result has 491 conditions, 479 events. 45/479 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1919 event pairs, 0 based on Foata normal form. 0/409 useless extension candidates. Maximal degree in co-relation 304. Up to 9 conditions per place. [2024-11-10 14:32:53,750 INFO L82 GeneralOperation]: Start removeDead. Operand has 204 places, 220 transitions, 456 flow [2024-11-10 14:32:53,752 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 204 places, 220 transitions, 456 flow [2024-11-10 14:32:53,753 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 14:32:53,754 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;@1359713, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 14:32:53,756 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2024-11-10 14:32:53,760 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-10 14:32:53,760 INFO L124 PetriNetUnfolderBase]: 2/59 cut-off events. [2024-11-10 14:32:53,760 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 14:32:53,760 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:32:53,760 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:32:53,760 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2024-11-10 14:32:53,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:32:53,761 INFO L85 PathProgramCache]: Analyzing trace with hash -345071537, now seen corresponding path program 1 times [2024-11-10 14:32:53,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:32:53,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316906882] [2024-11-10 14:32:53,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:32:53,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:32:53,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:32:54,011 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-10 14:32:54,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:32:54,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316906882] [2024-11-10 14:32:54,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316906882] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:32:54,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:32:54,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 14:32:54,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993747804] [2024-11-10 14:32:54,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:32:54,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 14:32:54,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:32:54,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 14:32:54,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-10 14:32:54,103 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 220 [2024-11-10 14:32:54,104 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 220 transitions, 456 flow. Second operand has 6 states, 6 states have (on average 166.5) internal successors, (999), 6 states have internal predecessors, (999), 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-10 14:32:54,104 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:32:54,104 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 220 [2024-11-10 14:32:54,104 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:32:54,675 INFO L124 PetriNetUnfolderBase]: 964/4937 cut-off events. [2024-11-10 14:32:54,675 INFO L125 PetriNetUnfolderBase]: For 57/57 co-relation queries the response was YES. [2024-11-10 14:32:54,684 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6602 conditions, 4937 events. 964/4937 cut-off events. For 57/57 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 47182 event pairs, 418 based on Foata normal form. 1146/5597 useless extension candidates. Maximal degree in co-relation 2358. Up to 1208 conditions per place. [2024-11-10 14:32:54,698 INFO L140 encePairwiseOnDemand]: 197/220 looper letters, 62 selfloop transitions, 5 changer transitions 0/230 dead transitions. [2024-11-10 14:32:54,698 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 230 transitions, 610 flow [2024-11-10 14:32:54,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 14:32:54,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 14:32:54,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1107 transitions. [2024-11-10 14:32:54,700 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8386363636363636 [2024-11-10 14:32:54,700 INFO L175 Difference]: Start difference. First operand has 204 places, 220 transitions, 456 flow. Second operand 6 states and 1107 transitions. [2024-11-10 14:32:54,701 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 204 places, 230 transitions, 610 flow [2024-11-10 14:32:54,702 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 230 transitions, 610 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 14:32:54,704 INFO L231 Difference]: Finished difference. Result has 204 places, 198 transitions, 422 flow [2024-11-10 14:32:54,705 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=220, PETRI_DIFFERENCE_MINUEND_FLOW=412, PETRI_DIFFERENCE_MINUEND_PLACES=199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=198, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=193, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=422, PETRI_PLACES=204, PETRI_TRANSITIONS=198} [2024-11-10 14:32:54,705 INFO L277 CegarLoopForPetriNet]: 204 programPoint places, 0 predicate places. [2024-11-10 14:32:54,705 INFO L471 AbstractCegarLoop]: Abstraction has has 204 places, 198 transitions, 422 flow [2024-11-10 14:32:54,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 166.5) internal successors, (999), 6 states have internal predecessors, (999), 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-10 14:32:54,706 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:32:54,706 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-10 14:32:54,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 14:32:54,706 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2024-11-10 14:32:54,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:32:54,707 INFO L85 PathProgramCache]: Analyzing trace with hash -2006269707, now seen corresponding path program 1 times [2024-11-10 14:32:54,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:32:54,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307603109] [2024-11-10 14:32:54,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:32:54,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:32:54,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:32:54,737 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-10 14:32:54,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:32:54,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307603109] [2024-11-10 14:32:54,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307603109] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:32:54,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:32:54,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:32:54,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791346793] [2024-11-10 14:32:54,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:32:54,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:32:54,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:32:54,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:32:54,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:32:54,760 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 220 [2024-11-10 14:32:54,761 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 198 transitions, 422 flow. Second operand has 3 states, 3 states have (on average 170.66666666666666) internal successors, (512), 3 states have internal predecessors, (512), 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-10 14:32:54,761 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:32:54,761 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 220 [2024-11-10 14:32:54,761 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:32:55,622 INFO L124 PetriNetUnfolderBase]: 2103/8959 cut-off events. [2024-11-10 14:32:55,623 INFO L125 PetriNetUnfolderBase]: For 277/492 co-relation queries the response was YES. [2024-11-10 14:32:55,642 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12483 conditions, 8959 events. 2103/8959 cut-off events. For 277/492 co-relation queries the response was YES. Maximal size of possible extension queue 200. Compared 89571 event pairs, 747 based on Foata normal form. 8/8134 useless extension candidates. Maximal degree in co-relation 11204. Up to 2127 conditions per place. [2024-11-10 14:32:55,669 INFO L140 encePairwiseOnDemand]: 208/220 looper letters, 45 selfloop transitions, 8 changer transitions 0/219 dead transitions. [2024-11-10 14:32:55,669 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 219 transitions, 581 flow [2024-11-10 14:32:55,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:32:55,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:32:55,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 564 transitions. [2024-11-10 14:32:55,671 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8545454545454545 [2024-11-10 14:32:55,671 INFO L175 Difference]: Start difference. First operand has 204 places, 198 transitions, 422 flow. Second operand 3 states and 564 transitions. [2024-11-10 14:32:55,671 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 204 places, 219 transitions, 581 flow [2024-11-10 14:32:55,673 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 219 transitions, 571 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-10 14:32:55,675 INFO L231 Difference]: Finished difference. Result has 201 places, 202 transitions, 468 flow [2024-11-10 14:32:55,676 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=220, PETRI_DIFFERENCE_MINUEND_FLOW=408, PETRI_DIFFERENCE_MINUEND_PLACES=197, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=196, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=188, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=468, PETRI_PLACES=201, PETRI_TRANSITIONS=202} [2024-11-10 14:32:55,676 INFO L277 CegarLoopForPetriNet]: 204 programPoint places, -3 predicate places. [2024-11-10 14:32:55,677 INFO L471 AbstractCegarLoop]: Abstraction has has 201 places, 202 transitions, 468 flow [2024-11-10 14:32:55,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 170.66666666666666) internal successors, (512), 3 states have internal predecessors, (512), 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-10 14:32:55,677 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:32:55,677 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-10 14:32:55,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 14:32:55,678 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2024-11-10 14:32:55,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:32:55,678 INFO L85 PathProgramCache]: Analyzing trace with hash 708329995, now seen corresponding path program 1 times [2024-11-10 14:32:55,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:32:55,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11901423] [2024-11-10 14:32:55,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:32:55,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:32:55,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:32:55,720 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-10 14:32:55,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:32:55,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11901423] [2024-11-10 14:32:55,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11901423] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:32:55,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:32:55,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 14:32:55,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100293064] [2024-11-10 14:32:55,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:32:55,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:32:55,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:32:55,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:32:55,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:32:55,741 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 220 [2024-11-10 14:32:55,741 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 202 transitions, 468 flow. Second operand has 3 states, 3 states have (on average 178.33333333333334) internal successors, (535), 3 states have internal predecessors, (535), 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-10 14:32:55,742 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:32:55,742 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 220 [2024-11-10 14:32:55,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:32:56,478 INFO L124 PetriNetUnfolderBase]: 1320/7895 cut-off events. [2024-11-10 14:32:56,479 INFO L125 PetriNetUnfolderBase]: For 412/458 co-relation queries the response was YES. [2024-11-10 14:32:56,500 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10705 conditions, 7895 events. 1320/7895 cut-off events. For 412/458 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 81119 event pairs, 566 based on Foata normal form. 1/7236 useless extension candidates. Maximal degree in co-relation 4586. Up to 1811 conditions per place. [2024-11-10 14:32:56,523 INFO L140 encePairwiseOnDemand]: 217/220 looper letters, 27 selfloop transitions, 2 changer transitions 0/207 dead transitions. [2024-11-10 14:32:56,523 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 207 transitions, 536 flow [2024-11-10 14:32:56,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:32:56,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:32:56,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 561 transitions. [2024-11-10 14:32:56,525 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.85 [2024-11-10 14:32:56,525 INFO L175 Difference]: Start difference. First operand has 201 places, 202 transitions, 468 flow. Second operand 3 states and 561 transitions. [2024-11-10 14:32:56,525 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 207 transitions, 536 flow [2024-11-10 14:32:56,530 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 201 places, 207 transitions, 520 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:32:56,532 INFO L231 Difference]: Finished difference. Result has 202 places, 203 transitions, 464 flow [2024-11-10 14:32:56,533 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=220, PETRI_DIFFERENCE_MINUEND_FLOW=452, PETRI_DIFFERENCE_MINUEND_PLACES=199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=202, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=200, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=464, PETRI_PLACES=202, PETRI_TRANSITIONS=203} [2024-11-10 14:32:56,534 INFO L277 CegarLoopForPetriNet]: 204 programPoint places, -2 predicate places. [2024-11-10 14:32:56,535 INFO L471 AbstractCegarLoop]: Abstraction has has 202 places, 203 transitions, 464 flow [2024-11-10 14:32:56,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 178.33333333333334) internal successors, (535), 3 states have internal predecessors, (535), 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-10 14:32:56,535 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:32:56,535 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:32:56,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 14:32:56,536 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2024-11-10 14:32:56,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:32:56,536 INFO L85 PathProgramCache]: Analyzing trace with hash 404228100, now seen corresponding path program 1 times [2024-11-10 14:32:56,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:32:56,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921845624] [2024-11-10 14:32:56,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:32:56,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:32:56,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:32:56,603 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:32:56,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:32:56,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921845624] [2024-11-10 14:32:56,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921845624] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 14:32:56,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1397738358] [2024-11-10 14:32:56,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:32:56,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 14:32:56,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 14:32:56,606 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 14:32:56,607 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-10 14:32:56,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:32:56,693 INFO L255 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-10 14:32:56,695 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 14:32:56,720 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 14:32:56,724 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 14:32:56,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1397738358] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:32:56,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 14:32:56,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2024-11-10 14:32:56,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213743479] [2024-11-10 14:32:56,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:32:56,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:32:56,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:32:56,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:32:56,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-10 14:32:56,741 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 220 [2024-11-10 14:32:56,742 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 203 transitions, 464 flow. Second operand has 3 states, 3 states have (on average 179.0) internal successors, (537), 3 states have internal predecessors, (537), 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-10 14:32:56,743 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:32:56,743 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 220 [2024-11-10 14:32:56,743 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:32:58,024 INFO L124 PetriNetUnfolderBase]: 2343/13610 cut-off events. [2024-11-10 14:32:58,025 INFO L125 PetriNetUnfolderBase]: For 117/117 co-relation queries the response was YES. [2024-11-10 14:32:58,077 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18112 conditions, 13610 events. 2343/13610 cut-off events. For 117/117 co-relation queries the response was YES. Maximal size of possible extension queue 287. Compared 160262 event pairs, 1363 based on Foata normal form. 36/12504 useless extension candidates. Maximal degree in co-relation 18053. Up to 2189 conditions per place. [2024-11-10 14:32:58,220 INFO L140 encePairwiseOnDemand]: 217/220 looper letters, 37 selfloop transitions, 2 changer transitions 0/218 dead transitions. [2024-11-10 14:32:58,220 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 218 transitions, 572 flow [2024-11-10 14:32:58,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:32:58,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:32:58,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 571 transitions. [2024-11-10 14:32:58,225 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8651515151515151 [2024-11-10 14:32:58,225 INFO L175 Difference]: Start difference. First operand has 202 places, 203 transitions, 464 flow. Second operand 3 states and 571 transitions. [2024-11-10 14:32:58,225 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 204 places, 218 transitions, 572 flow [2024-11-10 14:32:58,226 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 218 transitions, 570 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-10 14:32:58,232 INFO L231 Difference]: Finished difference. Result has 204 places, 204 transitions, 474 flow [2024-11-10 14:32:58,233 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=220, PETRI_DIFFERENCE_MINUEND_FLOW=462, PETRI_DIFFERENCE_MINUEND_PLACES=201, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=203, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=201, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=474, PETRI_PLACES=204, PETRI_TRANSITIONS=204} [2024-11-10 14:32:58,233 INFO L277 CegarLoopForPetriNet]: 204 programPoint places, 0 predicate places. [2024-11-10 14:32:58,233 INFO L471 AbstractCegarLoop]: Abstraction has has 204 places, 204 transitions, 474 flow [2024-11-10 14:32:58,234 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 179.0) internal successors, (537), 3 states have internal predecessors, (537), 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-10 14:32:58,234 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:32:58,234 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:32:58,251 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-10 14:32:58,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 14:32:58,438 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2024-11-10 14:32:58,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:32:58,439 INFO L85 PathProgramCache]: Analyzing trace with hash 2065620780, now seen corresponding path program 1 times [2024-11-10 14:32:58,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:32:58,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298605821] [2024-11-10 14:32:58,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:32:58,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:32:58,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 14:32:58,513 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 14:32:58,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 14:32:58,537 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 14:32:58,538 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 14:32:58,538 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 10 remaining) [2024-11-10 14:32:58,539 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (8 of 10 remaining) [2024-11-10 14:32:58,539 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (7 of 10 remaining) [2024-11-10 14:32:58,539 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (6 of 10 remaining) [2024-11-10 14:32:58,539 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (5 of 10 remaining) [2024-11-10 14:32:58,539 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (4 of 10 remaining) [2024-11-10 14:32:58,539 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (3 of 10 remaining) [2024-11-10 14:32:58,539 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (2 of 10 remaining) [2024-11-10 14:32:58,539 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (1 of 10 remaining) [2024-11-10 14:32:58,539 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (0 of 10 remaining) [2024-11-10 14:32:58,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 14:32:58,539 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-11-10 14:32:58,540 WARN L244 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-10 14:32:58,540 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-11-10 14:32:58,563 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-11-10 14:32:58,567 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 234 places, 253 transitions, 533 flow [2024-11-10 14:32:58,611 INFO L124 PetriNetUnfolderBase]: 68/703 cut-off events. [2024-11-10 14:32:58,611 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2024-11-10 14:32:58,617 INFO L83 FinitePrefix]: Finished finitePrefix Result has 728 conditions, 703 events. 68/703 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 3071 event pairs, 1 based on Foata normal form. 0/600 useless extension candidates. Maximal degree in co-relation 487. Up to 16 conditions per place. [2024-11-10 14:32:58,617 INFO L82 GeneralOperation]: Start removeDead. Operand has 234 places, 253 transitions, 533 flow [2024-11-10 14:32:58,621 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 234 places, 253 transitions, 533 flow [2024-11-10 14:32:58,622 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 14:32:58,624 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;@1359713, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 14:32:58,624 INFO L334 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2024-11-10 14:32:58,626 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-10 14:32:58,628 INFO L124 PetriNetUnfolderBase]: 2/59 cut-off events. [2024-11-10 14:32:58,628 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 14:32:58,629 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:32:58,629 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:32:58,629 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-11-10 14:32:58,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:32:58,629 INFO L85 PathProgramCache]: Analyzing trace with hash 1178098988, now seen corresponding path program 1 times [2024-11-10 14:32:58,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:32:58,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836934842] [2024-11-10 14:32:58,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:32:58,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:32:58,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:32:58,808 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-10 14:32:58,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:32:58,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836934842] [2024-11-10 14:32:58,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836934842] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:32:58,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:32:58,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 14:32:58,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791025] [2024-11-10 14:32:58,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:32:58,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 14:32:58,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:32:58,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 14:32:58,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-10 14:32:58,873 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 187 out of 253 [2024-11-10 14:32:58,874 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 234 places, 253 transitions, 533 flow. Second operand has 6 states, 6 states have (on average 188.5) internal successors, (1131), 6 states have internal predecessors, (1131), 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-10 14:32:58,875 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:32:58,875 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 187 of 253 [2024-11-10 14:32:58,875 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:33:01,446 INFO L124 PetriNetUnfolderBase]: 8120/27945 cut-off events. [2024-11-10 14:33:01,447 INFO L125 PetriNetUnfolderBase]: For 539/539 co-relation queries the response was YES. [2024-11-10 14:33:01,530 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39680 conditions, 27945 events. 8120/27945 cut-off events. For 539/539 co-relation queries the response was YES. Maximal size of possible extension queue 725. Compared 341040 event pairs, 913 based on Foata normal form. 9185/35317 useless extension candidates. Maximal degree in co-relation 6446. Up to 8631 conditions per place. [2024-11-10 14:33:01,728 INFO L140 encePairwiseOnDemand]: 226/253 looper letters, 84 selfloop transitions, 5 changer transitions 0/273 dead transitions. [2024-11-10 14:33:01,729 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 232 places, 273 transitions, 751 flow [2024-11-10 14:33:01,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 14:33:01,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 14:33:01,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1281 transitions. [2024-11-10 14:33:01,732 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8438735177865613 [2024-11-10 14:33:01,732 INFO L175 Difference]: Start difference. First operand has 234 places, 253 transitions, 533 flow. Second operand 6 states and 1281 transitions. [2024-11-10 14:33:01,732 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 232 places, 273 transitions, 751 flow [2024-11-10 14:33:01,733 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 232 places, 273 transitions, 751 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 14:33:01,736 INFO L231 Difference]: Finished difference. Result has 232 places, 225 transitions, 487 flow [2024-11-10 14:33:01,737 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=253, PETRI_DIFFERENCE_MINUEND_FLOW=477, PETRI_DIFFERENCE_MINUEND_PLACES=227, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=225, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=220, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=487, PETRI_PLACES=232, PETRI_TRANSITIONS=225} [2024-11-10 14:33:01,737 INFO L277 CegarLoopForPetriNet]: 234 programPoint places, -2 predicate places. [2024-11-10 14:33:01,738 INFO L471 AbstractCegarLoop]: Abstraction has has 232 places, 225 transitions, 487 flow [2024-11-10 14:33:01,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 188.5) internal successors, (1131), 6 states have internal predecessors, (1131), 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-10 14:33:01,738 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:33:01,739 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-10 14:33:01,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 14:33:01,739 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-11-10 14:33:01,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:33:01,739 INFO L85 PathProgramCache]: Analyzing trace with hash -1561010348, now seen corresponding path program 1 times [2024-11-10 14:33:01,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:33:01,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824918159] [2024-11-10 14:33:01,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:33:01,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:33:01,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:33:01,769 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-10 14:33:01,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:33:01,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824918159] [2024-11-10 14:33:01,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824918159] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:33:01,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:33:01,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:33:01,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543723358] [2024-11-10 14:33:01,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:33:01,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:33:01,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:33:01,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:33:01,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:33:01,791 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 188 out of 253 [2024-11-10 14:33:01,793 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 232 places, 225 transitions, 487 flow. Second operand has 3 states, 3 states have (on average 189.66666666666666) internal successors, (569), 3 states have internal predecessors, (569), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:33:01,793 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:33:01,793 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 188 of 253 [2024-11-10 14:33:01,793 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:33:10,246 INFO L124 PetriNetUnfolderBase]: 27267/84086 cut-off events. [2024-11-10 14:33:10,247 INFO L125 PetriNetUnfolderBase]: For 2355/5451 co-relation queries the response was YES. [2024-11-10 14:33:10,623 INFO L83 FinitePrefix]: Finished finitePrefix Result has 123724 conditions, 84086 events. 27267/84086 cut-off events. For 2355/5451 co-relation queries the response was YES. Maximal size of possible extension queue 1702. Compared 1129108 event pairs, 10774 based on Foata normal form. 32/76137 useless extension candidates. Maximal degree in co-relation 110936. Up to 25188 conditions per place. [2024-11-10 14:33:11,047 INFO L140 encePairwiseOnDemand]: 238/253 looper letters, 60 selfloop transitions, 10 changer transitions 0/254 dead transitions. [2024-11-10 14:33:11,047 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 232 places, 254 transitions, 706 flow [2024-11-10 14:33:11,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:33:11,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:33:11,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 639 transitions. [2024-11-10 14:33:11,052 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.841897233201581 [2024-11-10 14:33:11,052 INFO L175 Difference]: Start difference. First operand has 232 places, 225 transitions, 487 flow. Second operand 3 states and 639 transitions. [2024-11-10 14:33:11,052 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 232 places, 254 transitions, 706 flow [2024-11-10 14:33:11,057 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 227 places, 254 transitions, 696 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-10 14:33:11,060 INFO L231 Difference]: Finished difference. Result has 229 places, 231 transitions, 551 flow [2024-11-10 14:33:11,060 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=253, PETRI_DIFFERENCE_MINUEND_FLOW=473, PETRI_DIFFERENCE_MINUEND_PLACES=225, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=223, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=213, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=551, PETRI_PLACES=229, PETRI_TRANSITIONS=231} [2024-11-10 14:33:11,061 INFO L277 CegarLoopForPetriNet]: 234 programPoint places, -5 predicate places. [2024-11-10 14:33:11,061 INFO L471 AbstractCegarLoop]: Abstraction has has 229 places, 231 transitions, 551 flow [2024-11-10 14:33:11,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 189.66666666666666) internal successors, (569), 3 states have internal predecessors, (569), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:33:11,062 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:33:11,062 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-10 14:33:11,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-10 14:33:11,063 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-11-10 14:33:11,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:33:11,064 INFO L85 PathProgramCache]: Analyzing trace with hash 2111560904, now seen corresponding path program 1 times [2024-11-10 14:33:11,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:33:11,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842844337] [2024-11-10 14:33:11,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:33:11,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:33:11,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:33:11,092 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-10 14:33:11,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:33:11,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842844337] [2024-11-10 14:33:11,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842844337] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:33:11,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:33:11,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 14:33:11,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139873998] [2024-11-10 14:33:11,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:33:11,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:33:11,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:33:11,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:33:11,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:33:11,112 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 199 out of 253 [2024-11-10 14:33:11,113 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 231 transitions, 551 flow. Second operand has 3 states, 3 states have (on average 200.33333333333334) internal successors, (601), 3 states have internal predecessors, (601), 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-10 14:33:11,113 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:33:11,113 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 199 of 253 [2024-11-10 14:33:11,113 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:33:18,656 INFO L124 PetriNetUnfolderBase]: 16338/71074 cut-off events. [2024-11-10 14:33:18,656 INFO L125 PetriNetUnfolderBase]: For 3897/5164 co-relation queries the response was YES. [2024-11-10 14:33:19,022 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100173 conditions, 71074 events. 16338/71074 cut-off events. For 3897/5164 co-relation queries the response was YES. Maximal size of possible extension queue 1308. Compared 1032885 event pairs, 12212 based on Foata normal form. 1/64579 useless extension candidates. Maximal degree in co-relation 76389. Up to 19482 conditions per place. [2024-11-10 14:33:19,222 INFO L140 encePairwiseOnDemand]: 250/253 looper letters, 33 selfloop transitions, 2 changer transitions 0/236 dead transitions. [2024-11-10 14:33:19,223 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 236 transitions, 631 flow [2024-11-10 14:33:19,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:33:19,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:33:19,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 633 transitions. [2024-11-10 14:33:19,224 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.83399209486166 [2024-11-10 14:33:19,224 INFO L175 Difference]: Start difference. First operand has 229 places, 231 transitions, 551 flow. Second operand 3 states and 633 transitions. [2024-11-10 14:33:19,224 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 231 places, 236 transitions, 631 flow [2024-11-10 14:33:19,245 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 229 places, 236 transitions, 611 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:33:19,247 INFO L231 Difference]: Finished difference. Result has 230 places, 232 transitions, 543 flow [2024-11-10 14:33:19,248 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=253, PETRI_DIFFERENCE_MINUEND_FLOW=531, PETRI_DIFFERENCE_MINUEND_PLACES=227, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=231, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=229, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=543, PETRI_PLACES=230, PETRI_TRANSITIONS=232} [2024-11-10 14:33:19,249 INFO L277 CegarLoopForPetriNet]: 234 programPoint places, -4 predicate places. [2024-11-10 14:33:19,249 INFO L471 AbstractCegarLoop]: Abstraction has has 230 places, 232 transitions, 543 flow [2024-11-10 14:33:19,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 200.33333333333334) internal successors, (601), 3 states have internal predecessors, (601), 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-10 14:33:19,250 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:33:19,250 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:33:19,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-10 14:33:19,250 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-11-10 14:33:19,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:33:19,250 INFO L85 PathProgramCache]: Analyzing trace with hash 362325603, now seen corresponding path program 1 times [2024-11-10 14:33:19,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:33:19,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004663086] [2024-11-10 14:33:19,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:33:19,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:33:19,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:33:19,316 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:33:19,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:33:19,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004663086] [2024-11-10 14:33:19,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004663086] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 14:33:19,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1442245239] [2024-11-10 14:33:19,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:33:19,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 14:33:19,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 14:33:19,319 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 14:33:19,321 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-10 14:33:19,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:33:19,404 INFO L255 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-10 14:33:19,405 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 14:33:19,419 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 14:33:19,420 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 14:33:19,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1442245239] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:33:19,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 14:33:19,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2024-11-10 14:33:19,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126664537] [2024-11-10 14:33:19,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:33:19,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:33:19,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:33:19,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:33:19,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-10 14:33:19,431 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 199 out of 253 [2024-11-10 14:33:19,432 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 230 places, 232 transitions, 543 flow. Second operand has 3 states, 3 states have (on average 201.0) internal successors, (603), 3 states have internal predecessors, (603), 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-10 14:33:19,432 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:33:19,432 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 199 of 253 [2024-11-10 14:33:19,432 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:33:31,107 INFO L124 PetriNetUnfolderBase]: 28232/114640 cut-off events. [2024-11-10 14:33:31,107 INFO L125 PetriNetUnfolderBase]: For 1400/1400 co-relation queries the response was YES. [2024-11-10 14:33:32,072 INFO L83 FinitePrefix]: Finished finitePrefix Result has 160840 conditions, 114640 events. 28232/114640 cut-off events. For 1400/1400 co-relation queries the response was YES. Maximal size of possible extension queue 2365. Compared 1777988 event pairs, 17335 based on Foata normal form. 247/105201 useless extension candidates. Maximal degree in co-relation 160780. Up to 22843 conditions per place. [2024-11-10 14:33:32,436 INFO L140 encePairwiseOnDemand]: 250/253 looper letters, 47 selfloop transitions, 2 changer transitions 0/251 dead transitions. [2024-11-10 14:33:32,436 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 232 places, 251 transitions, 679 flow [2024-11-10 14:33:32,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:33:32,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:33:32,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 647 transitions. [2024-11-10 14:33:32,438 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.852437417654809 [2024-11-10 14:33:32,438 INFO L175 Difference]: Start difference. First operand has 230 places, 232 transitions, 543 flow. Second operand 3 states and 647 transitions. [2024-11-10 14:33:32,438 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 232 places, 251 transitions, 679 flow [2024-11-10 14:33:32,440 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 231 places, 251 transitions, 677 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-10 14:33:32,442 INFO L231 Difference]: Finished difference. Result has 232 places, 233 transitions, 553 flow [2024-11-10 14:33:32,443 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=253, PETRI_DIFFERENCE_MINUEND_FLOW=541, PETRI_DIFFERENCE_MINUEND_PLACES=229, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=232, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=230, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=553, PETRI_PLACES=232, PETRI_TRANSITIONS=233} [2024-11-10 14:33:32,443 INFO L277 CegarLoopForPetriNet]: 234 programPoint places, -2 predicate places. [2024-11-10 14:33:32,443 INFO L471 AbstractCegarLoop]: Abstraction has has 232 places, 233 transitions, 553 flow [2024-11-10 14:33:32,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 201.0) internal successors, (603), 3 states have internal predecessors, (603), 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-10 14:33:32,444 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:33:32,444 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:33:32,460 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-10 14:33:32,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-10 14:33:32,645 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-11-10 14:33:32,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:33:32,645 INFO L85 PathProgramCache]: Analyzing trace with hash -1963608438, now seen corresponding path program 1 times [2024-11-10 14:33:32,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:33:32,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623565502] [2024-11-10 14:33:32,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:33:32,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:33:32,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:33:32,720 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 14:33:32,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:33:32,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623565502] [2024-11-10 14:33:32,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623565502] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 14:33:32,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [592229580] [2024-11-10 14:33:32,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:33:32,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 14:33:32,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 14:33:32,722 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 14:33:32,723 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-10 14:33:32,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:33:32,803 INFO L255 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 14:33:32,804 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 14:33:32,852 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 14:33:32,853 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 14:33:32,890 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 14:33:32,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [592229580] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 14:33:32,890 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 14:33:32,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2024-11-10 14:33:32,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561203154] [2024-11-10 14:33:32,890 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 14:33:32,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 14:33:32,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:33:32,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 14:33:32,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-10 14:33:32,969 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 196 out of 253 [2024-11-10 14:33:32,971 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 232 places, 233 transitions, 553 flow. Second operand has 10 states, 10 states have (on average 198.1) internal successors, (1981), 10 states have internal predecessors, (1981), 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-10 14:33:32,971 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:33:32,971 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 196 of 253 [2024-11-10 14:33:32,971 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand