./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/test-easy11.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 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/weaver/test-easy11.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-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 ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash dd59a2dab1e1a10d8308eb629ebc6f779430a45291e09beb1ad6d6fe62d16e94 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 02:28:17,065 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 02:28:17,118 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 02:28:17,122 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 02:28:17,122 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 02:28:17,142 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 02:28:17,143 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 02:28:17,143 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 02:28:17,144 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 02:28:17,144 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 02:28:17,144 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 02:28:17,144 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 02:28:17,144 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 02:28:17,144 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 02:28:17,144 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 02:28:17,145 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 02:28:17,145 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 02:28:17,145 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 02:28:17,145 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 02:28:17,145 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 02:28:17,145 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 02:28:17,145 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 02:28:17,145 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 02:28:17,145 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 02:28:17,145 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 02:28:17,145 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 02:28:17,145 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 02:28:17,146 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 02:28:17,146 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 02:28:17,146 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 02:28:17,146 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 02:28:17,146 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 02:28:17,146 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 02:28:17,146 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 02:28:17,146 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 02:28:17,146 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 02:28:17,146 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 02:28:17,147 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 02:28:17,147 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 02:28:17,147 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 02:28:17,147 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 02:28:17,147 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 02:28:17,147 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 02:28:17,147 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 ! call(reach_error())) ) 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 -> dd59a2dab1e1a10d8308eb629ebc6f779430a45291e09beb1ad6d6fe62d16e94 [2025-03-04 02:28:17,387 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 02:28:17,394 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 02:28:17,396 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 02:28:17,397 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 02:28:17,397 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 02:28:17,399 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/test-easy11.wvr.c [2025-03-04 02:28:18,550 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe921cc85/67c251235dea4d1a928657f3c85d9e47/FLAG7342235be [2025-03-04 02:28:18,760 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 02:28:18,761 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/test-easy11.wvr.c [2025-03-04 02:28:18,769 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe921cc85/67c251235dea4d1a928657f3c85d9e47/FLAG7342235be [2025-03-04 02:28:19,119 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe921cc85/67c251235dea4d1a928657f3c85d9e47 [2025-03-04 02:28:19,121 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 02:28:19,122 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 02:28:19,123 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 02:28:19,123 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 02:28:19,126 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 02:28:19,127 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:28:19" (1/1) ... [2025-03-04 02:28:19,127 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c7956c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:28:19, skipping insertion in model container [2025-03-04 02:28:19,127 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:28:19" (1/1) ... [2025-03-04 02:28:19,139 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 02:28:19,237 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/test-easy11.wvr.c[1841,1854] [2025-03-04 02:28:19,240 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 02:28:19,246 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 02:28:19,255 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/test-easy11.wvr.c[1841,1854] [2025-03-04 02:28:19,255 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 02:28:19,265 INFO L204 MainTranslator]: Completed translation [2025-03-04 02:28:19,266 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:28:19 WrapperNode [2025-03-04 02:28:19,266 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 02:28:19,267 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 02:28:19,267 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 02:28:19,268 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 02:28:19,273 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:28:19" (1/1) ... [2025-03-04 02:28:19,277 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:28:19" (1/1) ... [2025-03-04 02:28:19,286 INFO L138 Inliner]: procedures = 18, calls = 10, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 41 [2025-03-04 02:28:19,289 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 02:28:19,289 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 02:28:19,289 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 02:28:19,289 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 02:28:19,294 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:28:19" (1/1) ... [2025-03-04 02:28:19,294 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:28:19" (1/1) ... [2025-03-04 02:28:19,295 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:28:19" (1/1) ... [2025-03-04 02:28:19,307 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-04 02:28:19,308 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:28:19" (1/1) ... [2025-03-04 02:28:19,308 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:28:19" (1/1) ... [2025-03-04 02:28:19,310 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:28:19" (1/1) ... [2025-03-04 02:28:19,311 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:28:19" (1/1) ... [2025-03-04 02:28:19,311 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:28:19" (1/1) ... [2025-03-04 02:28:19,311 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:28:19" (1/1) ... [2025-03-04 02:28:19,312 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 02:28:19,313 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 02:28:19,313 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 02:28:19,313 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 02:28:19,314 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:28:19" (1/1) ... [2025-03-04 02:28:19,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 02:28:19,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:28:19,337 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-04 02:28:19,339 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-04 02:28:19,356 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 02:28:19,356 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-04 02:28:19,356 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-04 02:28:19,357 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-04 02:28:19,357 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-04 02:28:19,357 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 02:28:19,357 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 02:28:19,357 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 02:28:19,358 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 02:28:19,418 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 02:28:19,421 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 02:28:19,558 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 02:28:19,559 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 02:28:19,639 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 02:28:19,642 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 02:28:19,643 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:28:19 BoogieIcfgContainer [2025-03-04 02:28:19,643 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 02:28:19,644 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 02:28:19,645 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 02:28:19,648 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 02:28:19,648 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 02:28:19" (1/3) ... [2025-03-04 02:28:19,648 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@231f99a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:28:19, skipping insertion in model container [2025-03-04 02:28:19,648 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:28:19" (2/3) ... [2025-03-04 02:28:19,649 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@231f99a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:28:19, skipping insertion in model container [2025-03-04 02:28:19,649 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:28:19" (3/3) ... [2025-03-04 02:28:19,649 INFO L128 eAbstractionObserver]: Analyzing ICFG test-easy11.wvr.c [2025-03-04 02:28:19,660 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 02:28:19,662 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG test-easy11.wvr.c that has 3 procedures, 21 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-03-04 02:28:19,663 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 02:28:19,700 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-04 02:28:19,727 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 27 places, 22 transitions, 58 flow [2025-03-04 02:28:19,746 INFO L124 PetriNetUnfolderBase]: 2/20 cut-off events. [2025-03-04 02:28:19,749 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 02:28:19,751 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29 conditions, 20 events. 2/20 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 16 event pairs, 0 based on Foata normal form. 0/17 useless extension candidates. Maximal degree in co-relation 15. Up to 2 conditions per place. [2025-03-04 02:28:19,752 INFO L82 GeneralOperation]: Start removeDead. Operand has 27 places, 22 transitions, 58 flow [2025-03-04 02:28:19,754 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 24 places, 19 transitions, 50 flow [2025-03-04 02:28:19,764 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 02:28:19,775 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;@5824b53a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 02:28:19,775 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-03-04 02:28:19,781 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 02:28:19,781 INFO L124 PetriNetUnfolderBase]: 2/18 cut-off events. [2025-03-04 02:28:19,783 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 02:28:19,783 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:28:19,784 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:28:19,784 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:28:19,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:28:19,787 INFO L85 PathProgramCache]: Analyzing trace with hash -317440562, now seen corresponding path program 1 times [2025-03-04 02:28:19,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:28:19,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993408537] [2025-03-04 02:28:19,795 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:28:19,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:28:19,849 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 02:28:19,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 02:28:19,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:28:19,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:28:20,189 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-04 02:28:20,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:28:20,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993408537] [2025-03-04 02:28:20,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993408537] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:28:20,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:28:20,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 02:28:20,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380280514] [2025-03-04 02:28:20,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:28:20,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 02:28:20,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:28:20,215 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 02:28:20,216 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-04 02:28:20,252 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 22 [2025-03-04 02:28:20,254 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 19 transitions, 50 flow. Second operand has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 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-04 02:28:20,256 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:28:20,256 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 22 [2025-03-04 02:28:20,257 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:28:20,522 INFO L124 PetriNetUnfolderBase]: 111/201 cut-off events. [2025-03-04 02:28:20,523 INFO L125 PetriNetUnfolderBase]: For 27/27 co-relation queries the response was YES. [2025-03-04 02:28:20,523 INFO L83 FinitePrefix]: Finished finitePrefix Result has 428 conditions, 201 events. 111/201 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 609 event pairs, 2 based on Foata normal form. 1/174 useless extension candidates. Maximal degree in co-relation 364. Up to 57 conditions per place. [2025-03-04 02:28:20,526 INFO L140 encePairwiseOnDemand]: 13/22 looper letters, 40 selfloop transitions, 10 changer transitions 10/61 dead transitions. [2025-03-04 02:28:20,527 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 61 transitions, 278 flow [2025-03-04 02:28:20,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 02:28:20,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 02:28:20,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 88 transitions. [2025-03-04 02:28:20,538 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2025-03-04 02:28:20,539 INFO L175 Difference]: Start difference. First operand has 24 places, 19 transitions, 50 flow. Second operand 9 states and 88 transitions. [2025-03-04 02:28:20,540 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 61 transitions, 278 flow [2025-03-04 02:28:20,543 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 61 transitions, 254 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 02:28:20,548 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 107 flow [2025-03-04 02:28:20,550 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=42, PETRI_DIFFERENCE_MINUEND_PLACES=20, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=107, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2025-03-04 02:28:20,553 INFO L279 CegarLoopForPetriNet]: 24 programPoint places, 10 predicate places. [2025-03-04 02:28:20,554 INFO L471 AbstractCegarLoop]: Abstraction has has 34 places, 27 transitions, 107 flow [2025-03-04 02:28:20,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 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-04 02:28:20,555 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:28:20,555 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:28:20,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 02:28:20,555 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:28:20,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:28:20,556 INFO L85 PathProgramCache]: Analyzing trace with hash 541205236, now seen corresponding path program 2 times [2025-03-04 02:28:20,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:28:20,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733522360] [2025-03-04 02:28:20,556 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:28:20,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:28:20,563 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 1 equivalence classes. [2025-03-04 02:28:20,567 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 02:28:20,568 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 02:28:20,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:28:20,716 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-04 02:28:20,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:28:20,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733522360] [2025-03-04 02:28:20,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733522360] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:28:20,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:28:20,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 02:28:20,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358647763] [2025-03-04 02:28:20,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:28:20,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 02:28:20,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:28:20,719 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 02:28:20,719 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-04 02:28:20,725 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 22 [2025-03-04 02:28:20,726 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 27 transitions, 107 flow. Second operand has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 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-04 02:28:20,726 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:28:20,726 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 22 [2025-03-04 02:28:20,726 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:28:20,955 INFO L124 PetriNetUnfolderBase]: 114/208 cut-off events. [2025-03-04 02:28:20,955 INFO L125 PetriNetUnfolderBase]: For 94/94 co-relation queries the response was YES. [2025-03-04 02:28:20,957 INFO L83 FinitePrefix]: Finished finitePrefix Result has 588 conditions, 208 events. 114/208 cut-off events. For 94/94 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 610 event pairs, 14 based on Foata normal form. 1/198 useless extension candidates. Maximal degree in co-relation 575. Up to 115 conditions per place. [2025-03-04 02:28:20,958 INFO L140 encePairwiseOnDemand]: 13/22 looper letters, 34 selfloop transitions, 14 changer transitions 10/59 dead transitions. [2025-03-04 02:28:20,959 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 59 transitions, 336 flow [2025-03-04 02:28:20,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 02:28:20,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 02:28:20,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 83 transitions. [2025-03-04 02:28:20,961 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.41919191919191917 [2025-03-04 02:28:20,961 INFO L175 Difference]: Start difference. First operand has 34 places, 27 transitions, 107 flow. Second operand 9 states and 83 transitions. [2025-03-04 02:28:20,962 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 59 transitions, 336 flow [2025-03-04 02:28:20,963 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 59 transitions, 324 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-03-04 02:28:20,965 INFO L231 Difference]: Finished difference. Result has 43 places, 35 transitions, 190 flow [2025-03-04 02:28:20,966 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=190, PETRI_PLACES=43, PETRI_TRANSITIONS=35} [2025-03-04 02:28:20,966 INFO L279 CegarLoopForPetriNet]: 24 programPoint places, 19 predicate places. [2025-03-04 02:28:20,967 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 35 transitions, 190 flow [2025-03-04 02:28:20,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 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-04 02:28:20,967 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:28:20,967 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:28:20,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 02:28:20,967 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:28:20,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:28:20,967 INFO L85 PathProgramCache]: Analyzing trace with hash -699367322, now seen corresponding path program 3 times [2025-03-04 02:28:20,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:28:20,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664861028] [2025-03-04 02:28:20,967 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:28:20,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:28:20,975 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 17 statements into 1 equivalence classes. [2025-03-04 02:28:20,979 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 02:28:20,980 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 02:28:20,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:28:21,120 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-04 02:28:21,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:28:21,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664861028] [2025-03-04 02:28:21,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664861028] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:28:21,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:28:21,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 02:28:21,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706748131] [2025-03-04 02:28:21,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:28:21,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 02:28:21,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:28:21,121 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 02:28:21,122 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-04 02:28:21,133 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 22 [2025-03-04 02:28:21,134 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 35 transitions, 190 flow. Second operand has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 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-04 02:28:21,134 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:28:21,134 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 22 [2025-03-04 02:28:21,134 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:28:21,328 INFO L124 PetriNetUnfolderBase]: 119/216 cut-off events. [2025-03-04 02:28:21,328 INFO L125 PetriNetUnfolderBase]: For 196/196 co-relation queries the response was YES. [2025-03-04 02:28:21,329 INFO L83 FinitePrefix]: Finished finitePrefix Result has 705 conditions, 216 events. 119/216 cut-off events. For 196/196 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 661 event pairs, 11 based on Foata normal form. 1/217 useless extension candidates. Maximal degree in co-relation 688. Up to 119 conditions per place. [2025-03-04 02:28:21,330 INFO L140 encePairwiseOnDemand]: 13/22 looper letters, 39 selfloop transitions, 18 changer transitions 9/67 dead transitions. [2025-03-04 02:28:21,330 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 67 transitions, 450 flow [2025-03-04 02:28:21,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 02:28:21,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 02:28:21,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 86 transitions. [2025-03-04 02:28:21,331 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.43434343434343436 [2025-03-04 02:28:21,331 INFO L175 Difference]: Start difference. First operand has 43 places, 35 transitions, 190 flow. Second operand 9 states and 86 transitions. [2025-03-04 02:28:21,331 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 67 transitions, 450 flow [2025-03-04 02:28:21,333 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 67 transitions, 418 flow, removed 6 selfloop flow, removed 4 redundant places. [2025-03-04 02:28:21,334 INFO L231 Difference]: Finished difference. Result has 49 places, 40 transitions, 257 flow [2025-03-04 02:28:21,334 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=167, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=257, PETRI_PLACES=49, PETRI_TRANSITIONS=40} [2025-03-04 02:28:21,335 INFO L279 CegarLoopForPetriNet]: 24 programPoint places, 25 predicate places. [2025-03-04 02:28:21,335 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 40 transitions, 257 flow [2025-03-04 02:28:21,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 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-04 02:28:21,335 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:28:21,335 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:28:21,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 02:28:21,335 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:28:21,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:28:21,336 INFO L85 PathProgramCache]: Analyzing trace with hash 1553897768, now seen corresponding path program 4 times [2025-03-04 02:28:21,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:28:21,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829176390] [2025-03-04 02:28:21,336 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:28:21,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:28:21,340 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 17 statements into 2 equivalence classes. [2025-03-04 02:28:21,344 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 02:28:21,344 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 02:28:21,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:28:21,467 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-04 02:28:21,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:28:21,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829176390] [2025-03-04 02:28:21,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829176390] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:28:21,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:28:21,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 02:28:21,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750779836] [2025-03-04 02:28:21,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:28:21,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 02:28:21,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:28:21,469 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 02:28:21,469 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-04 02:28:21,489 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 22 [2025-03-04 02:28:21,490 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 40 transitions, 257 flow. Second operand has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 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-04 02:28:21,490 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:28:21,490 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 22 [2025-03-04 02:28:21,490 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:28:21,700 INFO L124 PetriNetUnfolderBase]: 194/329 cut-off events. [2025-03-04 02:28:21,700 INFO L125 PetriNetUnfolderBase]: For 603/603 co-relation queries the response was YES. [2025-03-04 02:28:21,701 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1221 conditions, 329 events. 194/329 cut-off events. For 603/603 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1081 event pairs, 35 based on Foata normal form. 1/330 useless extension candidates. Maximal degree in co-relation 1203. Up to 140 conditions per place. [2025-03-04 02:28:21,702 INFO L140 encePairwiseOnDemand]: 12/22 looper letters, 44 selfloop transitions, 37 changer transitions 8/90 dead transitions. [2025-03-04 02:28:21,702 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 90 transitions, 737 flow [2025-03-04 02:28:21,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 02:28:21,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 02:28:21,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 90 transitions. [2025-03-04 02:28:21,708 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5113636363636364 [2025-03-04 02:28:21,708 INFO L175 Difference]: Start difference. First operand has 49 places, 40 transitions, 257 flow. Second operand 8 states and 90 transitions. [2025-03-04 02:28:21,708 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 90 transitions, 737 flow [2025-03-04 02:28:21,710 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 90 transitions, 661 flow, removed 6 selfloop flow, removed 6 redundant places. [2025-03-04 02:28:21,711 INFO L231 Difference]: Finished difference. Result has 53 places, 64 transitions, 518 flow [2025-03-04 02:28:21,711 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=217, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=518, PETRI_PLACES=53, PETRI_TRANSITIONS=64} [2025-03-04 02:28:21,712 INFO L279 CegarLoopForPetriNet]: 24 programPoint places, 29 predicate places. [2025-03-04 02:28:21,712 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 64 transitions, 518 flow [2025-03-04 02:28:21,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 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-04 02:28:21,712 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:28:21,712 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:28:21,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 02:28:21,713 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:28:21,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:28:21,713 INFO L85 PathProgramCache]: Analyzing trace with hash 31400426, now seen corresponding path program 5 times [2025-03-04 02:28:21,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:28:21,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025768217] [2025-03-04 02:28:21,713 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:28:21,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:28:21,719 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 17 statements into 1 equivalence classes. [2025-03-04 02:28:21,722 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 02:28:21,725 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 02:28:21,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:28:21,842 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-04 02:28:21,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:28:21,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025768217] [2025-03-04 02:28:21,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025768217] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:28:21,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:28:21,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 02:28:21,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032652718] [2025-03-04 02:28:21,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:28:21,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 02:28:21,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:28:21,844 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 02:28:21,844 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-04 02:28:21,858 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 22 [2025-03-04 02:28:21,859 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 64 transitions, 518 flow. Second operand has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 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-04 02:28:21,859 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:28:21,859 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 22 [2025-03-04 02:28:21,859 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:28:22,038 INFO L124 PetriNetUnfolderBase]: 207/357 cut-off events. [2025-03-04 02:28:22,038 INFO L125 PetriNetUnfolderBase]: For 817/817 co-relation queries the response was YES. [2025-03-04 02:28:22,040 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1463 conditions, 357 events. 207/357 cut-off events. For 817/817 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1302 event pairs, 16 based on Foata normal form. 1/358 useless extension candidates. Maximal degree in co-relation 1442. Up to 185 conditions per place. [2025-03-04 02:28:22,041 INFO L140 encePairwiseOnDemand]: 13/22 looper letters, 53 selfloop transitions, 33 changer transitions 10/97 dead transitions. [2025-03-04 02:28:22,041 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 97 transitions, 859 flow [2025-03-04 02:28:22,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 02:28:22,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 02:28:22,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 90 transitions. [2025-03-04 02:28:22,044 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45454545454545453 [2025-03-04 02:28:22,044 INFO L175 Difference]: Start difference. First operand has 53 places, 64 transitions, 518 flow. Second operand 9 states and 90 transitions. [2025-03-04 02:28:22,044 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 97 transitions, 859 flow [2025-03-04 02:28:22,050 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 97 transitions, 839 flow, removed 10 selfloop flow, removed 1 redundant places. [2025-03-04 02:28:22,051 INFO L231 Difference]: Finished difference. Result has 62 places, 66 transitions, 591 flow [2025-03-04 02:28:22,052 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=500, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=591, PETRI_PLACES=62, PETRI_TRANSITIONS=66} [2025-03-04 02:28:22,053 INFO L279 CegarLoopForPetriNet]: 24 programPoint places, 38 predicate places. [2025-03-04 02:28:22,053 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 66 transitions, 591 flow [2025-03-04 02:28:22,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 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-04 02:28:22,054 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:28:22,054 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:28:22,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 02:28:22,056 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:28:22,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:28:22,057 INFO L85 PathProgramCache]: Analyzing trace with hash 513661970, now seen corresponding path program 6 times [2025-03-04 02:28:22,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:28:22,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375930676] [2025-03-04 02:28:22,057 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 02:28:22,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:28:22,062 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 17 statements into 1 equivalence classes. [2025-03-04 02:28:22,066 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 02:28:22,066 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-04 02:28:22,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:28:22,189 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-04 02:28:22,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:28:22,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375930676] [2025-03-04 02:28:22,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375930676] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:28:22,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:28:22,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 02:28:22,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289083879] [2025-03-04 02:28:22,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:28:22,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 02:28:22,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:28:22,190 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 02:28:22,191 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-04 02:28:22,198 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 22 [2025-03-04 02:28:22,198 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 66 transitions, 591 flow. Second operand has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 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-04 02:28:22,198 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:28:22,198 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 22 [2025-03-04 02:28:22,198 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:28:22,391 INFO L124 PetriNetUnfolderBase]: 225/385 cut-off events. [2025-03-04 02:28:22,391 INFO L125 PetriNetUnfolderBase]: For 1166/1166 co-relation queries the response was YES. [2025-03-04 02:28:22,393 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1761 conditions, 385 events. 225/385 cut-off events. For 1166/1166 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1404 event pairs, 20 based on Foata normal form. 1/386 useless extension candidates. Maximal degree in co-relation 1737. Up to 209 conditions per place. [2025-03-04 02:28:22,395 INFO L140 encePairwiseOnDemand]: 12/22 looper letters, 51 selfloop transitions, 39 changer transitions 10/101 dead transitions. [2025-03-04 02:28:22,395 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 101 transitions, 1023 flow [2025-03-04 02:28:22,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 02:28:22,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 02:28:22,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 87 transitions. [2025-03-04 02:28:22,396 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4393939393939394 [2025-03-04 02:28:22,396 INFO L175 Difference]: Start difference. First operand has 62 places, 66 transitions, 591 flow. Second operand 9 states and 87 transitions. [2025-03-04 02:28:22,397 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 101 transitions, 1023 flow [2025-03-04 02:28:22,401 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 101 transitions, 933 flow, removed 6 selfloop flow, removed 7 redundant places. [2025-03-04 02:28:22,402 INFO L231 Difference]: Finished difference. Result has 66 places, 77 transitions, 765 flow [2025-03-04 02:28:22,402 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=519, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=765, PETRI_PLACES=66, PETRI_TRANSITIONS=77} [2025-03-04 02:28:22,403 INFO L279 CegarLoopForPetriNet]: 24 programPoint places, 42 predicate places. [2025-03-04 02:28:22,403 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 77 transitions, 765 flow [2025-03-04 02:28:22,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 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-04 02:28:22,403 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:28:22,403 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:28:22,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 02:28:22,404 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:28:22,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:28:22,404 INFO L85 PathProgramCache]: Analyzing trace with hash -1139291404, now seen corresponding path program 7 times [2025-03-04 02:28:22,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:28:22,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851957658] [2025-03-04 02:28:22,404 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 02:28:22,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:28:22,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 02:28:22,411 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 02:28:22,411 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:28:22,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:28:22,525 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-04 02:28:22,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:28:22,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851957658] [2025-03-04 02:28:22,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851957658] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:28:22,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:28:22,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 02:28:22,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745373893] [2025-03-04 02:28:22,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:28:22,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 02:28:22,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:28:22,526 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 02:28:22,526 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-04 02:28:22,534 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 22 [2025-03-04 02:28:22,535 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 77 transitions, 765 flow. Second operand has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 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-04 02:28:22,535 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:28:22,535 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 22 [2025-03-04 02:28:22,535 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:28:22,733 INFO L124 PetriNetUnfolderBase]: 218/373 cut-off events. [2025-03-04 02:28:22,733 INFO L125 PetriNetUnfolderBase]: For 1416/1416 co-relation queries the response was YES. [2025-03-04 02:28:22,734 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1830 conditions, 373 events. 218/373 cut-off events. For 1416/1416 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1375 event pairs, 15 based on Foata normal form. 1/374 useless extension candidates. Maximal degree in co-relation 1803. Up to 197 conditions per place. [2025-03-04 02:28:22,736 INFO L140 encePairwiseOnDemand]: 13/22 looper letters, 56 selfloop transitions, 36 changer transitions 12/105 dead transitions. [2025-03-04 02:28:22,736 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 105 transitions, 1124 flow [2025-03-04 02:28:22,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 02:28:22,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 02:28:22,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 86 transitions. [2025-03-04 02:28:22,738 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.43434343434343436 [2025-03-04 02:28:22,738 INFO L175 Difference]: Start difference. First operand has 66 places, 77 transitions, 765 flow. Second operand 9 states and 86 transitions. [2025-03-04 02:28:22,738 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 105 transitions, 1124 flow [2025-03-04 02:28:22,742 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 105 transitions, 1063 flow, removed 14 selfloop flow, removed 4 redundant places. [2025-03-04 02:28:22,744 INFO L231 Difference]: Finished difference. Result has 69 places, 74 transitions, 752 flow [2025-03-04 02:28:22,744 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=710, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=752, PETRI_PLACES=69, PETRI_TRANSITIONS=74} [2025-03-04 02:28:22,745 INFO L279 CegarLoopForPetriNet]: 24 programPoint places, 45 predicate places. [2025-03-04 02:28:22,745 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 74 transitions, 752 flow [2025-03-04 02:28:22,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 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-04 02:28:22,745 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:28:22,745 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:28:22,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 02:28:22,746 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:28:22,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:28:22,746 INFO L85 PathProgramCache]: Analyzing trace with hash 968494814, now seen corresponding path program 8 times [2025-03-04 02:28:22,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:28:22,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258103725] [2025-03-04 02:28:22,746 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:28:22,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:28:22,752 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 1 equivalence classes. [2025-03-04 02:28:22,759 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 02:28:22,759 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 02:28:22,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:28:22,853 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-04 02:28:22,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:28:22,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258103725] [2025-03-04 02:28:22,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258103725] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:28:22,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:28:22,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 02:28:22,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822896679] [2025-03-04 02:28:22,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:28:22,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 02:28:22,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:28:22,854 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 02:28:22,854 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-04 02:28:22,864 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 22 [2025-03-04 02:28:22,864 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 74 transitions, 752 flow. Second operand has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 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-04 02:28:22,864 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:28:22,864 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 22 [2025-03-04 02:28:22,864 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:28:23,078 INFO L124 PetriNetUnfolderBase]: 214/366 cut-off events. [2025-03-04 02:28:23,079 INFO L125 PetriNetUnfolderBase]: For 1463/1463 co-relation queries the response was YES. [2025-03-04 02:28:23,080 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1801 conditions, 366 events. 214/366 cut-off events. For 1463/1463 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1323 event pairs, 17 based on Foata normal form. 1/367 useless extension candidates. Maximal degree in co-relation 1775. Up to 195 conditions per place. [2025-03-04 02:28:23,082 INFO L140 encePairwiseOnDemand]: 12/22 looper letters, 50 selfloop transitions, 38 changer transitions 9/98 dead transitions. [2025-03-04 02:28:23,082 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 98 transitions, 1071 flow [2025-03-04 02:28:23,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 02:28:23,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 02:28:23,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 87 transitions. [2025-03-04 02:28:23,084 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4393939393939394 [2025-03-04 02:28:23,084 INFO L175 Difference]: Start difference. First operand has 69 places, 74 transitions, 752 flow. Second operand 9 states and 87 transitions. [2025-03-04 02:28:23,084 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 98 transitions, 1071 flow [2025-03-04 02:28:23,090 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 98 transitions, 991 flow, removed 3 selfloop flow, removed 6 redundant places. [2025-03-04 02:28:23,092 INFO L231 Difference]: Finished difference. Result has 71 places, 76 transitions, 798 flow [2025-03-04 02:28:23,092 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=674, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=798, PETRI_PLACES=71, PETRI_TRANSITIONS=76} [2025-03-04 02:28:23,093 INFO L279 CegarLoopForPetriNet]: 24 programPoint places, 47 predicate places. [2025-03-04 02:28:23,093 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 76 transitions, 798 flow [2025-03-04 02:28:23,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 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-04 02:28:23,093 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:28:23,093 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:28:23,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 02:28:23,093 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:28:23,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:28:23,094 INFO L85 PathProgramCache]: Analyzing trace with hash 433265012, now seen corresponding path program 9 times [2025-03-04 02:28:23,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:28:23,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601601746] [2025-03-04 02:28:23,094 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:28:23,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:28:23,098 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 17 statements into 1 equivalence classes. [2025-03-04 02:28:23,101 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 02:28:23,102 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 02:28:23,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:28:23,214 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-04 02:28:23,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:28:23,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601601746] [2025-03-04 02:28:23,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601601746] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:28:23,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:28:23,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 02:28:23,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256563345] [2025-03-04 02:28:23,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:28:23,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 02:28:23,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:28:23,215 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 02:28:23,215 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-04 02:28:23,222 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 22 [2025-03-04 02:28:23,222 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 76 transitions, 798 flow. Second operand has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 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-04 02:28:23,222 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:28:23,222 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 22 [2025-03-04 02:28:23,222 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:28:23,406 INFO L124 PetriNetUnfolderBase]: 212/364 cut-off events. [2025-03-04 02:28:23,406 INFO L125 PetriNetUnfolderBase]: For 1559/1559 co-relation queries the response was YES. [2025-03-04 02:28:23,407 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1816 conditions, 364 events. 212/364 cut-off events. For 1559/1559 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1322 event pairs, 19 based on Foata normal form. 1/365 useless extension candidates. Maximal degree in co-relation 1787. Up to 193 conditions per place. [2025-03-04 02:28:23,409 INFO L140 encePairwiseOnDemand]: 12/22 looper letters, 49 selfloop transitions, 36 changer transitions 11/97 dead transitions. [2025-03-04 02:28:23,409 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 97 transitions, 1079 flow [2025-03-04 02:28:23,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 02:28:23,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 02:28:23,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 85 transitions. [2025-03-04 02:28:23,410 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4292929292929293 [2025-03-04 02:28:23,410 INFO L175 Difference]: Start difference. First operand has 71 places, 76 transitions, 798 flow. Second operand 9 states and 85 transitions. [2025-03-04 02:28:23,410 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 97 transitions, 1079 flow [2025-03-04 02:28:23,432 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 97 transitions, 1005 flow, removed 8 selfloop flow, removed 5 redundant places. [2025-03-04 02:28:23,433 INFO L231 Difference]: Finished difference. Result has 74 places, 74 transitions, 775 flow [2025-03-04 02:28:23,434 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=726, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=775, PETRI_PLACES=74, PETRI_TRANSITIONS=74} [2025-03-04 02:28:23,434 INFO L279 CegarLoopForPetriNet]: 24 programPoint places, 50 predicate places. [2025-03-04 02:28:23,434 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 74 transitions, 775 flow [2025-03-04 02:28:23,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 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-04 02:28:23,434 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:28:23,434 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:28:23,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 02:28:23,434 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:28:23,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:28:23,435 INFO L85 PathProgramCache]: Analyzing trace with hash -396266158, now seen corresponding path program 10 times [2025-03-04 02:28:23,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:28:23,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763289697] [2025-03-04 02:28:23,435 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:28:23,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:28:23,438 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 17 statements into 2 equivalence classes. [2025-03-04 02:28:23,440 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 02:28:23,440 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 02:28:23,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:28:23,551 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-04 02:28:23,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:28:23,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763289697] [2025-03-04 02:28:23,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763289697] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:28:23,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:28:23,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 02:28:23,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937705378] [2025-03-04 02:28:23,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:28:23,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 02:28:23,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:28:23,553 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 02:28:23,553 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-04 02:28:23,560 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 22 [2025-03-04 02:28:23,560 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 74 transitions, 775 flow. Second operand has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 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-04 02:28:23,560 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:28:23,560 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 22 [2025-03-04 02:28:23,560 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:28:23,742 INFO L124 PetriNetUnfolderBase]: 285/475 cut-off events. [2025-03-04 02:28:23,743 INFO L125 PetriNetUnfolderBase]: For 2283/2283 co-relation queries the response was YES. [2025-03-04 02:28:23,744 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2463 conditions, 475 events. 285/475 cut-off events. For 2283/2283 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 1793 event pairs, 42 based on Foata normal form. 1/476 useless extension candidates. Maximal degree in co-relation 2434. Up to 216 conditions per place. [2025-03-04 02:28:23,746 INFO L140 encePairwiseOnDemand]: 12/22 looper letters, 61 selfloop transitions, 52 changer transitions 9/123 dead transitions. [2025-03-04 02:28:23,746 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 123 transitions, 1448 flow [2025-03-04 02:28:23,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 02:28:23,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 02:28:23,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 96 transitions. [2025-03-04 02:28:23,747 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.48484848484848486 [2025-03-04 02:28:23,747 INFO L175 Difference]: Start difference. First operand has 74 places, 74 transitions, 775 flow. Second operand 9 states and 96 transitions. [2025-03-04 02:28:23,747 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 123 transitions, 1448 flow [2025-03-04 02:28:23,753 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 123 transitions, 1334 flow, removed 3 selfloop flow, removed 7 redundant places. [2025-03-04 02:28:23,755 INFO L231 Difference]: Finished difference. Result has 77 places, 95 transitions, 1139 flow [2025-03-04 02:28:23,757 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=699, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1139, PETRI_PLACES=77, PETRI_TRANSITIONS=95} [2025-03-04 02:28:23,757 INFO L279 CegarLoopForPetriNet]: 24 programPoint places, 53 predicate places. [2025-03-04 02:28:23,757 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 95 transitions, 1139 flow [2025-03-04 02:28:23,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 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-04 02:28:23,757 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:28:23,757 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:28:23,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 02:28:23,757 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:28:23,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:28:23,758 INFO L85 PathProgramCache]: Analyzing trace with hash -9879194, now seen corresponding path program 11 times [2025-03-04 02:28:23,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:28:23,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115575918] [2025-03-04 02:28:23,758 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:28:23,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:28:23,762 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 17 statements into 1 equivalence classes. [2025-03-04 02:28:23,765 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 02:28:23,765 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 02:28:23,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:28:23,855 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-04 02:28:23,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:28:23,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115575918] [2025-03-04 02:28:23,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115575918] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:28:23,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:28:23,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 02:28:23,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883985182] [2025-03-04 02:28:23,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:28:23,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 02:28:23,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:28:23,855 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 02:28:23,856 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-04 02:28:23,863 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 22 [2025-03-04 02:28:23,864 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 95 transitions, 1139 flow. Second operand has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 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-04 02:28:23,864 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:28:23,864 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 22 [2025-03-04 02:28:23,864 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:28:24,047 INFO L124 PetriNetUnfolderBase]: 287/483 cut-off events. [2025-03-04 02:28:24,047 INFO L125 PetriNetUnfolderBase]: For 2524/2524 co-relation queries the response was YES. [2025-03-04 02:28:24,048 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2647 conditions, 483 events. 287/483 cut-off events. For 2524/2524 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 1859 event pairs, 29 based on Foata normal form. 1/484 useless extension candidates. Maximal degree in co-relation 2614. Up to 242 conditions per place. [2025-03-04 02:28:24,051 INFO L140 encePairwiseOnDemand]: 12/22 looper letters, 53 selfloop transitions, 50 changer transitions 14/118 dead transitions. [2025-03-04 02:28:24,051 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 118 transitions, 1476 flow [2025-03-04 02:28:24,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 02:28:24,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 02:28:24,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 86 transitions. [2025-03-04 02:28:24,052 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.43434343434343436 [2025-03-04 02:28:24,052 INFO L175 Difference]: Start difference. First operand has 77 places, 95 transitions, 1139 flow. Second operand 9 states and 86 transitions. [2025-03-04 02:28:24,052 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 118 transitions, 1476 flow [2025-03-04 02:28:24,059 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 118 transitions, 1416 flow, removed 14 selfloop flow, removed 3 redundant places. [2025-03-04 02:28:24,060 INFO L231 Difference]: Finished difference. Result has 82 places, 92 transitions, 1142 flow [2025-03-04 02:28:24,061 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=1082, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1142, PETRI_PLACES=82, PETRI_TRANSITIONS=92} [2025-03-04 02:28:24,061 INFO L279 CegarLoopForPetriNet]: 24 programPoint places, 58 predicate places. [2025-03-04 02:28:24,061 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 92 transitions, 1142 flow [2025-03-04 02:28:24,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 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-04 02:28:24,061 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:28:24,062 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:28:24,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 02:28:24,062 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:28:24,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:28:24,062 INFO L85 PathProgramCache]: Analyzing trace with hash 1399138266, now seen corresponding path program 12 times [2025-03-04 02:28:24,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:28:24,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388341745] [2025-03-04 02:28:24,062 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 02:28:24,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:28:24,065 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 17 statements into 1 equivalence classes. [2025-03-04 02:28:24,068 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 02:28:24,068 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-04 02:28:24,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:28:24,147 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-04 02:28:24,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:28:24,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388341745] [2025-03-04 02:28:24,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388341745] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:28:24,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:28:24,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 02:28:24,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938387484] [2025-03-04 02:28:24,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:28:24,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 02:28:24,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:28:24,149 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 02:28:24,149 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-04 02:28:24,157 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 22 [2025-03-04 02:28:24,157 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 92 transitions, 1142 flow. Second operand has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 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-04 02:28:24,158 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:28:24,158 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 22 [2025-03-04 02:28:24,158 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:28:24,335 INFO L124 PetriNetUnfolderBase]: 301/503 cut-off events. [2025-03-04 02:28:24,335 INFO L125 PetriNetUnfolderBase]: For 2844/2844 co-relation queries the response was YES. [2025-03-04 02:28:24,336 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2700 conditions, 503 events. 301/503 cut-off events. For 2844/2844 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 1928 event pairs, 26 based on Foata normal form. 1/504 useless extension candidates. Maximal degree in co-relation 2667. Up to 248 conditions per place. [2025-03-04 02:28:24,339 INFO L140 encePairwiseOnDemand]: 12/22 looper letters, 56 selfloop transitions, 51 changer transitions 11/119 dead transitions. [2025-03-04 02:28:24,339 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 119 transitions, 1503 flow [2025-03-04 02:28:24,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 02:28:24,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 02:28:24,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 88 transitions. [2025-03-04 02:28:24,340 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2025-03-04 02:28:24,340 INFO L175 Difference]: Start difference. First operand has 82 places, 92 transitions, 1142 flow. Second operand 9 states and 88 transitions. [2025-03-04 02:28:24,340 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 119 transitions, 1503 flow [2025-03-04 02:28:24,346 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 119 transitions, 1385 flow, removed 9 selfloop flow, removed 7 redundant places. [2025-03-04 02:28:24,348 INFO L231 Difference]: Finished difference. Result has 82 places, 93 transitions, 1153 flow [2025-03-04 02:28:24,349 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=1030, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1153, PETRI_PLACES=82, PETRI_TRANSITIONS=93} [2025-03-04 02:28:24,349 INFO L279 CegarLoopForPetriNet]: 24 programPoint places, 58 predicate places. [2025-03-04 02:28:24,349 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 93 transitions, 1153 flow [2025-03-04 02:28:24,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 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-04 02:28:24,349 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:28:24,349 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:28:24,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 02:28:24,350 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:28:24,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:28:24,350 INFO L85 PathProgramCache]: Analyzing trace with hash 1473500810, now seen corresponding path program 13 times [2025-03-04 02:28:24,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:28:24,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950460244] [2025-03-04 02:28:24,350 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 02:28:24,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:28:24,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 02:28:24,355 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 02:28:24,355 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:28:24,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:28:24,423 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-04 02:28:24,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:28:24,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950460244] [2025-03-04 02:28:24,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950460244] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:28:24,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:28:24,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 02:28:24,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710108674] [2025-03-04 02:28:24,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:28:24,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 02:28:24,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:28:24,424 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 02:28:24,425 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-04 02:28:24,432 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 22 [2025-03-04 02:28:24,433 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 93 transitions, 1153 flow. Second operand has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 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-04 02:28:24,433 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:28:24,433 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 22 [2025-03-04 02:28:24,433 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:28:24,616 INFO L124 PetriNetUnfolderBase]: 313/525 cut-off events. [2025-03-04 02:28:24,616 INFO L125 PetriNetUnfolderBase]: For 3341/3341 co-relation queries the response was YES. [2025-03-04 02:28:24,617 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2919 conditions, 525 events. 313/525 cut-off events. For 3341/3341 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2009 event pairs, 39 based on Foata normal form. 1/526 useless extension candidates. Maximal degree in co-relation 2885. Up to 272 conditions per place. [2025-03-04 02:28:24,620 INFO L140 encePairwiseOnDemand]: 12/22 looper letters, 59 selfloop transitions, 56 changer transitions 11/127 dead transitions. [2025-03-04 02:28:24,620 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 127 transitions, 1713 flow [2025-03-04 02:28:24,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 02:28:24,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 02:28:24,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 85 transitions. [2025-03-04 02:28:24,621 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4292929292929293 [2025-03-04 02:28:24,621 INFO L175 Difference]: Start difference. First operand has 82 places, 93 transitions, 1153 flow. Second operand 9 states and 85 transitions. [2025-03-04 02:28:24,621 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 127 transitions, 1713 flow [2025-03-04 02:28:24,628 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 127 transitions, 1584 flow, removed 7 selfloop flow, removed 7 redundant places. [2025-03-04 02:28:24,630 INFO L231 Difference]: Finished difference. Result has 86 places, 104 transitions, 1386 flow [2025-03-04 02:28:24,630 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=1040, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1386, PETRI_PLACES=86, PETRI_TRANSITIONS=104} [2025-03-04 02:28:24,631 INFO L279 CegarLoopForPetriNet]: 24 programPoint places, 62 predicate places. [2025-03-04 02:28:24,631 INFO L471 AbstractCegarLoop]: Abstraction has has 86 places, 104 transitions, 1386 flow [2025-03-04 02:28:24,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 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-04 02:28:24,631 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:28:24,631 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:28:24,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 02:28:24,632 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:28:24,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:28:24,632 INFO L85 PathProgramCache]: Analyzing trace with hash -368722892, now seen corresponding path program 14 times [2025-03-04 02:28:24,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:28:24,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623807309] [2025-03-04 02:28:24,633 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:28:24,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:28:24,637 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 1 equivalence classes. [2025-03-04 02:28:24,640 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 02:28:24,640 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 02:28:24,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:28:24,725 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-04 02:28:24,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:28:24,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623807309] [2025-03-04 02:28:24,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623807309] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:28:24,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:28:24,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 02:28:24,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025107089] [2025-03-04 02:28:24,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:28:24,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 02:28:24,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:28:24,727 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 02:28:24,727 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-04 02:28:24,737 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 22 [2025-03-04 02:28:24,737 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 104 transitions, 1386 flow. Second operand has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 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-04 02:28:24,737 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:28:24,737 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 22 [2025-03-04 02:28:24,737 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:28:24,917 INFO L124 PetriNetUnfolderBase]: 321/541 cut-off events. [2025-03-04 02:28:24,918 INFO L125 PetriNetUnfolderBase]: For 3977/3977 co-relation queries the response was YES. [2025-03-04 02:28:24,919 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3104 conditions, 541 events. 321/541 cut-off events. For 3977/3977 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2116 event pairs, 39 based on Foata normal form. 1/542 useless extension candidates. Maximal degree in co-relation 3067. Up to 276 conditions per place. [2025-03-04 02:28:24,921 INFO L140 encePairwiseOnDemand]: 13/22 looper letters, 69 selfloop transitions, 52 changer transitions 9/131 dead transitions. [2025-03-04 02:28:24,922 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 131 transitions, 1836 flow [2025-03-04 02:28:24,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 02:28:24,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 02:28:24,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 84 transitions. [2025-03-04 02:28:24,923 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42424242424242425 [2025-03-04 02:28:24,923 INFO L175 Difference]: Start difference. First operand has 86 places, 104 transitions, 1386 flow. Second operand 9 states and 84 transitions. [2025-03-04 02:28:24,923 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 131 transitions, 1836 flow [2025-03-04 02:28:24,932 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 131 transitions, 1745 flow, removed 24 selfloop flow, removed 4 redundant places. [2025-03-04 02:28:24,934 INFO L231 Difference]: Finished difference. Result has 91 places, 107 transitions, 1449 flow [2025-03-04 02:28:24,935 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=1301, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1449, PETRI_PLACES=91, PETRI_TRANSITIONS=107} [2025-03-04 02:28:24,936 INFO L279 CegarLoopForPetriNet]: 24 programPoint places, 67 predicate places. [2025-03-04 02:28:24,936 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 107 transitions, 1449 flow [2025-03-04 02:28:24,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 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-04 02:28:24,936 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:28:24,936 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:28:24,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 02:28:24,936 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:28:24,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:28:24,936 INFO L85 PathProgramCache]: Analyzing trace with hash 2041258070, now seen corresponding path program 15 times [2025-03-04 02:28:24,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:28:24,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560399904] [2025-03-04 02:28:24,937 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:28:24,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:28:24,940 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 17 statements into 1 equivalence classes. [2025-03-04 02:28:24,942 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 02:28:24,942 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 02:28:24,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:28:25,024 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-04 02:28:25,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:28:25,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560399904] [2025-03-04 02:28:25,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560399904] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:28:25,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:28:25,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 02:28:25,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559634396] [2025-03-04 02:28:25,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:28:25,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 02:28:25,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:28:25,025 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 02:28:25,026 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-04 02:28:25,034 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 22 [2025-03-04 02:28:25,035 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 107 transitions, 1449 flow. Second operand has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 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-04 02:28:25,035 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:28:25,035 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 22 [2025-03-04 02:28:25,035 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:28:25,217 INFO L124 PetriNetUnfolderBase]: 325/549 cut-off events. [2025-03-04 02:28:25,217 INFO L125 PetriNetUnfolderBase]: For 4058/4058 co-relation queries the response was YES. [2025-03-04 02:28:25,218 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3189 conditions, 549 events. 325/549 cut-off events. For 4058/4058 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2165 event pairs, 32 based on Foata normal form. 1/550 useless extension candidates. Maximal degree in co-relation 3151. Up to 196 conditions per place. [2025-03-04 02:28:25,220 INFO L140 encePairwiseOnDemand]: 13/22 looper letters, 72 selfloop transitions, 51 changer transitions 9/133 dead transitions. [2025-03-04 02:28:25,220 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 133 transitions, 1902 flow [2025-03-04 02:28:25,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 02:28:25,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 02:28:25,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 81 transitions. [2025-03-04 02:28:25,221 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4090909090909091 [2025-03-04 02:28:25,221 INFO L175 Difference]: Start difference. First operand has 91 places, 107 transitions, 1449 flow. Second operand 9 states and 81 transitions. [2025-03-04 02:28:25,221 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 133 transitions, 1902 flow [2025-03-04 02:28:25,229 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 133 transitions, 1785 flow, removed 10 selfloop flow, removed 7 redundant places. [2025-03-04 02:28:25,231 INFO L231 Difference]: Finished difference. Result has 92 places, 108 transitions, 1460 flow [2025-03-04 02:28:25,231 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=1334, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1460, PETRI_PLACES=92, PETRI_TRANSITIONS=108} [2025-03-04 02:28:25,232 INFO L279 CegarLoopForPetriNet]: 24 programPoint places, 68 predicate places. [2025-03-04 02:28:25,232 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 108 transitions, 1460 flow [2025-03-04 02:28:25,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 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-04 02:28:25,232 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:28:25,232 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:28:25,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 02:28:25,232 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:28:25,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:28:25,232 INFO L85 PathProgramCache]: Analyzing trace with hash 2008730612, now seen corresponding path program 16 times [2025-03-04 02:28:25,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:28:25,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334379454] [2025-03-04 02:28:25,232 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:28:25,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:28:25,235 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 17 statements into 2 equivalence classes. [2025-03-04 02:28:25,238 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 02:28:25,238 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 02:28:25,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:28:25,327 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-04 02:28:25,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:28:25,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334379454] [2025-03-04 02:28:25,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334379454] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:28:25,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:28:25,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 02:28:25,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301585353] [2025-03-04 02:28:25,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:28:25,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 02:28:25,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:28:25,329 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 02:28:25,330 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-04 02:28:25,335 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 22 [2025-03-04 02:28:25,335 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 108 transitions, 1460 flow. Second operand has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 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-04 02:28:25,335 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:28:25,335 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 22 [2025-03-04 02:28:25,335 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:28:25,582 INFO L124 PetriNetUnfolderBase]: 344/582 cut-off events. [2025-03-04 02:28:25,582 INFO L125 PetriNetUnfolderBase]: For 4342/4342 co-relation queries the response was YES. [2025-03-04 02:28:25,584 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3353 conditions, 582 events. 344/582 cut-off events. For 4342/4342 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2350 event pairs, 72 based on Foata normal form. 1/583 useless extension candidates. Maximal degree in co-relation 3315. Up to 277 conditions per place. [2025-03-04 02:28:25,586 INFO L140 encePairwiseOnDemand]: 12/22 looper letters, 65 selfloop transitions, 56 changer transitions 13/135 dead transitions. [2025-03-04 02:28:25,587 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 135 transitions, 1921 flow [2025-03-04 02:28:25,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 02:28:25,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 02:28:25,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 90 transitions. [2025-03-04 02:28:25,588 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5113636363636364 [2025-03-04 02:28:25,588 INFO L175 Difference]: Start difference. First operand has 92 places, 108 transitions, 1460 flow. Second operand 8 states and 90 transitions. [2025-03-04 02:28:25,588 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 135 transitions, 1921 flow [2025-03-04 02:28:25,596 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 135 transitions, 1778 flow, removed 11 selfloop flow, removed 7 redundant places. [2025-03-04 02:28:25,598 INFO L231 Difference]: Finished difference. Result has 92 places, 106 transitions, 1417 flow [2025-03-04 02:28:25,599 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=1324, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1417, PETRI_PLACES=92, PETRI_TRANSITIONS=106} [2025-03-04 02:28:25,599 INFO L279 CegarLoopForPetriNet]: 24 programPoint places, 68 predicate places. [2025-03-04 02:28:25,600 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 106 transitions, 1417 flow [2025-03-04 02:28:25,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 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-04 02:28:25,600 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:28:25,600 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:28:25,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 02:28:25,600 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:28:25,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:28:25,601 INFO L85 PathProgramCache]: Analyzing trace with hash -1598782571, now seen corresponding path program 1 times [2025-03-04 02:28:25,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:28:25,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395545522] [2025-03-04 02:28:25,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:28:25,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:28:25,604 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 02:28:25,607 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 02:28:25,607 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:28:25,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:28:25,632 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-04 02:28:25,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:28:25,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395545522] [2025-03-04 02:28:25,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395545522] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:28:25,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [675766558] [2025-03-04 02:28:25,633 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:28:25,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:28:25,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:28:25,635 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-04 02:28:25,637 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-04 02:28:25,663 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 02:28:25,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 02:28:25,673 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:28:25,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:28:25,678 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 02:28:25,681 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:28:25,708 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-04 02:28:25,708 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:28:25,736 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:28:25,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [675766558] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 02:28:25,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 02:28:25,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 6 [2025-03-04 02:28:25,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463523260] [2025-03-04 02:28:25,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:28:25,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 02:28:25,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:28:25,737 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 02:28:25,737 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 02:28:25,742 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 22 [2025-03-04 02:28:25,742 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 106 transitions, 1417 flow. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 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-04 02:28:25,743 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:28:25,743 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 22 [2025-03-04 02:28:25,743 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:28:25,845 INFO L124 PetriNetUnfolderBase]: 383/661 cut-off events. [2025-03-04 02:28:25,846 INFO L125 PetriNetUnfolderBase]: For 4314/4314 co-relation queries the response was YES. [2025-03-04 02:28:25,847 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3582 conditions, 661 events. 383/661 cut-off events. For 4314/4314 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 2872 event pairs, 45 based on Foata normal form. 11/672 useless extension candidates. Maximal degree in co-relation 3541. Up to 343 conditions per place. [2025-03-04 02:28:25,851 INFO L140 encePairwiseOnDemand]: 17/22 looper letters, 107 selfloop transitions, 31 changer transitions 0/139 dead transitions. [2025-03-04 02:28:25,851 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 139 transitions, 1920 flow [2025-03-04 02:28:25,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 02:28:25,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 02:28:25,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2025-03-04 02:28:25,852 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5818181818181818 [2025-03-04 02:28:25,852 INFO L175 Difference]: Start difference. First operand has 92 places, 106 transitions, 1417 flow. Second operand 5 states and 64 transitions. [2025-03-04 02:28:25,852 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 139 transitions, 1920 flow [2025-03-04 02:28:25,862 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 139 transitions, 1782 flow, removed 10 selfloop flow, removed 7 redundant places. [2025-03-04 02:28:25,864 INFO L231 Difference]: Finished difference. Result has 91 places, 110 transitions, 1431 flow [2025-03-04 02:28:25,864 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=1242, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1431, PETRI_PLACES=91, PETRI_TRANSITIONS=110} [2025-03-04 02:28:25,864 INFO L279 CegarLoopForPetriNet]: 24 programPoint places, 67 predicate places. [2025-03-04 02:28:25,864 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 110 transitions, 1431 flow [2025-03-04 02:28:25,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 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-04 02:28:25,864 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:28:25,865 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:28:25,871 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-04 02:28:26,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-04 02:28:26,072 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:28:26,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:28:26,073 INFO L85 PathProgramCache]: Analyzing trace with hash 1148940206, now seen corresponding path program 1 times [2025-03-04 02:28:26,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:28:26,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910433993] [2025-03-04 02:28:26,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:28:26,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:28:26,077 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 02:28:26,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 02:28:26,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:28:26,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:28:26,100 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:28:26,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:28:26,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910433993] [2025-03-04 02:28:26,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910433993] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:28:26,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:28:26,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 02:28:26,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62747493] [2025-03-04 02:28:26,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:28:26,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 02:28:26,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:28:26,102 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 02:28:26,102 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 02:28:26,103 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 22 [2025-03-04 02:28:26,103 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 110 transitions, 1431 flow. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 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-04 02:28:26,103 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:28:26,103 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 22 [2025-03-04 02:28:26,103 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:28:26,211 INFO L124 PetriNetUnfolderBase]: 371/649 cut-off events. [2025-03-04 02:28:26,212 INFO L125 PetriNetUnfolderBase]: For 5403/5403 co-relation queries the response was YES. [2025-03-04 02:28:26,213 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3657 conditions, 649 events. 371/649 cut-off events. For 5403/5403 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 2857 event pairs, 52 based on Foata normal form. 12/661 useless extension candidates. Maximal degree in co-relation 3333. Up to 167 conditions per place. [2025-03-04 02:28:26,216 INFO L140 encePairwiseOnDemand]: 16/22 looper letters, 98 selfloop transitions, 37 changer transitions 6/142 dead transitions. [2025-03-04 02:28:26,216 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 142 transitions, 1950 flow [2025-03-04 02:28:26,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 02:28:26,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 02:28:26,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 77 transitions. [2025-03-04 02:28:26,217 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5 [2025-03-04 02:28:26,217 INFO L175 Difference]: Start difference. First operand has 91 places, 110 transitions, 1431 flow. Second operand 7 states and 77 transitions. [2025-03-04 02:28:26,217 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 142 transitions, 1950 flow [2025-03-04 02:28:26,249 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 142 transitions, 1932 flow, removed 3 selfloop flow, removed 2 redundant places. [2025-03-04 02:28:26,250 INFO L231 Difference]: Finished difference. Result has 97 places, 111 transitions, 1565 flow [2025-03-04 02:28:26,250 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=1387, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1565, PETRI_PLACES=97, PETRI_TRANSITIONS=111} [2025-03-04 02:28:26,251 INFO L279 CegarLoopForPetriNet]: 24 programPoint places, 73 predicate places. [2025-03-04 02:28:26,252 INFO L471 AbstractCegarLoop]: Abstraction has has 97 places, 111 transitions, 1565 flow [2025-03-04 02:28:26,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 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-04 02:28:26,252 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:28:26,252 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:28:26,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-04 02:28:26,252 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:28:26,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:28:26,253 INFO L85 PathProgramCache]: Analyzing trace with hash 1183354852, now seen corresponding path program 2 times [2025-03-04 02:28:26,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:28:26,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093798072] [2025-03-04 02:28:26,253 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:28:26,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:28:26,255 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-03-04 02:28:26,260 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 02:28:26,260 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:28:26,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:28:26,283 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-04 02:28:26,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:28:26,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093798072] [2025-03-04 02:28:26,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093798072] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:28:26,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1000227920] [2025-03-04 02:28:26,284 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:28:26,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:28:26,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:28:26,286 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-04 02:28:26,287 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-04 02:28:26,309 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-03-04 02:28:26,318 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 02:28:26,318 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:28:26,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:28:26,319 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 02:28:26,320 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:28:26,325 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-04 02:28:26,325 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:28:26,350 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:28:26,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1000227920] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 02:28:26,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 02:28:26,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 7 [2025-03-04 02:28:26,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835703376] [2025-03-04 02:28:26,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:28:26,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 02:28:26,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:28:26,351 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 02:28:26,351 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-04 02:28:26,356 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 22 [2025-03-04 02:28:26,356 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 111 transitions, 1565 flow. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 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-04 02:28:26,356 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:28:26,356 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 22 [2025-03-04 02:28:26,356 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:28:26,477 INFO L124 PetriNetUnfolderBase]: 444/787 cut-off events. [2025-03-04 02:28:26,477 INFO L125 PetriNetUnfolderBase]: For 7746/7746 co-relation queries the response was YES. [2025-03-04 02:28:26,479 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4624 conditions, 787 events. 444/787 cut-off events. For 7746/7746 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 3612 event pairs, 91 based on Foata normal form. 8/795 useless extension candidates. Maximal degree in co-relation 3877. Up to 306 conditions per place. [2025-03-04 02:28:26,482 INFO L140 encePairwiseOnDemand]: 16/22 looper letters, 128 selfloop transitions, 37 changer transitions 0/166 dead transitions. [2025-03-04 02:28:26,482 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 166 transitions, 2384 flow [2025-03-04 02:28:26,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 02:28:26,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 02:28:26,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 86 transitions. [2025-03-04 02:28:26,483 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6515151515151515 [2025-03-04 02:28:26,483 INFO L175 Difference]: Start difference. First operand has 97 places, 111 transitions, 1565 flow. Second operand 6 states and 86 transitions. [2025-03-04 02:28:26,483 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 166 transitions, 2384 flow [2025-03-04 02:28:26,495 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 166 transitions, 2192 flow, removed 50 selfloop flow, removed 3 redundant places. [2025-03-04 02:28:26,496 INFO L231 Difference]: Finished difference. Result has 102 places, 118 transitions, 1663 flow [2025-03-04 02:28:26,496 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=1418, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1663, PETRI_PLACES=102, PETRI_TRANSITIONS=118} [2025-03-04 02:28:26,497 INFO L279 CegarLoopForPetriNet]: 24 programPoint places, 78 predicate places. [2025-03-04 02:28:26,497 INFO L471 AbstractCegarLoop]: Abstraction has has 102 places, 118 transitions, 1663 flow [2025-03-04 02:28:26,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 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-04 02:28:26,497 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:28:26,497 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:28:26,503 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 02:28:26,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:28:26,698 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:28:26,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:28:26,698 INFO L85 PathProgramCache]: Analyzing trace with hash 173623545, now seen corresponding path program 2 times [2025-03-04 02:28:26,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:28:26,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971208989] [2025-03-04 02:28:26,698 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:28:26,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:28:26,701 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-03-04 02:28:26,704 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 02:28:26,706 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:28:26,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:28:26,728 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-04 02:28:26,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:28:26,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971208989] [2025-03-04 02:28:26,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971208989] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:28:26,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [256894172] [2025-03-04 02:28:26,728 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:28:26,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:28:26,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:28:26,731 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-04 02:28:26,732 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-04 02:28:26,769 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-03-04 02:28:26,780 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 02:28:26,780 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:28:26,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:28:26,782 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 02:28:26,783 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:28:26,790 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-04 02:28:26,791 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:28:26,815 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:28:26,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [256894172] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 02:28:26,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 02:28:26,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 7 [2025-03-04 02:28:26,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661129340] [2025-03-04 02:28:26,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:28:26,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 02:28:26,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:28:26,816 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 02:28:26,816 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-04 02:28:26,821 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 22 [2025-03-04 02:28:26,821 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 118 transitions, 1663 flow. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 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-04 02:28:26,821 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:28:26,821 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 22 [2025-03-04 02:28:26,821 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:28:26,953 INFO L124 PetriNetUnfolderBase]: 558/1011 cut-off events. [2025-03-04 02:28:26,953 INFO L125 PetriNetUnfolderBase]: For 8665/8665 co-relation queries the response was YES. [2025-03-04 02:28:26,955 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5627 conditions, 1011 events. 558/1011 cut-off events. For 8665/8665 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 5059 event pairs, 52 based on Foata normal form. 9/1020 useless extension candidates. Maximal degree in co-relation 5503. Up to 508 conditions per place. [2025-03-04 02:28:26,959 INFO L140 encePairwiseOnDemand]: 15/22 looper letters, 126 selfloop transitions, 42 changer transitions 0/169 dead transitions. [2025-03-04 02:28:26,960 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 169 transitions, 2494 flow [2025-03-04 02:28:26,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 02:28:26,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 02:28:26,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 68 transitions. [2025-03-04 02:28:26,961 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6181818181818182 [2025-03-04 02:28:26,961 INFO L175 Difference]: Start difference. First operand has 102 places, 118 transitions, 1663 flow. Second operand 5 states and 68 transitions. [2025-03-04 02:28:26,961 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 169 transitions, 2494 flow [2025-03-04 02:28:26,977 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 169 transitions, 2414 flow, removed 16 selfloop flow, removed 2 redundant places. [2025-03-04 02:28:26,979 INFO L231 Difference]: Finished difference. Result has 107 places, 129 transitions, 1909 flow [2025-03-04 02:28:26,979 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=1591, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1909, PETRI_PLACES=107, PETRI_TRANSITIONS=129} [2025-03-04 02:28:26,979 INFO L279 CegarLoopForPetriNet]: 24 programPoint places, 83 predicate places. [2025-03-04 02:28:26,980 INFO L471 AbstractCegarLoop]: Abstraction has has 107 places, 129 transitions, 1909 flow [2025-03-04 02:28:26,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 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-04 02:28:26,980 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:28:26,980 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:28:26,986 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-04 02:28:27,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:28:27,181 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:28:27,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:28:27,181 INFO L85 PathProgramCache]: Analyzing trace with hash 360629290, now seen corresponding path program 3 times [2025-03-04 02:28:27,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:28:27,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317559378] [2025-03-04 02:28:27,181 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:28:27,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:28:27,186 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 18 statements into 2 equivalence classes. [2025-03-04 02:28:27,187 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 02:28:27,187 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 02:28:27,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:28:27,208 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:28:27,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:28:27,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317559378] [2025-03-04 02:28:27,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317559378] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:28:27,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:28:27,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 02:28:27,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569354081] [2025-03-04 02:28:27,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:28:27,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 02:28:27,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:28:27,210 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 02:28:27,210 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 02:28:27,214 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 22 [2025-03-04 02:28:27,214 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 129 transitions, 1909 flow. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 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-04 02:28:27,214 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:28:27,214 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 22 [2025-03-04 02:28:27,214 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:28:27,374 INFO L124 PetriNetUnfolderBase]: 504/916 cut-off events. [2025-03-04 02:28:27,374 INFO L125 PetriNetUnfolderBase]: For 9271/9271 co-relation queries the response was YES. [2025-03-04 02:28:27,377 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5436 conditions, 916 events. 504/916 cut-off events. For 9271/9271 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 4431 event pairs, 73 based on Foata normal form. 7/923 useless extension candidates. Maximal degree in co-relation 5289. Up to 226 conditions per place. [2025-03-04 02:28:27,382 INFO L140 encePairwiseOnDemand]: 16/22 looper letters, 129 selfloop transitions, 36 changer transitions 5/171 dead transitions. [2025-03-04 02:28:27,382 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 171 transitions, 2552 flow [2025-03-04 02:28:27,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 02:28:27,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 02:28:27,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 93 transitions. [2025-03-04 02:28:27,385 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5284090909090909 [2025-03-04 02:28:27,385 INFO L175 Difference]: Start difference. First operand has 107 places, 129 transitions, 1909 flow. Second operand 8 states and 93 transitions. [2025-03-04 02:28:27,385 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 171 transitions, 2552 flow [2025-03-04 02:28:27,402 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 171 transitions, 2510 flow, removed 17 selfloop flow, removed 2 redundant places. [2025-03-04 02:28:27,404 INFO L231 Difference]: Finished difference. Result has 112 places, 122 transitions, 1843 flow [2025-03-04 02:28:27,405 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=1806, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1843, PETRI_PLACES=112, PETRI_TRANSITIONS=122} [2025-03-04 02:28:27,406 INFO L279 CegarLoopForPetriNet]: 24 programPoint places, 88 predicate places. [2025-03-04 02:28:27,406 INFO L471 AbstractCegarLoop]: Abstraction has has 112 places, 122 transitions, 1843 flow [2025-03-04 02:28:27,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 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-04 02:28:27,406 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:28:27,406 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:28:27,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-04 02:28:27,406 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:28:27,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:28:27,407 INFO L85 PathProgramCache]: Analyzing trace with hash 529713679, now seen corresponding path program 3 times [2025-03-04 02:28:27,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:28:27,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587785921] [2025-03-04 02:28:27,408 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:28:27,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:28:27,410 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 18 statements into 2 equivalence classes. [2025-03-04 02:28:27,414 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 02:28:27,414 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 02:28:27,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:28:27,437 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:28:27,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:28:27,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587785921] [2025-03-04 02:28:27,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587785921] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:28:27,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:28:27,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 02:28:27,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123895714] [2025-03-04 02:28:27,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:28:27,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 02:28:27,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:28:27,440 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 02:28:27,440 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 02:28:27,443 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 22 [2025-03-04 02:28:27,444 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 122 transitions, 1843 flow. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 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-04 02:28:27,444 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:28:27,444 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 22 [2025-03-04 02:28:27,444 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:28:27,593 INFO L124 PetriNetUnfolderBase]: 465/840 cut-off events. [2025-03-04 02:28:27,593 INFO L125 PetriNetUnfolderBase]: For 8455/8455 co-relation queries the response was YES. [2025-03-04 02:28:27,595 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5095 conditions, 840 events. 465/840 cut-off events. For 8455/8455 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 3959 event pairs, 40 based on Foata normal form. 6/846 useless extension candidates. Maximal degree in co-relation 4336. Up to 324 conditions per place. [2025-03-04 02:28:27,603 INFO L140 encePairwiseOnDemand]: 16/22 looper letters, 119 selfloop transitions, 32 changer transitions 2/154 dead transitions. [2025-03-04 02:28:27,603 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 154 transitions, 2466 flow [2025-03-04 02:28:27,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 02:28:27,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 02:28:27,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 68 transitions. [2025-03-04 02:28:27,605 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5151515151515151 [2025-03-04 02:28:27,605 INFO L175 Difference]: Start difference. First operand has 112 places, 122 transitions, 1843 flow. Second operand 6 states and 68 transitions. [2025-03-04 02:28:27,605 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 154 transitions, 2466 flow [2025-03-04 02:28:27,620 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 154 transitions, 2382 flow, removed 18 selfloop flow, removed 4 redundant places. [2025-03-04 02:28:27,622 INFO L231 Difference]: Finished difference. Result has 114 places, 119 transitions, 1790 flow [2025-03-04 02:28:27,622 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=1725, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1790, PETRI_PLACES=114, PETRI_TRANSITIONS=119} [2025-03-04 02:28:27,622 INFO L279 CegarLoopForPetriNet]: 24 programPoint places, 90 predicate places. [2025-03-04 02:28:27,622 INFO L471 AbstractCegarLoop]: Abstraction has has 114 places, 119 transitions, 1790 flow [2025-03-04 02:28:27,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 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-04 02:28:27,623 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:28:27,623 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:28:27,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-04 02:28:27,623 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:28:27,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:28:27,623 INFO L85 PathProgramCache]: Analyzing trace with hash 97683250, now seen corresponding path program 4 times [2025-03-04 02:28:27,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:28:27,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143539123] [2025-03-04 02:28:27,624 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:28:27,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:28:27,626 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 18 statements into 2 equivalence classes. [2025-03-04 02:28:27,630 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 02:28:27,630 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 02:28:27,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:28:27,649 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-04 02:28:27,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:28:27,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143539123] [2025-03-04 02:28:27,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143539123] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:28:27,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [592343297] [2025-03-04 02:28:27,650 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:28:27,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:28:27,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:28:27,652 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-04 02:28:27,654 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-04 02:28:27,675 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 18 statements into 2 equivalence classes. [2025-03-04 02:28:27,684 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 02:28:27,684 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 02:28:27,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:28:27,685 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 02:28:27,686 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:28:27,699 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-04 02:28:27,700 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:28:27,720 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:28:27,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [592343297] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 02:28:27,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 02:28:27,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 7 [2025-03-04 02:28:27,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598204246] [2025-03-04 02:28:27,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:28:27,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 02:28:27,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:28:27,721 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 02:28:27,721 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-04 02:28:27,725 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 22 [2025-03-04 02:28:27,725 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 119 transitions, 1790 flow. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 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-04 02:28:27,725 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:28:27,725 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 22 [2025-03-04 02:28:27,725 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:28:27,842 INFO L124 PetriNetUnfolderBase]: 515/936 cut-off events. [2025-03-04 02:28:27,842 INFO L125 PetriNetUnfolderBase]: For 10439/10439 co-relation queries the response was YES. [2025-03-04 02:28:27,845 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5484 conditions, 936 events. 515/936 cut-off events. For 10439/10439 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 4538 event pairs, 73 based on Foata normal form. 14/950 useless extension candidates. Maximal degree in co-relation 4520. Up to 503 conditions per place. [2025-03-04 02:28:27,848 INFO L140 encePairwiseOnDemand]: 17/22 looper letters, 103 selfloop transitions, 37 changer transitions 5/146 dead transitions. [2025-03-04 02:28:27,848 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 146 transitions, 2398 flow [2025-03-04 02:28:27,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 02:28:27,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 02:28:27,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 60 transitions. [2025-03-04 02:28:27,850 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5454545454545454 [2025-03-04 02:28:27,850 INFO L175 Difference]: Start difference. First operand has 114 places, 119 transitions, 1790 flow. Second operand 5 states and 60 transitions. [2025-03-04 02:28:27,850 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 146 transitions, 2398 flow [2025-03-04 02:28:27,865 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 146 transitions, 2325 flow, removed 27 selfloop flow, removed 3 redundant places. [2025-03-04 02:28:27,868 INFO L231 Difference]: Finished difference. Result has 115 places, 116 transitions, 1851 flow [2025-03-04 02:28:27,868 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=1625, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1851, PETRI_PLACES=115, PETRI_TRANSITIONS=116} [2025-03-04 02:28:27,869 INFO L279 CegarLoopForPetriNet]: 24 programPoint places, 91 predicate places. [2025-03-04 02:28:27,869 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 116 transitions, 1851 flow [2025-03-04 02:28:27,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 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-04 02:28:27,869 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:28:27,870 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:28:27,875 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-04 02:28:28,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:28:28,070 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:28:28,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:28:28,071 INFO L85 PathProgramCache]: Analyzing trace with hash -559664049, now seen corresponding path program 4 times [2025-03-04 02:28:28,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:28:28,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389771377] [2025-03-04 02:28:28,071 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:28:28,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:28:28,073 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 18 statements into 2 equivalence classes. [2025-03-04 02:28:28,075 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 02:28:28,075 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 02:28:28,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:28:28,097 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-04 02:28:28,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:28:28,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389771377] [2025-03-04 02:28:28,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389771377] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:28:28,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1307508753] [2025-03-04 02:28:28,097 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:28:28,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:28:28,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:28:28,099 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-04 02:28:28,101 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-04 02:28:28,122 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 18 statements into 2 equivalence classes. [2025-03-04 02:28:28,130 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 02:28:28,130 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 02:28:28,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:28:28,131 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 02:28:28,132 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:28:28,139 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-04 02:28:28,140 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:28:28,163 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:28:28,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1307508753] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 02:28:28,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 02:28:28,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 8 [2025-03-04 02:28:28,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157329646] [2025-03-04 02:28:28,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:28:28,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 02:28:28,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:28:28,165 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 02:28:28,165 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-04 02:28:28,169 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 22 [2025-03-04 02:28:28,169 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 116 transitions, 1851 flow. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 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-04 02:28:28,169 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:28:28,169 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 22 [2025-03-04 02:28:28,169 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:28:28,296 INFO L124 PetriNetUnfolderBase]: 474/861 cut-off events. [2025-03-04 02:28:28,296 INFO L125 PetriNetUnfolderBase]: For 9841/9841 co-relation queries the response was YES. [2025-03-04 02:28:28,298 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5181 conditions, 861 events. 474/861 cut-off events. For 9841/9841 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 4110 event pairs, 110 based on Foata normal form. 9/870 useless extension candidates. Maximal degree in co-relation 4260. Up to 407 conditions per place. [2025-03-04 02:28:28,301 INFO L140 encePairwiseOnDemand]: 15/22 looper letters, 112 selfloop transitions, 46 changer transitions 2/161 dead transitions. [2025-03-04 02:28:28,301 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 161 transitions, 2585 flow [2025-03-04 02:28:28,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 02:28:28,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 02:28:28,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 82 transitions. [2025-03-04 02:28:28,302 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6212121212121212 [2025-03-04 02:28:28,302 INFO L175 Difference]: Start difference. First operand has 115 places, 116 transitions, 1851 flow. Second operand 6 states and 82 transitions. [2025-03-04 02:28:28,302 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 161 transitions, 2585 flow [2025-03-04 02:28:28,315 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 161 transitions, 2521 flow, removed 14 selfloop flow, removed 3 redundant places. [2025-03-04 02:28:28,317 INFO L231 Difference]: Finished difference. Result has 118 places, 119 transitions, 1995 flow [2025-03-04 02:28:28,318 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=1797, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1995, PETRI_PLACES=118, PETRI_TRANSITIONS=119} [2025-03-04 02:28:28,318 INFO L279 CegarLoopForPetriNet]: 24 programPoint places, 94 predicate places. [2025-03-04 02:28:28,318 INFO L471 AbstractCegarLoop]: Abstraction has has 118 places, 119 transitions, 1995 flow [2025-03-04 02:28:28,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 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-04 02:28:28,318 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:28:28,318 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:28:28,324 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-04 02:28:28,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-03-04 02:28:28,519 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:28:28,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:28:28,519 INFO L85 PathProgramCache]: Analyzing trace with hash -69009956, now seen corresponding path program 5 times [2025-03-04 02:28:28,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:28:28,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3596089] [2025-03-04 02:28:28,519 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:28:28,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:28:28,522 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-03-04 02:28:28,523 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 02:28:28,524 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:28:28,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:28:28,544 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-04 02:28:28,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:28:28,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3596089] [2025-03-04 02:28:28,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3596089] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:28:28,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1367927155] [2025-03-04 02:28:28,544 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:28:28,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:28:28,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:28:28,546 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:28:28,547 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 02:28:28,569 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-03-04 02:28:28,576 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 02:28:28,577 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:28:28,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:28:28,577 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 02:28:28,578 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:28:28,584 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-04 02:28:28,584 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:28:28,604 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:28:28,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1367927155] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 02:28:28,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 02:28:28,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 7 [2025-03-04 02:28:28,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305047582] [2025-03-04 02:28:28,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:28:28,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 02:28:28,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:28:28,605 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 02:28:28,605 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-04 02:28:28,607 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 22 [2025-03-04 02:28:28,607 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 119 transitions, 1995 flow. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 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-04 02:28:28,607 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:28:28,607 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 22 [2025-03-04 02:28:28,607 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:28:28,724 INFO L124 PetriNetUnfolderBase]: 434/790 cut-off events. [2025-03-04 02:28:28,724 INFO L125 PetriNetUnfolderBase]: For 9732/9732 co-relation queries the response was YES. [2025-03-04 02:28:28,726 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4906 conditions, 790 events. 434/790 cut-off events. For 9732/9732 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 3681 event pairs, 50 based on Foata normal form. 8/798 useless extension candidates. Maximal degree in co-relation 4363. Up to 388 conditions per place. [2025-03-04 02:28:28,729 INFO L140 encePairwiseOnDemand]: 16/22 looper letters, 109 selfloop transitions, 37 changer transitions 2/149 dead transitions. [2025-03-04 02:28:28,729 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 149 transitions, 2508 flow [2025-03-04 02:28:28,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 02:28:28,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 02:28:28,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2025-03-04 02:28:28,732 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5909090909090909 [2025-03-04 02:28:28,732 INFO L175 Difference]: Start difference. First operand has 118 places, 119 transitions, 1995 flow. Second operand 5 states and 65 transitions. [2025-03-04 02:28:28,732 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 149 transitions, 2508 flow [2025-03-04 02:28:28,747 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 149 transitions, 2342 flow, removed 36 selfloop flow, removed 4 redundant places. [2025-03-04 02:28:28,749 INFO L231 Difference]: Finished difference. Result has 119 places, 118 transitions, 1876 flow [2025-03-04 02:28:28,749 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=1786, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1876, PETRI_PLACES=119, PETRI_TRANSITIONS=118} [2025-03-04 02:28:28,750 INFO L279 CegarLoopForPetriNet]: 24 programPoint places, 95 predicate places. [2025-03-04 02:28:28,750 INFO L471 AbstractCegarLoop]: Abstraction has has 119 places, 118 transitions, 1876 flow [2025-03-04 02:28:28,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 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-04 02:28:28,750 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:28:28,750 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:28:28,758 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-04 02:28:28,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:28:28,951 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:28:28,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:28:28,951 INFO L85 PathProgramCache]: Analyzing trace with hash -1839973202, now seen corresponding path program 6 times [2025-03-04 02:28:28,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:28:28,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111773255] [2025-03-04 02:28:28,951 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 02:28:28,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:28:28,953 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 18 statements into 2 equivalence classes. [2025-03-04 02:28:28,955 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 02:28:28,955 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-03-04 02:28:28,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:28:28,972 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:28:28,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:28:28,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111773255] [2025-03-04 02:28:28,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111773255] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:28:28,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:28:28,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 02:28:28,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52202561] [2025-03-04 02:28:28,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:28:28,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 02:28:28,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:28:28,974 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 02:28:28,974 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 02:28:28,976 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 22 [2025-03-04 02:28:28,976 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 118 transitions, 1876 flow. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 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-04 02:28:28,976 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:28:28,976 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 22 [2025-03-04 02:28:28,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:28:29,100 INFO L124 PetriNetUnfolderBase]: 378/687 cut-off events. [2025-03-04 02:28:29,101 INFO L125 PetriNetUnfolderBase]: For 7857/7857 co-relation queries the response was YES. [2025-03-04 02:28:29,104 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4311 conditions, 687 events. 378/687 cut-off events. For 7857/7857 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 3067 event pairs, 33 based on Foata normal form. 7/694 useless extension candidates. Maximal degree in co-relation 3914. Up to 284 conditions per place. [2025-03-04 02:28:29,107 INFO L140 encePairwiseOnDemand]: 16/22 looper letters, 108 selfloop transitions, 26 changer transitions 3/138 dead transitions. [2025-03-04 02:28:29,107 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 138 transitions, 2297 flow [2025-03-04 02:28:29,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 02:28:29,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 02:28:29,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 67 transitions. [2025-03-04 02:28:29,108 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5075757575757576 [2025-03-04 02:28:29,108 INFO L175 Difference]: Start difference. First operand has 119 places, 118 transitions, 1876 flow. Second operand 6 states and 67 transitions. [2025-03-04 02:28:29,108 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 138 transitions, 2297 flow [2025-03-04 02:28:29,122 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 138 transitions, 2222 flow, removed 7 selfloop flow, removed 5 redundant places. [2025-03-04 02:28:29,123 INFO L231 Difference]: Finished difference. Result has 119 places, 108 transitions, 1704 flow [2025-03-04 02:28:29,124 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=1696, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1704, PETRI_PLACES=119, PETRI_TRANSITIONS=108} [2025-03-04 02:28:29,124 INFO L279 CegarLoopForPetriNet]: 24 programPoint places, 95 predicate places. [2025-03-04 02:28:29,125 INFO L471 AbstractCegarLoop]: Abstraction has has 119 places, 108 transitions, 1704 flow [2025-03-04 02:28:29,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 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-04 02:28:29,126 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:28:29,126 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:28:29,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-04 02:28:29,126 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:28:29,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:28:29,127 INFO L85 PathProgramCache]: Analyzing trace with hash -1216446581, now seen corresponding path program 5 times [2025-03-04 02:28:29,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:28:29,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821910496] [2025-03-04 02:28:29,127 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:28:29,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:28:29,129 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-03-04 02:28:29,132 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 02:28:29,132 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:28:29,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:28:29,152 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:28:29,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:28:29,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821910496] [2025-03-04 02:28:29,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821910496] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:28:29,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:28:29,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 02:28:29,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669405962] [2025-03-04 02:28:29,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:28:29,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 02:28:29,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:28:29,153 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 02:28:29,153 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 02:28:29,153 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 22 [2025-03-04 02:28:29,154 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 108 transitions, 1704 flow. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 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-04 02:28:29,154 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:28:29,154 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 22 [2025-03-04 02:28:29,154 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:28:29,260 INFO L124 PetriNetUnfolderBase]: 360/657 cut-off events. [2025-03-04 02:28:29,260 INFO L125 PetriNetUnfolderBase]: For 7572/7572 co-relation queries the response was YES. [2025-03-04 02:28:29,262 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4116 conditions, 657 events. 360/657 cut-off events. For 7572/7572 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 2922 event pairs, 70 based on Foata normal form. 10/667 useless extension candidates. Maximal degree in co-relation 3645. Up to 248 conditions per place. [2025-03-04 02:28:29,264 INFO L140 encePairwiseOnDemand]: 16/22 looper letters, 89 selfloop transitions, 33 changer transitions 5/128 dead transitions. [2025-03-04 02:28:29,264 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 128 transitions, 2085 flow [2025-03-04 02:28:29,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 02:28:29,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 02:28:29,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 73 transitions. [2025-03-04 02:28:29,265 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.474025974025974 [2025-03-04 02:28:29,265 INFO L175 Difference]: Start difference. First operand has 119 places, 108 transitions, 1704 flow. Second operand 7 states and 73 transitions. [2025-03-04 02:28:29,265 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 128 transitions, 2085 flow [2025-03-04 02:28:29,276 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 128 transitions, 1987 flow, removed 6 selfloop flow, removed 5 redundant places. [2025-03-04 02:28:29,279 INFO L231 Difference]: Finished difference. Result has 119 places, 102 transitions, 1591 flow [2025-03-04 02:28:29,279 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=1563, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1591, PETRI_PLACES=119, PETRI_TRANSITIONS=102} [2025-03-04 02:28:29,279 INFO L279 CegarLoopForPetriNet]: 24 programPoint places, 95 predicate places. [2025-03-04 02:28:29,279 INFO L471 AbstractCegarLoop]: Abstraction has has 119 places, 102 transitions, 1591 flow [2025-03-04 02:28:29,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 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-04 02:28:29,279 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:28:29,279 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:28:29,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-04 02:28:29,280 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:28:29,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:28:29,281 INFO L85 PathProgramCache]: Analyzing trace with hash -1582714951, now seen corresponding path program 6 times [2025-03-04 02:28:29,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:28:29,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539785197] [2025-03-04 02:28:29,281 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 02:28:29,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:28:29,283 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 18 statements into 2 equivalence classes. [2025-03-04 02:28:29,285 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 02:28:29,285 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-03-04 02:28:29,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:28:29,302 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:28:29,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:28:29,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539785197] [2025-03-04 02:28:29,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539785197] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:28:29,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:28:29,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 02:28:29,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585888684] [2025-03-04 02:28:29,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:28:29,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 02:28:29,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:28:29,303 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 02:28:29,303 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 02:28:29,306 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 22 [2025-03-04 02:28:29,306 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 102 transitions, 1591 flow. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 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-04 02:28:29,306 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:28:29,307 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 22 [2025-03-04 02:28:29,307 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:28:29,425 INFO L124 PetriNetUnfolderBase]: 302/545 cut-off events. [2025-03-04 02:28:29,425 INFO L125 PetriNetUnfolderBase]: For 6358/6358 co-relation queries the response was YES. [2025-03-04 02:28:29,427 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3512 conditions, 545 events. 302/545 cut-off events. For 6358/6358 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2246 event pairs, 56 based on Foata normal form. 6/551 useless extension candidates. Maximal degree in co-relation 3346. Up to 192 conditions per place. [2025-03-04 02:28:29,428 INFO L140 encePairwiseOnDemand]: 16/22 looper letters, 87 selfloop transitions, 33 changer transitions 3/124 dead transitions. [2025-03-04 02:28:29,428 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 124 transitions, 1953 flow [2025-03-04 02:28:29,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 02:28:29,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 02:28:29,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 83 transitions. [2025-03-04 02:28:29,429 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4715909090909091 [2025-03-04 02:28:29,429 INFO L175 Difference]: Start difference. First operand has 119 places, 102 transitions, 1591 flow. Second operand 8 states and 83 transitions. [2025-03-04 02:28:29,429 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 124 transitions, 1953 flow [2025-03-04 02:28:29,438 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 124 transitions, 1879 flow, removed 14 selfloop flow, removed 3 redundant places. [2025-03-04 02:28:29,439 INFO L231 Difference]: Finished difference. Result has 122 places, 92 transitions, 1436 flow [2025-03-04 02:28:29,439 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=1406, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1436, PETRI_PLACES=122, PETRI_TRANSITIONS=92} [2025-03-04 02:28:29,443 INFO L279 CegarLoopForPetriNet]: 24 programPoint places, 98 predicate places. [2025-03-04 02:28:29,443 INFO L471 AbstractCegarLoop]: Abstraction has has 122 places, 92 transitions, 1436 flow [2025-03-04 02:28:29,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 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-04 02:28:29,443 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:28:29,443 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:28:29,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-04 02:28:29,444 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:28:29,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:28:29,444 INFO L85 PathProgramCache]: Analyzing trace with hash -1224817727, now seen corresponding path program 1 times [2025-03-04 02:28:29,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:28:29,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29509525] [2025-03-04 02:28:29,444 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:28:29,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:28:29,446 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 02:28:29,447 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 02:28:29,447 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:28:29,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:28:29,526 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:28:29,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:28:29,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29509525] [2025-03-04 02:28:29,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29509525] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:28:29,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1178447967] [2025-03-04 02:28:29,527 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:28:29,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:28:29,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:28:29,528 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:28:29,530 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 02:28:29,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 02:28:29,558 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 02:28:29,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:28:29,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:28:29,559 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-04 02:28:29,559 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:28:29,667 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:28:29,668 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:28:29,911 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:28:29,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1178447967] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:28:29,911 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:28:29,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 22 [2025-03-04 02:28:29,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498779728] [2025-03-04 02:28:29,911 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:28:29,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-04 02:28:29,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:28:29,912 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-04 02:28:29,913 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=420, Unknown=0, NotChecked=0, Total=506 [2025-03-04 02:28:29,916 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 22 [2025-03-04 02:28:29,916 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 92 transitions, 1436 flow. Second operand has 23 states, 23 states have (on average 4.695652173913044) internal successors, (108), 23 states have internal predecessors, (108), 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-04 02:28:29,916 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:28:29,916 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 22 [2025-03-04 02:28:29,916 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:28:30,900 INFO L124 PetriNetUnfolderBase]: 694/1300 cut-off events. [2025-03-04 02:28:30,901 INFO L125 PetriNetUnfolderBase]: For 13324/13324 co-relation queries the response was YES. [2025-03-04 02:28:30,905 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7405 conditions, 1300 events. 694/1300 cut-off events. For 13324/13324 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 6985 event pairs, 29 based on Foata normal form. 2/1302 useless extension candidates. Maximal degree in co-relation 4069. Up to 242 conditions per place. [2025-03-04 02:28:30,909 INFO L140 encePairwiseOnDemand]: 12/22 looper letters, 129 selfloop transitions, 87 changer transitions 68/285 dead transitions. [2025-03-04 02:28:30,909 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 285 transitions, 3898 flow [2025-03-04 02:28:30,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-03-04 02:28:30,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2025-03-04 02:28:30,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 310 transitions. [2025-03-04 02:28:30,911 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.39141414141414144 [2025-03-04 02:28:30,911 INFO L175 Difference]: Start difference. First operand has 122 places, 92 transitions, 1436 flow. Second operand 36 states and 310 transitions. [2025-03-04 02:28:30,911 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 285 transitions, 3898 flow [2025-03-04 02:28:30,923 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 285 transitions, 3620 flow, removed 17 selfloop flow, removed 8 redundant places. [2025-03-04 02:28:30,926 INFO L231 Difference]: Finished difference. Result has 158 places, 129 transitions, 2254 flow [2025-03-04 02:28:30,926 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=1320, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=36, PETRI_FLOW=2254, PETRI_PLACES=158, PETRI_TRANSITIONS=129} [2025-03-04 02:28:30,927 INFO L279 CegarLoopForPetriNet]: 24 programPoint places, 134 predicate places. [2025-03-04 02:28:30,927 INFO L471 AbstractCegarLoop]: Abstraction has has 158 places, 129 transitions, 2254 flow [2025-03-04 02:28:30,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 4.695652173913044) internal successors, (108), 23 states have internal predecessors, (108), 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-04 02:28:30,928 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:28:30,928 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:28:30,935 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-04 02:28:31,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:28:31,129 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:28:31,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:28:31,129 INFO L85 PathProgramCache]: Analyzing trace with hash 277842129, now seen corresponding path program 2 times [2025-03-04 02:28:31,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:28:31,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720506548] [2025-03-04 02:28:31,129 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:28:31,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:28:31,133 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-03-04 02:28:31,135 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 02:28:31,135 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:28:31,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:28:31,225 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:28:31,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:28:31,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720506548] [2025-03-04 02:28:31,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720506548] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:28:31,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2040325279] [2025-03-04 02:28:31,226 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:28:31,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:28:31,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:28:31,228 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:28:31,229 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 02:28:31,250 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-03-04 02:28:31,257 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 02:28:31,257 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:28:31,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:28:31,258 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-04 02:28:31,259 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:28:31,362 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:28:31,362 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:28:31,516 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:28:31,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2040325279] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:28:31,516 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:28:31,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 22 [2025-03-04 02:28:31,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473924123] [2025-03-04 02:28:31,516 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:28:31,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-04 02:28:31,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:28:31,517 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-04 02:28:31,518 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=410, Unknown=0, NotChecked=0, Total=506 [2025-03-04 02:28:31,524 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 22 [2025-03-04 02:28:31,524 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 129 transitions, 2254 flow. Second operand has 23 states, 23 states have (on average 4.478260869565218) internal successors, (103), 23 states have internal predecessors, (103), 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-04 02:28:31,524 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:28:31,524 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 22 [2025-03-04 02:28:31,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:28:31,896 INFO L124 PetriNetUnfolderBase]: 751/1463 cut-off events. [2025-03-04 02:28:31,896 INFO L125 PetriNetUnfolderBase]: For 17119/17119 co-relation queries the response was YES. [2025-03-04 02:28:31,900 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8415 conditions, 1463 events. 751/1463 cut-off events. For 17119/17119 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 8399 event pairs, 98 based on Foata normal form. 3/1466 useless extension candidates. Maximal degree in co-relation 8273. Up to 594 conditions per place. [2025-03-04 02:28:31,903 INFO L140 encePairwiseOnDemand]: 12/22 looper letters, 102 selfloop transitions, 99 changer transitions 12/214 dead transitions. [2025-03-04 02:28:31,903 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 214 transitions, 3743 flow [2025-03-04 02:28:31,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 02:28:31,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-04 02:28:31,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 121 transitions. [2025-03-04 02:28:31,904 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4230769230769231 [2025-03-04 02:28:31,904 INFO L175 Difference]: Start difference. First operand has 158 places, 129 transitions, 2254 flow. Second operand 13 states and 121 transitions. [2025-03-04 02:28:31,904 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 214 transitions, 3743 flow [2025-03-04 02:28:31,934 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 214 transitions, 2921 flow, removed 240 selfloop flow, removed 17 redundant places. [2025-03-04 02:28:31,936 INFO L231 Difference]: Finished difference. Result has 147 places, 161 transitions, 2350 flow [2025-03-04 02:28:31,936 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=1697, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=69, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=2350, PETRI_PLACES=147, PETRI_TRANSITIONS=161} [2025-03-04 02:28:31,937 INFO L279 CegarLoopForPetriNet]: 24 programPoint places, 123 predicate places. [2025-03-04 02:28:31,937 INFO L471 AbstractCegarLoop]: Abstraction has has 147 places, 161 transitions, 2350 flow [2025-03-04 02:28:31,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 4.478260869565218) internal successors, (103), 23 states have internal predecessors, (103), 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-04 02:28:31,937 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:28:31,937 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:28:31,943 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-04 02:28:32,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:28:32,138 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:28:32,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:28:32,138 INFO L85 PathProgramCache]: Analyzing trace with hash -1782706343, now seen corresponding path program 3 times [2025-03-04 02:28:32,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:28:32,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570193450] [2025-03-04 02:28:32,138 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:28:32,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:28:32,140 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 19 statements into 2 equivalence classes. [2025-03-04 02:28:32,142 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 02:28:32,142 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 02:28:32,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:28:32,227 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:28:32,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:28:32,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570193450] [2025-03-04 02:28:32,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570193450] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:28:32,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1338722691] [2025-03-04 02:28:32,228 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:28:32,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:28:32,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:28:32,230 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:28:32,231 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-04 02:28:32,252 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 19 statements into 2 equivalence classes. [2025-03-04 02:28:32,260 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 02:28:32,260 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 02:28:32,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:28:32,260 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-04 02:28:32,261 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:28:32,355 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:28:32,355 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:28:32,510 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:28:32,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1338722691] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:28:32,510 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:28:32,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 22 [2025-03-04 02:28:32,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936311198] [2025-03-04 02:28:32,511 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:28:32,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-04 02:28:32,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:28:32,512 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-04 02:28:32,513 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=408, Unknown=0, NotChecked=0, Total=506 [2025-03-04 02:28:32,521 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 22 [2025-03-04 02:28:32,522 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 161 transitions, 2350 flow. Second operand has 23 states, 23 states have (on average 4.434782608695652) internal successors, (102), 23 states have internal predecessors, (102), 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-04 02:28:32,522 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:28:32,522 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 22 [2025-03-04 02:28:32,522 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:28:33,054 INFO L124 PetriNetUnfolderBase]: 896/1776 cut-off events. [2025-03-04 02:28:33,055 INFO L125 PetriNetUnfolderBase]: For 16568/16568 co-relation queries the response was YES. [2025-03-04 02:28:33,058 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9006 conditions, 1776 events. 896/1776 cut-off events. For 16568/16568 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 10975 event pairs, 106 based on Foata normal form. 4/1780 useless extension candidates. Maximal degree in co-relation 8861. Up to 556 conditions per place. [2025-03-04 02:28:33,062 INFO L140 encePairwiseOnDemand]: 12/22 looper letters, 86 selfloop transitions, 153 changer transitions 12/252 dead transitions. [2025-03-04 02:28:33,062 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 252 transitions, 3900 flow [2025-03-04 02:28:33,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-04 02:28:33,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-03-04 02:28:33,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 147 transitions. [2025-03-04 02:28:33,063 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.393048128342246 [2025-03-04 02:28:33,063 INFO L175 Difference]: Start difference. First operand has 147 places, 161 transitions, 2350 flow. Second operand 17 states and 147 transitions. [2025-03-04 02:28:33,063 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 252 transitions, 3900 flow [2025-03-04 02:28:33,091 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 252 transitions, 3767 flow, removed 33 selfloop flow, removed 5 redundant places. [2025-03-04 02:28:33,094 INFO L231 Difference]: Finished difference. Result has 164 places, 205 transitions, 3435 flow [2025-03-04 02:28:33,094 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=2267, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=111, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=3435, PETRI_PLACES=164, PETRI_TRANSITIONS=205} [2025-03-04 02:28:33,094 INFO L279 CegarLoopForPetriNet]: 24 programPoint places, 140 predicate places. [2025-03-04 02:28:33,094 INFO L471 AbstractCegarLoop]: Abstraction has has 164 places, 205 transitions, 3435 flow [2025-03-04 02:28:33,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 4.434782608695652) internal successors, (102), 23 states have internal predecessors, (102), 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-04 02:28:33,094 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:28:33,094 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:28:33,100 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-04 02:28:33,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:28:33,295 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:28:33,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:28:33,295 INFO L85 PathProgramCache]: Analyzing trace with hash 477455249, now seen corresponding path program 4 times [2025-03-04 02:28:33,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:28:33,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843530134] [2025-03-04 02:28:33,295 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:28:33,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:28:33,298 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 19 statements into 2 equivalence classes. [2025-03-04 02:28:33,300 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 02:28:33,300 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 02:28:33,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:28:33,414 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:28:33,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:28:33,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843530134] [2025-03-04 02:28:33,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843530134] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:28:33,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1940915949] [2025-03-04 02:28:33,415 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:28:33,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:28:33,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:28:33,416 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:28:33,418 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-04 02:28:33,441 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 19 statements into 2 equivalence classes. [2025-03-04 02:28:33,448 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 02:28:33,449 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 02:28:33,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:28:33,449 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-04 02:28:33,450 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:28:33,554 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:28:33,554 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:28:33,720 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:28:33,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1940915949] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:28:33,720 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:28:33,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 23 [2025-03-04 02:28:33,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24778494] [2025-03-04 02:28:33,721 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:28:33,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-04 02:28:33,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:28:33,721 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-04 02:28:33,721 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=459, Unknown=0, NotChecked=0, Total=552 [2025-03-04 02:28:33,727 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 22 [2025-03-04 02:28:33,728 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 205 transitions, 3435 flow. Second operand has 24 states, 24 states have (on average 4.458333333333333) internal successors, (107), 24 states have internal predecessors, (107), 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-04 02:28:33,728 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:28:33,728 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 22 [2025-03-04 02:28:33,728 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:28:34,240 INFO L124 PetriNetUnfolderBase]: 874/1728 cut-off events. [2025-03-04 02:28:34,240 INFO L125 PetriNetUnfolderBase]: For 19443/19443 co-relation queries the response was YES. [2025-03-04 02:28:34,246 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9770 conditions, 1728 events. 874/1728 cut-off events. For 19443/19443 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 10565 event pairs, 94 based on Foata normal form. 4/1732 useless extension candidates. Maximal degree in co-relation 9627. Up to 600 conditions per place. [2025-03-04 02:28:34,252 INFO L140 encePairwiseOnDemand]: 12/22 looper letters, 88 selfloop transitions, 146 changer transitions 17/252 dead transitions. [2025-03-04 02:28:34,252 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 252 transitions, 4275 flow [2025-03-04 02:28:34,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-04 02:28:34,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-03-04 02:28:34,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 147 transitions. [2025-03-04 02:28:34,253 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.393048128342246 [2025-03-04 02:28:34,253 INFO L175 Difference]: Start difference. First operand has 164 places, 205 transitions, 3435 flow. Second operand 17 states and 147 transitions. [2025-03-04 02:28:34,253 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 252 transitions, 4275 flow [2025-03-04 02:28:34,304 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 252 transitions, 4056 flow, removed 89 selfloop flow, removed 4 redundant places. [2025-03-04 02:28:34,307 INFO L231 Difference]: Finished difference. Result has 177 places, 202 transitions, 3462 flow [2025-03-04 02:28:34,308 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=3218, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=205, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=146, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=3462, PETRI_PLACES=177, PETRI_TRANSITIONS=202} [2025-03-04 02:28:34,308 INFO L279 CegarLoopForPetriNet]: 24 programPoint places, 153 predicate places. [2025-03-04 02:28:34,308 INFO L471 AbstractCegarLoop]: Abstraction has has 177 places, 202 transitions, 3462 flow [2025-03-04 02:28:34,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 4.458333333333333) internal successors, (107), 24 states have internal predecessors, (107), 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-04 02:28:34,308 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:28:34,308 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:28:34,314 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-04 02:28:34,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2025-03-04 02:28:34,509 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:28:34,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:28:34,509 INFO L85 PathProgramCache]: Analyzing trace with hash 1772885901, now seen corresponding path program 5 times [2025-03-04 02:28:34,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:28:34,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849682817] [2025-03-04 02:28:34,509 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:28:34,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:28:34,512 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-03-04 02:28:34,514 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 02:28:34,514 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:28:34,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:28:34,577 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:28:34,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:28:34,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849682817] [2025-03-04 02:28:34,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849682817] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:28:34,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [335144248] [2025-03-04 02:28:34,577 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:28:34,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:28:34,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:28:34,579 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:28:34,581 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-04 02:28:34,605 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-03-04 02:28:34,613 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 02:28:34,613 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:28:34,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:28:34,613 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-04 02:28:34,614 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:28:34,666 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:28:34,666 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 02:28:34,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [335144248] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:28:34,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 02:28:34,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 11 [2025-03-04 02:28:34,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142041050] [2025-03-04 02:28:34,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:28:34,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 02:28:34,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:28:34,667 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 02:28:34,667 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2025-03-04 02:28:34,672 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 22 [2025-03-04 02:28:34,673 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 202 transitions, 3462 flow. Second operand has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 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-04 02:28:34,673 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:28:34,673 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 22 [2025-03-04 02:28:34,673 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:28:34,848 INFO L124 PetriNetUnfolderBase]: 802/1568 cut-off events. [2025-03-04 02:28:34,848 INFO L125 PetriNetUnfolderBase]: For 19428/19428 co-relation queries the response was YES. [2025-03-04 02:28:34,852 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9400 conditions, 1568 events. 802/1568 cut-off events. For 19428/19428 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 9129 event pairs, 158 based on Foata normal form. 2/1570 useless extension candidates. Maximal degree in co-relation 9277. Up to 998 conditions per place. [2025-03-04 02:28:34,856 INFO L140 encePairwiseOnDemand]: 14/22 looper letters, 124 selfloop transitions, 63 changer transitions 45/233 dead transitions. [2025-03-04 02:28:34,856 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 233 transitions, 4278 flow [2025-03-04 02:28:34,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 02:28:34,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 02:28:34,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 83 transitions. [2025-03-04 02:28:34,856 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.41919191919191917 [2025-03-04 02:28:34,856 INFO L175 Difference]: Start difference. First operand has 177 places, 202 transitions, 3462 flow. Second operand 9 states and 83 transitions. [2025-03-04 02:28:34,856 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 233 transitions, 4278 flow [2025-03-04 02:28:34,895 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 233 transitions, 4016 flow, removed 8 selfloop flow, removed 14 redundant places. [2025-03-04 02:28:34,898 INFO L231 Difference]: Finished difference. Result has 171 places, 175 transitions, 2851 flow [2025-03-04 02:28:34,898 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=3216, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=202, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2851, PETRI_PLACES=171, PETRI_TRANSITIONS=175} [2025-03-04 02:28:34,898 INFO L279 CegarLoopForPetriNet]: 24 programPoint places, 147 predicate places. [2025-03-04 02:28:34,898 INFO L471 AbstractCegarLoop]: Abstraction has has 171 places, 175 transitions, 2851 flow [2025-03-04 02:28:34,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 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-04 02:28:34,898 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:28:34,898 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:28:34,904 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-04 02:28:35,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2025-03-04 02:28:35,099 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:28:35,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:28:35,099 INFO L85 PathProgramCache]: Analyzing trace with hash 391749731, now seen corresponding path program 6 times [2025-03-04 02:28:35,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:28:35,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441516421] [2025-03-04 02:28:35,099 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 02:28:35,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:28:35,101 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 19 statements into 2 equivalence classes. [2025-03-04 02:28:35,103 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 02:28:35,103 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-03-04 02:28:35,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:28:35,178 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:28:35,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:28:35,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441516421] [2025-03-04 02:28:35,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441516421] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:28:35,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [987056467] [2025-03-04 02:28:35,178 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 02:28:35,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:28:35,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:28:35,180 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:28:35,181 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-04 02:28:35,204 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 19 statements into 2 equivalence classes. [2025-03-04 02:28:35,212 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 02:28:35,212 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-03-04 02:28:35,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:28:35,213 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-04 02:28:35,213 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:28:35,303 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:28:35,303 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:28:35,460 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:28:35,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [987056467] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:28:35,460 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:28:35,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 22 [2025-03-04 02:28:35,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876777241] [2025-03-04 02:28:35,460 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:28:35,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-04 02:28:35,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:28:35,461 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-04 02:28:35,461 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=406, Unknown=0, NotChecked=0, Total=506 [2025-03-04 02:28:35,468 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 22 [2025-03-04 02:28:35,468 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 175 transitions, 2851 flow. Second operand has 23 states, 23 states have (on average 4.521739130434782) internal successors, (104), 23 states have internal predecessors, (104), 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-04 02:28:35,468 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:28:35,468 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 22 [2025-03-04 02:28:35,468 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:28:35,786 INFO L124 PetriNetUnfolderBase]: 758/1518 cut-off events. [2025-03-04 02:28:35,786 INFO L125 PetriNetUnfolderBase]: For 16785/16785 co-relation queries the response was YES. [2025-03-04 02:28:35,790 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8283 conditions, 1518 events. 758/1518 cut-off events. For 16785/16785 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 9070 event pairs, 126 based on Foata normal form. 4/1522 useless extension candidates. Maximal degree in co-relation 8145. Up to 776 conditions per place. [2025-03-04 02:28:35,793 INFO L140 encePairwiseOnDemand]: 12/22 looper letters, 91 selfloop transitions, 101 changer transitions 23/216 dead transitions. [2025-03-04 02:28:35,793 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 216 transitions, 3665 flow [2025-03-04 02:28:35,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 02:28:35,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-04 02:28:35,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 112 transitions. [2025-03-04 02:28:35,794 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42424242424242425 [2025-03-04 02:28:35,794 INFO L175 Difference]: Start difference. First operand has 171 places, 175 transitions, 2851 flow. Second operand 12 states and 112 transitions. [2025-03-04 02:28:35,794 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 216 transitions, 3665 flow [2025-03-04 02:28:35,824 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 216 transitions, 3367 flow, removed 27 selfloop flow, removed 16 redundant places. [2025-03-04 02:28:35,827 INFO L231 Difference]: Finished difference. Result has 158 places, 163 transitions, 2674 flow [2025-03-04 02:28:35,827 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=2583, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=175, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=96, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2674, PETRI_PLACES=158, PETRI_TRANSITIONS=163} [2025-03-04 02:28:35,827 INFO L279 CegarLoopForPetriNet]: 24 programPoint places, 134 predicate places. [2025-03-04 02:28:35,827 INFO L471 AbstractCegarLoop]: Abstraction has has 158 places, 163 transitions, 2674 flow [2025-03-04 02:28:35,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 4.521739130434782) internal successors, (104), 23 states have internal predecessors, (104), 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-04 02:28:35,828 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:28:35,828 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:28:35,834 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-03-04 02:28:36,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2025-03-04 02:28:36,028 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:28:36,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:28:36,029 INFO L85 PathProgramCache]: Analyzing trace with hash -660834713, now seen corresponding path program 7 times [2025-03-04 02:28:36,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:28:36,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780445414] [2025-03-04 02:28:36,029 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 02:28:36,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:28:36,031 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 02:28:36,032 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 02:28:36,032 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:28:36,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:28:36,104 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:28:36,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:28:36,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780445414] [2025-03-04 02:28:36,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1780445414] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:28:36,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [361531574] [2025-03-04 02:28:36,104 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 02:28:36,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:28:36,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:28:36,106 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:28:36,107 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-04 02:28:36,127 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 02:28:36,135 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 02:28:36,135 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:28:36,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:28:36,135 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-04 02:28:36,136 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:28:36,221 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:28:36,222 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:28:36,363 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:28:36,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [361531574] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:28:36,363 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:28:36,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 22 [2025-03-04 02:28:36,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015294694] [2025-03-04 02:28:36,363 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:28:36,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-04 02:28:36,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:28:36,364 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-04 02:28:36,364 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=409, Unknown=0, NotChecked=0, Total=506 [2025-03-04 02:28:36,368 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 22 [2025-03-04 02:28:36,368 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 163 transitions, 2674 flow. Second operand has 23 states, 23 states have (on average 4.391304347826087) internal successors, (101), 23 states have internal predecessors, (101), 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-04 02:28:36,368 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:28:36,369 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 22 [2025-03-04 02:28:36,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:28:36,662 INFO L124 PetriNetUnfolderBase]: 731/1460 cut-off events. [2025-03-04 02:28:36,662 INFO L125 PetriNetUnfolderBase]: For 15061/15061 co-relation queries the response was YES. [2025-03-04 02:28:36,665 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8027 conditions, 1460 events. 731/1460 cut-off events. For 15061/15061 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 8581 event pairs, 134 based on Foata normal form. 5/1465 useless extension candidates. Maximal degree in co-relation 7901. Up to 816 conditions per place. [2025-03-04 02:28:36,667 INFO L140 encePairwiseOnDemand]: 12/22 looper letters, 84 selfloop transitions, 85 changer transitions 26/196 dead transitions. [2025-03-04 02:28:36,667 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 196 transitions, 3383 flow [2025-03-04 02:28:36,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 02:28:36,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-04 02:28:36,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 104 transitions. [2025-03-04 02:28:36,668 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3939393939393939 [2025-03-04 02:28:36,668 INFO L175 Difference]: Start difference. First operand has 158 places, 163 transitions, 2674 flow. Second operand 12 states and 104 transitions. [2025-03-04 02:28:36,668 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 196 transitions, 3383 flow [2025-03-04 02:28:36,694 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 196 transitions, 3332 flow, removed 10 selfloop flow, removed 5 redundant places. [2025-03-04 02:28:36,696 INFO L231 Difference]: Finished difference. Result has 163 places, 148 transitions, 2516 flow [2025-03-04 02:28:36,696 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=2623, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=85, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2516, PETRI_PLACES=163, PETRI_TRANSITIONS=148} [2025-03-04 02:28:36,696 INFO L279 CegarLoopForPetriNet]: 24 programPoint places, 139 predicate places. [2025-03-04 02:28:36,696 INFO L471 AbstractCegarLoop]: Abstraction has has 163 places, 148 transitions, 2516 flow [2025-03-04 02:28:36,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 4.391304347826087) internal successors, (101), 23 states have internal predecessors, (101), 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-04 02:28:36,696 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:28:36,696 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:28:36,702 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-03-04 02:28:36,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2025-03-04 02:28:36,897 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:28:36,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:28:36,897 INFO L85 PathProgramCache]: Analyzing trace with hash -632085999, now seen corresponding path program 8 times [2025-03-04 02:28:36,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:28:36,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113863273] [2025-03-04 02:28:36,898 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:28:36,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:28:36,900 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-03-04 02:28:36,901 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 02:28:36,901 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:28:36,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:28:36,970 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:28:36,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:28:36,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113863273] [2025-03-04 02:28:36,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113863273] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:28:36,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [488804812] [2025-03-04 02:28:36,971 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:28:36,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:28:36,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:28:36,974 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:28:36,975 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-04 02:28:36,996 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-03-04 02:28:37,010 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 02:28:37,010 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:28:37,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:28:37,012 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-04 02:28:37,012 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:28:37,106 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:28:37,106 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:28:37,259 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:28:37,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [488804812] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:28:37,259 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:28:37,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 22 [2025-03-04 02:28:37,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127737212] [2025-03-04 02:28:37,259 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:28:37,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-04 02:28:37,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:28:37,260 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-04 02:28:37,260 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=419, Unknown=0, NotChecked=0, Total=506 [2025-03-04 02:28:37,282 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 22 [2025-03-04 02:28:37,283 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 148 transitions, 2516 flow. Second operand has 23 states, 23 states have (on average 4.478260869565218) internal successors, (103), 23 states have internal predecessors, (103), 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-04 02:28:37,283 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:28:37,283 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 22 [2025-03-04 02:28:37,283 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:28:37,633 INFO L124 PetriNetUnfolderBase]: 650/1262 cut-off events. [2025-03-04 02:28:37,633 INFO L125 PetriNetUnfolderBase]: For 14685/14685 co-relation queries the response was YES. [2025-03-04 02:28:37,637 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7431 conditions, 1262 events. 650/1262 cut-off events. For 14685/14685 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 6921 event pairs, 63 based on Foata normal form. 7/1269 useless extension candidates. Maximal degree in co-relation 7333. Up to 451 conditions per place. [2025-03-04 02:28:37,639 INFO L140 encePairwiseOnDemand]: 12/22 looper letters, 75 selfloop transitions, 62 changer transitions 51/189 dead transitions. [2025-03-04 02:28:37,639 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 189 transitions, 3274 flow [2025-03-04 02:28:37,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 02:28:37,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-04 02:28:37,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 111 transitions. [2025-03-04 02:28:37,640 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3881118881118881 [2025-03-04 02:28:37,640 INFO L175 Difference]: Start difference. First operand has 163 places, 148 transitions, 2516 flow. Second operand 13 states and 111 transitions. [2025-03-04 02:28:37,640 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 189 transitions, 3274 flow [2025-03-04 02:28:37,682 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 189 transitions, 3029 flow, removed 1 selfloop flow, removed 11 redundant places. [2025-03-04 02:28:37,685 INFO L231 Difference]: Finished difference. Result has 159 places, 116 transitions, 1850 flow [2025-03-04 02:28:37,685 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=2274, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1850, PETRI_PLACES=159, PETRI_TRANSITIONS=116} [2025-03-04 02:28:37,685 INFO L279 CegarLoopForPetriNet]: 24 programPoint places, 135 predicate places. [2025-03-04 02:28:37,685 INFO L471 AbstractCegarLoop]: Abstraction has has 159 places, 116 transitions, 1850 flow [2025-03-04 02:28:37,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 4.478260869565218) internal successors, (103), 23 states have internal predecessors, (103), 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-04 02:28:37,686 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:28:37,686 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:28:37,693 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-03-04 02:28:37,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:28:37,886 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:28:37,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:28:37,887 INFO L85 PathProgramCache]: Analyzing trace with hash -2056163371, now seen corresponding path program 9 times [2025-03-04 02:28:37,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:28:37,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581689272] [2025-03-04 02:28:37,887 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:28:37,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:28:37,889 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 19 statements into 2 equivalence classes. [2025-03-04 02:28:37,894 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 02:28:37,894 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 02:28:37,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:28:37,970 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:28:37,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:28:37,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581689272] [2025-03-04 02:28:37,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1581689272] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:28:37,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [803401517] [2025-03-04 02:28:37,970 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:28:37,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:28:37,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:28:37,972 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:28:37,973 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-04 02:28:37,997 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 19 statements into 2 equivalence classes. [2025-03-04 02:28:38,006 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 02:28:38,006 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 02:28:38,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:28:38,007 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-04 02:28:38,008 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:28:38,096 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:28:38,096 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:28:38,228 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:28:38,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [803401517] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:28:38,229 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:28:38,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 23 [2025-03-04 02:28:38,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013640884] [2025-03-04 02:28:38,229 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:28:38,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-04 02:28:38,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:28:38,229 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-04 02:28:38,229 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=453, Unknown=0, NotChecked=0, Total=552 [2025-03-04 02:28:38,237 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 22 [2025-03-04 02:28:38,237 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 116 transitions, 1850 flow. Second operand has 24 states, 24 states have (on average 4.458333333333333) internal successors, (107), 24 states have internal predecessors, (107), 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-04 02:28:38,237 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:28:38,237 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 22 [2025-03-04 02:28:38,237 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:28:38,928 INFO L124 PetriNetUnfolderBase]: 789/1575 cut-off events. [2025-03-04 02:28:38,928 INFO L125 PetriNetUnfolderBase]: For 16612/16612 co-relation queries the response was YES. [2025-03-04 02:28:38,932 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8800 conditions, 1575 events. 789/1575 cut-off events. For 16612/16612 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 9345 event pairs, 113 based on Foata normal form. 17/1592 useless extension candidates. Maximal degree in co-relation 8718. Up to 605 conditions per place. [2025-03-04 02:28:38,935 INFO L140 encePairwiseOnDemand]: 12/22 looper letters, 135 selfloop transitions, 134 changer transitions 17/287 dead transitions. [2025-03-04 02:28:38,935 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 287 transitions, 4532 flow [2025-03-04 02:28:38,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-03-04 02:28:38,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2025-03-04 02:28:38,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 268 transitions. [2025-03-04 02:28:38,936 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3582887700534759 [2025-03-04 02:28:38,936 INFO L175 Difference]: Start difference. First operand has 159 places, 116 transitions, 1850 flow. Second operand 34 states and 268 transitions. [2025-03-04 02:28:38,936 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 287 transitions, 4532 flow [2025-03-04 02:28:38,961 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 287 transitions, 4146 flow, removed 24 selfloop flow, removed 19 redundant places. [2025-03-04 02:28:38,964 INFO L231 Difference]: Finished difference. Result has 174 places, 196 transitions, 3338 flow [2025-03-04 02:28:38,964 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=1662, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=68, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=34, PETRI_FLOW=3338, PETRI_PLACES=174, PETRI_TRANSITIONS=196} [2025-03-04 02:28:38,965 INFO L279 CegarLoopForPetriNet]: 24 programPoint places, 150 predicate places. [2025-03-04 02:28:38,965 INFO L471 AbstractCegarLoop]: Abstraction has has 174 places, 196 transitions, 3338 flow [2025-03-04 02:28:38,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 4.458333333333333) internal successors, (107), 24 states have internal predecessors, (107), 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-04 02:28:38,965 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:28:38,965 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:28:38,970 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-03-04 02:28:39,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2025-03-04 02:28:39,166 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:28:39,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:28:39,167 INFO L85 PathProgramCache]: Analyzing trace with hash -1374628063, now seen corresponding path program 10 times [2025-03-04 02:28:39,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:28:39,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539347294] [2025-03-04 02:28:39,167 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:28:39,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:28:39,169 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 19 statements into 2 equivalence classes. [2025-03-04 02:28:39,170 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 02:28:39,170 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 02:28:39,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:28:39,236 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:28:39,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:28:39,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539347294] [2025-03-04 02:28:39,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539347294] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:28:39,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [615159219] [2025-03-04 02:28:39,236 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:28:39,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:28:39,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:28:39,238 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:28:39,239 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-04 02:28:39,260 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 19 statements into 2 equivalence classes. [2025-03-04 02:28:39,267 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 02:28:39,267 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 02:28:39,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:28:39,268 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-04 02:28:39,268 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:28:39,370 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:28:39,371 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:28:39,498 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:28:39,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [615159219] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:28:39,498 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:28:39,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 22 [2025-03-04 02:28:39,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855515967] [2025-03-04 02:28:39,498 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:28:39,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-04 02:28:39,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:28:39,498 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-04 02:28:39,499 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=410, Unknown=0, NotChecked=0, Total=506 [2025-03-04 02:28:39,509 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 22 [2025-03-04 02:28:39,509 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 196 transitions, 3338 flow. Second operand has 23 states, 23 states have (on average 4.391304347826087) internal successors, (101), 23 states have internal predecessors, (101), 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-04 02:28:39,509 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:28:39,509 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 22 [2025-03-04 02:28:39,509 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:28:39,948 INFO L124 PetriNetUnfolderBase]: 951/1889 cut-off events. [2025-03-04 02:28:39,948 INFO L125 PetriNetUnfolderBase]: For 21117/21117 co-relation queries the response was YES. [2025-03-04 02:28:39,953 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10996 conditions, 1889 events. 951/1889 cut-off events. For 21117/21117 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 11741 event pairs, 147 based on Foata normal form. 3/1892 useless extension candidates. Maximal degree in co-relation 10851. Up to 936 conditions per place. [2025-03-04 02:28:39,957 INFO L140 encePairwiseOnDemand]: 12/22 looper letters, 133 selfloop transitions, 138 changer transitions 24/296 dead transitions. [2025-03-04 02:28:39,957 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 296 transitions, 5229 flow [2025-03-04 02:28:39,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-04 02:28:39,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-03-04 02:28:39,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 154 transitions. [2025-03-04 02:28:39,958 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3888888888888889 [2025-03-04 02:28:39,958 INFO L175 Difference]: Start difference. First operand has 174 places, 196 transitions, 3338 flow. Second operand 18 states and 154 transitions. [2025-03-04 02:28:39,958 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 296 transitions, 5229 flow [2025-03-04 02:28:40,004 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 296 transitions, 4628 flow, removed 234 selfloop flow, removed 12 redundant places. [2025-03-04 02:28:40,008 INFO L231 Difference]: Finished difference. Result has 182 places, 225 transitions, 3772 flow [2025-03-04 02:28:40,008 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=2880, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=196, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=109, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=3772, PETRI_PLACES=182, PETRI_TRANSITIONS=225} [2025-03-04 02:28:40,008 INFO L279 CegarLoopForPetriNet]: 24 programPoint places, 158 predicate places. [2025-03-04 02:28:40,009 INFO L471 AbstractCegarLoop]: Abstraction has has 182 places, 225 transitions, 3772 flow [2025-03-04 02:28:40,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 4.391304347826087) internal successors, (101), 23 states have internal predecessors, (101), 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-04 02:28:40,009 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:28:40,009 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:28:40,014 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2025-03-04 02:28:40,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2025-03-04 02:28:40,213 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:28:40,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:28:40,213 INFO L85 PathProgramCache]: Analyzing trace with hash 1606474555, now seen corresponding path program 11 times [2025-03-04 02:28:40,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:28:40,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571514880] [2025-03-04 02:28:40,213 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:28:40,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:28:40,215 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-03-04 02:28:40,216 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 02:28:40,216 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:28:40,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:28:40,268 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:28:40,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:28:40,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571514880] [2025-03-04 02:28:40,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571514880] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:28:40,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1828521715] [2025-03-04 02:28:40,268 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:28:40,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:28:40,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:28:40,271 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:28:40,272 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-03-04 02:28:40,295 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-03-04 02:28:40,303 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 02:28:40,303 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:28:40,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:28:40,303 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-04 02:28:40,304 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:28:40,360 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:28:40,360 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 02:28:40,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1828521715] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:28:40,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 02:28:40,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 12 [2025-03-04 02:28:40,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266161567] [2025-03-04 02:28:40,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:28:40,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 02:28:40,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:28:40,361 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 02:28:40,361 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2025-03-04 02:28:40,369 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 22 [2025-03-04 02:28:40,369 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 225 transitions, 3772 flow. Second operand has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 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-04 02:28:40,369 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:28:40,369 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 22 [2025-03-04 02:28:40,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:28:40,580 INFO L124 PetriNetUnfolderBase]: 906/1797 cut-off events. [2025-03-04 02:28:40,580 INFO L125 PetriNetUnfolderBase]: For 21328/21328 co-relation queries the response was YES. [2025-03-04 02:28:40,585 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10394 conditions, 1797 events. 906/1797 cut-off events. For 21328/21328 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 10987 event pairs, 181 based on Foata normal form. 4/1801 useless extension candidates. Maximal degree in co-relation 10255. Up to 1051 conditions per place. [2025-03-04 02:28:40,590 INFO L140 encePairwiseOnDemand]: 14/22 looper letters, 129 selfloop transitions, 65 changer transitions 53/248 dead transitions. [2025-03-04 02:28:40,590 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 248 transitions, 4429 flow [2025-03-04 02:28:40,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 02:28:40,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 02:28:40,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 82 transitions. [2025-03-04 02:28:40,591 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.41414141414141414 [2025-03-04 02:28:40,591 INFO L175 Difference]: Start difference. First operand has 182 places, 225 transitions, 3772 flow. Second operand 9 states and 82 transitions. [2025-03-04 02:28:40,591 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 248 transitions, 4429 flow [2025-03-04 02:28:40,651 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 248 transitions, 4312 flow, removed 19 selfloop flow, removed 10 redundant places. [2025-03-04 02:28:40,654 INFO L231 Difference]: Finished difference. Result has 181 places, 183 transitions, 3071 flow [2025-03-04 02:28:40,654 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=3659, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=225, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3071, PETRI_PLACES=181, PETRI_TRANSITIONS=183} [2025-03-04 02:28:40,655 INFO L279 CegarLoopForPetriNet]: 24 programPoint places, 157 predicate places. [2025-03-04 02:28:40,655 INFO L471 AbstractCegarLoop]: Abstraction has has 181 places, 183 transitions, 3071 flow [2025-03-04 02:28:40,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 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-04 02:28:40,656 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:28:40,656 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:28:40,664 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2025-03-04 02:28:40,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2025-03-04 02:28:40,857 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:28:40,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:28:40,857 INFO L85 PathProgramCache]: Analyzing trace with hash 1817481725, now seen corresponding path program 12 times [2025-03-04 02:28:40,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:28:40,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516182275] [2025-03-04 02:28:40,857 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 02:28:40,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:28:40,859 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 19 statements into 2 equivalence classes. [2025-03-04 02:28:40,862 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 02:28:40,862 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-03-04 02:28:40,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:28:40,950 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:28:40,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:28:40,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516182275] [2025-03-04 02:28:40,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516182275] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:28:40,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1169537164] [2025-03-04 02:28:40,950 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 02:28:40,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:28:40,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:28:40,952 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:28:40,954 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-03-04 02:28:40,975 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 19 statements into 2 equivalence classes. [2025-03-04 02:28:40,982 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 02:28:40,982 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-03-04 02:28:40,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:28:40,983 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-04 02:28:40,983 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:28:41,038 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:28:41,038 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:28:41,181 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:28:41,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1169537164] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:28:41,181 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:28:41,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2025-03-04 02:28:41,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448623594] [2025-03-04 02:28:41,181 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:28:41,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-04 02:28:41,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:28:41,182 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-04 02:28:41,182 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=300, Unknown=0, NotChecked=0, Total=380 [2025-03-04 02:28:41,189 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 22 [2025-03-04 02:28:41,189 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 183 transitions, 3071 flow. Second operand has 20 states, 20 states have (on average 4.6) internal successors, (92), 20 states have internal predecessors, (92), 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-04 02:28:41,189 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:28:41,189 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 22 [2025-03-04 02:28:41,189 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:28:41,723 INFO L124 PetriNetUnfolderBase]: 784/1599 cut-off events. [2025-03-04 02:28:41,723 INFO L125 PetriNetUnfolderBase]: For 18951/18951 co-relation queries the response was YES. [2025-03-04 02:28:41,727 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9176 conditions, 1599 events. 784/1599 cut-off events. For 18951/18951 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 9782 event pairs, 44 based on Foata normal form. 7/1606 useless extension candidates. Maximal degree in co-relation 9121. Up to 514 conditions per place. [2025-03-04 02:28:41,730 INFO L140 encePairwiseOnDemand]: 12/22 looper letters, 85 selfloop transitions, 147 changer transitions 28/261 dead transitions. [2025-03-04 02:28:41,730 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 261 transitions, 4365 flow [2025-03-04 02:28:41,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-03-04 02:28:41,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2025-03-04 02:28:41,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 201 transitions. [2025-03-04 02:28:41,731 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3383838383838384 [2025-03-04 02:28:41,731 INFO L175 Difference]: Start difference. First operand has 181 places, 183 transitions, 3071 flow. Second operand 27 states and 201 transitions. [2025-03-04 02:28:41,731 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 261 transitions, 4365 flow [2025-03-04 02:28:41,771 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 261 transitions, 4155 flow, removed 18 selfloop flow, removed 13 redundant places. [2025-03-04 02:28:41,774 INFO L231 Difference]: Finished difference. Result has 198 places, 200 transitions, 3676 flow [2025-03-04 02:28:41,774 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=2885, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=183, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=129, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=3676, PETRI_PLACES=198, PETRI_TRANSITIONS=200} [2025-03-04 02:28:41,775 INFO L279 CegarLoopForPetriNet]: 24 programPoint places, 174 predicate places. [2025-03-04 02:28:41,775 INFO L471 AbstractCegarLoop]: Abstraction has has 198 places, 200 transitions, 3676 flow [2025-03-04 02:28:41,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 4.6) internal successors, (92), 20 states have internal predecessors, (92), 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-04 02:28:41,775 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:28:41,775 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:28:41,780 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2025-03-04 02:28:41,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2025-03-04 02:28:41,975 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:28:41,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:28:41,976 INFO L85 PathProgramCache]: Analyzing trace with hash -972430153, now seen corresponding path program 13 times [2025-03-04 02:28:41,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:28:41,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739234085] [2025-03-04 02:28:41,976 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 02:28:41,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:28:41,978 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 02:28:41,979 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 02:28:41,979 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:28:41,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:28:42,051 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:28:42,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:28:42,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739234085] [2025-03-04 02:28:42,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739234085] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:28:42,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1317164607] [2025-03-04 02:28:42,051 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 02:28:42,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:28:42,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:28:42,053 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:28:42,055 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-03-04 02:28:42,075 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 02:28:42,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 02:28:42,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:28:42,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:28:42,082 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-04 02:28:42,083 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:28:42,117 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:28:42,117 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:28:42,281 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:28:42,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1317164607] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:28:42,281 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:28:42,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 18 [2025-03-04 02:28:42,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799389882] [2025-03-04 02:28:42,282 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:28:42,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-04 02:28:42,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:28:42,282 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-04 02:28:42,282 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2025-03-04 02:28:42,285 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 22 [2025-03-04 02:28:42,285 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 200 transitions, 3676 flow. Second operand has 19 states, 19 states have (on average 4.526315789473684) internal successors, (86), 19 states have internal predecessors, (86), 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-04 02:28:42,285 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:28:42,285 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 22 [2025-03-04 02:28:42,285 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:28:42,797 INFO L124 PetriNetUnfolderBase]: 789/1610 cut-off events. [2025-03-04 02:28:42,797 INFO L125 PetriNetUnfolderBase]: For 23651/23651 co-relation queries the response was YES. [2025-03-04 02:28:42,802 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10061 conditions, 1610 events. 789/1610 cut-off events. For 23651/23651 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 9792 event pairs, 74 based on Foata normal form. 11/1621 useless extension candidates. Maximal degree in co-relation 10003. Up to 482 conditions per place. [2025-03-04 02:28:42,806 INFO L140 encePairwiseOnDemand]: 12/22 looper letters, 92 selfloop transitions, 138 changer transitions 24/255 dead transitions. [2025-03-04 02:28:42,806 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 255 transitions, 4596 flow [2025-03-04 02:28:42,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-04 02:28:42,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2025-03-04 02:28:42,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 187 transitions. [2025-03-04 02:28:42,807 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.34 [2025-03-04 02:28:42,807 INFO L175 Difference]: Start difference. First operand has 198 places, 200 transitions, 3676 flow. Second operand 25 states and 187 transitions. [2025-03-04 02:28:42,807 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 255 transitions, 4596 flow [2025-03-04 02:28:42,856 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 210 places, 255 transitions, 4475 flow, removed 48 selfloop flow, removed 7 redundant places. [2025-03-04 02:28:42,859 INFO L231 Difference]: Finished difference. Result has 213 places, 197 transitions, 3835 flow [2025-03-04 02:28:42,860 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=3552, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=134, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=3835, PETRI_PLACES=213, PETRI_TRANSITIONS=197} [2025-03-04 02:28:42,860 INFO L279 CegarLoopForPetriNet]: 24 programPoint places, 189 predicate places. [2025-03-04 02:28:42,860 INFO L471 AbstractCegarLoop]: Abstraction has has 213 places, 197 transitions, 3835 flow [2025-03-04 02:28:42,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 4.526315789473684) internal successors, (86), 19 states have internal predecessors, (86), 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-04 02:28:42,860 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:28:42,860 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:28:42,866 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2025-03-04 02:28:43,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:28:43,061 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:28:43,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:28:43,061 INFO L85 PathProgramCache]: Analyzing trace with hash -29776209, now seen corresponding path program 14 times [2025-03-04 02:28:43,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:28:43,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952519688] [2025-03-04 02:28:43,061 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:28:43,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:28:43,063 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-03-04 02:28:43,064 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 02:28:43,065 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:28:43,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:28:43,146 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:28:43,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:28:43,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952519688] [2025-03-04 02:28:43,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952519688] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:28:43,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1787293119] [2025-03-04 02:28:43,147 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:28:43,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:28:43,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:28:43,148 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:28:43,150 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-03-04 02:28:43,170 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-03-04 02:28:43,177 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 02:28:43,177 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:28:43,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:28:43,178 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-04 02:28:43,178 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:28:43,232 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:28:43,232 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:28:43,355 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:28:43,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1787293119] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:28:43,356 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:28:43,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 20 [2025-03-04 02:28:43,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825440160] [2025-03-04 02:28:43,356 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:28:43,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-04 02:28:43,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:28:43,356 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-04 02:28:43,356 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=329, Unknown=0, NotChecked=0, Total=420 [2025-03-04 02:28:43,368 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 22 [2025-03-04 02:28:43,369 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 213 places, 197 transitions, 3835 flow. Second operand has 21 states, 21 states have (on average 4.476190476190476) internal successors, (94), 21 states have internal predecessors, (94), 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-04 02:28:43,369 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:28:43,369 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 22 [2025-03-04 02:28:43,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:28:43,849 INFO L124 PetriNetUnfolderBase]: 841/1757 cut-off events. [2025-03-04 02:28:43,849 INFO L125 PetriNetUnfolderBase]: For 25660/25660 co-relation queries the response was YES. [2025-03-04 02:28:43,855 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11001 conditions, 1757 events. 841/1757 cut-off events. For 25660/25660 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 11268 event pairs, 62 based on Foata normal form. 3/1760 useless extension candidates. Maximal degree in co-relation 10942. Up to 548 conditions per place. [2025-03-04 02:28:43,860 INFO L140 encePairwiseOnDemand]: 12/22 looper letters, 91 selfloop transitions, 148 changer transitions 31/271 dead transitions. [2025-03-04 02:28:43,860 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 271 transitions, 5226 flow [2025-03-04 02:28:43,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-04 02:28:43,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-03-04 02:28:43,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 180 transitions. [2025-03-04 02:28:43,861 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.371900826446281 [2025-03-04 02:28:43,861 INFO L175 Difference]: Start difference. First operand has 213 places, 197 transitions, 3835 flow. Second operand 22 states and 180 transitions. [2025-03-04 02:28:43,861 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 271 transitions, 5226 flow [2025-03-04 02:28:43,915 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 271 transitions, 4972 flow, removed 31 selfloop flow, removed 16 redundant places. [2025-03-04 02:28:43,918 INFO L231 Difference]: Finished difference. Result has 214 places, 203 transitions, 4071 flow [2025-03-04 02:28:43,919 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=3619, PETRI_DIFFERENCE_MINUEND_PLACES=188, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=197, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=126, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=4071, PETRI_PLACES=214, PETRI_TRANSITIONS=203} [2025-03-04 02:28:43,919 INFO L279 CegarLoopForPetriNet]: 24 programPoint places, 190 predicate places. [2025-03-04 02:28:43,919 INFO L471 AbstractCegarLoop]: Abstraction has has 214 places, 203 transitions, 4071 flow [2025-03-04 02:28:43,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 4.476190476190476) internal successors, (94), 21 states have internal predecessors, (94), 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-04 02:28:43,919 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:28:43,919 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:28:43,925 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2025-03-04 02:28:44,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable41 [2025-03-04 02:28:44,120 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:28:44,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:28:44,120 INFO L85 PathProgramCache]: Analyzing trace with hash 862639675, now seen corresponding path program 15 times [2025-03-04 02:28:44,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:28:44,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281582204] [2025-03-04 02:28:44,120 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:28:44,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:28:44,123 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 19 statements into 2 equivalence classes. [2025-03-04 02:28:44,124 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 02:28:44,125 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 02:28:44,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:28:44,199 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:28:44,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:28:44,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281582204] [2025-03-04 02:28:44,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281582204] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:28:44,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1803547876] [2025-03-04 02:28:44,200 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:28:44,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:28:44,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:28:44,202 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:28:44,203 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2025-03-04 02:28:44,226 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 19 statements into 2 equivalence classes. [2025-03-04 02:28:44,233 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 02:28:44,233 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 02:28:44,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:28:44,233 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-04 02:28:44,234 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:28:44,315 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:28:44,315 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:28:44,427 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:28:44,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1803547876] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:28:44,427 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:28:44,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 22 [2025-03-04 02:28:44,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159625953] [2025-03-04 02:28:44,427 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:28:44,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-04 02:28:44,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:28:44,428 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-04 02:28:44,428 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=409, Unknown=0, NotChecked=0, Total=506 [2025-03-04 02:28:44,433 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 22 [2025-03-04 02:28:44,433 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 203 transitions, 4071 flow. Second operand has 23 states, 23 states have (on average 4.478260869565218) internal successors, (103), 23 states have internal predecessors, (103), 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-04 02:28:44,433 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:28:44,433 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 22 [2025-03-04 02:28:44,433 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:28:44,760 INFO L124 PetriNetUnfolderBase]: 851/1798 cut-off events. [2025-03-04 02:28:44,760 INFO L125 PetriNetUnfolderBase]: For 25749/25749 co-relation queries the response was YES. [2025-03-04 02:28:44,765 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11237 conditions, 1798 events. 851/1798 cut-off events. For 25749/25749 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 11761 event pairs, 194 based on Foata normal form. 6/1804 useless extension candidates. Maximal degree in co-relation 11177. Up to 1032 conditions per place. [2025-03-04 02:28:44,769 INFO L140 encePairwiseOnDemand]: 12/22 looper letters, 105 selfloop transitions, 88 changer transitions 62/256 dead transitions. [2025-03-04 02:28:44,769 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 256 transitions, 5292 flow [2025-03-04 02:28:44,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 02:28:44,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-04 02:28:44,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 112 transitions. [2025-03-04 02:28:44,770 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3916083916083916 [2025-03-04 02:28:44,770 INFO L175 Difference]: Start difference. First operand has 214 places, 203 transitions, 4071 flow. Second operand 13 states and 112 transitions. [2025-03-04 02:28:44,770 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 223 places, 256 transitions, 5292 flow [2025-03-04 02:28:44,826 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 256 transitions, 4733 flow, removed 60 selfloop flow, removed 16 redundant places. [2025-03-04 02:28:44,829 INFO L231 Difference]: Finished difference. Result has 211 places, 170 transitions, 3294 flow [2025-03-04 02:28:44,829 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=3561, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=203, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=82, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=3294, PETRI_PLACES=211, PETRI_TRANSITIONS=170} [2025-03-04 02:28:44,829 INFO L279 CegarLoopForPetriNet]: 24 programPoint places, 187 predicate places. [2025-03-04 02:28:44,829 INFO L471 AbstractCegarLoop]: Abstraction has has 211 places, 170 transitions, 3294 flow [2025-03-04 02:28:44,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 4.478260869565218) internal successors, (103), 23 states have internal predecessors, (103), 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-04 02:28:44,829 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:28:44,829 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:28:44,835 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2025-03-04 02:28:45,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:28:45,030 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:28:45,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:28:45,030 INFO L85 PathProgramCache]: Analyzing trace with hash -1714465127, now seen corresponding path program 16 times [2025-03-04 02:28:45,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:28:45,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638380363] [2025-03-04 02:28:45,030 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:28:45,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:28:45,032 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 19 statements into 2 equivalence classes. [2025-03-04 02:28:45,034 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 02:28:45,034 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 02:28:45,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:28:45,095 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:28:45,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:28:45,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638380363] [2025-03-04 02:28:45,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638380363] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:28:45,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1019670667] [2025-03-04 02:28:45,095 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:28:45,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:28:45,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:28:45,097 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:28:45,098 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2025-03-04 02:28:45,120 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 19 statements into 2 equivalence classes. [2025-03-04 02:28:45,126 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 02:28:45,126 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 02:28:45,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:28:45,127 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-04 02:28:45,127 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:28:45,206 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:28:45,206 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:28:45,386 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:28:45,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1019670667] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:28:45,386 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:28:45,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 22 [2025-03-04 02:28:45,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350178003] [2025-03-04 02:28:45,386 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:28:45,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-04 02:28:45,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:28:45,387 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-04 02:28:45,387 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=412, Unknown=0, NotChecked=0, Total=506 [2025-03-04 02:28:45,398 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 22 [2025-03-04 02:28:45,399 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 170 transitions, 3294 flow. Second operand has 23 states, 23 states have (on average 4.434782608695652) internal successors, (102), 23 states have internal predecessors, (102), 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-04 02:28:45,399 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:28:45,399 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 22 [2025-03-04 02:28:45,399 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:28:45,926 INFO L124 PetriNetUnfolderBase]: 777/1660 cut-off events. [2025-03-04 02:28:45,927 INFO L125 PetriNetUnfolderBase]: For 22007/22007 co-relation queries the response was YES. [2025-03-04 02:28:45,931 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9796 conditions, 1660 events. 777/1660 cut-off events. For 22007/22007 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 10712 event pairs, 126 based on Foata normal form. 5/1665 useless extension candidates. Maximal degree in co-relation 9738. Up to 904 conditions per place. [2025-03-04 02:28:45,935 INFO L140 encePairwiseOnDemand]: 11/22 looper letters, 104 selfloop transitions, 136 changer transitions 30/271 dead transitions. [2025-03-04 02:28:45,935 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 271 transitions, 5322 flow [2025-03-04 02:28:45,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-03-04 02:28:45,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2025-03-04 02:28:45,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 214 transitions. [2025-03-04 02:28:45,936 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3741258741258741 [2025-03-04 02:28:45,936 INFO L175 Difference]: Start difference. First operand has 211 places, 170 transitions, 3294 flow. Second operand 26 states and 214 transitions. [2025-03-04 02:28:45,936 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 271 transitions, 5322 flow [2025-03-04 02:28:45,984 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 271 transitions, 4769 flow, removed 83 selfloop flow, removed 18 redundant places. [2025-03-04 02:28:45,988 INFO L231 Difference]: Finished difference. Result has 216 places, 201 transitions, 4002 flow [2025-03-04 02:28:45,988 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=2925, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=170, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=104, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=4002, PETRI_PLACES=216, PETRI_TRANSITIONS=201} [2025-03-04 02:28:45,989 INFO L279 CegarLoopForPetriNet]: 24 programPoint places, 192 predicate places. [2025-03-04 02:28:45,989 INFO L471 AbstractCegarLoop]: Abstraction has has 216 places, 201 transitions, 4002 flow [2025-03-04 02:28:45,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 4.434782608695652) internal successors, (102), 23 states have internal predecessors, (102), 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-04 02:28:45,989 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:28:45,989 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:28:45,995 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2025-03-04 02:28:46,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:28:46,190 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:28:46,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:28:46,190 INFO L85 PathProgramCache]: Analyzing trace with hash 978724045, now seen corresponding path program 17 times [2025-03-04 02:28:46,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:28:46,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953021460] [2025-03-04 02:28:46,190 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:28:46,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:28:46,192 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-03-04 02:28:46,193 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 02:28:46,193 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:28:46,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:28:46,246 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:28:46,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:28:46,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953021460] [2025-03-04 02:28:46,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953021460] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:28:46,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1457550346] [2025-03-04 02:28:46,247 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:28:46,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:28:46,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:28:46,248 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:28:46,250 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2025-03-04 02:28:46,275 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-03-04 02:28:46,283 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 02:28:46,283 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:28:46,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:28:46,284 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-04 02:28:46,284 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:28:46,330 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:28:46,330 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 02:28:46,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1457550346] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:28:46,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 02:28:46,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 11 [2025-03-04 02:28:46,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192850777] [2025-03-04 02:28:46,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:28:46,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 02:28:46,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:28:46,331 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 02:28:46,331 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2025-03-04 02:28:46,339 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 22 [2025-03-04 02:28:46,339 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 216 places, 201 transitions, 4002 flow. Second operand has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 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-04 02:28:46,339 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:28:46,339 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 22 [2025-03-04 02:28:46,339 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:28:46,521 INFO L124 PetriNetUnfolderBase]: 718/1524 cut-off events. [2025-03-04 02:28:46,521 INFO L125 PetriNetUnfolderBase]: For 18363/18363 co-relation queries the response was YES. [2025-03-04 02:28:46,526 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9142 conditions, 1524 events. 718/1524 cut-off events. For 18363/18363 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 9479 event pairs, 104 based on Foata normal form. 2/1526 useless extension candidates. Maximal degree in co-relation 9081. Up to 708 conditions per place. [2025-03-04 02:28:46,529 INFO L140 encePairwiseOnDemand]: 14/22 looper letters, 101 selfloop transitions, 105 changer transitions 17/224 dead transitions. [2025-03-04 02:28:46,529 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 224 transitions, 4751 flow [2025-03-04 02:28:46,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 02:28:46,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 02:28:46,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 79 transitions. [2025-03-04 02:28:46,529 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.398989898989899 [2025-03-04 02:28:46,529 INFO L175 Difference]: Start difference. First operand has 216 places, 201 transitions, 4002 flow. Second operand 9 states and 79 transitions. [2025-03-04 02:28:46,530 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 224 transitions, 4751 flow [2025-03-04 02:28:46,572 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 224 transitions, 4406 flow, removed 99 selfloop flow, removed 16 redundant places. [2025-03-04 02:28:46,576 INFO L231 Difference]: Finished difference. Result has 205 places, 195 transitions, 3790 flow [2025-03-04 02:28:46,576 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=3666, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=201, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=101, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3790, PETRI_PLACES=205, PETRI_TRANSITIONS=195} [2025-03-04 02:28:46,576 INFO L279 CegarLoopForPetriNet]: 24 programPoint places, 181 predicate places. [2025-03-04 02:28:46,576 INFO L471 AbstractCegarLoop]: Abstraction has has 205 places, 195 transitions, 3790 flow [2025-03-04 02:28:46,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 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-04 02:28:46,576 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:28:46,576 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:28:46,583 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2025-03-04 02:28:46,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:28:46,777 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:28:46,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:28:46,777 INFO L85 PathProgramCache]: Analyzing trace with hash 782242717, now seen corresponding path program 18 times [2025-03-04 02:28:46,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:28:46,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98940600] [2025-03-04 02:28:46,777 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 02:28:46,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:28:46,779 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 19 statements into 2 equivalence classes. [2025-03-04 02:28:46,781 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 02:28:46,781 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-03-04 02:28:46,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:28:46,851 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:28:46,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:28:46,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98940600] [2025-03-04 02:28:46,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98940600] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:28:46,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [322858229] [2025-03-04 02:28:46,851 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 02:28:46,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:28:46,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:28:46,854 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:28:46,855 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2025-03-04 02:28:46,875 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 19 statements into 2 equivalence classes. [2025-03-04 02:28:46,883 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 02:28:46,883 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-03-04 02:28:46,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:28:46,883 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-04 02:28:46,884 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:28:46,963 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:28:46,963 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:28:47,092 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:28:47,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [322858229] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:28:47,093 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:28:47,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 22 [2025-03-04 02:28:47,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41148847] [2025-03-04 02:28:47,093 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:28:47,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-04 02:28:47,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:28:47,093 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-04 02:28:47,093 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=410, Unknown=0, NotChecked=0, Total=506 [2025-03-04 02:28:47,099 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 22 [2025-03-04 02:28:47,099 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 195 transitions, 3790 flow. Second operand has 23 states, 23 states have (on average 4.434782608695652) internal successors, (102), 23 states have internal predecessors, (102), 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-04 02:28:47,099 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:28:47,099 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 22 [2025-03-04 02:28:47,099 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:28:47,371 INFO L124 PetriNetUnfolderBase]: 680/1439 cut-off events. [2025-03-04 02:28:47,372 INFO L125 PetriNetUnfolderBase]: For 17169/17169 co-relation queries the response was YES. [2025-03-04 02:28:47,376 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8539 conditions, 1439 events. 680/1439 cut-off events. For 17169/17169 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 8821 event pairs, 145 based on Foata normal form. 4/1443 useless extension candidates. Maximal degree in co-relation 8484. Up to 846 conditions per place. [2025-03-04 02:28:47,378 INFO L140 encePairwiseOnDemand]: 12/22 looper letters, 114 selfloop transitions, 92 changer transitions 19/226 dead transitions. [2025-03-04 02:28:47,378 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 226 transitions, 4412 flow [2025-03-04 02:28:47,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 02:28:47,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-04 02:28:47,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 114 transitions. [2025-03-04 02:28:47,379 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.37012987012987014 [2025-03-04 02:28:47,379 INFO L175 Difference]: Start difference. First operand has 205 places, 195 transitions, 3790 flow. Second operand 14 states and 114 transitions. [2025-03-04 02:28:47,379 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 216 places, 226 transitions, 4412 flow [2025-03-04 02:28:47,419 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 226 transitions, 4120 flow, removed 5 selfloop flow, removed 9 redundant places. [2025-03-04 02:28:47,422 INFO L231 Difference]: Finished difference. Result has 208 places, 183 transitions, 3456 flow [2025-03-04 02:28:47,422 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=3503, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=195, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=92, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=3456, PETRI_PLACES=208, PETRI_TRANSITIONS=183} [2025-03-04 02:28:47,423 INFO L279 CegarLoopForPetriNet]: 24 programPoint places, 184 predicate places. [2025-03-04 02:28:47,423 INFO L471 AbstractCegarLoop]: Abstraction has has 208 places, 183 transitions, 3456 flow [2025-03-04 02:28:47,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 4.434782608695652) internal successors, (102), 23 states have internal predecessors, (102), 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-04 02:28:47,423 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:28:47,423 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:28:47,429 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2025-03-04 02:28:47,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:28:47,625 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:28:47,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:28:47,625 INFO L85 PathProgramCache]: Analyzing trace with hash 247012915, now seen corresponding path program 19 times [2025-03-04 02:28:47,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:28:47,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215563917] [2025-03-04 02:28:47,625 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 02:28:47,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:28:47,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 02:28:47,628 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 02:28:47,628 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:28:47,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:28:47,691 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:28:47,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:28:47,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215563917] [2025-03-04 02:28:47,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215563917] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:28:47,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [956289567] [2025-03-04 02:28:47,692 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 02:28:47,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:28:47,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:28:47,693 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:28:47,694 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2025-03-04 02:28:47,713 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 02:28:47,719 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 02:28:47,719 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:28:47,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:28:47,720 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-04 02:28:47,720 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:28:47,788 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:28:47,788 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:28:47,914 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:28:47,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [956289567] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:28:47,915 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:28:47,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 22 [2025-03-04 02:28:47,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56549889] [2025-03-04 02:28:47,915 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:28:47,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-04 02:28:47,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:28:47,915 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-04 02:28:47,915 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=407, Unknown=0, NotChecked=0, Total=506 [2025-03-04 02:28:47,927 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 22 [2025-03-04 02:28:47,927 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 183 transitions, 3456 flow. Second operand has 23 states, 23 states have (on average 4.434782608695652) internal successors, (102), 23 states have internal predecessors, (102), 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-04 02:28:47,927 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:28:47,927 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 22 [2025-03-04 02:28:47,927 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:28:48,272 INFO L124 PetriNetUnfolderBase]: 761/1568 cut-off events. [2025-03-04 02:28:48,272 INFO L125 PetriNetUnfolderBase]: For 19895/19895 co-relation queries the response was YES. [2025-03-04 02:28:48,276 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9472 conditions, 1568 events. 761/1568 cut-off events. For 19895/19895 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 9656 event pairs, 162 based on Foata normal form. 5/1573 useless extension candidates. Maximal degree in co-relation 9418. Up to 795 conditions per place. [2025-03-04 02:28:48,278 INFO L140 encePairwiseOnDemand]: 12/22 looper letters, 128 selfloop transitions, 92 changer transitions 28/249 dead transitions. [2025-03-04 02:28:48,278 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 249 transitions, 4832 flow [2025-03-04 02:28:48,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 02:28:48,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-04 02:28:48,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 125 transitions. [2025-03-04 02:28:48,279 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3787878787878788 [2025-03-04 02:28:48,279 INFO L175 Difference]: Start difference. First operand has 208 places, 183 transitions, 3456 flow. Second operand 15 states and 125 transitions. [2025-03-04 02:28:48,279 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 216 places, 249 transitions, 4832 flow [2025-03-04 02:28:48,321 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 249 transitions, 4586 flow, removed 11 selfloop flow, removed 14 redundant places. [2025-03-04 02:28:48,324 INFO L231 Difference]: Finished difference. Result has 207 places, 180 transitions, 3451 flow [2025-03-04 02:28:48,324 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=3239, PETRI_DIFFERENCE_MINUEND_PLACES=188, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=183, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=81, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=3451, PETRI_PLACES=207, PETRI_TRANSITIONS=180} [2025-03-04 02:28:48,325 INFO L279 CegarLoopForPetriNet]: 24 programPoint places, 183 predicate places. [2025-03-04 02:28:48,325 INFO L471 AbstractCegarLoop]: Abstraction has has 207 places, 180 transitions, 3451 flow [2025-03-04 02:28:48,325 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 4.434782608695652) internal successors, (102), 23 states have internal predecessors, (102), 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-04 02:28:48,325 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:28:48,325 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:28:48,334 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2025-03-04 02:28:48,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable46 [2025-03-04 02:28:48,525 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:28:48,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:28:48,526 INFO L85 PathProgramCache]: Analyzing trace with hash 306683221, now seen corresponding path program 20 times [2025-03-04 02:28:48,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:28:48,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233221463] [2025-03-04 02:28:48,526 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:28:48,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:28:48,528 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-03-04 02:28:48,529 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 02:28:48,529 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:28:48,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:28:48,592 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:28:48,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:28:48,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233221463] [2025-03-04 02:28:48,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233221463] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:28:48,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [544431213] [2025-03-04 02:28:48,593 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:28:48,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:28:48,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:28:48,595 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:28:48,596 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2025-03-04 02:28:48,615 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-03-04 02:28:48,623 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 02:28:48,623 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:28:48,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:28:48,624 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-04 02:28:48,625 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:28:48,693 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:28:48,693 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:28:48,807 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:28:48,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [544431213] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:28:48,807 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:28:48,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 22 [2025-03-04 02:28:48,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291609064] [2025-03-04 02:28:48,808 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:28:48,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-04 02:28:48,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:28:48,808 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-04 02:28:48,808 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=416, Unknown=0, NotChecked=0, Total=506 [2025-03-04 02:28:48,815 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 22 [2025-03-04 02:28:48,815 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 180 transitions, 3451 flow. Second operand has 23 states, 23 states have (on average 4.391304347826087) internal successors, (101), 23 states have internal predecessors, (101), 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-04 02:28:48,815 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:28:48,815 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 22 [2025-03-04 02:28:48,815 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:28:49,132 INFO L124 PetriNetUnfolderBase]: 709/1472 cut-off events. [2025-03-04 02:28:49,132 INFO L125 PetriNetUnfolderBase]: For 19063/19063 co-relation queries the response was YES. [2025-03-04 02:28:49,136 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8735 conditions, 1472 events. 709/1472 cut-off events. For 19063/19063 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 8909 event pairs, 136 based on Foata normal form. 7/1479 useless extension candidates. Maximal degree in co-relation 8681. Up to 750 conditions per place. [2025-03-04 02:28:49,138 INFO L140 encePairwiseOnDemand]: 12/22 looper letters, 99 selfloop transitions, 59 changer transitions 67/226 dead transitions. [2025-03-04 02:28:49,138 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 226 transitions, 4311 flow [2025-03-04 02:28:49,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-04 02:28:49,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-03-04 02:28:49,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 124 transitions. [2025-03-04 02:28:49,139 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3522727272727273 [2025-03-04 02:28:49,139 INFO L175 Difference]: Start difference. First operand has 207 places, 180 transitions, 3451 flow. Second operand 16 states and 124 transitions. [2025-03-04 02:28:49,139 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 226 transitions, 4311 flow [2025-03-04 02:28:49,180 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 226 transitions, 4152 flow, removed 12 selfloop flow, removed 12 redundant places. [2025-03-04 02:28:49,182 INFO L231 Difference]: Finished difference. Result has 209 places, 142 transitions, 2614 flow [2025-03-04 02:28:49,183 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=3292, PETRI_DIFFERENCE_MINUEND_PLACES=192, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=180, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=2614, PETRI_PLACES=209, PETRI_TRANSITIONS=142} [2025-03-04 02:28:49,183 INFO L279 CegarLoopForPetriNet]: 24 programPoint places, 185 predicate places. [2025-03-04 02:28:49,183 INFO L471 AbstractCegarLoop]: Abstraction has has 209 places, 142 transitions, 2614 flow [2025-03-04 02:28:49,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 4.391304347826087) internal successors, (101), 23 states have internal predecessors, (101), 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-04 02:28:49,183 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:28:49,183 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:28:49,188 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2025-03-04 02:28:49,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2025-03-04 02:28:49,384 INFO L396 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:28:49,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:28:49,384 INFO L85 PathProgramCache]: Analyzing trace with hash 327409873, now seen corresponding path program 21 times [2025-03-04 02:28:49,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:28:49,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845113712] [2025-03-04 02:28:49,384 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:28:49,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:28:49,386 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 19 statements into 2 equivalence classes. [2025-03-04 02:28:49,387 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 02:28:49,387 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 02:28:49,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:28:49,455 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:28:49,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:28:49,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845113712] [2025-03-04 02:28:49,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845113712] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:28:49,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [406908854] [2025-03-04 02:28:49,456 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:28:49,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:28:49,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:28:49,457 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:28:49,459 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2025-03-04 02:28:49,479 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 19 statements into 2 equivalence classes. [2025-03-04 02:28:49,486 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 02:28:49,487 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 02:28:49,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:28:49,487 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-04 02:28:49,487 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:28:49,565 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:28:49,566 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:28:49,676 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:28:49,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [406908854] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:28:49,676 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:28:49,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 22 [2025-03-04 02:28:49,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509711050] [2025-03-04 02:28:49,676 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:28:49,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-04 02:28:49,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:28:49,677 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-04 02:28:49,677 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=406, Unknown=0, NotChecked=0, Total=506 [2025-03-04 02:28:49,682 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 22 [2025-03-04 02:28:49,682 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 142 transitions, 2614 flow. Second operand has 23 states, 23 states have (on average 4.478260869565218) internal successors, (103), 23 states have internal predecessors, (103), 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-04 02:28:49,683 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:28:49,683 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 22 [2025-03-04 02:28:49,683 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:28:49,936 INFO L124 PetriNetUnfolderBase]: 507/1091 cut-off events. [2025-03-04 02:28:49,936 INFO L125 PetriNetUnfolderBase]: For 14286/14286 co-relation queries the response was YES. [2025-03-04 02:28:49,939 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6399 conditions, 1091 events. 507/1091 cut-off events. For 14286/14286 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 6231 event pairs, 146 based on Foata normal form. 2/1093 useless extension candidates. Maximal degree in co-relation 6345. Up to 733 conditions per place. [2025-03-04 02:28:49,941 INFO L140 encePairwiseOnDemand]: 12/22 looper letters, 92 selfloop transitions, 51 changer transitions 21/165 dead transitions. [2025-03-04 02:28:49,941 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 165 transitions, 3078 flow [2025-03-04 02:28:49,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 02:28:49,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-04 02:28:49,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 101 transitions. [2025-03-04 02:28:49,941 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3531468531468531 [2025-03-04 02:28:49,941 INFO L175 Difference]: Start difference. First operand has 209 places, 142 transitions, 2614 flow. Second operand 13 states and 101 transitions. [2025-03-04 02:28:49,941 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 210 places, 165 transitions, 3078 flow [2025-03-04 02:28:49,969 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 165 transitions, 2699 flow, removed 34 selfloop flow, removed 26 redundant places. [2025-03-04 02:28:49,971 INFO L231 Difference]: Finished difference. Result has 185 places, 131 transitions, 2137 flow [2025-03-04 02:28:49,971 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=2239, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=2137, PETRI_PLACES=185, PETRI_TRANSITIONS=131} [2025-03-04 02:28:49,971 INFO L279 CegarLoopForPetriNet]: 24 programPoint places, 161 predicate places. [2025-03-04 02:28:49,971 INFO L471 AbstractCegarLoop]: Abstraction has has 185 places, 131 transitions, 2137 flow [2025-03-04 02:28:49,971 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 4.478260869565218) internal successors, (103), 23 states have internal predecessors, (103), 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-04 02:28:49,971 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:28:49,971 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:28:49,977 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2025-03-04 02:28:50,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2025-03-04 02:28:50,172 INFO L396 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:28:50,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:28:50,172 INFO L85 PathProgramCache]: Analyzing trace with hash 1013584379, now seen corresponding path program 22 times [2025-03-04 02:28:50,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:28:50,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797527031] [2025-03-04 02:28:50,172 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:28:50,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:28:50,174 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 19 statements into 2 equivalence classes. [2025-03-04 02:28:50,175 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 02:28:50,175 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 02:28:50,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:28:50,232 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:28:50,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:28:50,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797527031] [2025-03-04 02:28:50,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797527031] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:28:50,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1742569383] [2025-03-04 02:28:50,232 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:28:50,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:28:50,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:28:50,234 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:28:50,234 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2025-03-04 02:28:50,253 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 19 statements into 2 equivalence classes. [2025-03-04 02:28:50,259 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 02:28:50,259 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 02:28:50,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:28:50,259 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-04 02:28:50,260 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:28:50,335 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:28:50,336 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:28:50,468 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:28:50,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1742569383] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:28:50,468 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:28:50,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 23 [2025-03-04 02:28:50,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497750862] [2025-03-04 02:28:50,468 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:28:50,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-04 02:28:50,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:28:50,469 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-04 02:28:50,469 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=465, Unknown=0, NotChecked=0, Total=552 [2025-03-04 02:28:50,483 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 22 [2025-03-04 02:28:50,484 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 131 transitions, 2137 flow. Second operand has 24 states, 24 states have (on average 4.458333333333333) internal successors, (107), 24 states have internal predecessors, (107), 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-04 02:28:50,484 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:28:50,484 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 22 [2025-03-04 02:28:50,484 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:28:50,750 INFO L124 PetriNetUnfolderBase]: 470/999 cut-off events. [2025-03-04 02:28:50,751 INFO L125 PetriNetUnfolderBase]: For 11032/11032 co-relation queries the response was YES. [2025-03-04 02:28:50,753 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5479 conditions, 999 events. 470/999 cut-off events. For 11032/11032 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 5454 event pairs, 65 based on Foata normal form. 3/1002 useless extension candidates. Maximal degree in co-relation 5433. Up to 332 conditions per place. [2025-03-04 02:28:50,754 INFO L140 encePairwiseOnDemand]: 12/22 looper letters, 64 selfloop transitions, 50 changer transitions 40/155 dead transitions. [2025-03-04 02:28:50,754 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 155 transitions, 2579 flow [2025-03-04 02:28:50,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 02:28:50,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-04 02:28:50,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 99 transitions. [2025-03-04 02:28:50,755 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.34615384615384615 [2025-03-04 02:28:50,755 INFO L175 Difference]: Start difference. First operand has 185 places, 131 transitions, 2137 flow. Second operand 13 states and 99 transitions. [2025-03-04 02:28:50,755 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 155 transitions, 2579 flow [2025-03-04 02:28:50,786 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 155 transitions, 2399 flow, removed 10 selfloop flow, removed 14 redundant places. [2025-03-04 02:28:50,787 INFO L231 Difference]: Finished difference. Result has 176 places, 103 transitions, 1573 flow [2025-03-04 02:28:50,788 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=1961, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1573, PETRI_PLACES=176, PETRI_TRANSITIONS=103} [2025-03-04 02:28:50,788 INFO L279 CegarLoopForPetriNet]: 24 programPoint places, 152 predicate places. [2025-03-04 02:28:50,788 INFO L471 AbstractCegarLoop]: Abstraction has has 176 places, 103 transitions, 1573 flow [2025-03-04 02:28:50,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 4.458333333333333) internal successors, (107), 24 states have internal predecessors, (107), 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-04 02:28:50,788 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:28:50,788 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:28:50,793 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Ended with exit code 0 [2025-03-04 02:28:50,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2025-03-04 02:28:50,989 INFO L396 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:28:50,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:28:50,989 INFO L85 PathProgramCache]: Analyzing trace with hash -329372659, now seen corresponding path program 23 times [2025-03-04 02:28:50,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:28:50,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190469685] [2025-03-04 02:28:50,989 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:28:50,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:28:50,991 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-03-04 02:28:50,992 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 02:28:50,992 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:28:50,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:28:51,036 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:28:51,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:28:51,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190469685] [2025-03-04 02:28:51,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190469685] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:28:51,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [655403672] [2025-03-04 02:28:51,037 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:28:51,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:28:51,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:28:51,039 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:28:51,040 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2025-03-04 02:28:51,059 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-03-04 02:28:51,065 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 02:28:51,065 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:28:51,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:28:51,066 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-04 02:28:51,066 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:28:51,096 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:28:51,096 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 02:28:51,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [655403672] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:28:51,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 02:28:51,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 10 [2025-03-04 02:28:51,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584711828] [2025-03-04 02:28:51,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:28:51,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 02:28:51,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:28:51,097 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 02:28:51,097 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2025-03-04 02:28:51,102 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 22 [2025-03-04 02:28:51,102 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 103 transitions, 1573 flow. Second operand has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 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-04 02:28:51,102 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:28:51,102 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 22 [2025-03-04 02:28:51,102 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:28:51,198 INFO L124 PetriNetUnfolderBase]: 411/883 cut-off events. [2025-03-04 02:28:51,198 INFO L125 PetriNetUnfolderBase]: For 8337/8337 co-relation queries the response was YES. [2025-03-04 02:28:51,200 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4557 conditions, 883 events. 411/883 cut-off events. For 8337/8337 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 4722 event pairs, 34 based on Foata normal form. 10/893 useless extension candidates. Maximal degree in co-relation 4514. Up to 206 conditions per place. [2025-03-04 02:28:51,201 INFO L140 encePairwiseOnDemand]: 14/22 looper letters, 53 selfloop transitions, 29 changer transitions 40/123 dead transitions. [2025-03-04 02:28:51,201 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 123 transitions, 2003 flow [2025-03-04 02:28:51,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 02:28:51,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 02:28:51,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 72 transitions. [2025-03-04 02:28:51,201 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.36363636363636365 [2025-03-04 02:28:51,202 INFO L175 Difference]: Start difference. First operand has 176 places, 103 transitions, 1573 flow. Second operand 9 states and 72 transitions. [2025-03-04 02:28:51,202 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 123 transitions, 2003 flow [2025-03-04 02:28:51,215 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 123 transitions, 1739 flow, removed 8 selfloop flow, removed 29 redundant places. [2025-03-04 02:28:51,216 INFO L231 Difference]: Finished difference. Result has 143 places, 77 transitions, 1056 flow [2025-03-04 02:28:51,216 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=1321, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1056, PETRI_PLACES=143, PETRI_TRANSITIONS=77} [2025-03-04 02:28:51,217 INFO L279 CegarLoopForPetriNet]: 24 programPoint places, 119 predicate places. [2025-03-04 02:28:51,217 INFO L471 AbstractCegarLoop]: Abstraction has has 143 places, 77 transitions, 1056 flow [2025-03-04 02:28:51,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 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-04 02:28:51,217 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:28:51,217 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:28:51,223 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2025-03-04 02:28:51,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:28:51,417 INFO L396 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:28:51,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:28:51,418 INFO L85 PathProgramCache]: Analyzing trace with hash 946345795, now seen corresponding path program 24 times [2025-03-04 02:28:51,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:28:51,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267496284] [2025-03-04 02:28:51,418 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 02:28:51,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:28:51,420 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 19 statements into 2 equivalence classes. [2025-03-04 02:28:51,422 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 02:28:51,422 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-03-04 02:28:51,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:28:51,480 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:28:51,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:28:51,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267496284] [2025-03-04 02:28:51,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267496284] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:28:51,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [704579669] [2025-03-04 02:28:51,481 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 02:28:51,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:28:51,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:28:51,483 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:28:51,483 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2025-03-04 02:28:51,502 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 19 statements into 2 equivalence classes. [2025-03-04 02:28:51,508 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 02:28:51,508 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-03-04 02:28:51,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:28:51,509 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-04 02:28:51,509 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:28:51,581 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:28:51,581 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:28:51,705 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:28:51,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [704579669] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:28:51,705 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:28:51,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 22 [2025-03-04 02:28:51,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633861777] [2025-03-04 02:28:51,705 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:28:51,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-04 02:28:51,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:28:51,706 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-04 02:28:51,706 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=409, Unknown=0, NotChecked=0, Total=506 [2025-03-04 02:28:51,711 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 22 [2025-03-04 02:28:51,711 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 77 transitions, 1056 flow. Second operand has 23 states, 23 states have (on average 4.521739130434782) internal successors, (104), 23 states have internal predecessors, (104), 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-04 02:28:51,711 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:28:51,711 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 22 [2025-03-04 02:28:51,711 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:28:51,902 INFO L124 PetriNetUnfolderBase]: 189/435 cut-off events. [2025-03-04 02:28:51,902 INFO L125 PetriNetUnfolderBase]: For 3703/3703 co-relation queries the response was YES. [2025-03-04 02:28:51,903 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2184 conditions, 435 events. 189/435 cut-off events. For 3703/3703 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1955 event pairs, 7 based on Foata normal form. 4/439 useless extension candidates. Maximal degree in co-relation 2148. Up to 99 conditions per place. [2025-03-04 02:28:51,903 INFO L140 encePairwiseOnDemand]: 12/22 looper letters, 48 selfloop transitions, 31 changer transitions 19/99 dead transitions. [2025-03-04 02:28:51,903 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 99 transitions, 1336 flow [2025-03-04 02:28:51,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 02:28:51,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-04 02:28:51,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 87 transitions. [2025-03-04 02:28:51,904 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.32954545454545453 [2025-03-04 02:28:51,904 INFO L175 Difference]: Start difference. First operand has 143 places, 77 transitions, 1056 flow. Second operand 12 states and 87 transitions. [2025-03-04 02:28:51,904 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 99 transitions, 1336 flow [2025-03-04 02:28:51,909 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 99 transitions, 1199 flow, removed 12 selfloop flow, removed 17 redundant places. [2025-03-04 02:28:51,910 INFO L231 Difference]: Finished difference. Result has 122 places, 65 transitions, 784 flow [2025-03-04 02:28:51,910 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=931, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=784, PETRI_PLACES=122, PETRI_TRANSITIONS=65} [2025-03-04 02:28:51,911 INFO L279 CegarLoopForPetriNet]: 24 programPoint places, 98 predicate places. [2025-03-04 02:28:51,911 INFO L471 AbstractCegarLoop]: Abstraction has has 122 places, 65 transitions, 784 flow [2025-03-04 02:28:51,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 4.521739130434782) internal successors, (104), 23 states have internal predecessors, (104), 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-04 02:28:51,911 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:28:51,911 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:28:51,916 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Ended with exit code 0 [2025-03-04 02:28:52,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable51 [2025-03-04 02:28:52,111 INFO L396 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:28:52,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:28:52,112 INFO L85 PathProgramCache]: Analyzing trace with hash 1106498671, now seen corresponding path program 25 times [2025-03-04 02:28:52,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:28:52,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315328538] [2025-03-04 02:28:52,112 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 02:28:52,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:28:52,114 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 02:28:52,115 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 02:28:52,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:28:52,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:28:52,185 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:28:52,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:28:52,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315328538] [2025-03-04 02:28:52,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315328538] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:28:52,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1572264745] [2025-03-04 02:28:52,185 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 02:28:52,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:28:52,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:28:52,187 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:28:52,188 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2025-03-04 02:28:52,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 02:28:52,216 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 02:28:52,217 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:28:52,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:28:52,217 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-04 02:28:52,218 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:28:52,302 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:28:52,302 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:28:52,455 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:28:52,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1572264745] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:28:52,456 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:28:52,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 22 [2025-03-04 02:28:52,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942367411] [2025-03-04 02:28:52,456 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:28:52,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-04 02:28:52,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:28:52,457 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-04 02:28:52,457 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=408, Unknown=0, NotChecked=0, Total=506 [2025-03-04 02:28:52,463 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 22 [2025-03-04 02:28:52,463 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 65 transitions, 784 flow. Second operand has 23 states, 23 states have (on average 4.434782608695652) internal successors, (102), 23 states have internal predecessors, (102), 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-04 02:28:52,463 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:28:52,463 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 22 [2025-03-04 02:28:52,463 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:28:52,608 INFO L124 PetriNetUnfolderBase]: 125/289 cut-off events. [2025-03-04 02:28:52,608 INFO L125 PetriNetUnfolderBase]: For 2370/2370 co-relation queries the response was YES. [2025-03-04 02:28:52,609 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1459 conditions, 289 events. 125/289 cut-off events. For 2370/2370 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1093 event pairs, 7 based on Foata normal form. 3/292 useless extension candidates. Maximal degree in co-relation 1430. Up to 67 conditions per place. [2025-03-04 02:28:52,609 INFO L140 encePairwiseOnDemand]: 12/22 looper letters, 28 selfloop transitions, 12 changer transitions 42/83 dead transitions. [2025-03-04 02:28:52,609 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 83 transitions, 1011 flow [2025-03-04 02:28:52,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 02:28:52,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-04 02:28:52,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 81 transitions. [2025-03-04 02:28:52,610 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3068181818181818 [2025-03-04 02:28:52,610 INFO L175 Difference]: Start difference. First operand has 122 places, 65 transitions, 784 flow. Second operand 12 states and 81 transitions. [2025-03-04 02:28:52,610 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 83 transitions, 1011 flow [2025-03-04 02:28:52,615 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 83 transitions, 854 flow, removed 9 selfloop flow, removed 20 redundant places. [2025-03-04 02:28:52,615 INFO L231 Difference]: Finished difference. Result has 111 places, 34 transitions, 330 flow [2025-03-04 02:28:52,615 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=633, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=330, PETRI_PLACES=111, PETRI_TRANSITIONS=34} [2025-03-04 02:28:52,616 INFO L279 CegarLoopForPetriNet]: 24 programPoint places, 87 predicate places. [2025-03-04 02:28:52,616 INFO L471 AbstractCegarLoop]: Abstraction has has 111 places, 34 transitions, 330 flow [2025-03-04 02:28:52,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 4.434782608695652) internal successors, (102), 23 states have internal predecessors, (102), 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-04 02:28:52,616 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:28:52,616 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:28:52,624 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2025-03-04 02:28:52,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52,32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:28:52,817 INFO L396 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:28:52,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:28:52,817 INFO L85 PathProgramCache]: Analyzing trace with hash -1704229137, now seen corresponding path program 26 times [2025-03-04 02:28:52,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:28:52,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48446633] [2025-03-04 02:28:52,817 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:28:52,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:28:52,820 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-03-04 02:28:52,821 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 02:28:52,821 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:28:52,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:28:52,858 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:28:52,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:28:52,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48446633] [2025-03-04 02:28:52,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48446633] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:28:52,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [567653592] [2025-03-04 02:28:52,859 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:28:52,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:28:52,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:28:52,864 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:28:52,865 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2025-03-04 02:28:52,885 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-03-04 02:28:52,892 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 02:28:52,892 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:28:52,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:28:52,893 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 02:28:52,893 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:28:52,904 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:28:52,904 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:28:52,947 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:28:52,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [567653592] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:28:52,947 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:28:52,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 13 [2025-03-04 02:28:52,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033315085] [2025-03-04 02:28:52,947 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:28:52,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 02:28:52,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:28:52,948 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 02:28:52,948 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2025-03-04 02:28:52,948 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 22 [2025-03-04 02:28:52,949 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 34 transitions, 330 flow. Second operand has 13 states, 13 states have (on average 5.3076923076923075) internal successors, (69), 13 states have internal predecessors, (69), 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-04 02:28:52,949 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:28:52,949 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 22 [2025-03-04 02:28:52,949 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:28:53,020 INFO L124 PetriNetUnfolderBase]: 43/98 cut-off events. [2025-03-04 02:28:53,020 INFO L125 PetriNetUnfolderBase]: For 853/853 co-relation queries the response was YES. [2025-03-04 02:28:53,020 INFO L83 FinitePrefix]: Finished finitePrefix Result has 508 conditions, 98 events. 43/98 cut-off events. For 853/853 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 191 event pairs, 12 based on Foata normal form. 2/100 useless extension candidates. Maximal degree in co-relation 483. Up to 38 conditions per place. [2025-03-04 02:28:53,021 INFO L140 encePairwiseOnDemand]: 16/22 looper letters, 28 selfloop transitions, 5 changer transitions 8/42 dead transitions. [2025-03-04 02:28:53,021 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 42 transitions, 419 flow [2025-03-04 02:28:53,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 02:28:53,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 02:28:53,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 59 transitions. [2025-03-04 02:28:53,022 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3352272727272727 [2025-03-04 02:28:53,022 INFO L175 Difference]: Start difference. First operand has 111 places, 34 transitions, 330 flow. Second operand 8 states and 59 transitions. [2025-03-04 02:28:53,022 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 42 transitions, 419 flow [2025-03-04 02:28:53,023 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 42 transitions, 318 flow, removed 8 selfloop flow, removed 24 redundant places. [2025-03-04 02:28:53,024 INFO L231 Difference]: Finished difference. Result has 59 places, 27 transitions, 172 flow [2025-03-04 02:28:53,024 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=200, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=172, PETRI_PLACES=59, PETRI_TRANSITIONS=27} [2025-03-04 02:28:53,024 INFO L279 CegarLoopForPetriNet]: 24 programPoint places, 35 predicate places. [2025-03-04 02:28:53,024 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 27 transitions, 172 flow [2025-03-04 02:28:53,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.3076923076923075) internal successors, (69), 13 states have internal predecessors, (69), 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-04 02:28:53,024 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:28:53,024 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:28:53,032 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Ended with exit code 0 [2025-03-04 02:28:53,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:28:53,225 INFO L396 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:28:53,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:28:53,226 INFO L85 PathProgramCache]: Analyzing trace with hash 1363964874, now seen corresponding path program 27 times [2025-03-04 02:28:53,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:28:53,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073499702] [2025-03-04 02:28:53,226 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:28:53,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:28:53,228 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 21 statements into 2 equivalence classes. [2025-03-04 02:28:53,230 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 02:28:53,231 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 02:28:53,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:28:53,304 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:28:53,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:28:53,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073499702] [2025-03-04 02:28:53,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073499702] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:28:53,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [883245713] [2025-03-04 02:28:53,305 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:28:53,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:28:53,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:28:53,306 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:28:53,308 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2025-03-04 02:28:53,326 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 21 statements into 2 equivalence classes. [2025-03-04 02:28:53,333 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 02:28:53,333 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 02:28:53,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:28:53,334 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-04 02:28:53,334 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:28:53,425 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:28:53,425 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:28:53,598 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:28:53,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [883245713] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:28:53,598 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:28:53,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 27 [2025-03-04 02:28:53,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767759352] [2025-03-04 02:28:53,598 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:28:53,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-04 02:28:53,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:28:53,599 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-04 02:28:53,599 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=621, Unknown=0, NotChecked=0, Total=756 [2025-03-04 02:28:53,610 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 22 [2025-03-04 02:28:53,610 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 27 transitions, 172 flow. Second operand has 28 states, 28 states have (on average 4.428571428571429) internal successors, (124), 28 states have internal predecessors, (124), 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-04 02:28:53,610 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:28:53,610 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 22 [2025-03-04 02:28:53,610 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:28:53,762 INFO L124 PetriNetUnfolderBase]: 36/83 cut-off events. [2025-03-04 02:28:53,762 INFO L125 PetriNetUnfolderBase]: For 211/211 co-relation queries the response was YES. [2025-03-04 02:28:53,762 INFO L83 FinitePrefix]: Finished finitePrefix Result has 343 conditions, 83 events. 36/83 cut-off events. For 211/211 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 143 event pairs, 0 based on Foata normal form. 1/84 useless extension candidates. Maximal degree in co-relation 326. Up to 21 conditions per place. [2025-03-04 02:28:53,762 INFO L140 encePairwiseOnDemand]: 12/22 looper letters, 0 selfloop transitions, 0 changer transitions 42/42 dead transitions. [2025-03-04 02:28:53,762 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 42 transitions, 295 flow [2025-03-04 02:28:53,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 02:28:53,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-04 02:28:53,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 79 transitions. [2025-03-04 02:28:53,763 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2762237762237762 [2025-03-04 02:28:53,763 INFO L175 Difference]: Start difference. First operand has 59 places, 27 transitions, 172 flow. Second operand 13 states and 79 transitions. [2025-03-04 02:28:53,763 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 42 transitions, 295 flow [2025-03-04 02:28:53,763 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 42 transitions, 276 flow, removed 3 selfloop flow, removed 5 redundant places. [2025-03-04 02:28:53,764 INFO L231 Difference]: Finished difference. Result has 60 places, 0 transitions, 0 flow [2025-03-04 02:28:53,764 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=149, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=0, PETRI_PLACES=60, PETRI_TRANSITIONS=0} [2025-03-04 02:28:53,764 INFO L279 CegarLoopForPetriNet]: 24 programPoint places, 36 predicate places. [2025-03-04 02:28:53,764 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 0 transitions, 0 flow [2025-03-04 02:28:53,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 4.428571428571429) internal successors, (124), 28 states have internal predecessors, (124), 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-04 02:28:53,766 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2025-03-04 02:28:53,766 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2025-03-04 02:28:53,766 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2025-03-04 02:28:53,771 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Ended with exit code 0 [2025-03-04 02:28:53,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable54 [2025-03-04 02:28:53,967 INFO L422 BasicCegarLoop]: Path program histogram: [27, 16, 6, 6] [2025-03-04 02:28:53,969 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-04 02:28:53,969 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 02:28:53,972 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 02:28:53 BasicIcfg [2025-03-04 02:28:53,972 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 02:28:53,973 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 02:28:53,973 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 02:28:53,973 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 02:28:53,973 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:28:19" (3/4) ... [2025-03-04 02:28:53,975 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-04 02:28:53,976 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-03-04 02:28:53,977 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-03-04 02:28:53,979 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 35 nodes and edges [2025-03-04 02:28:53,979 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2025-03-04 02:28:53,979 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2025-03-04 02:28:53,979 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-04 02:28:54,027 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 02:28:54,028 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-04 02:28:54,028 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 02:28:54,028 INFO L158 Benchmark]: Toolchain (without parser) took 34906.52ms. Allocated memory was 142.6MB in the beginning and 520.1MB in the end (delta: 377.5MB). Free memory was 111.8MB in the beginning and 270.9MB in the end (delta: -159.1MB). Peak memory consumption was 213.6MB. Max. memory is 16.1GB. [2025-03-04 02:28:54,029 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 201.3MB. Free memory is still 124.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 02:28:54,029 INFO L158 Benchmark]: CACSL2BoogieTranslator took 143.69ms. Allocated memory is still 142.6MB. Free memory was 111.8MB in the beginning and 100.3MB in the end (delta: 11.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 02:28:54,030 INFO L158 Benchmark]: Boogie Procedure Inliner took 21.24ms. Allocated memory is still 142.6MB. Free memory was 100.3MB in the beginning and 99.4MB in the end (delta: 890.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 02:28:54,030 INFO L158 Benchmark]: Boogie Preprocessor took 23.25ms. Allocated memory is still 142.6MB. Free memory was 99.4MB in the beginning and 98.2MB in the end (delta: 1.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 02:28:54,030 INFO L158 Benchmark]: IcfgBuilder took 329.96ms. Allocated memory is still 142.6MB. Free memory was 98.2MB in the beginning and 78.4MB in the end (delta: 19.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 02:28:54,030 INFO L158 Benchmark]: TraceAbstraction took 34328.07ms. Allocated memory was 142.6MB in the beginning and 520.1MB in the end (delta: 377.5MB). Free memory was 77.9MB in the beginning and 279.2MB in the end (delta: -201.3MB). Peak memory consumption was 180.1MB. Max. memory is 16.1GB. [2025-03-04 02:28:54,030 INFO L158 Benchmark]: Witness Printer took 54.99ms. Allocated memory is still 520.1MB. Free memory was 279.2MB in the beginning and 270.9MB in the end (delta: 8.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 02:28:54,031 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24ms. Allocated memory is still 201.3MB. Free memory is still 124.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 143.69ms. Allocated memory is still 142.6MB. Free memory was 111.8MB in the beginning and 100.3MB in the end (delta: 11.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 21.24ms. Allocated memory is still 142.6MB. Free memory was 100.3MB in the beginning and 99.4MB in the end (delta: 890.6kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 23.25ms. Allocated memory is still 142.6MB. Free memory was 99.4MB in the beginning and 98.2MB in the end (delta: 1.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 329.96ms. Allocated memory is still 142.6MB. Free memory was 98.2MB in the beginning and 78.4MB in the end (delta: 19.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 34328.07ms. Allocated memory was 142.6MB in the beginning and 520.1MB in the end (delta: 377.5MB). Free memory was 77.9MB in the beginning and 279.2MB in the end (delta: -201.3MB). Peak memory consumption was 180.1MB. Max. memory is 16.1GB. * Witness Printer took 54.99ms. Allocated memory is still 520.1MB. Free memory was 279.2MB in the beginning and 270.9MB in the end (delta: 8.3MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 74]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 33 locations, 3 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 34.2s, OverallIterations: 55, TraceHistogramMax: 2, PathProgramHistogramMax: 27, EmptinessCheckTime: 0.0s, AutomataDifference: 16.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2785 SdHoareTripleChecker+Valid, 7.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2729 mSDsluCounter, 550 SdHoareTripleChecker+Invalid, 6.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 474 mSDsCounter, 607 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 18744 IncrementalHoareTripleChecker+Invalid, 19351 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 607 mSolverCounterUnsat, 76 mSDtfsCounter, 18744 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1918 GetRequests, 905 SyntacticMatches, 9 SemanticMatches, 1004 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6567 ImplicationChecksByTransitivity, 7.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4071occurred in iteration=42, InterpolantAutomatonStates: 653, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 9.5s InterpolantComputationTime, 1628 NumberOfCodeBlocks, 1628 NumberOfCodeBlocksAsserted, 150 NumberOfCheckSat, 2059 ConstructedInterpolants, 0 QuantifiedInterpolants, 11149 SizeOfPredicates, 103 NumberOfNonLiveVariables, 3192 ConjunctsInSsa, 392 ConjunctsInUnsatCore, 117 InterpolantComputations, 32 PerfectInterpolantSequences, 33/207 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-04 02:28:54,044 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE