./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/06-symbeq_06-tricky_address1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/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.6.800.v20240513-1750.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/06-symbeq_06-tricky_address1.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 99f794c04b6feffb38c1e5c415a278bf34dda5287d389b184a9a7d818ab0b70e --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 21:57:31,258 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 21:57:31,321 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-08 21:57:31,326 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 21:57:31,326 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 21:57:31,350 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 21:57:31,351 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 21:57:31,351 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 21:57:31,351 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 21:57:31,351 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 21:57:31,351 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 21:57:31,351 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 21:57:31,352 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 21:57:31,352 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 21:57:31,352 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 21:57:31,353 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 21:57:31,353 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 21:57:31,353 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 21:57:31,353 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 21:57:31,353 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 21:57:31,353 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 21:57:31,353 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 21:57:31,353 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-08 21:57:31,353 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-08 21:57:31,353 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 21:57:31,353 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 21:57:31,353 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 21:57:31,353 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 21:57:31,353 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 21:57:31,353 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 21:57:31,353 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 21:57:31,353 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 21:57:31,353 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 21:57:31,353 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 21:57:31,353 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 21:57:31,354 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 21:57:31,354 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 21:57:31,354 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 21:57:31,354 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 21:57:31,354 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 21:57:31,354 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 21:57:31,354 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 21:57:31,354 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> 99f794c04b6feffb38c1e5c415a278bf34dda5287d389b184a9a7d818ab0b70e [2025-03-08 21:57:31,600 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 21:57:31,609 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 21:57:31,612 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 21:57:31,613 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 21:57:31,613 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 21:57:31,614 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/06-symbeq_06-tricky_address1.i [2025-03-08 21:57:32,748 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f9a8b286c/ab6dcd521d9045bcb8dadd3cd611433f/FLAG63b67d54d [2025-03-08 21:57:32,982 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 21:57:32,983 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/06-symbeq_06-tricky_address1.i [2025-03-08 21:57:32,995 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f9a8b286c/ab6dcd521d9045bcb8dadd3cd611433f/FLAG63b67d54d [2025-03-08 21:57:33,006 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f9a8b286c/ab6dcd521d9045bcb8dadd3cd611433f [2025-03-08 21:57:33,007 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 21:57:33,009 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 21:57:33,011 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 21:57:33,011 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 21:57:33,014 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 21:57:33,014 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 09:57:33" (1/1) ... [2025-03-08 21:57:33,016 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63913881 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:57:33, skipping insertion in model container [2025-03-08 21:57:33,016 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 09:57:33" (1/1) ... [2025-03-08 21:57:33,050 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 21:57:33,284 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 21:57:33,308 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 21:57:33,353 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 21:57:33,396 INFO L204 MainTranslator]: Completed translation [2025-03-08 21:57:33,397 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:57:33 WrapperNode [2025-03-08 21:57:33,397 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 21:57:33,398 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 21:57:33,398 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 21:57:33,398 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 21:57:33,403 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:57:33" (1/1) ... [2025-03-08 21:57:33,415 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:57:33" (1/1) ... [2025-03-08 21:57:33,441 INFO L138 Inliner]: procedures = 265, calls = 74, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 148 [2025-03-08 21:57:33,444 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 21:57:33,445 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 21:57:33,445 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 21:57:33,445 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 21:57:33,450 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:57:33" (1/1) ... [2025-03-08 21:57:33,450 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:57:33" (1/1) ... [2025-03-08 21:57:33,453 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:57:33" (1/1) ... [2025-03-08 21:57:33,457 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:57:33" (1/1) ... [2025-03-08 21:57:33,462 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:57:33" (1/1) ... [2025-03-08 21:57:33,463 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:57:33" (1/1) ... [2025-03-08 21:57:33,468 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:57:33" (1/1) ... [2025-03-08 21:57:33,469 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:57:33" (1/1) ... [2025-03-08 21:57:33,470 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 21:57:33,471 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 21:57:33,471 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 21:57:33,471 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 21:57:33,476 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:57:33" (1/1) ... [2025-03-08 21:57:33,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 21:57:33,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 21:57:33,504 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) [2025-03-08 21:57:33,508 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 [2025-03-08 21:57:33,525 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-08 21:57:33,525 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-08 21:57:33,526 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-08 21:57:33,526 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-08 21:57:33,526 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 21:57:33,526 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-03-08 21:57:33,526 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-03-08 21:57:33,526 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-08 21:57:33,526 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 21:57:33,526 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 21:57:33,527 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-08 21:57:33,633 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 21:57:33,635 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 21:57:33,897 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-08 21:57:33,897 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 21:57:33,912 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 21:57:33,912 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 21:57:33,912 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:57:33 BoogieIcfgContainer [2025-03-08 21:57:33,912 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 21:57:33,914 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 21:57:33,914 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 21:57:33,917 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 21:57:33,917 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 09:57:33" (1/3) ... [2025-03-08 21:57:33,918 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ddfbdc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 09:57:33, skipping insertion in model container [2025-03-08 21:57:33,918 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:57:33" (2/3) ... [2025-03-08 21:57:33,918 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ddfbdc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 09:57:33, skipping insertion in model container [2025-03-08 21:57:33,918 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:57:33" (3/3) ... [2025-03-08 21:57:33,919 INFO L128 eAbstractionObserver]: Analyzing ICFG 06-symbeq_06-tricky_address1.i [2025-03-08 21:57:33,932 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 21:57:33,933 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 06-symbeq_06-tricky_address1.i that has 2 procedures, 158 locations, 1 initial locations, 1 loop locations, and 4 error locations. [2025-03-08 21:57:33,934 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-08 21:57:33,990 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-08 21:57:34,020 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 161 places, 160 transitions, 324 flow [2025-03-08 21:57:34,091 INFO L124 PetriNetUnfolderBase]: 3/159 cut-off events. [2025-03-08 21:57:34,093 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-08 21:57:34,098 INFO L83 FinitePrefix]: Finished finitePrefix Result has 163 conditions, 159 events. 3/159 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 83 event pairs, 0 based on Foata normal form. 0/152 useless extension candidates. Maximal degree in co-relation 90. Up to 2 conditions per place. [2025-03-08 21:57:34,100 INFO L82 GeneralOperation]: Start removeDead. Operand has 161 places, 160 transitions, 324 flow [2025-03-08 21:57:34,104 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 160 places, 159 transitions, 321 flow [2025-03-08 21:57:34,113 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 21:57:34,125 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;@300c5801, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 21:57:34,125 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-03-08 21:57:34,145 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-08 21:57:34,147 INFO L124 PetriNetUnfolderBase]: 3/112 cut-off events. [2025-03-08 21:57:34,147 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-08 21:57:34,147 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:57:34,148 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:57:34,148 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-08 21:57:34,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:57:34,153 INFO L85 PathProgramCache]: Analyzing trace with hash 1531881620, now seen corresponding path program 1 times [2025-03-08 21:57:34,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:57:34,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253623158] [2025-03-08 21:57:34,158 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:57:34,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:57:34,222 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-08 21:57:34,273 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-08 21:57:34,273 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:57:34,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:57:34,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:57:34,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:57:34,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253623158] [2025-03-08 21:57:34,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253623158] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:57:34,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:57:34,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 21:57:34,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831738949] [2025-03-08 21:57:34,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:57:34,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 21:57:34,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:57:34,511 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 21:57:34,512 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 21:57:34,531 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 160 [2025-03-08 21:57:34,534 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 159 transitions, 321 flow. Second operand has 3 states, 3 states have (on average 149.0) internal successors, (447), 3 states have internal predecessors, (447), 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) [2025-03-08 21:57:34,534 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:57:34,534 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 160 [2025-03-08 21:57:34,539 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:57:34,604 INFO L124 PetriNetUnfolderBase]: 7/221 cut-off events. [2025-03-08 21:57:34,604 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-08 21:57:34,605 INFO L83 FinitePrefix]: Finished finitePrefix Result has 250 conditions, 221 events. 7/221 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 323 event pairs, 6 based on Foata normal form. 5/214 useless extension candidates. Maximal degree in co-relation 144. Up to 24 conditions per place. [2025-03-08 21:57:34,606 INFO L140 encePairwiseOnDemand]: 155/160 looper letters, 10 selfloop transitions, 2 changer transitions 1/158 dead transitions. [2025-03-08 21:57:34,607 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 158 transitions, 343 flow [2025-03-08 21:57:34,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 21:57:34,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 21:57:34,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 456 transitions. [2025-03-08 21:57:34,617 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.95 [2025-03-08 21:57:34,618 INFO L175 Difference]: Start difference. First operand has 160 places, 159 transitions, 321 flow. Second operand 3 states and 456 transitions. [2025-03-08 21:57:34,619 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 158 transitions, 343 flow [2025-03-08 21:57:34,622 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 158 transitions, 342 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 21:57:34,626 INFO L231 Difference]: Finished difference. Result has 162 places, 157 transitions, 326 flow [2025-03-08 21:57:34,628 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=160, PETRI_DIFFERENCE_MINUEND_FLOW=316, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=155, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=326, PETRI_PLACES=162, PETRI_TRANSITIONS=157} [2025-03-08 21:57:34,632 INFO L279 CegarLoopForPetriNet]: 160 programPoint places, 2 predicate places. [2025-03-08 21:57:34,633 INFO L471 AbstractCegarLoop]: Abstraction has has 162 places, 157 transitions, 326 flow [2025-03-08 21:57:34,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 149.0) internal successors, (447), 3 states have internal predecessors, (447), 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) [2025-03-08 21:57:34,633 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:57:34,633 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:57:34,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 21:57:34,634 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-08 21:57:34,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:57:34,635 INFO L85 PathProgramCache]: Analyzing trace with hash -1288320965, now seen corresponding path program 1 times [2025-03-08 21:57:34,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:57:34,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185250047] [2025-03-08 21:57:34,635 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:57:34,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:57:34,653 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-08 21:57:34,673 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-08 21:57:34,673 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:57:34,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:57:34,835 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:57:34,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:57:34,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185250047] [2025-03-08 21:57:34,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185250047] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 21:57:34,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1706069205] [2025-03-08 21:57:34,836 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:57:34,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 21:57:34,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 21:57:34,838 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) [2025-03-08 21:57:34,840 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 21:57:34,897 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-08 21:57:34,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-08 21:57:34,932 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:57:34,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:57:34,934 INFO L256 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 21:57:34,938 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 21:57:34,989 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:57:34,990 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 21:57:35,036 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:57:35,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1706069205] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 21:57:35,037 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 21:57:35,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-08 21:57:35,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436557067] [2025-03-08 21:57:35,037 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 21:57:35,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 21:57:35,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:57:35,039 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 21:57:35,039 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-08 21:57:35,063 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 160 [2025-03-08 21:57:35,065 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 157 transitions, 326 flow. Second operand has 10 states, 10 states have (on average 146.0) internal successors, (1460), 10 states have internal predecessors, (1460), 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) [2025-03-08 21:57:35,066 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:57:35,066 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 160 [2025-03-08 21:57:35,066 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:57:35,189 INFO L124 PetriNetUnfolderBase]: 7/227 cut-off events. [2025-03-08 21:57:35,189 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-08 21:57:35,190 INFO L83 FinitePrefix]: Finished finitePrefix Result has 274 conditions, 227 events. 7/227 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 318 event pairs, 6 based on Foata normal form. 2/218 useless extension candidates. Maximal degree in co-relation 191. Up to 24 conditions per place. [2025-03-08 21:57:35,191 INFO L140 encePairwiseOnDemand]: 154/160 looper letters, 14 selfloop transitions, 9 changer transitions 0/165 dead transitions. [2025-03-08 21:57:35,191 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 165 transitions, 390 flow [2025-03-08 21:57:35,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 21:57:35,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-08 21:57:35,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1321 transitions. [2025-03-08 21:57:35,197 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9173611111111111 [2025-03-08 21:57:35,197 INFO L175 Difference]: Start difference. First operand has 162 places, 157 transitions, 326 flow. Second operand 9 states and 1321 transitions. [2025-03-08 21:57:35,197 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 165 transitions, 390 flow [2025-03-08 21:57:35,198 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 165 transitions, 388 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 21:57:35,201 INFO L231 Difference]: Finished difference. Result has 171 places, 163 transitions, 374 flow [2025-03-08 21:57:35,201 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=160, PETRI_DIFFERENCE_MINUEND_FLOW=324, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=151, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=374, PETRI_PLACES=171, PETRI_TRANSITIONS=163} [2025-03-08 21:57:35,202 INFO L279 CegarLoopForPetriNet]: 160 programPoint places, 11 predicate places. [2025-03-08 21:57:35,203 INFO L471 AbstractCegarLoop]: Abstraction has has 171 places, 163 transitions, 374 flow [2025-03-08 21:57:35,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 146.0) internal successors, (1460), 10 states have internal predecessors, (1460), 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) [2025-03-08 21:57:35,204 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:57:35,204 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:57:35,213 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 21:57:35,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 21:57:35,409 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-08 21:57:35,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:57:35,410 INFO L85 PathProgramCache]: Analyzing trace with hash -320842789, now seen corresponding path program 2 times [2025-03-08 21:57:35,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:57:35,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284918232] [2025-03-08 21:57:35,410 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 21:57:35,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:57:35,422 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 109 statements into 2 equivalence classes. [2025-03-08 21:57:35,432 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 94 of 109 statements. [2025-03-08 21:57:35,432 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 21:57:35,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:57:35,963 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-08 21:57:35,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:57:35,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284918232] [2025-03-08 21:57:35,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284918232] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:57:35,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:57:35,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 21:57:35,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424630696] [2025-03-08 21:57:35,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:57:35,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 21:57:35,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:57:35,966 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 21:57:35,966 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 21:57:36,457 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 160 [2025-03-08 21:57:36,459 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 163 transitions, 374 flow. Second operand has 6 states, 6 states have (on average 135.66666666666666) internal successors, (814), 6 states have internal predecessors, (814), 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) [2025-03-08 21:57:36,459 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:57:36,459 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 160 [2025-03-08 21:57:36,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:57:36,657 INFO L124 PetriNetUnfolderBase]: 103/540 cut-off events. [2025-03-08 21:57:36,657 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-03-08 21:57:36,659 INFO L83 FinitePrefix]: Finished finitePrefix Result has 806 conditions, 540 events. 103/540 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 2314 event pairs, 40 based on Foata normal form. 0/503 useless extension candidates. Maximal degree in co-relation 693. Up to 184 conditions per place. [2025-03-08 21:57:36,661 INFO L140 encePairwiseOnDemand]: 149/160 looper letters, 31 selfloop transitions, 22 changer transitions 0/192 dead transitions. [2025-03-08 21:57:36,662 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 192 transitions, 538 flow [2025-03-08 21:57:36,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 21:57:36,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 21:57:36,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 858 transitions. [2025-03-08 21:57:36,667 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.89375 [2025-03-08 21:57:36,667 INFO L175 Difference]: Start difference. First operand has 171 places, 163 transitions, 374 flow. Second operand 6 states and 858 transitions. [2025-03-08 21:57:36,667 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 192 transitions, 538 flow [2025-03-08 21:57:36,668 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 192 transitions, 532 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-03-08 21:57:36,671 INFO L231 Difference]: Finished difference. Result has 180 places, 184 transitions, 518 flow [2025-03-08 21:57:36,671 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=160, PETRI_DIFFERENCE_MINUEND_FLOW=368, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=153, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=518, PETRI_PLACES=180, PETRI_TRANSITIONS=184} [2025-03-08 21:57:36,672 INFO L279 CegarLoopForPetriNet]: 160 programPoint places, 20 predicate places. [2025-03-08 21:57:36,672 INFO L471 AbstractCegarLoop]: Abstraction has has 180 places, 184 transitions, 518 flow [2025-03-08 21:57:36,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 135.66666666666666) internal successors, (814), 6 states have internal predecessors, (814), 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) [2025-03-08 21:57:36,672 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:57:36,673 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:57:36,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 21:57:36,673 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-08 21:57:36,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:57:36,674 INFO L85 PathProgramCache]: Analyzing trace with hash -78790998, now seen corresponding path program 1 times [2025-03-08 21:57:36,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:57:36,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918755272] [2025-03-08 21:57:36,676 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:57:36,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:57:36,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-08 21:57:36,708 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-08 21:57:36,709 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:57:36,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:57:36,846 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:57:36,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:57:36,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918755272] [2025-03-08 21:57:36,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918755272] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 21:57:36,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1112078253] [2025-03-08 21:57:36,847 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:57:36,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 21:57:36,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 21:57:36,853 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) [2025-03-08 21:57:36,855 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 21:57:36,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-08 21:57:36,937 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-08 21:57:36,937 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:57:36,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:57:36,940 INFO L256 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 21:57:36,942 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 21:57:36,995 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:57:36,996 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 21:57:37,092 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:57:37,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1112078253] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 21:57:37,093 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 21:57:37,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2025-03-08 21:57:37,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141462175] [2025-03-08 21:57:37,093 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 21:57:37,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-08 21:57:37,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:57:37,096 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-08 21:57:37,096 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-03-08 21:57:37,125 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 160 [2025-03-08 21:57:37,128 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 184 transitions, 518 flow. Second operand has 18 states, 18 states have (on average 146.0) internal successors, (2628), 18 states have internal predecessors, (2628), 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) [2025-03-08 21:57:37,128 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:57:37,128 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 160 [2025-03-08 21:57:37,128 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:57:37,341 INFO L124 PetriNetUnfolderBase]: 41/402 cut-off events. [2025-03-08 21:57:37,341 INFO L125 PetriNetUnfolderBase]: For 54/57 co-relation queries the response was YES. [2025-03-08 21:57:37,343 INFO L83 FinitePrefix]: Finished finitePrefix Result has 682 conditions, 402 events. 41/402 cut-off events. For 54/57 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1228 event pairs, 11 based on Foata normal form. 4/390 useless extension candidates. Maximal degree in co-relation 494. Up to 51 conditions per place. [2025-03-08 21:57:37,344 INFO L140 encePairwiseOnDemand]: 154/160 looper letters, 18 selfloop transitions, 21 changer transitions 0/202 dead transitions. [2025-03-08 21:57:37,344 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 202 transitions, 684 flow [2025-03-08 21:57:37,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-08 21:57:37,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-03-08 21:57:37,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 3067 transitions. [2025-03-08 21:57:37,350 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.912797619047619 [2025-03-08 21:57:37,350 INFO L175 Difference]: Start difference. First operand has 180 places, 184 transitions, 518 flow. Second operand 21 states and 3067 transitions. [2025-03-08 21:57:37,350 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 202 transitions, 684 flow [2025-03-08 21:57:37,353 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 202 transitions, 684 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-08 21:57:37,356 INFO L231 Difference]: Finished difference. Result has 205 places, 197 transitions, 648 flow [2025-03-08 21:57:37,357 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=160, PETRI_DIFFERENCE_MINUEND_FLOW=518, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=173, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=648, PETRI_PLACES=205, PETRI_TRANSITIONS=197} [2025-03-08 21:57:37,357 INFO L279 CegarLoopForPetriNet]: 160 programPoint places, 45 predicate places. [2025-03-08 21:57:37,357 INFO L471 AbstractCegarLoop]: Abstraction has has 205 places, 197 transitions, 648 flow [2025-03-08 21:57:37,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 146.0) internal successors, (2628), 18 states have internal predecessors, (2628), 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) [2025-03-08 21:57:37,359 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:57:37,359 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:57:37,366 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 21:57:37,560 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,SelfDestructingSolverStorable3 [2025-03-08 21:57:37,561 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-08 21:57:37,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:57:37,562 INFO L85 PathProgramCache]: Analyzing trace with hash -1783398934, now seen corresponding path program 2 times [2025-03-08 21:57:37,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:57:37,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662620458] [2025-03-08 21:57:37,562 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 21:57:37,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:57:37,575 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 137 statements into 2 equivalence classes. [2025-03-08 21:57:37,586 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 102 of 137 statements. [2025-03-08 21:57:37,587 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 21:57:37,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:57:37,903 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-08 21:57:37,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:57:37,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662620458] [2025-03-08 21:57:37,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662620458] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:57:37,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:57:37,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 21:57:37,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279458026] [2025-03-08 21:57:37,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:57:37,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 21:57:37,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:57:37,908 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 21:57:37,908 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 21:57:38,225 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 160 [2025-03-08 21:57:38,226 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 197 transitions, 648 flow. Second operand has 6 states, 6 states have (on average 130.66666666666666) internal successors, (784), 6 states have internal predecessors, (784), 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) [2025-03-08 21:57:38,227 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:57:38,227 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 160 [2025-03-08 21:57:38,227 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:57:38,466 INFO L124 PetriNetUnfolderBase]: 223/892 cut-off events. [2025-03-08 21:57:38,467 INFO L125 PetriNetUnfolderBase]: For 190/196 co-relation queries the response was YES. [2025-03-08 21:57:38,469 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1763 conditions, 892 events. 223/892 cut-off events. For 190/196 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 4686 event pairs, 82 based on Foata normal form. 5/839 useless extension candidates. Maximal degree in co-relation 1566. Up to 407 conditions per place. [2025-03-08 21:57:38,473 INFO L140 encePairwiseOnDemand]: 145/160 looper letters, 53 selfloop transitions, 39 changer transitions 5/242 dead transitions. [2025-03-08 21:57:38,474 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 242 transitions, 962 flow [2025-03-08 21:57:38,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 21:57:38,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 21:57:38,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 844 transitions. [2025-03-08 21:57:38,475 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8791666666666667 [2025-03-08 21:57:38,476 INFO L175 Difference]: Start difference. First operand has 205 places, 197 transitions, 648 flow. Second operand 6 states and 844 transitions. [2025-03-08 21:57:38,476 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 210 places, 242 transitions, 962 flow [2025-03-08 21:57:38,480 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 242 transitions, 938 flow, removed 6 selfloop flow, removed 6 redundant places. [2025-03-08 21:57:38,483 INFO L231 Difference]: Finished difference. Result has 209 places, 233 transitions, 912 flow [2025-03-08 21:57:38,483 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=160, PETRI_DIFFERENCE_MINUEND_FLOW=624, PETRI_DIFFERENCE_MINUEND_PLACES=199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=197, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=182, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=912, PETRI_PLACES=209, PETRI_TRANSITIONS=233} [2025-03-08 21:57:38,484 INFO L279 CegarLoopForPetriNet]: 160 programPoint places, 49 predicate places. [2025-03-08 21:57:38,485 INFO L471 AbstractCegarLoop]: Abstraction has has 209 places, 233 transitions, 912 flow [2025-03-08 21:57:38,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 130.66666666666666) internal successors, (784), 6 states have internal predecessors, (784), 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) [2025-03-08 21:57:38,485 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:57:38,485 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:57:38,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 21:57:38,486 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-08 21:57:38,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:57:38,486 INFO L85 PathProgramCache]: Analyzing trace with hash -1518349476, now seen corresponding path program 1 times [2025-03-08 21:57:38,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:57:38,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657829166] [2025-03-08 21:57:38,486 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:57:38,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:57:38,497 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-08 21:57:38,504 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-08 21:57:38,504 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:57:38,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:57:38,729 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:57:38,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:57:38,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657829166] [2025-03-08 21:57:38,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657829166] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 21:57:38,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [72486471] [2025-03-08 21:57:38,729 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:57:38,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 21:57:38,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 21:57:38,735 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) [2025-03-08 21:57:38,737 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 21:57:38,794 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-08 21:57:38,825 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-08 21:57:38,825 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:57:38,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:57:38,826 INFO L256 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-08 21:57:38,829 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 21:57:38,916 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:57:38,918 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 21:57:39,087 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:57:39,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [72486471] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 21:57:39,088 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 21:57:39,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2025-03-08 21:57:39,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699746533] [2025-03-08 21:57:39,088 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 21:57:39,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-08 21:57:39,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:57:39,089 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-08 21:57:39,089 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2025-03-08 21:57:39,117 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 160 [2025-03-08 21:57:39,120 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 233 transitions, 912 flow. Second operand has 23 states, 23 states have (on average 146.08695652173913) internal successors, (3360), 23 states have internal predecessors, (3360), 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) [2025-03-08 21:57:39,120 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:57:39,121 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 160 [2025-03-08 21:57:39,121 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:57:39,444 INFO L124 PetriNetUnfolderBase]: 123/664 cut-off events. [2025-03-08 21:57:39,444 INFO L125 PetriNetUnfolderBase]: For 324/327 co-relation queries the response was YES. [2025-03-08 21:57:39,446 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1409 conditions, 664 events. 123/664 cut-off events. For 324/327 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 2932 event pairs, 15 based on Foata normal form. 3/639 useless extension candidates. Maximal degree in co-relation 1133. Up to 118 conditions per place. [2025-03-08 21:57:39,448 INFO L140 encePairwiseOnDemand]: 154/160 looper letters, 21 selfloop transitions, 30 changer transitions 0/250 dead transitions. [2025-03-08 21:57:39,448 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 250 transitions, 1136 flow [2025-03-08 21:57:39,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-08 21:57:39,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2025-03-08 21:57:39,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 4374 transitions. [2025-03-08 21:57:39,455 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.91125 [2025-03-08 21:57:39,455 INFO L175 Difference]: Start difference. First operand has 209 places, 233 transitions, 912 flow. Second operand 30 states and 4374 transitions. [2025-03-08 21:57:39,455 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 237 places, 250 transitions, 1136 flow [2025-03-08 21:57:39,459 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 237 places, 250 transitions, 1104 flow, removed 16 selfloop flow, removed 0 redundant places. [2025-03-08 21:57:39,462 INFO L231 Difference]: Finished difference. Result has 241 places, 243 transitions, 1032 flow [2025-03-08 21:57:39,462 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=160, PETRI_DIFFERENCE_MINUEND_FLOW=880, PETRI_DIFFERENCE_MINUEND_PLACES=208, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=233, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=210, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=1032, PETRI_PLACES=241, PETRI_TRANSITIONS=243} [2025-03-08 21:57:39,463 INFO L279 CegarLoopForPetriNet]: 160 programPoint places, 81 predicate places. [2025-03-08 21:57:39,463 INFO L471 AbstractCegarLoop]: Abstraction has has 241 places, 243 transitions, 1032 flow [2025-03-08 21:57:39,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 146.08695652173913) internal successors, (3360), 23 states have internal predecessors, (3360), 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) [2025-03-08 21:57:39,465 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:57:39,465 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:57:39,475 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-08 21:57:39,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 21:57:39,666 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-08 21:57:39,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:57:39,667 INFO L85 PathProgramCache]: Analyzing trace with hash 928010101, now seen corresponding path program 2 times [2025-03-08 21:57:39,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:57:39,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982095540] [2025-03-08 21:57:39,667 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 21:57:39,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:57:39,677 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 154 statements into 2 equivalence classes. [2025-03-08 21:57:39,682 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 104 of 154 statements. [2025-03-08 21:57:39,682 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 21:57:39,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:57:39,889 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-03-08 21:57:39,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:57:39,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982095540] [2025-03-08 21:57:39,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982095540] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:57:39,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:57:39,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 21:57:39,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467720040] [2025-03-08 21:57:39,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:57:39,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 21:57:39,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:57:39,891 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 21:57:39,891 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 21:57:39,970 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 160 [2025-03-08 21:57:39,971 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 241 places, 243 transitions, 1032 flow. Second operand has 6 states, 6 states have (on average 138.33333333333334) internal successors, (830), 6 states have internal predecessors, (830), 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) [2025-03-08 21:57:39,971 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:57:39,971 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 160 [2025-03-08 21:57:39,971 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:57:40,149 INFO L124 PetriNetUnfolderBase]: 212/925 cut-off events. [2025-03-08 21:57:40,150 INFO L125 PetriNetUnfolderBase]: For 576/620 co-relation queries the response was YES. [2025-03-08 21:57:40,153 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2185 conditions, 925 events. 212/925 cut-off events. For 576/620 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 4930 event pairs, 40 based on Foata normal form. 1/908 useless extension candidates. Maximal degree in co-relation 1908. Up to 338 conditions per place. [2025-03-08 21:57:40,156 INFO L140 encePairwiseOnDemand]: 149/160 looper letters, 72 selfloop transitions, 40 changer transitions 0/282 dead transitions. [2025-03-08 21:57:40,156 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 246 places, 282 transitions, 1440 flow [2025-03-08 21:57:40,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 21:57:40,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 21:57:40,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 873 transitions. [2025-03-08 21:57:40,158 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.909375 [2025-03-08 21:57:40,158 INFO L175 Difference]: Start difference. First operand has 241 places, 243 transitions, 1032 flow. Second operand 6 states and 873 transitions. [2025-03-08 21:57:40,158 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 246 places, 282 transitions, 1440 flow [2025-03-08 21:57:40,165 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 282 transitions, 1394 flow, removed 5 selfloop flow, removed 18 redundant places. [2025-03-08 21:57:40,168 INFO L231 Difference]: Finished difference. Result has 233 places, 274 transitions, 1354 flow [2025-03-08 21:57:40,168 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=160, PETRI_DIFFERENCE_MINUEND_FLOW=986, PETRI_DIFFERENCE_MINUEND_PLACES=223, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=243, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=215, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1354, PETRI_PLACES=233, PETRI_TRANSITIONS=274} [2025-03-08 21:57:40,169 INFO L279 CegarLoopForPetriNet]: 160 programPoint places, 73 predicate places. [2025-03-08 21:57:40,169 INFO L471 AbstractCegarLoop]: Abstraction has has 233 places, 274 transitions, 1354 flow [2025-03-08 21:57:40,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 138.33333333333334) internal successors, (830), 6 states have internal predecessors, (830), 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) [2025-03-08 21:57:40,170 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:57:40,170 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:57:40,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 21:57:40,171 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-08 21:57:40,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:57:40,172 INFO L85 PathProgramCache]: Analyzing trace with hash 590300793, now seen corresponding path program 1 times [2025-03-08 21:57:40,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:57:40,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416938989] [2025-03-08 21:57:40,172 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:57:40,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:57:40,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-08 21:57:40,202 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-08 21:57:40,202 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:57:40,202 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:57:40,479 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-03-08 21:57:40,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:57:40,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416938989] [2025-03-08 21:57:40,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416938989] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:57:40,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:57:40,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 21:57:40,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208947983] [2025-03-08 21:57:40,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:57:40,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 21:57:40,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:57:40,481 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 21:57:40,481 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 21:57:40,569 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 160 [2025-03-08 21:57:40,570 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 233 places, 274 transitions, 1354 flow. Second operand has 6 states, 6 states have (on average 133.33333333333334) internal successors, (800), 6 states have internal predecessors, (800), 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) [2025-03-08 21:57:40,570 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:57:40,570 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 160 [2025-03-08 21:57:40,570 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:57:40,805 INFO L124 PetriNetUnfolderBase]: 361/1326 cut-off events. [2025-03-08 21:57:40,805 INFO L125 PetriNetUnfolderBase]: For 1440/1468 co-relation queries the response was YES. [2025-03-08 21:57:40,809 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3665 conditions, 1326 events. 361/1326 cut-off events. For 1440/1468 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 7957 event pairs, 87 based on Foata normal form. 2/1292 useless extension candidates. Maximal degree in co-relation 3405. Up to 610 conditions per place. [2025-03-08 21:57:40,813 INFO L140 encePairwiseOnDemand]: 145/160 looper letters, 100 selfloop transitions, 64 changer transitions 10/335 dead transitions. [2025-03-08 21:57:40,814 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 335 transitions, 2042 flow [2025-03-08 21:57:40,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 21:57:40,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 21:57:40,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 859 transitions. [2025-03-08 21:57:40,816 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8947916666666667 [2025-03-08 21:57:40,816 INFO L175 Difference]: Start difference. First operand has 233 places, 274 transitions, 1354 flow. Second operand 6 states and 859 transitions. [2025-03-08 21:57:40,816 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 238 places, 335 transitions, 2042 flow [2025-03-08 21:57:40,825 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 238 places, 335 transitions, 2024 flow, removed 9 selfloop flow, removed 0 redundant places. [2025-03-08 21:57:40,828 INFO L231 Difference]: Finished difference. Result has 243 places, 321 transitions, 1922 flow [2025-03-08 21:57:40,829 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=160, PETRI_DIFFERENCE_MINUEND_FLOW=1336, PETRI_DIFFERENCE_MINUEND_PLACES=233, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=274, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=237, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1922, PETRI_PLACES=243, PETRI_TRANSITIONS=321} [2025-03-08 21:57:40,829 INFO L279 CegarLoopForPetriNet]: 160 programPoint places, 83 predicate places. [2025-03-08 21:57:40,829 INFO L471 AbstractCegarLoop]: Abstraction has has 243 places, 321 transitions, 1922 flow [2025-03-08 21:57:40,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 133.33333333333334) internal successors, (800), 6 states have internal predecessors, (800), 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) [2025-03-08 21:57:40,829 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:57:40,830 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:57:40,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 21:57:40,830 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-08 21:57:40,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:57:40,831 INFO L85 PathProgramCache]: Analyzing trace with hash 845009196, now seen corresponding path program 1 times [2025-03-08 21:57:40,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:57:40,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667172893] [2025-03-08 21:57:40,831 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:57:40,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:57:40,843 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-08 21:57:40,918 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-08 21:57:40,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:57:40,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:57:46,505 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-03-08 21:57:46,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:57:46,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667172893] [2025-03-08 21:57:46,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667172893] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:57:46,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:57:46,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-08 21:57:46,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267346174] [2025-03-08 21:57:46,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:57:46,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-08 21:57:46,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:57:46,506 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-08 21:57:46,507 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2025-03-08 21:57:48,493 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 160 [2025-03-08 21:57:48,494 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 243 places, 321 transitions, 1922 flow. Second operand has 15 states, 15 states have (on average 121.73333333333333) internal successors, (1826), 15 states have internal predecessors, (1826), 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) [2025-03-08 21:57:48,494 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:57:48,494 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 160 [2025-03-08 21:57:48,494 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:57:49,598 INFO L124 PetriNetUnfolderBase]: 461/1566 cut-off events. [2025-03-08 21:57:49,598 INFO L125 PetriNetUnfolderBase]: For 2922/3002 co-relation queries the response was YES. [2025-03-08 21:57:49,603 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5173 conditions, 1566 events. 461/1566 cut-off events. For 2922/3002 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 9811 event pairs, 19 based on Foata normal form. 37/1587 useless extension candidates. Maximal degree in co-relation 4896. Up to 562 conditions per place. [2025-03-08 21:57:49,608 INFO L140 encePairwiseOnDemand]: 133/160 looper letters, 190 selfloop transitions, 84 changer transitions 47/471 dead transitions. [2025-03-08 21:57:49,609 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 260 places, 471 transitions, 3654 flow [2025-03-08 21:57:49,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-08 21:57:49,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-03-08 21:57:49,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 2298 transitions. [2025-03-08 21:57:49,613 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7979166666666667 [2025-03-08 21:57:49,613 INFO L175 Difference]: Start difference. First operand has 243 places, 321 transitions, 1922 flow. Second operand 18 states and 2298 transitions. [2025-03-08 21:57:49,613 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 260 places, 471 transitions, 3654 flow [2025-03-08 21:57:49,628 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 260 places, 471 transitions, 3568 flow, removed 43 selfloop flow, removed 0 redundant places. [2025-03-08 21:57:49,632 INFO L231 Difference]: Finished difference. Result has 268 places, 358 transitions, 2482 flow [2025-03-08 21:57:49,633 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=160, PETRI_DIFFERENCE_MINUEND_FLOW=1848, PETRI_DIFFERENCE_MINUEND_PLACES=243, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=321, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=256, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=2482, PETRI_PLACES=268, PETRI_TRANSITIONS=358} [2025-03-08 21:57:49,633 INFO L279 CegarLoopForPetriNet]: 160 programPoint places, 108 predicate places. [2025-03-08 21:57:49,633 INFO L471 AbstractCegarLoop]: Abstraction has has 268 places, 358 transitions, 2482 flow [2025-03-08 21:57:49,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 121.73333333333333) internal successors, (1826), 15 states have internal predecessors, (1826), 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) [2025-03-08 21:57:49,634 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:57:49,634 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:57:49,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 21:57:49,635 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-08 21:57:49,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:57:49,635 INFO L85 PathProgramCache]: Analyzing trace with hash -162561478, now seen corresponding path program 2 times [2025-03-08 21:57:49,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:57:49,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079852351] [2025-03-08 21:57:49,636 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 21:57:49,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:57:49,645 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 168 statements into 2 equivalence classes. [2025-03-08 21:57:49,654 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 118 of 168 statements. [2025-03-08 21:57:49,654 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 21:57:49,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:57:50,124 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-03-08 21:57:50,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:57:50,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079852351] [2025-03-08 21:57:50,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079852351] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:57:50,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:57:50,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 21:57:50,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331671711] [2025-03-08 21:57:50,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:57:50,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 21:57:50,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:57:50,125 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 21:57:50,126 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-08 21:57:50,828 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 160 [2025-03-08 21:57:50,830 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 268 places, 358 transitions, 2482 flow. Second operand has 10 states, 10 states have (on average 126.0) internal successors, (1260), 10 states have internal predecessors, (1260), 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) [2025-03-08 21:57:50,830 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:57:50,830 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 160 [2025-03-08 21:57:50,830 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:57:51,329 INFO L124 PetriNetUnfolderBase]: 458/1562 cut-off events. [2025-03-08 21:57:51,329 INFO L125 PetriNetUnfolderBase]: For 4283/4329 co-relation queries the response was YES. [2025-03-08 21:57:51,334 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5969 conditions, 1562 events. 458/1562 cut-off events. For 4283/4329 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 9748 event pairs, 44 based on Foata normal form. 19/1562 useless extension candidates. Maximal degree in co-relation 5682. Up to 662 conditions per place. [2025-03-08 21:57:51,338 INFO L140 encePairwiseOnDemand]: 140/160 looper letters, 165 selfloop transitions, 80 changer transitions 27/424 dead transitions. [2025-03-08 21:57:51,339 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 274 places, 424 transitions, 3515 flow [2025-03-08 21:57:51,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 21:57:51,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-08 21:57:51,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1234 transitions. [2025-03-08 21:57:51,340 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8569444444444444 [2025-03-08 21:57:51,340 INFO L175 Difference]: Start difference. First operand has 268 places, 358 transitions, 2482 flow. Second operand 9 states and 1234 transitions. [2025-03-08 21:57:51,340 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 274 places, 424 transitions, 3515 flow [2025-03-08 21:57:51,360 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 268 places, 424 transitions, 3475 flow, removed 12 selfloop flow, removed 6 redundant places. [2025-03-08 21:57:51,365 INFO L231 Difference]: Finished difference. Result has 271 places, 359 transitions, 2649 flow [2025-03-08 21:57:51,365 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=160, PETRI_DIFFERENCE_MINUEND_FLOW=2447, PETRI_DIFFERENCE_MINUEND_PLACES=260, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=358, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=76, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=278, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2649, PETRI_PLACES=271, PETRI_TRANSITIONS=359} [2025-03-08 21:57:51,366 INFO L279 CegarLoopForPetriNet]: 160 programPoint places, 111 predicate places. [2025-03-08 21:57:51,366 INFO L471 AbstractCegarLoop]: Abstraction has has 271 places, 359 transitions, 2649 flow [2025-03-08 21:57:51,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 126.0) internal successors, (1260), 10 states have internal predecessors, (1260), 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) [2025-03-08 21:57:51,366 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:57:51,366 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:57:51,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 21:57:51,367 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-08 21:57:51,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:57:51,368 INFO L85 PathProgramCache]: Analyzing trace with hash -1799924342, now seen corresponding path program 3 times [2025-03-08 21:57:51,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:57:51,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703316825] [2025-03-08 21:57:51,368 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 21:57:51,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:57:51,378 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 168 statements into 11 equivalence classes. [2025-03-08 21:57:51,385 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 118 of 168 statements. [2025-03-08 21:57:51,385 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-08 21:57:51,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:57:51,855 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-03-08 21:57:51,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:57:51,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703316825] [2025-03-08 21:57:51,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703316825] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:57:51,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:57:51,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 21:57:51,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669281843] [2025-03-08 21:57:51,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:57:51,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 21:57:51,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:57:51,856 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 21:57:51,856 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2025-03-08 21:57:52,500 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 160 [2025-03-08 21:57:52,501 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 271 places, 359 transitions, 2649 flow. Second operand has 10 states, 10 states have (on average 128.0) internal successors, (1280), 10 states have internal predecessors, (1280), 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) [2025-03-08 21:57:52,501 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:57:52,502 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 160 [2025-03-08 21:57:52,502 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:57:53,060 INFO L124 PetriNetUnfolderBase]: 754/2506 cut-off events. [2025-03-08 21:57:53,060 INFO L125 PetriNetUnfolderBase]: For 9076/9204 co-relation queries the response was YES. [2025-03-08 21:57:53,067 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10262 conditions, 2506 events. 754/2506 cut-off events. For 9076/9204 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 18783 event pairs, 62 based on Foata normal form. 48/2524 useless extension candidates. Maximal degree in co-relation 9972. Up to 612 conditions per place. [2025-03-08 21:57:53,074 INFO L140 encePairwiseOnDemand]: 141/160 looper letters, 329 selfloop transitions, 100 changer transitions 18/603 dead transitions. [2025-03-08 21:57:53,074 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 280 places, 603 transitions, 6036 flow [2025-03-08 21:57:53,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 21:57:53,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-08 21:57:53,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1402 transitions. [2025-03-08 21:57:53,077 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.87625 [2025-03-08 21:57:53,077 INFO L175 Difference]: Start difference. First operand has 271 places, 359 transitions, 2649 flow. Second operand 10 states and 1402 transitions. [2025-03-08 21:57:53,077 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 280 places, 603 transitions, 6036 flow [2025-03-08 21:57:53,108 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 276 places, 603 transitions, 5900 flow, removed 2 selfloop flow, removed 4 redundant places. [2025-03-08 21:57:53,113 INFO L231 Difference]: Finished difference. Result has 282 places, 439 transitions, 4069 flow [2025-03-08 21:57:53,113 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=160, PETRI_DIFFERENCE_MINUEND_FLOW=2584, PETRI_DIFFERENCE_MINUEND_PLACES=267, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=359, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=278, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4069, PETRI_PLACES=282, PETRI_TRANSITIONS=439} [2025-03-08 21:57:53,114 INFO L279 CegarLoopForPetriNet]: 160 programPoint places, 122 predicate places. [2025-03-08 21:57:53,114 INFO L471 AbstractCegarLoop]: Abstraction has has 282 places, 439 transitions, 4069 flow [2025-03-08 21:57:53,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 128.0) internal successors, (1280), 10 states have internal predecessors, (1280), 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) [2025-03-08 21:57:53,114 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:57:53,115 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:57:53,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 21:57:53,115 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-08 21:57:53,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:57:53,116 INFO L85 PathProgramCache]: Analyzing trace with hash 1559827944, now seen corresponding path program 4 times [2025-03-08 21:57:53,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:57:53,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550321138] [2025-03-08 21:57:53,116 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 21:57:53,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:57:53,125 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 168 statements into 2 equivalence classes. [2025-03-08 21:57:53,153 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 168 of 168 statements. [2025-03-08 21:57:53,153 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-08 21:57:53,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:57:54,029 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 236 trivial. 0 not checked. [2025-03-08 21:57:54,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:57:54,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550321138] [2025-03-08 21:57:54,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550321138] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:57:54,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:57:54,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-08 21:57:54,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068742775] [2025-03-08 21:57:54,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:57:54,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-08 21:57:54,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:57:54,030 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-08 21:57:54,030 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2025-03-08 21:57:56,250 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 160 [2025-03-08 21:57:56,251 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 282 places, 439 transitions, 4069 flow. Second operand has 15 states, 15 states have (on average 120.8) internal successors, (1812), 15 states have internal predecessors, (1812), 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) [2025-03-08 21:57:56,251 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:57:56,251 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 160 [2025-03-08 21:57:56,251 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:57:57,555 INFO L124 PetriNetUnfolderBase]: 850/2753 cut-off events. [2025-03-08 21:57:57,555 INFO L125 PetriNetUnfolderBase]: For 12941/13105 co-relation queries the response was YES. [2025-03-08 21:57:57,563 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12017 conditions, 2753 events. 850/2753 cut-off events. For 12941/13105 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 20517 event pairs, 93 based on Foata normal form. 93/2814 useless extension candidates. Maximal degree in co-relation 11721. Up to 1157 conditions per place. [2025-03-08 21:57:57,572 INFO L140 encePairwiseOnDemand]: 134/160 looper letters, 225 selfloop transitions, 174 changer transitions 13/561 dead transitions. [2025-03-08 21:57:57,572 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 307 places, 561 transitions, 5826 flow [2025-03-08 21:57:57,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-03-08 21:57:57,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2025-03-08 21:57:57,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 3278 transitions. [2025-03-08 21:57:57,575 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7879807692307692 [2025-03-08 21:57:57,575 INFO L175 Difference]: Start difference. First operand has 282 places, 439 transitions, 4069 flow. Second operand 26 states and 3278 transitions. [2025-03-08 21:57:57,575 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 307 places, 561 transitions, 5826 flow [2025-03-08 21:57:57,625 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 306 places, 561 transitions, 5798 flow, removed 9 selfloop flow, removed 1 redundant places. [2025-03-08 21:57:57,632 INFO L231 Difference]: Finished difference. Result has 323 places, 479 transitions, 4979 flow [2025-03-08 21:57:57,632 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=160, PETRI_DIFFERENCE_MINUEND_FLOW=4047, PETRI_DIFFERENCE_MINUEND_PLACES=281, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=439, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=138, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=292, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=4979, PETRI_PLACES=323, PETRI_TRANSITIONS=479} [2025-03-08 21:57:57,633 INFO L279 CegarLoopForPetriNet]: 160 programPoint places, 163 predicate places. [2025-03-08 21:57:57,633 INFO L471 AbstractCegarLoop]: Abstraction has has 323 places, 479 transitions, 4979 flow [2025-03-08 21:57:57,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 120.8) internal successors, (1812), 15 states have internal predecessors, (1812), 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) [2025-03-08 21:57:57,634 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:57:57,634 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:57:57,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 21:57:57,634 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-08 21:57:57,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:57:57,635 INFO L85 PathProgramCache]: Analyzing trace with hash 1493938316, now seen corresponding path program 5 times [2025-03-08 21:57:57,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:57:57,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878218852] [2025-03-08 21:57:57,635 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 21:57:57,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:57:57,651 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 168 statements into 11 equivalence classes. [2025-03-08 21:57:57,699 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) and asserted 168 of 168 statements. [2025-03-08 21:57:57,699 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2025-03-08 21:57:57,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:58:01,901 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 0 proven. 235 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 21:58:01,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:58:01,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878218852] [2025-03-08 21:58:01,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878218852] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 21:58:01,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [19348454] [2025-03-08 21:58:01,901 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 21:58:01,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 21:58:01,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 21:58:01,903 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 21:58:01,904 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 21:58:01,962 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 168 statements into 11 equivalence classes. [2025-03-08 21:58:02,022 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) and asserted 168 of 168 statements. [2025-03-08 21:58:02,023 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2025-03-08 21:58:02,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:58:02,025 INFO L256 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 57 conjuncts are in the unsatisfiable core [2025-03-08 21:58:02,031 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 21:58:02,086 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2025-03-08 21:58:02,183 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2025-03-08 21:58:02,254 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-03-08 21:58:02,254 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 15 [2025-03-08 21:58:02,311 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2025-03-08 21:58:02,372 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42 [2025-03-08 21:58:02,448 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 57 [2025-03-08 21:58:02,570 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 21:58:02,572 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 21:58:02,572 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 21:58:02,575 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 21:58:02,578 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 21:58:02,579 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 65 treesize of output 73 [2025-03-08 21:58:02,849 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 0 proven. 197 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2025-03-08 21:58:02,849 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 21:58:03,553 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 19 [2025-03-08 21:58:03,557 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2025-03-08 21:58:03,560 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 236 trivial. 0 not checked. [2025-03-08 21:58:03,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [19348454] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-08 21:58:03,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-08 21:58:03,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [34, 21] total 49 [2025-03-08 21:58:03,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756044724] [2025-03-08 21:58:03,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:58:03,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 21:58:03,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:58:03,561 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 21:58:03,561 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=2243, Unknown=0, NotChecked=0, Total=2450 [2025-03-08 21:58:05,414 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 160 [2025-03-08 21:58:05,415 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 323 places, 479 transitions, 4979 flow. Second operand has 10 states, 10 states have (on average 126.1) internal successors, (1261), 10 states have internal predecessors, (1261), 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) [2025-03-08 21:58:05,415 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:58:05,415 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 160 [2025-03-08 21:58:05,415 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:58:07,697 INFO L124 PetriNetUnfolderBase]: 1273/3981 cut-off events. [2025-03-08 21:58:07,698 INFO L125 PetriNetUnfolderBase]: For 25616/25889 co-relation queries the response was YES. [2025-03-08 21:58:07,715 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19318 conditions, 3981 events. 1273/3981 cut-off events. For 25616/25889 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 32803 event pairs, 50 based on Foata normal form. 115/4069 useless extension candidates. Maximal degree in co-relation 19004. Up to 1053 conditions per place. [2025-03-08 21:58:07,725 INFO L140 encePairwiseOnDemand]: 137/160 looper letters, 374 selfloop transitions, 260 changer transitions 23/820 dead transitions. [2025-03-08 21:58:07,726 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 338 places, 820 transitions, 10552 flow [2025-03-08 21:58:07,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-08 21:58:07,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-03-08 21:58:07,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 2164 transitions. [2025-03-08 21:58:07,728 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8453125 [2025-03-08 21:58:07,728 INFO L175 Difference]: Start difference. First operand has 323 places, 479 transitions, 4979 flow. Second operand 16 states and 2164 transitions. [2025-03-08 21:58:07,728 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 338 places, 820 transitions, 10552 flow [2025-03-08 21:58:07,815 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 333 places, 820 transitions, 9904 flow, removed 104 selfloop flow, removed 5 redundant places. [2025-03-08 21:58:07,848 INFO L231 Difference]: Finished difference. Result has 345 places, 594 transitions, 7452 flow [2025-03-08 21:58:07,848 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=160, PETRI_DIFFERENCE_MINUEND_FLOW=4653, PETRI_DIFFERENCE_MINUEND_PLACES=318, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=479, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=149, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=308, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=7452, PETRI_PLACES=345, PETRI_TRANSITIONS=594} [2025-03-08 21:58:07,849 INFO L279 CegarLoopForPetriNet]: 160 programPoint places, 185 predicate places. [2025-03-08 21:58:07,849 INFO L471 AbstractCegarLoop]: Abstraction has has 345 places, 594 transitions, 7452 flow [2025-03-08 21:58:07,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 126.1) internal successors, (1261), 10 states have internal predecessors, (1261), 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) [2025-03-08 21:58:07,849 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:58:07,849 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:58:07,855 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-08 21:58:08,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 21:58:08,050 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-08 21:58:08,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:58:08,051 INFO L85 PathProgramCache]: Analyzing trace with hash -1440220166, now seen corresponding path program 6 times [2025-03-08 21:58:08,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:58:08,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619790581] [2025-03-08 21:58:08,051 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-08 21:58:08,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:58:08,060 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 168 statements into 11 equivalence classes. [2025-03-08 21:58:08,067 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 117 of 168 statements. [2025-03-08 21:58:08,067 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-08 21:58:08,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:58:08,715 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 236 trivial. 0 not checked. [2025-03-08 21:58:08,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:58:08,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619790581] [2025-03-08 21:58:08,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619790581] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:58:08,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:58:08,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 21:58:08,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426467043] [2025-03-08 21:58:08,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:58:08,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 21:58:08,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:58:08,718 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 21:58:08,718 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-08 21:58:09,545 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 160 [2025-03-08 21:58:09,546 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 345 places, 594 transitions, 7452 flow. Second operand has 10 states, 10 states have (on average 126.0) internal successors, (1260), 10 states have internal predecessors, (1260), 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) [2025-03-08 21:58:09,546 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:58:09,546 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 160 [2025-03-08 21:58:09,546 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:58:10,623 INFO L124 PetriNetUnfolderBase]: 1331/3982 cut-off events. [2025-03-08 21:58:10,623 INFO L125 PetriNetUnfolderBase]: For 33554/33887 co-relation queries the response was YES. [2025-03-08 21:58:10,638 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21518 conditions, 3982 events. 1331/3982 cut-off events. For 33554/33887 co-relation queries the response was YES. Maximal size of possible extension queue 181. Compared 32613 event pairs, 231 based on Foata normal form. 149/4092 useless extension candidates. Maximal degree in co-relation 21192. Up to 1927 conditions per place. [2025-03-08 21:58:10,648 INFO L140 encePairwiseOnDemand]: 140/160 looper letters, 248 selfloop transitions, 254 changer transitions 18/683 dead transitions. [2025-03-08 21:58:10,648 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 355 places, 683 transitions, 9712 flow [2025-03-08 21:58:10,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 21:58:10,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-08 21:58:10,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1731 transitions. [2025-03-08 21:58:10,650 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8322115384615385 [2025-03-08 21:58:10,650 INFO L175 Difference]: Start difference. First operand has 345 places, 594 transitions, 7452 flow. Second operand 13 states and 1731 transitions. [2025-03-08 21:58:10,650 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 355 places, 683 transitions, 9712 flow [2025-03-08 21:58:10,785 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 355 places, 683 transitions, 9584 flow, removed 64 selfloop flow, removed 0 redundant places. [2025-03-08 21:58:10,794 INFO L231 Difference]: Finished difference. Result has 362 places, 625 transitions, 8564 flow [2025-03-08 21:58:10,794 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=160, PETRI_DIFFERENCE_MINUEND_FLOW=7326, PETRI_DIFFERENCE_MINUEND_PLACES=343, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=594, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=228, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=357, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=8564, PETRI_PLACES=362, PETRI_TRANSITIONS=625} [2025-03-08 21:58:10,796 INFO L279 CegarLoopForPetriNet]: 160 programPoint places, 202 predicate places. [2025-03-08 21:58:10,796 INFO L471 AbstractCegarLoop]: Abstraction has has 362 places, 625 transitions, 8564 flow [2025-03-08 21:58:10,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 126.0) internal successors, (1260), 10 states have internal predecessors, (1260), 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) [2025-03-08 21:58:10,796 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:58:10,797 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:58:10,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 21:58:10,797 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-08 21:58:10,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:58:10,798 INFO L85 PathProgramCache]: Analyzing trace with hash -1098260644, now seen corresponding path program 7 times [2025-03-08 21:58:10,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:58:10,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613443382] [2025-03-08 21:58:10,798 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-08 21:58:10,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:58:10,813 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-08 21:58:10,844 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-08 21:58:10,844 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:58:10,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:58:19,203 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 236 trivial. 0 not checked. [2025-03-08 21:58:19,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:58:19,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613443382] [2025-03-08 21:58:19,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613443382] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:58:19,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:58:19,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-08 21:58:19,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327329641] [2025-03-08 21:58:19,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:58:19,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-08 21:58:19,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:58:19,204 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-08 21:58:19,204 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2025-03-08 21:58:21,046 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 160 [2025-03-08 21:58:21,047 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 362 places, 625 transitions, 8564 flow. Second operand has 15 states, 15 states have (on average 121.73333333333333) internal successors, (1826), 15 states have internal predecessors, (1826), 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) [2025-03-08 21:58:21,047 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:58:21,048 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 160 [2025-03-08 21:58:21,048 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:58:22,599 INFO L124 PetriNetUnfolderBase]: 1234/3860 cut-off events. [2025-03-08 21:58:22,599 INFO L125 PetriNetUnfolderBase]: For 38890/39148 co-relation queries the response was YES. [2025-03-08 21:58:22,621 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21748 conditions, 3860 events. 1234/3860 cut-off events. For 38890/39148 co-relation queries the response was YES. Maximal size of possible extension queue 182. Compared 31935 event pairs, 128 based on Foata normal form. 113/3931 useless extension candidates. Maximal degree in co-relation 21414. Up to 1219 conditions per place. [2025-03-08 21:58:22,635 INFO L140 encePairwiseOnDemand]: 135/160 looper letters, 446 selfloop transitions, 209 changer transitions 25/841 dead transitions. [2025-03-08 21:58:22,635 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 378 places, 841 transitions, 12304 flow [2025-03-08 21:58:22,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-08 21:58:22,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-03-08 21:58:22,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 2195 transitions. [2025-03-08 21:58:22,637 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8069852941176471 [2025-03-08 21:58:22,637 INFO L175 Difference]: Start difference. First operand has 362 places, 625 transitions, 8564 flow. Second operand 17 states and 2195 transitions. [2025-03-08 21:58:22,637 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 378 places, 841 transitions, 12304 flow [2025-03-08 21:58:22,815 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 375 places, 841 transitions, 11995 flow, removed 103 selfloop flow, removed 3 redundant places. [2025-03-08 21:58:22,825 INFO L231 Difference]: Finished difference. Result has 382 places, 659 transitions, 9661 flow [2025-03-08 21:58:22,826 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=160, PETRI_DIFFERENCE_MINUEND_FLOW=8294, PETRI_DIFFERENCE_MINUEND_PLACES=359, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=625, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=175, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=436, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=9661, PETRI_PLACES=382, PETRI_TRANSITIONS=659} [2025-03-08 21:58:22,826 INFO L279 CegarLoopForPetriNet]: 160 programPoint places, 222 predicate places. [2025-03-08 21:58:22,826 INFO L471 AbstractCegarLoop]: Abstraction has has 382 places, 659 transitions, 9661 flow [2025-03-08 21:58:22,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 121.73333333333333) internal successors, (1826), 15 states have internal predecessors, (1826), 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) [2025-03-08 21:58:22,827 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:58:22,827 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:58:22,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 21:58:22,827 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-08 21:58:22,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:58:22,828 INFO L85 PathProgramCache]: Analyzing trace with hash 270647720, now seen corresponding path program 8 times [2025-03-08 21:58:22,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:58:22,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903652593] [2025-03-08 21:58:22,829 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 21:58:22,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:58:22,837 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 168 statements into 2 equivalence classes. [2025-03-08 21:58:22,844 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 117 of 168 statements. [2025-03-08 21:58:22,844 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 21:58:22,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:58:23,284 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 236 trivial. 0 not checked. [2025-03-08 21:58:23,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:58:23,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903652593] [2025-03-08 21:58:23,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903652593] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:58:23,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:58:23,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 21:58:23,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066233774] [2025-03-08 21:58:23,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:58:23,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 21:58:23,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:58:23,286 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 21:58:23,286 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-03-08 21:58:24,111 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 160 [2025-03-08 21:58:24,112 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 382 places, 659 transitions, 9661 flow. Second operand has 10 states, 10 states have (on average 126.0) internal successors, (1260), 10 states have internal predecessors, (1260), 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) [2025-03-08 21:58:24,112 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:58:24,112 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 160 [2025-03-08 21:58:24,112 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:58:25,199 INFO L124 PetriNetUnfolderBase]: 1339/4025 cut-off events. [2025-03-08 21:58:25,199 INFO L125 PetriNetUnfolderBase]: For 48943/49197 co-relation queries the response was YES. [2025-03-08 21:58:25,222 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23997 conditions, 4025 events. 1339/4025 cut-off events. For 48943/49197 co-relation queries the response was YES. Maximal size of possible extension queue 181. Compared 33165 event pairs, 235 based on Foata normal form. 103/4088 useless extension candidates. Maximal degree in co-relation 23656. Up to 1917 conditions per place. [2025-03-08 21:58:25,232 INFO L140 encePairwiseOnDemand]: 140/160 looper letters, 284 selfloop transitions, 280 changer transitions 18/745 dead transitions. [2025-03-08 21:58:25,232 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 395 places, 745 transitions, 12190 flow [2025-03-08 21:58:25,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 21:58:25,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-08 21:58:25,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1850 transitions. [2025-03-08 21:58:25,234 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8258928571428571 [2025-03-08 21:58:25,234 INFO L175 Difference]: Start difference. First operand has 382 places, 659 transitions, 9661 flow. Second operand 14 states and 1850 transitions. [2025-03-08 21:58:25,234 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 395 places, 745 transitions, 12190 flow [2025-03-08 21:58:25,439 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 388 places, 745 transitions, 11747 flow, removed 111 selfloop flow, removed 7 redundant places. [2025-03-08 21:58:25,448 INFO L231 Difference]: Finished difference. Result has 397 places, 696 transitions, 10812 flow [2025-03-08 21:58:25,449 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=160, PETRI_DIFFERENCE_MINUEND_FLOW=9232, PETRI_DIFFERENCE_MINUEND_PLACES=375, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=659, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=247, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=400, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=10812, PETRI_PLACES=397, PETRI_TRANSITIONS=696} [2025-03-08 21:58:25,449 INFO L279 CegarLoopForPetriNet]: 160 programPoint places, 237 predicate places. [2025-03-08 21:58:25,449 INFO L471 AbstractCegarLoop]: Abstraction has has 397 places, 696 transitions, 10812 flow [2025-03-08 21:58:25,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 126.0) internal successors, (1260), 10 states have internal predecessors, (1260), 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) [2025-03-08 21:58:25,450 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:58:25,450 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:58:25,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 21:58:25,450 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-08 21:58:25,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:58:25,451 INFO L85 PathProgramCache]: Analyzing trace with hash -633155074, now seen corresponding path program 9 times [2025-03-08 21:58:25,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:58:25,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039586429] [2025-03-08 21:58:25,451 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 21:58:25,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:58:25,460 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 168 statements into 11 equivalence classes. [2025-03-08 21:58:25,465 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 117 of 168 statements. [2025-03-08 21:58:25,465 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-08 21:58:25,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:58:26,001 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 236 trivial. 0 not checked. [2025-03-08 21:58:26,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:58:26,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039586429] [2025-03-08 21:58:26,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039586429] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:58:26,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:58:26,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 21:58:26,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650799945] [2025-03-08 21:58:26,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:58:26,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 21:58:26,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:58:26,002 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 21:58:26,002 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-03-08 21:58:26,745 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 160 [2025-03-08 21:58:26,746 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 397 places, 696 transitions, 10812 flow. Second operand has 10 states, 10 states have (on average 126.0) internal successors, (1260), 10 states have internal predecessors, (1260), 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) [2025-03-08 21:58:26,746 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:58:26,746 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 160 [2025-03-08 21:58:26,746 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:58:27,900 INFO L124 PetriNetUnfolderBase]: 1338/4040 cut-off events. [2025-03-08 21:58:27,900 INFO L125 PetriNetUnfolderBase]: For 52312/52562 co-relation queries the response was YES. [2025-03-08 21:58:27,925 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24664 conditions, 4040 events. 1338/4040 cut-off events. For 52312/52562 co-relation queries the response was YES. Maximal size of possible extension queue 182. Compared 33384 event pairs, 129 based on Foata normal form. 101/4099 useless extension candidates. Maximal degree in co-relation 24315. Up to 1345 conditions per place. [2025-03-08 21:58:27,935 INFO L140 encePairwiseOnDemand]: 139/160 looper letters, 451 selfloop transitions, 244 changer transitions 25/883 dead transitions. [2025-03-08 21:58:27,936 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 407 places, 883 transitions, 14430 flow [2025-03-08 21:58:27,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 21:58:27,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-08 21:58:27,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1519 transitions. [2025-03-08 21:58:27,937 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8630681818181818 [2025-03-08 21:58:27,937 INFO L175 Difference]: Start difference. First operand has 397 places, 696 transitions, 10812 flow. Second operand 11 states and 1519 transitions. [2025-03-08 21:58:27,937 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 407 places, 883 transitions, 14430 flow [2025-03-08 21:58:28,135 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 405 places, 883 transitions, 14117 flow, removed 122 selfloop flow, removed 2 redundant places. [2025-03-08 21:58:28,145 INFO L231 Difference]: Finished difference. Result has 412 places, 720 transitions, 11922 flow [2025-03-08 21:58:28,146 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=160, PETRI_DIFFERENCE_MINUEND_FLOW=10521, PETRI_DIFFERENCE_MINUEND_PLACES=395, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=696, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=221, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=463, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=11922, PETRI_PLACES=412, PETRI_TRANSITIONS=720} [2025-03-08 21:58:28,146 INFO L279 CegarLoopForPetriNet]: 160 programPoint places, 252 predicate places. [2025-03-08 21:58:28,146 INFO L471 AbstractCegarLoop]: Abstraction has has 412 places, 720 transitions, 11922 flow [2025-03-08 21:58:28,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 126.0) internal successors, (1260), 10 states have internal predecessors, (1260), 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) [2025-03-08 21:58:28,146 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:58:28,146 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:58:28,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 21:58:28,147 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-08 21:58:28,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:58:28,148 INFO L85 PathProgramCache]: Analyzing trace with hash 1234555359, now seen corresponding path program 1 times [2025-03-08 21:58:28,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:58:28,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918352703] [2025-03-08 21:58:28,148 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:58:28,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:58:28,156 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-08 21:58:28,184 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-08 21:58:28,184 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:58:28,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:58:30,974 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 236 trivial. 0 not checked. [2025-03-08 21:58:30,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:58:30,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918352703] [2025-03-08 21:58:30,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918352703] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:58:30,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:58:30,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-08 21:58:30,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000624542] [2025-03-08 21:58:30,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:58:30,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 21:58:30,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:58:30,975 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 21:58:30,975 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2025-03-08 21:58:32,264 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 160 [2025-03-08 21:58:32,265 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 412 places, 720 transitions, 11922 flow. Second operand has 13 states, 13 states have (on average 127.53846153846153) internal successors, (1658), 13 states have internal predecessors, (1658), 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) [2025-03-08 21:58:32,265 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:58:32,265 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 160 [2025-03-08 21:58:32,265 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:58:33,689 INFO L124 PetriNetUnfolderBase]: 1021/3442 cut-off events. [2025-03-08 21:58:33,689 INFO L125 PetriNetUnfolderBase]: For 56799/57160 co-relation queries the response was YES. [2025-03-08 21:58:33,712 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21910 conditions, 3442 events. 1021/3442 cut-off events. For 56799/57160 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 28928 event pairs, 33 based on Foata normal form. 82/3503 useless extension candidates. Maximal degree in co-relation 21555. Up to 801 conditions per place. [2025-03-08 21:58:33,721 INFO L140 encePairwiseOnDemand]: 138/160 looper letters, 429 selfloop transitions, 200 changer transitions 42/893 dead transitions. [2025-03-08 21:58:33,722 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 433 places, 893 transitions, 15168 flow [2025-03-08 21:58:33,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-08 21:58:33,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-03-08 21:58:33,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 2910 transitions. [2025-03-08 21:58:33,724 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8267045454545454 [2025-03-08 21:58:33,724 INFO L175 Difference]: Start difference. First operand has 412 places, 720 transitions, 11922 flow. Second operand 22 states and 2910 transitions. [2025-03-08 21:58:33,724 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 433 places, 893 transitions, 15168 flow [2025-03-08 21:58:33,980 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 430 places, 893 transitions, 14951 flow, removed 69 selfloop flow, removed 3 redundant places. [2025-03-08 21:58:33,991 INFO L231 Difference]: Finished difference. Result has 439 places, 766 transitions, 13092 flow [2025-03-08 21:58:33,991 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=160, PETRI_DIFFERENCE_MINUEND_FLOW=11745, PETRI_DIFFERENCE_MINUEND_PLACES=409, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=720, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=160, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=540, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=13092, PETRI_PLACES=439, PETRI_TRANSITIONS=766} [2025-03-08 21:58:33,991 INFO L279 CegarLoopForPetriNet]: 160 programPoint places, 279 predicate places. [2025-03-08 21:58:33,991 INFO L471 AbstractCegarLoop]: Abstraction has has 439 places, 766 transitions, 13092 flow [2025-03-08 21:58:33,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 127.53846153846153) internal successors, (1658), 13 states have internal predecessors, (1658), 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) [2025-03-08 21:58:33,992 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:58:33,992 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:58:33,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 21:58:33,992 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-08 21:58:33,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:58:33,993 INFO L85 PathProgramCache]: Analyzing trace with hash 2092056002, now seen corresponding path program 10 times [2025-03-08 21:58:33,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:58:33,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836750722] [2025-03-08 21:58:33,993 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 21:58:33,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:58:34,002 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 168 statements into 2 equivalence classes. [2025-03-08 21:58:34,012 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 168 of 168 statements. [2025-03-08 21:58:34,013 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-08 21:58:34,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:58:34,777 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 236 trivial. 0 not checked. [2025-03-08 21:58:34,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:58:34,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836750722] [2025-03-08 21:58:34,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836750722] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:58:34,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:58:34,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-08 21:58:34,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552109766] [2025-03-08 21:58:34,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:58:34,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-08 21:58:34,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:58:34,778 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-08 21:58:34,778 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2025-03-08 21:58:36,811 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 160 [2025-03-08 21:58:36,813 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 439 places, 766 transitions, 13092 flow. Second operand has 15 states, 15 states have (on average 118.8) internal successors, (1782), 15 states have internal predecessors, (1782), 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) [2025-03-08 21:58:36,813 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:58:36,813 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 160 [2025-03-08 21:58:36,813 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:58:39,073 INFO L124 PetriNetUnfolderBase]: 1935/5584 cut-off events. [2025-03-08 21:58:39,074 INFO L125 PetriNetUnfolderBase]: For 93265/93578 co-relation queries the response was YES. [2025-03-08 21:58:39,103 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37552 conditions, 5584 events. 1935/5584 cut-off events. For 93265/93578 co-relation queries the response was YES. Maximal size of possible extension queue 240. Compared 48150 event pairs, 215 based on Foata normal form. 114/5661 useless extension candidates. Maximal degree in co-relation 37189. Up to 1653 conditions per place. [2025-03-08 21:58:39,116 INFO L140 encePairwiseOnDemand]: 131/160 looper letters, 971 selfloop transitions, 220 changer transitions 12/1348 dead transitions. [2025-03-08 21:58:39,116 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 452 places, 1348 transitions, 25106 flow [2025-03-08 21:58:39,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-08 21:58:39,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-03-08 21:58:39,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 2456 transitions. [2025-03-08 21:58:39,118 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8078947368421052 [2025-03-08 21:58:39,118 INFO L175 Difference]: Start difference. First operand has 439 places, 766 transitions, 13092 flow. Second operand 19 states and 2456 transitions. [2025-03-08 21:58:39,118 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 452 places, 1348 transitions, 25106 flow [2025-03-08 21:58:39,509 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 441 places, 1348 transitions, 24910 flow, removed 25 selfloop flow, removed 11 redundant places. [2025-03-08 21:58:39,524 INFO L231 Difference]: Finished difference. Result has 455 places, 917 transitions, 17674 flow [2025-03-08 21:58:39,525 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=160, PETRI_DIFFERENCE_MINUEND_FLOW=12965, PETRI_DIFFERENCE_MINUEND_PLACES=423, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=766, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=73, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=576, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=17674, PETRI_PLACES=455, PETRI_TRANSITIONS=917} [2025-03-08 21:58:39,525 INFO L279 CegarLoopForPetriNet]: 160 programPoint places, 295 predicate places. [2025-03-08 21:58:39,525 INFO L471 AbstractCegarLoop]: Abstraction has has 455 places, 917 transitions, 17674 flow [2025-03-08 21:58:39,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 118.8) internal successors, (1782), 15 states have internal predecessors, (1782), 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) [2025-03-08 21:58:39,526 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:58:39,526 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:58:39,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 21:58:39,526 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-08 21:58:39,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:58:39,528 INFO L85 PathProgramCache]: Analyzing trace with hash -993892860, now seen corresponding path program 11 times [2025-03-08 21:58:39,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:58:39,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068377458] [2025-03-08 21:58:39,528 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 21:58:39,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:58:39,541 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 168 statements into 11 equivalence classes. [2025-03-08 21:58:39,553 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) and asserted 168 of 168 statements. [2025-03-08 21:58:39,553 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2025-03-08 21:58:39,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:58:40,048 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 236 trivial. 0 not checked. [2025-03-08 21:58:40,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:58:40,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068377458] [2025-03-08 21:58:40,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068377458] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:58:40,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:58:40,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 21:58:40,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888113543] [2025-03-08 21:58:40,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:58:40,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 21:58:40,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:58:40,050 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 21:58:40,050 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-08 21:58:40,791 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 160 [2025-03-08 21:58:40,792 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 455 places, 917 transitions, 17674 flow. Second operand has 10 states, 10 states have (on average 128.0) internal successors, (1280), 10 states have internal predecessors, (1280), 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) [2025-03-08 21:58:40,792 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:58:40,792 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 160 [2025-03-08 21:58:40,792 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:58:42,220 INFO L124 PetriNetUnfolderBase]: 1647/5024 cut-off events. [2025-03-08 21:58:42,220 INFO L125 PetriNetUnfolderBase]: For 96857/97243 co-relation queries the response was YES. [2025-03-08 21:58:42,257 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35343 conditions, 5024 events. 1647/5024 cut-off events. For 96857/97243 co-relation queries the response was YES. Maximal size of possible extension queue 240. Compared 44386 event pairs, 234 based on Foata normal form. 223/5186 useless extension candidates. Maximal degree in co-relation 34968. Up to 2364 conditions per place. [2025-03-08 21:58:42,271 INFO L140 encePairwiseOnDemand]: 140/160 looper letters, 382 selfloop transitions, 379 changer transitions 9/959 dead transitions. [2025-03-08 21:58:42,271 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 465 places, 959 transitions, 19840 flow [2025-03-08 21:58:42,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 21:58:42,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-08 21:58:42,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1495 transitions. [2025-03-08 21:58:42,272 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8494318181818182 [2025-03-08 21:58:42,272 INFO L175 Difference]: Start difference. First operand has 455 places, 917 transitions, 17674 flow. Second operand 11 states and 1495 transitions. [2025-03-08 21:58:42,272 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 465 places, 959 transitions, 19840 flow [2025-03-08 21:58:42,706 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 462 places, 959 transitions, 19750 flow, removed 18 selfloop flow, removed 3 redundant places. [2025-03-08 21:58:42,719 INFO L231 Difference]: Finished difference. Result has 464 places, 921 transitions, 18465 flow [2025-03-08 21:58:42,719 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=160, PETRI_DIFFERENCE_MINUEND_FLOW=17584, PETRI_DIFFERENCE_MINUEND_PLACES=452, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=917, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=375, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=540, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=18465, PETRI_PLACES=464, PETRI_TRANSITIONS=921} [2025-03-08 21:58:42,720 INFO L279 CegarLoopForPetriNet]: 160 programPoint places, 304 predicate places. [2025-03-08 21:58:42,720 INFO L471 AbstractCegarLoop]: Abstraction has has 464 places, 921 transitions, 18465 flow [2025-03-08 21:58:42,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 128.0) internal successors, (1280), 10 states have internal predecessors, (1280), 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) [2025-03-08 21:58:42,720 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:58:42,720 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:58:42,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 21:58:42,720 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-08 21:58:42,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:58:42,722 INFO L85 PathProgramCache]: Analyzing trace with hash 1650972464, now seen corresponding path program 12 times [2025-03-08 21:58:42,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:58:42,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290115075] [2025-03-08 21:58:42,722 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-08 21:58:42,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:58:42,729 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 168 statements into 11 equivalence classes. [2025-03-08 21:58:42,733 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 116 of 168 statements. [2025-03-08 21:58:42,734 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-08 21:58:42,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:58:43,181 INFO L134 CoverageAnalysis]: Checked inductivity of 238 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2025-03-08 21:58:43,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:58:43,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290115075] [2025-03-08 21:58:43,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290115075] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:58:43,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:58:43,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 21:58:43,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375826277] [2025-03-08 21:58:43,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:58:43,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 21:58:43,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:58:43,183 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 21:58:43,183 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-03-08 21:58:44,036 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 160 [2025-03-08 21:58:44,037 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 464 places, 921 transitions, 18465 flow. Second operand has 10 states, 10 states have (on average 128.0) internal successors, (1280), 10 states have internal predecessors, (1280), 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) [2025-03-08 21:58:44,037 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:58:44,037 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 160 [2025-03-08 21:58:44,037 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:58:45,770 INFO L124 PetriNetUnfolderBase]: 1664/5089 cut-off events. [2025-03-08 21:58:45,770 INFO L125 PetriNetUnfolderBase]: For 106325/106696 co-relation queries the response was YES. [2025-03-08 21:58:45,810 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36929 conditions, 5089 events. 1664/5089 cut-off events. For 106325/106696 co-relation queries the response was YES. Maximal size of possible extension queue 242. Compared 45123 event pairs, 131 based on Foata normal form. 171/5201 useless extension candidates. Maximal degree in co-relation 36589. Up to 1808 conditions per place. [2025-03-08 21:58:45,824 INFO L140 encePairwiseOnDemand]: 142/160 looper letters, 496 selfloop transitions, 368 changer transitions 9/1062 dead transitions. [2025-03-08 21:58:45,824 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 474 places, 1062 transitions, 22199 flow [2025-03-08 21:58:45,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 21:58:45,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-08 21:58:45,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1514 transitions. [2025-03-08 21:58:45,826 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8602272727272727 [2025-03-08 21:58:45,826 INFO L175 Difference]: Start difference. First operand has 464 places, 921 transitions, 18465 flow. Second operand 11 states and 1514 transitions. [2025-03-08 21:58:45,826 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 474 places, 1062 transitions, 22199 flow [2025-03-08 21:58:46,304 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 466 places, 1062 transitions, 21401 flow, removed 21 selfloop flow, removed 8 redundant places. [2025-03-08 21:58:46,319 INFO L231 Difference]: Finished difference. Result has 470 places, 949 transitions, 19430 flow [2025-03-08 21:58:46,320 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=160, PETRI_DIFFERENCE_MINUEND_FLOW=17725, PETRI_DIFFERENCE_MINUEND_PLACES=456, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=921, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=341, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=571, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=19430, PETRI_PLACES=470, PETRI_TRANSITIONS=949} [2025-03-08 21:58:46,320 INFO L279 CegarLoopForPetriNet]: 160 programPoint places, 310 predicate places. [2025-03-08 21:58:46,320 INFO L471 AbstractCegarLoop]: Abstraction has has 470 places, 949 transitions, 19430 flow [2025-03-08 21:58:46,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 128.0) internal successors, (1280), 10 states have internal predecessors, (1280), 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) [2025-03-08 21:58:46,321 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:58:46,321 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:58:46,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-08 21:58:46,321 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-08 21:58:46,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:58:46,322 INFO L85 PathProgramCache]: Analyzing trace with hash -577393004, now seen corresponding path program 13 times [2025-03-08 21:58:46,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:58:46,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215333157] [2025-03-08 21:58:46,322 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-08 21:58:46,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:58:46,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-08 21:58:46,351 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-08 21:58:46,351 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:58:46,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:58:49,684 INFO L134 CoverageAnalysis]: Checked inductivity of 238 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 236 trivial. 0 not checked. [2025-03-08 21:58:49,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:58:49,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215333157] [2025-03-08 21:58:49,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215333157] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 21:58:49,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1632561451] [2025-03-08 21:58:49,685 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-08 21:58:49,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 21:58:49,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 21:58:49,687 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 21:58:49,688 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-08 21:58:49,755 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-08 21:58:49,789 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-08 21:58:49,789 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:58:49,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:58:49,791 INFO L256 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 65 conjuncts are in the unsatisfiable core [2025-03-08 21:58:49,795 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 21:58:50,006 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2025-03-08 21:58:50,081 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2025-03-08 21:58:50,125 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-03-08 21:58:50,125 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 15 [2025-03-08 21:58:50,172 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2025-03-08 21:58:50,251 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 21:58:50,252 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 21:58:50,254 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 21:58:50,254 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 43 [2025-03-08 21:58:50,382 INFO L349 Elim1Store]: treesize reduction 190, result has 14.4 percent of original size [2025-03-08 21:58:50,382 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 116 treesize of output 124 [2025-03-08 21:58:50,500 INFO L349 Elim1Store]: treesize reduction 231, result has 12.2 percent of original size [2025-03-08 21:58:50,500 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 12 case distinctions, treesize of input 128 treesize of output 139 [2025-03-08 21:58:50,598 INFO L134 CoverageAnalysis]: Checked inductivity of 238 backedges. 0 proven. 226 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 21:58:50,598 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 21:58:50,965 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 19 [2025-03-08 21:58:50,966 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2025-03-08 21:58:50,968 INFO L134 CoverageAnalysis]: Checked inductivity of 238 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2025-03-08 21:58:50,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1632561451] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-08 21:58:50,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-08 21:58:50,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [14, 25] total 46 [2025-03-08 21:58:50,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106343169] [2025-03-08 21:58:50,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:58:50,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 21:58:50,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:58:50,969 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 21:58:50,969 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=2004, Unknown=0, NotChecked=0, Total=2162 [2025-03-08 21:58:52,018 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 160 [2025-03-08 21:58:52,020 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 470 places, 949 transitions, 19430 flow. Second operand has 10 states, 10 states have (on average 126.1) internal successors, (1261), 10 states have internal predecessors, (1261), 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) [2025-03-08 21:58:52,020 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:58:52,020 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 160 [2025-03-08 21:58:52,020 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand