/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis PETRI_NET -i ../../../trunk/examples/svcomp/weaver/unroll-cond-4.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 21:02:37,596 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 21:02:37,652 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2025-04-13 21:02:37,657 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 21:02:37,657 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 21:02:37,675 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 21:02:37,676 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 21:02:37,676 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 21:02:37,676 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 21:02:37,676 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 21:02:37,676 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 21:02:37,676 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 21:02:37,676 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 21:02:37,676 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 21:02:37,677 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 21:02:37,677 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 21:02:37,678 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 21:02:37,678 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 21:02:37,678 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 21:02:37,678 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 21:02:37,678 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 21:02:37,678 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 21:02:37,678 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 21:02:37,678 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 21:02:37,679 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 21:02:37,679 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 21:02:37,679 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 21:02:37,679 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 21:02:37,679 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 21:02:37,679 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 21:02:37,679 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 21:02:37,679 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 21:02:37,679 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 21:02:37,679 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 21:02:37,679 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 21:02:37,679 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 21:02:37,679 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 21:02:37,680 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 21:02:37,680 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 21:02:37,680 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 21:02:37,680 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 21:02:37,680 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 21:02:37,680 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 21:02:37,680 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 21:02:37,680 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 21:02:37,680 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 21:02:37,680 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 21:02:37,680 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Automaton type used in concurrency analysis -> PETRI_NET [2025-04-13 21:02:37,881 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 21:02:37,889 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 21:02:37,890 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 21:02:37,891 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 21:02:37,892 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 21:02:37,893 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/unroll-cond-4.wvr.c [2025-04-13 21:02:39,176 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b7c38f27b/d7861ab9da7c46cc94d61c3977842db8/FLAG5a570099c [2025-04-13 21:02:39,396 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 21:02:39,397 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-cond-4.wvr.c [2025-04-13 21:02:39,404 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b7c38f27b/d7861ab9da7c46cc94d61c3977842db8/FLAG5a570099c [2025-04-13 21:02:40,227 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b7c38f27b/d7861ab9da7c46cc94d61c3977842db8 [2025-04-13 21:02:40,229 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 21:02:40,230 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 21:02:40,231 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 21:02:40,231 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 21:02:40,234 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 21:02:40,234 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 09:02:40" (1/1) ... [2025-04-13 21:02:40,235 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c093e80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:02:40, skipping insertion in model container [2025-04-13 21:02:40,235 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 09:02:40" (1/1) ... [2025-04-13 21:02:40,245 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 21:02:40,414 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-cond-4.wvr.c[2834,2847] [2025-04-13 21:02:40,425 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 21:02:40,435 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 21:02:40,469 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-cond-4.wvr.c[2834,2847] [2025-04-13 21:02:40,474 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 21:02:40,486 INFO L204 MainTranslator]: Completed translation [2025-04-13 21:02:40,487 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:02:40 WrapperNode [2025-04-13 21:02:40,487 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 21:02:40,488 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 21:02:40,488 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 21:02:40,488 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 21:02:40,492 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:02:40" (1/1) ... [2025-04-13 21:02:40,498 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:02:40" (1/1) ... [2025-04-13 21:02:40,524 INFO L138 Inliner]: procedures = 23, calls = 31, calls flagged for inlining = 15, calls inlined = 15, statements flattened = 167 [2025-04-13 21:02:40,524 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 21:02:40,525 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 21:02:40,525 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 21:02:40,525 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 21:02:40,534 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:02:40" (1/1) ... [2025-04-13 21:02:40,535 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:02:40" (1/1) ... [2025-04-13 21:02:40,537 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:02:40" (1/1) ... [2025-04-13 21:02:40,551 INFO L175 MemorySlicer]: Split 11 memory accesses to 2 slices as follows [2, 9]. 82 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2025-04-13 21:02:40,551 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:02:40" (1/1) ... [2025-04-13 21:02:40,551 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:02:40" (1/1) ... [2025-04-13 21:02:40,559 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:02:40" (1/1) ... [2025-04-13 21:02:40,560 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:02:40" (1/1) ... [2025-04-13 21:02:40,562 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:02:40" (1/1) ... [2025-04-13 21:02:40,563 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:02:40" (1/1) ... [2025-04-13 21:02:40,564 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:02:40" (1/1) ... [2025-04-13 21:02:40,567 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 21:02:40,567 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-13 21:02:40,567 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-13 21:02:40,567 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-13 21:02:40,568 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:02:40" (1/1) ... [2025-04-13 21:02:40,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 21:02:40,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:02:40,592 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-04-13 21:02:40,593 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-04-13 21:02:40,610 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 21:02:40,610 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-13 21:02:40,610 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-13 21:02:40,610 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-13 21:02:40,610 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-13 21:02:40,610 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 21:02:40,611 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-13 21:02:40,611 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-13 21:02:40,611 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-13 21:02:40,611 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-13 21:02:40,611 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 21:02:40,611 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 21:02:40,611 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-13 21:02:40,611 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-13 21:02:40,612 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-13 21:02:40,691 INFO L234 CfgBuilder]: Building ICFG [2025-04-13 21:02:40,692 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 21:02:40,925 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 21:02:40,925 INFO L289 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 21:02:40,926 INFO L294 CfgBuilder]: Performing block encoding [2025-04-13 21:02:41,171 INFO L313 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 21:02:41,172 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 09:02:41 BoogieIcfgContainer [2025-04-13 21:02:41,172 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-13 21:02:41,173 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 21:02:41,173 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 21:02:41,176 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 21:02:41,177 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 09:02:40" (1/3) ... [2025-04-13 21:02:41,177 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@281dd6f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 09:02:41, skipping insertion in model container [2025-04-13 21:02:41,177 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:02:40" (2/3) ... [2025-04-13 21:02:41,177 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@281dd6f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 09:02:41, skipping insertion in model container [2025-04-13 21:02:41,177 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 09:02:41" (3/3) ... [2025-04-13 21:02:41,178 INFO L128 eAbstractionObserver]: Analyzing ICFG unroll-cond-4.wvr.c [2025-04-13 21:02:41,187 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 21:02:41,188 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG unroll-cond-4.wvr.c that has 3 procedures, 17 locations, 17 edges, 1 initial locations, 3 loop locations, and 1 error locations. [2025-04-13 21:02:41,188 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 21:02:41,223 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-13 21:02:41,242 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 23 places, 19 transitions, 52 flow [2025-04-13 21:02:41,258 INFO L116 PetriNetUnfolderBase]: 3/17 cut-off events. [2025-04-13 21:02:41,260 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-13 21:02:41,261 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26 conditions, 17 events. 3/17 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 10 event pairs, 0 based on Foata normal form. 0/13 useless extension candidates. Maximal degree in co-relation 11. Up to 2 conditions per place. [2025-04-13 21:02:41,262 INFO L82 GeneralOperation]: Start removeDead. Operand has 23 places, 19 transitions, 52 flow [2025-04-13 21:02:41,263 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 20 places, 16 transitions, 44 flow [2025-04-13 21:02:41,274 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 21:02:41,284 INFO L340 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;@142ea9bf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 21:02:41,284 INFO L341 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-04-13 21:02:41,292 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 21:02:41,292 INFO L116 PetriNetUnfolderBase]: 3/15 cut-off events. [2025-04-13 21:02:41,293 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-13 21:02:41,293 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:02:41,293 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:02:41,293 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:02:41,297 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:02:41,297 INFO L85 PathProgramCache]: Analyzing trace with hash -103174161, now seen corresponding path program 1 times [2025-04-13 21:02:41,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:02:41,302 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518984635] [2025-04-13 21:02:41,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:02:41,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:02:41,359 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-13 21:02:41,401 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-13 21:02:41,401 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:02:41,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:02:41,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:02:41,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:02:41,609 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518984635] [2025-04-13 21:02:41,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518984635] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:02:41,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:02:41,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 21:02:41,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599496450] [2025-04-13 21:02:41,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:02:41,617 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 21:02:41,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:02:41,657 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 21:02:41,657 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 21:02:41,658 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2025-04-13 21:02:41,660 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 20 places, 16 transitions, 44 flow. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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-04-13 21:02:41,660 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:02:41,660 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2025-04-13 21:02:41,661 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:02:41,728 INFO L116 PetriNetUnfolderBase]: 38/70 cut-off events. [2025-04-13 21:02:41,728 INFO L117 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-04-13 21:02:41,729 INFO L83 FinitePrefix]: Finished finitePrefix Result has 156 conditions, 70 events. 38/70 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 121 event pairs, 22 based on Foata normal form. 0/54 useless extension candidates. Maximal degree in co-relation 120. Up to 70 conditions per place. [2025-04-13 21:02:41,731 INFO L140 encePairwiseOnDemand]: 16/19 looper letters, 15 selfloop transitions, 2 changer transitions 0/17 dead transitions. [2025-04-13 21:02:41,731 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 22 places, 17 transitions, 80 flow [2025-04-13 21:02:41,732 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 21:02:41,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 21:02:41,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 24 transitions. [2025-04-13 21:02:41,741 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.42105263157894735 [2025-04-13 21:02:41,742 INFO L175 Difference]: Start difference. First operand has 20 places, 16 transitions, 44 flow. Second operand 3 states and 24 transitions. [2025-04-13 21:02:41,743 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 22 places, 17 transitions, 80 flow [2025-04-13 21:02:41,745 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 18 places, 17 transitions, 72 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-04-13 21:02:41,746 INFO L231 Difference]: Finished difference. Result has 19 places, 17 transitions, 48 flow [2025-04-13 21:02:41,748 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=36, PETRI_DIFFERENCE_MINUEND_PLACES=16, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=48, PETRI_PLACES=19, PETRI_TRANSITIONS=17} [2025-04-13 21:02:41,750 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, -1 predicate places. [2025-04-13 21:02:41,750 INFO L485 AbstractCegarLoop]: Abstraction has has 19 places, 17 transitions, 48 flow [2025-04-13 21:02:41,750 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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-04-13 21:02:41,750 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:02:41,750 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:02:41,750 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 21:02:41,751 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:02:41,751 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:02:41,751 INFO L85 PathProgramCache]: Analyzing trace with hash 1547688715, now seen corresponding path program 1 times [2025-04-13 21:02:41,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:02:41,751 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714149295] [2025-04-13 21:02:41,751 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:02:41,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:02:41,763 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-13 21:02:41,812 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 21:02:41,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:02:41,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:02:42,102 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 21:02:42,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:02:42,102 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714149295] [2025-04-13 21:02:42,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714149295] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:02:42,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:02:42,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 21:02:42,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775003032] [2025-04-13 21:02:42,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:02:42,103 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 21:02:42,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:02:42,104 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 21:02:42,104 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 21:02:42,104 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2025-04-13 21:02:42,104 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 19 places, 17 transitions, 48 flow. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 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-04-13 21:02:42,104 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:02:42,104 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2025-04-13 21:02:42,104 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:02:42,721 INFO L116 PetriNetUnfolderBase]: 65/121 cut-off events. [2025-04-13 21:02:42,721 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-13 21:02:42,722 INFO L83 FinitePrefix]: Finished finitePrefix Result has 257 conditions, 121 events. 65/121 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 323 event pairs, 22 based on Foata normal form. 0/92 useless extension candidates. Maximal degree in co-relation 246. Up to 71 conditions per place. [2025-04-13 21:02:42,723 INFO L140 encePairwiseOnDemand]: 13/19 looper letters, 32 selfloop transitions, 5 changer transitions 0/37 dead transitions. [2025-04-13 21:02:42,723 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 23 places, 37 transitions, 167 flow [2025-04-13 21:02:42,724 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 21:02:42,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 21:02:42,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2025-04-13 21:02:42,724 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.49473684210526314 [2025-04-13 21:02:42,725 INFO L175 Difference]: Start difference. First operand has 19 places, 17 transitions, 48 flow. Second operand 5 states and 47 transitions. [2025-04-13 21:02:42,725 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 23 places, 37 transitions, 167 flow [2025-04-13 21:02:42,725 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 22 places, 37 transitions, 163 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-04-13 21:02:42,726 INFO L231 Difference]: Finished difference. Result has 25 places, 21 transitions, 80 flow [2025-04-13 21:02:42,726 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=44, PETRI_DIFFERENCE_MINUEND_PLACES=18, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=80, PETRI_PLACES=25, PETRI_TRANSITIONS=21} [2025-04-13 21:02:42,726 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 5 predicate places. [2025-04-13 21:02:42,726 INFO L485 AbstractCegarLoop]: Abstraction has has 25 places, 21 transitions, 80 flow [2025-04-13 21:02:42,726 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 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-04-13 21:02:42,726 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:02:42,726 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:02:42,727 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 21:02:42,727 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:02:42,727 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:02:42,727 INFO L85 PathProgramCache]: Analyzing trace with hash 1122535579, now seen corresponding path program 2 times [2025-04-13 21:02:42,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:02:42,727 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325413276] [2025-04-13 21:02:42,727 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 21:02:42,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:02:42,738 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-04-13 21:02:42,770 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 13 of 14 statements. [2025-04-13 21:02:42,771 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 21:02:42,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:02:42,904 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 21:02:42,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:02:42,904 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325413276] [2025-04-13 21:02:42,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325413276] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:02:42,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:02:42,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 21:02:42,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846853339] [2025-04-13 21:02:42,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:02:42,904 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 21:02:42,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:02:42,905 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 21:02:42,905 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 21:02:42,905 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2025-04-13 21:02:42,905 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 21 transitions, 80 flow. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 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-04-13 21:02:42,905 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:02:42,905 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2025-04-13 21:02:42,905 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:02:43,078 INFO L116 PetriNetUnfolderBase]: 100/186 cut-off events. [2025-04-13 21:02:43,079 INFO L117 PetriNetUnfolderBase]: For 108/108 co-relation queries the response was YES. [2025-04-13 21:02:43,079 INFO L83 FinitePrefix]: Finished finitePrefix Result has 545 conditions, 186 events. 100/186 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 568 event pairs, 39 based on Foata normal form. 2/151 useless extension candidates. Maximal degree in co-relation 527. Up to 120 conditions per place. [2025-04-13 21:02:43,080 INFO L140 encePairwiseOnDemand]: 13/19 looper letters, 34 selfloop transitions, 7 changer transitions 0/41 dead transitions. [2025-04-13 21:02:43,080 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 41 transitions, 240 flow [2025-04-13 21:02:43,081 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 21:02:43,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 21:02:43,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2025-04-13 21:02:43,081 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.45263157894736844 [2025-04-13 21:02:43,081 INFO L175 Difference]: Start difference. First operand has 25 places, 21 transitions, 80 flow. Second operand 5 states and 43 transitions. [2025-04-13 21:02:43,081 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 41 transitions, 240 flow [2025-04-13 21:02:43,082 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 41 transitions, 223 flow, removed 5 selfloop flow, removed 1 redundant places. [2025-04-13 21:02:43,083 INFO L231 Difference]: Finished difference. Result has 31 places, 25 transitions, 122 flow [2025-04-13 21:02:43,083 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=122, PETRI_PLACES=31, PETRI_TRANSITIONS=25} [2025-04-13 21:02:43,083 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 11 predicate places. [2025-04-13 21:02:43,085 INFO L485 AbstractCegarLoop]: Abstraction has has 31 places, 25 transitions, 122 flow [2025-04-13 21:02:43,085 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 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-04-13 21:02:43,085 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:02:43,085 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:02:43,085 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 21:02:43,085 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:02:43,085 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:02:43,085 INFO L85 PathProgramCache]: Analyzing trace with hash 2020612513, now seen corresponding path program 3 times [2025-04-13 21:02:43,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:02:43,085 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705442747] [2025-04-13 21:02:43,086 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 21:02:43,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:02:43,097 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 14 statements into 2 equivalence classes. [2025-04-13 21:02:43,131 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 13 of 14 statements. [2025-04-13 21:02:43,131 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 21:02:43,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:02:43,268 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 21:02:43,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:02:43,268 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705442747] [2025-04-13 21:02:43,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705442747] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:02:43,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:02:43,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 21:02:43,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952860213] [2025-04-13 21:02:43,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:02:43,268 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 21:02:43,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:02:43,269 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 21:02:43,269 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 21:02:43,269 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2025-04-13 21:02:43,269 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 25 transitions, 122 flow. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 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-04-13 21:02:43,269 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:02:43,269 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2025-04-13 21:02:43,269 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:02:43,588 INFO L116 PetriNetUnfolderBase]: 109/200 cut-off events. [2025-04-13 21:02:43,588 INFO L117 PetriNetUnfolderBase]: For 284/284 co-relation queries the response was YES. [2025-04-13 21:02:43,589 INFO L83 FinitePrefix]: Finished finitePrefix Result has 706 conditions, 200 events. 109/200 cut-off events. For 284/284 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 644 event pairs, 39 based on Foata normal form. 3/178 useless extension candidates. Maximal degree in co-relation 685. Up to 111 conditions per place. [2025-04-13 21:02:43,590 INFO L140 encePairwiseOnDemand]: 13/19 looper letters, 33 selfloop transitions, 12 changer transitions 0/45 dead transitions. [2025-04-13 21:02:43,590 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 45 transitions, 305 flow [2025-04-13 21:02:43,590 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 21:02:43,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 21:02:43,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2025-04-13 21:02:43,591 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.49473684210526314 [2025-04-13 21:02:43,591 INFO L175 Difference]: Start difference. First operand has 31 places, 25 transitions, 122 flow. Second operand 5 states and 47 transitions. [2025-04-13 21:02:43,591 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 45 transitions, 305 flow [2025-04-13 21:02:43,592 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 45 transitions, 281 flow, removed 8 selfloop flow, removed 1 redundant places. [2025-04-13 21:02:43,593 INFO L231 Difference]: Finished difference. Result has 37 places, 31 transitions, 201 flow [2025-04-13 21:02:43,593 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=201, PETRI_PLACES=37, PETRI_TRANSITIONS=31} [2025-04-13 21:02:43,594 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 17 predicate places. [2025-04-13 21:02:43,594 INFO L485 AbstractCegarLoop]: Abstraction has has 37 places, 31 transitions, 201 flow [2025-04-13 21:02:43,594 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 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-04-13 21:02:43,594 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:02:43,594 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:02:43,594 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 21:02:43,594 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:02:43,595 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:02:43,595 INFO L85 PathProgramCache]: Analyzing trace with hash 980432509, now seen corresponding path program 4 times [2025-04-13 21:02:43,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:02:43,595 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443151890] [2025-04-13 21:02:43,595 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 21:02:43,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:02:43,604 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 14 statements into 2 equivalence classes. [2025-04-13 21:02:43,618 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 21:02:43,618 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 21:02:43,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:02:43,766 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 21:02:43,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:02:43,766 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443151890] [2025-04-13 21:02:43,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443151890] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:02:43,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:02:43,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 21:02:43,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437356883] [2025-04-13 21:02:43,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:02:43,767 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 21:02:43,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:02:43,767 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 21:02:43,767 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 21:02:43,767 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2025-04-13 21:02:43,768 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 31 transitions, 201 flow. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 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-04-13 21:02:43,768 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:02:43,768 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2025-04-13 21:02:43,768 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:02:43,919 INFO L116 PetriNetUnfolderBase]: 106/197 cut-off events. [2025-04-13 21:02:43,919 INFO L117 PetriNetUnfolderBase]: For 502/502 co-relation queries the response was YES. [2025-04-13 21:02:43,920 INFO L83 FinitePrefix]: Finished finitePrefix Result has 772 conditions, 197 events. 106/197 cut-off events. For 502/502 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 622 event pairs, 46 based on Foata normal form. 3/175 useless extension candidates. Maximal degree in co-relation 748. Up to 160 conditions per place. [2025-04-13 21:02:43,921 INFO L140 encePairwiseOnDemand]: 13/19 looper letters, 29 selfloop transitions, 15 changer transitions 0/44 dead transitions. [2025-04-13 21:02:43,921 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 44 transitions, 363 flow [2025-04-13 21:02:43,922 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 21:02:43,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 21:02:43,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 42 transitions. [2025-04-13 21:02:43,922 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4421052631578947 [2025-04-13 21:02:43,922 INFO L175 Difference]: Start difference. First operand has 37 places, 31 transitions, 201 flow. Second operand 5 states and 42 transitions. [2025-04-13 21:02:43,922 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 44 transitions, 363 flow [2025-04-13 21:02:43,928 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 44 transitions, 350 flow, removed 3 selfloop flow, removed 1 redundant places. [2025-04-13 21:02:43,929 INFO L231 Difference]: Finished difference. Result has 42 places, 37 transitions, 294 flow [2025-04-13 21:02:43,929 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=294, PETRI_PLACES=42, PETRI_TRANSITIONS=37} [2025-04-13 21:02:43,930 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 22 predicate places. [2025-04-13 21:02:43,930 INFO L485 AbstractCegarLoop]: Abstraction has has 42 places, 37 transitions, 294 flow [2025-04-13 21:02:43,930 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 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-04-13 21:02:43,930 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:02:43,930 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:02:43,930 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 21:02:43,930 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:02:43,930 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:02:43,930 INFO L85 PathProgramCache]: Analyzing trace with hash -1192587081, now seen corresponding path program 5 times [2025-04-13 21:02:43,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:02:43,931 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371708416] [2025-04-13 21:02:43,931 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 21:02:43,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:02:43,939 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-04-13 21:02:43,950 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 21:02:43,950 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 21:02:43,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:02:44,042 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 21:02:44,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:02:44,042 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371708416] [2025-04-13 21:02:44,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371708416] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:02:44,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:02:44,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 21:02:44,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029957744] [2025-04-13 21:02:44,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:02:44,043 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 21:02:44,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:02:44,043 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 21:02:44,043 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-13 21:02:44,043 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2025-04-13 21:02:44,043 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 37 transitions, 294 flow. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 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-04-13 21:02:44,044 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:02:44,044 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2025-04-13 21:02:44,044 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:02:44,158 INFO L116 PetriNetUnfolderBase]: 107/200 cut-off events. [2025-04-13 21:02:44,158 INFO L117 PetriNetUnfolderBase]: For 641/641 co-relation queries the response was YES. [2025-04-13 21:02:44,159 INFO L83 FinitePrefix]: Finished finitePrefix Result has 874 conditions, 200 events. 107/200 cut-off events. For 641/641 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 649 event pairs, 34 based on Foata normal form. 2/177 useless extension candidates. Maximal degree in co-relation 848. Up to 113 conditions per place. [2025-04-13 21:02:44,161 INFO L140 encePairwiseOnDemand]: 13/19 looper letters, 35 selfloop transitions, 14 changer transitions 0/49 dead transitions. [2025-04-13 21:02:44,161 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 49 transitions, 430 flow [2025-04-13 21:02:44,161 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 21:02:44,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 21:02:44,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 46 transitions. [2025-04-13 21:02:44,162 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4842105263157895 [2025-04-13 21:02:44,162 INFO L175 Difference]: Start difference. First operand has 42 places, 37 transitions, 294 flow. Second operand 5 states and 46 transitions. [2025-04-13 21:02:44,162 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 49 transitions, 430 flow [2025-04-13 21:02:44,164 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 49 transitions, 376 flow, removed 15 selfloop flow, removed 2 redundant places. [2025-04-13 21:02:44,167 INFO L231 Difference]: Finished difference. Result has 45 places, 38 transitions, 280 flow [2025-04-13 21:02:44,167 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=240, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=280, PETRI_PLACES=45, PETRI_TRANSITIONS=38} [2025-04-13 21:02:44,168 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 25 predicate places. [2025-04-13 21:02:44,169 INFO L485 AbstractCegarLoop]: Abstraction has has 45 places, 38 transitions, 280 flow [2025-04-13 21:02:44,169 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 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-04-13 21:02:44,169 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:02:44,169 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:02:44,169 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-13 21:02:44,169 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:02:44,169 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:02:44,169 INFO L85 PathProgramCache]: Analyzing trace with hash 984007429, now seen corresponding path program 6 times [2025-04-13 21:02:44,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:02:44,169 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944472574] [2025-04-13 21:02:44,169 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 21:02:44,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:02:44,179 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 14 statements into 2 equivalence classes. [2025-04-13 21:02:44,190 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 13 of 14 statements. [2025-04-13 21:02:44,191 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 21:02:44,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:02:44,283 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 21:02:44,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:02:44,283 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944472574] [2025-04-13 21:02:44,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944472574] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:02:44,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:02:44,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 21:02:44,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996296668] [2025-04-13 21:02:44,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:02:44,284 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 21:02:44,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:02:44,284 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 21:02:44,284 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 21:02:44,284 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2025-04-13 21:02:44,284 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 38 transitions, 280 flow. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 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-04-13 21:02:44,285 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:02:44,285 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2025-04-13 21:02:44,285 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:02:44,372 INFO L116 PetriNetUnfolderBase]: 106/194 cut-off events. [2025-04-13 21:02:44,373 INFO L117 PetriNetUnfolderBase]: For 597/597 co-relation queries the response was YES. [2025-04-13 21:02:44,373 INFO L83 FinitePrefix]: Finished finitePrefix Result has 822 conditions, 194 events. 106/194 cut-off events. For 597/597 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 605 event pairs, 45 based on Foata normal form. 2/171 useless extension candidates. Maximal degree in co-relation 795. Up to 154 conditions per place. [2025-04-13 21:02:44,374 INFO L140 encePairwiseOnDemand]: 13/19 looper letters, 31 selfloop transitions, 15 changer transitions 0/46 dead transitions. [2025-04-13 21:02:44,374 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 46 transitions, 402 flow [2025-04-13 21:02:44,375 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 21:02:44,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 21:02:44,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 42 transitions. [2025-04-13 21:02:44,377 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4421052631578947 [2025-04-13 21:02:44,377 INFO L175 Difference]: Start difference. First operand has 45 places, 38 transitions, 280 flow. Second operand 5 states and 42 transitions. [2025-04-13 21:02:44,377 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 46 transitions, 402 flow [2025-04-13 21:02:44,380 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 46 transitions, 368 flow, removed 2 selfloop flow, removed 3 redundant places. [2025-04-13 21:02:44,381 INFO L231 Difference]: Finished difference. Result has 47 places, 39 transitions, 292 flow [2025-04-13 21:02:44,381 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=248, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=292, PETRI_PLACES=47, PETRI_TRANSITIONS=39} [2025-04-13 21:02:44,383 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 27 predicate places. [2025-04-13 21:02:44,383 INFO L485 AbstractCegarLoop]: Abstraction has has 47 places, 39 transitions, 292 flow [2025-04-13 21:02:44,383 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 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-04-13 21:02:44,383 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:02:44,383 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:02:44,383 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-13 21:02:44,383 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:02:44,384 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:02:44,384 INFO L85 PathProgramCache]: Analyzing trace with hash 1619161925, now seen corresponding path program 1 times [2025-04-13 21:02:44,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:02:44,384 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703391844] [2025-04-13 21:02:44,384 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:02:44,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:02:44,392 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-13 21:02:44,407 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 21:02:44,407 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:02:44,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:02:44,603 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 21:02:44,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:02:44,603 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703391844] [2025-04-13 21:02:44,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703391844] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:02:44,603 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [118035743] [2025-04-13 21:02:44,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:02:44,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:02:44,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:02:44,606 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 21:02:44,607 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-04-13 21:02:44,660 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-13 21:02:44,677 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 21:02:44,677 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:02:44,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:02:44,679 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-04-13 21:02:44,683 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:02:44,755 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-13 21:02:45,708 INFO L325 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2025-04-13 21:02:45,708 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 178 treesize of output 169 [2025-04-13 21:02:59,338 WARN L286 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-04-13 21:03:07,351 WARN L286 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-04-13 21:03:27,524 WARN L286 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-04-13 21:03:35,628 WARN L286 SmtUtils]: Spent 8.10s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-04-13 21:03:51,762 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:03:51,762 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:04:05,990 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 77 [2025-04-13 21:04:06,038 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 21:04:06,038 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 204 treesize of output 188 [2025-04-13 21:04:07,016 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 29 [2025-04-13 21:04:07,032 INFO L325 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-04-13 21:04:07,033 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 1 [2025-04-13 21:04:07,101 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:04:07,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [118035743] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 21:04:07,101 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 21:04:07,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 19 [2025-04-13 21:04:07,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453545796] [2025-04-13 21:04:07,102 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 21:04:07,102 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-04-13 21:04:07,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:04:07,102 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-04-13 21:04:07,103 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=283, Unknown=1, NotChecked=0, Total=342 [2025-04-13 21:04:07,103 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2025-04-13 21:04:07,103 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 39 transitions, 292 flow. Second operand has 19 states, 19 states have (on average 4.157894736842105) internal successors, (79), 19 states have internal predecessors, (79), 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-04-13 21:04:07,103 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:04:07,103 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2025-04-13 21:04:07,103 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:04:14,634 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-13 21:04:14,862 INFO L116 PetriNetUnfolderBase]: 345/643 cut-off events. [2025-04-13 21:04:14,862 INFO L117 PetriNetUnfolderBase]: For 1619/1619 co-relation queries the response was YES. [2025-04-13 21:04:14,863 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2582 conditions, 643 events. 345/643 cut-off events. For 1619/1619 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 2960 event pairs, 30 based on Foata normal form. 5/543 useless extension candidates. Maximal degree in co-relation 2185. Up to 193 conditions per place. [2025-04-13 21:04:14,865 INFO L140 encePairwiseOnDemand]: 9/19 looper letters, 86 selfloop transitions, 50 changer transitions 56/192 dead transitions. [2025-04-13 21:04:14,865 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 192 transitions, 1506 flow [2025-04-13 21:04:14,866 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-04-13 21:04:14,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2025-04-13 21:04:14,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 214 transitions. [2025-04-13 21:04:14,867 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.45052631578947366 [2025-04-13 21:04:14,867 INFO L175 Difference]: Start difference. First operand has 47 places, 39 transitions, 292 flow. Second operand 25 states and 214 transitions. [2025-04-13 21:04:14,867 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 192 transitions, 1506 flow [2025-04-13 21:04:14,871 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 192 transitions, 1406 flow, removed 4 selfloop flow, removed 3 redundant places. [2025-04-13 21:04:14,873 INFO L231 Difference]: Finished difference. Result has 78 places, 73 transitions, 696 flow [2025-04-13 21:04:14,873 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=260, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=696, PETRI_PLACES=78, PETRI_TRANSITIONS=73} [2025-04-13 21:04:14,874 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 58 predicate places. [2025-04-13 21:04:14,874 INFO L485 AbstractCegarLoop]: Abstraction has has 78 places, 73 transitions, 696 flow [2025-04-13 21:04:14,874 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 4.157894736842105) internal successors, (79), 19 states have internal predecessors, (79), 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-04-13 21:04:14,874 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:04:14,874 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:04:14,881 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-04-13 21:04:15,074 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:04:15,075 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:04:15,075 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:04:15,075 INFO L85 PathProgramCache]: Analyzing trace with hash -1242690681, now seen corresponding path program 2 times [2025-04-13 21:04:15,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:04:15,075 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266087558] [2025-04-13 21:04:15,075 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 21:04:15,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:04:15,081 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-04-13 21:04:15,100 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 21:04:15,100 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 21:04:15,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:04:15,216 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 21:04:15,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:04:15,217 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266087558] [2025-04-13 21:04:15,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266087558] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:04:15,217 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1393318436] [2025-04-13 21:04:15,217 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 21:04:15,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:04:15,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:04:15,219 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-04-13 21:04:15,220 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-04-13 21:04:15,264 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-04-13 21:04:15,280 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 21:04:15,280 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 21:04:15,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:04:15,284 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-04-13 21:04:15,287 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:04:15,315 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-13 21:04:15,556 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-04-13 21:04:15,572 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:04:15,572 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:04:29,695 WARN L286 SmtUtils]: Spent 6.12s on a formula simplification. DAG size of input: 97 DAG size of output: 91 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 21:04:30,024 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 29 [2025-04-13 21:04:30,032 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-13 21:04:30,032 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 41 [2025-04-13 21:04:30,066 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:04:30,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1393318436] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 21:04:30,067 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 21:04:30,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8] total 21 [2025-04-13 21:04:30,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076940709] [2025-04-13 21:04:30,067 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 21:04:30,067 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-04-13 21:04:30,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:04:30,067 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-04-13 21:04:30,068 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=333, Unknown=0, NotChecked=0, Total=420 [2025-04-13 21:04:30,068 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2025-04-13 21:04:30,068 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 73 transitions, 696 flow. Second operand has 21 states, 21 states have (on average 4.0476190476190474) internal successors, (85), 21 states have internal predecessors, (85), 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-04-13 21:04:30,068 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:04:30,068 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2025-04-13 21:04:30,068 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:04:50,635 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-13 21:05:01,983 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-13 21:05:06,367 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.66s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-13 21:05:08,634 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-13 21:05:24,166 WARN L286 SmtUtils]: Spent 15.18s on a formula simplification. DAG size of input: 133 DAG size of output: 130 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 21:05:30,837 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-13 21:05:31,808 INFO L116 PetriNetUnfolderBase]: 287/603 cut-off events. [2025-04-13 21:05:31,808 INFO L117 PetriNetUnfolderBase]: For 2413/2413 co-relation queries the response was YES. [2025-04-13 21:05:31,810 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2828 conditions, 603 events. 287/603 cut-off events. For 2413/2413 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 3129 event pairs, 16 based on Foata normal form. 9/581 useless extension candidates. Maximal degree in co-relation 2709. Up to 237 conditions per place. [2025-04-13 21:05:31,813 INFO L140 encePairwiseOnDemand]: 9/19 looper letters, 89 selfloop transitions, 79 changer transitions 18/186 dead transitions. [2025-04-13 21:05:31,813 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 186 transitions, 1692 flow [2025-04-13 21:05:31,814 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-04-13 21:05:31,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2025-04-13 21:05:31,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 231 transitions. [2025-04-13 21:05:31,816 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.37993421052631576 [2025-04-13 21:05:31,816 INFO L175 Difference]: Start difference. First operand has 78 places, 73 transitions, 696 flow. Second operand 32 states and 231 transitions. [2025-04-13 21:05:31,816 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 186 transitions, 1692 flow [2025-04-13 21:05:31,825 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 186 transitions, 1510 flow, removed 89 selfloop flow, removed 6 redundant places. [2025-04-13 21:05:31,829 INFO L231 Difference]: Finished difference. Result has 105 places, 103 transitions, 1030 flow [2025-04-13 21:05:31,829 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=610, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=32, PETRI_FLOW=1030, PETRI_PLACES=105, PETRI_TRANSITIONS=103} [2025-04-13 21:05:31,830 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 85 predicate places. [2025-04-13 21:05:31,830 INFO L485 AbstractCegarLoop]: Abstraction has has 105 places, 103 transitions, 1030 flow [2025-04-13 21:05:31,830 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 4.0476190476190474) internal successors, (85), 21 states have internal predecessors, (85), 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-04-13 21:05:31,830 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:05:31,830 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:05:31,841 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-04-13 21:05:32,030 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2025-04-13 21:05:32,031 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:05:32,031 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:05:32,031 INFO L85 PathProgramCache]: Analyzing trace with hash -1156143021, now seen corresponding path program 3 times [2025-04-13 21:05:32,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:05:32,031 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288440004] [2025-04-13 21:05:32,031 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 21:05:32,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:05:32,036 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 15 statements into 2 equivalence classes. [2025-04-13 21:05:32,053 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 21:05:32,054 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 21:05:32,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:05:32,153 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 21:05:32,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:05:32,153 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288440004] [2025-04-13 21:05:32,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288440004] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:05:32,153 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1407807904] [2025-04-13 21:05:32,153 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 21:05:32,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:05:32,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:05:32,158 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-04-13 21:05:32,158 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-04-13 21:05:32,201 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 15 statements into 2 equivalence classes. [2025-04-13 21:05:32,229 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 21:05:32,229 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 21:05:32,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:05:32,230 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-04-13 21:05:32,232 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:05:32,259 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-13 21:05:32,406 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:05:32,406 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:05:41,130 WARN L286 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-04-13 21:05:51,305 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 170 treesize of output 150 [2025-04-13 21:05:51,412 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 21:05:51,413 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 9 new quantified variables, introduced 15 case distinctions, treesize of input 606 treesize of output 486 [2025-04-13 21:05:58,968 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-13 21:06:03,729 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-13 21:06:25,369 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-13 21:06:36,494 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:06:36,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1407807904] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 21:06:36,494 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 21:06:36,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2025-04-13 21:06:36,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052583418] [2025-04-13 21:06:36,494 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 21:06:36,495 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-13 21:06:36,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:06:36,495 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-13 21:06:36,495 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2025-04-13 21:06:36,496 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2025-04-13 21:06:36,496 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 103 transitions, 1030 flow. Second operand has 18 states, 18 states have (on average 4.5) internal successors, (81), 18 states have internal predecessors, (81), 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-04-13 21:06:36,496 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:06:36,496 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2025-04-13 21:06:36,496 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:06:39,226 INFO L116 PetriNetUnfolderBase]: 351/714 cut-off events. [2025-04-13 21:06:39,226 INFO L117 PetriNetUnfolderBase]: For 2474/2474 co-relation queries the response was YES. [2025-04-13 21:06:39,229 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3541 conditions, 714 events. 351/714 cut-off events. For 2474/2474 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 3745 event pairs, 19 based on Foata normal form. 20/732 useless extension candidates. Maximal degree in co-relation 3465. Up to 280 conditions per place. [2025-04-13 21:06:39,231 INFO L140 encePairwiseOnDemand]: 9/19 looper letters, 105 selfloop transitions, 70 changer transitions 44/219 dead transitions. [2025-04-13 21:06:39,231 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 219 transitions, 2214 flow [2025-04-13 21:06:39,231 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-04-13 21:06:39,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2025-04-13 21:06:39,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 222 transitions. [2025-04-13 21:06:39,232 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3651315789473684 [2025-04-13 21:06:39,232 INFO L175 Difference]: Start difference. First operand has 105 places, 103 transitions, 1030 flow. Second operand 32 states and 222 transitions. [2025-04-13 21:06:39,232 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 219 transitions, 2214 flow [2025-04-13 21:06:39,241 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 219 transitions, 1946 flow, removed 60 selfloop flow, removed 14 redundant places. [2025-04-13 21:06:39,243 INFO L231 Difference]: Finished difference. Result has 129 places, 115 transitions, 1144 flow [2025-04-13 21:06:39,243 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=842, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=32, PETRI_FLOW=1144, PETRI_PLACES=129, PETRI_TRANSITIONS=115} [2025-04-13 21:06:39,244 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 109 predicate places. [2025-04-13 21:06:39,244 INFO L485 AbstractCegarLoop]: Abstraction has has 129 places, 115 transitions, 1144 flow [2025-04-13 21:06:39,244 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.5) internal successors, (81), 18 states have internal predecessors, (81), 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-04-13 21:06:39,244 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:06:39,244 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:06:39,250 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-04-13 21:06:39,444 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:06:39,444 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:06:39,445 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:06:39,445 INFO L85 PathProgramCache]: Analyzing trace with hash 1323229281, now seen corresponding path program 4 times [2025-04-13 21:06:39,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:06:39,446 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567510042] [2025-04-13 21:06:39,446 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 21:06:39,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:06:39,451 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 15 statements into 2 equivalence classes. [2025-04-13 21:06:39,463 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 21:06:39,464 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 21:06:39,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:06:39,593 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 21:06:39,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:06:39,593 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567510042] [2025-04-13 21:06:39,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567510042] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:06:39,593 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2097042942] [2025-04-13 21:06:39,593 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 21:06:39,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:06:39,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:06:39,595 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-04-13 21:06:39,597 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-04-13 21:06:39,644 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 15 statements into 2 equivalence classes. [2025-04-13 21:06:39,658 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 21:06:39,658 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 21:06:39,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:06:39,659 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-13 21:06:39,661 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:06:39,689 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-13 21:06:41,333 INFO L325 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2025-04-13 21:06:41,333 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 182 treesize of output 169 [2025-04-13 21:06:57,557 WARN L286 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-04-13 21:07:13,620 WARN L286 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-04-13 21:07:21,666 WARN L286 SmtUtils]: Spent 8.05s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-04-13 21:07:37,887 WARN L286 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-04-13 21:07:45,899 WARN L286 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-04-13 21:07:53,914 WARN L286 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-04-13 21:08:18,013 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:08:18,013 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:08:36,077 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 77 [2025-04-13 21:08:36,110 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 21:08:36,110 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 216 treesize of output 188 [2025-04-13 21:08:36,747 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 29 [2025-04-13 21:08:36,751 INFO L325 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-04-13 21:08:36,751 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 1 [2025-04-13 21:08:36,781 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:08:36,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2097042942] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 21:08:36,781 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 21:08:36,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 19 [2025-04-13 21:08:36,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768300715] [2025-04-13 21:08:36,782 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 21:08:36,782 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-04-13 21:08:36,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:08:36,782 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-04-13 21:08:36,782 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2025-04-13 21:08:36,783 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2025-04-13 21:08:36,783 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 115 transitions, 1144 flow. Second operand has 19 states, 19 states have (on average 4.2631578947368425) internal successors, (81), 19 states have internal predecessors, (81), 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-04-13 21:08:36,783 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:08:36,783 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2025-04-13 21:08:36,783 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:09:01,421 WARN L286 SmtUtils]: Spent 15.52s on a formula simplification. DAG size of input: 112 DAG size of output: 41 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 21:09:01,733 INFO L116 PetriNetUnfolderBase]: 273/536 cut-off events. [2025-04-13 21:09:01,733 INFO L117 PetriNetUnfolderBase]: For 2413/2413 co-relation queries the response was YES. [2025-04-13 21:09:01,735 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2801 conditions, 536 events. 273/536 cut-off events. For 2413/2413 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 2424 event pairs, 24 based on Foata normal form. 7/540 useless extension candidates. Maximal degree in co-relation 2717. Up to 320 conditions per place. [2025-04-13 21:09:01,737 INFO L140 encePairwiseOnDemand]: 9/19 looper letters, 85 selfloop transitions, 70 changer transitions 10/165 dead transitions. [2025-04-13 21:09:01,737 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 165 transitions, 1702 flow [2025-04-13 21:09:01,737 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-13 21:09:01,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-04-13 21:09:01,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 139 transitions. [2025-04-13 21:09:01,738 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.33253588516746413 [2025-04-13 21:09:01,738 INFO L175 Difference]: Start difference. First operand has 129 places, 115 transitions, 1144 flow. Second operand 22 states and 139 transitions. [2025-04-13 21:09:01,738 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 165 transitions, 1702 flow [2025-04-13 21:09:01,746 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 165 transitions, 1545 flow, removed 41 selfloop flow, removed 15 redundant places. [2025-04-13 21:09:01,747 INFO L231 Difference]: Finished difference. Result has 128 places, 121 transitions, 1222 flow [2025-04-13 21:09:01,748 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=995, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=1222, PETRI_PLACES=128, PETRI_TRANSITIONS=121} [2025-04-13 21:09:01,748 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 108 predicate places. [2025-04-13 21:09:01,748 INFO L485 AbstractCegarLoop]: Abstraction has has 128 places, 121 transitions, 1222 flow [2025-04-13 21:09:01,748 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 4.2631578947368425) internal successors, (81), 19 states have internal predecessors, (81), 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-04-13 21:09:01,748 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:09:01,748 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:09:01,754 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-04-13 21:09:01,952 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:09:01,953 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:09:01,953 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:09:01,953 INFO L85 PathProgramCache]: Analyzing trace with hash 1485112271, now seen corresponding path program 5 times [2025-04-13 21:09:01,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:09:01,953 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076685285] [2025-04-13 21:09:01,953 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 21:09:01,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:09:01,958 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-04-13 21:09:01,966 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 21:09:01,966 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 21:09:01,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:09:02,076 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 21:09:02,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:09:02,077 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076685285] [2025-04-13 21:09:02,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076685285] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:09:02,077 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [494526783] [2025-04-13 21:09:02,077 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 21:09:02,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:09:02,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:09:02,079 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-04-13 21:09:02,080 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-04-13 21:09:02,125 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-04-13 21:09:02,155 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 21:09:02,155 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 21:09:02,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:09:02,156 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-04-13 21:09:02,158 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:09:02,185 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-13 21:09:02,205 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-04-13 21:09:02,429 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-04-13 21:09:02,443 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:09:02,444 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:09:07,391 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 43 [2025-04-13 21:09:07,402 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-13 21:09:07,402 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 444 treesize of output 351 [2025-04-13 21:09:07,483 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:09:07,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [494526783] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 21:09:07,483 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 21:09:07,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 9] total 23 [2025-04-13 21:09:07,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073596314] [2025-04-13 21:09:07,484 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 21:09:07,484 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-13 21:09:07,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:09:07,484 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-13 21:09:07,484 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=416, Unknown=0, NotChecked=0, Total=506 [2025-04-13 21:09:07,484 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2025-04-13 21:09:07,485 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 121 transitions, 1222 flow. Second operand has 23 states, 23 states have (on average 3.9130434782608696) internal successors, (90), 23 states have internal predecessors, (90), 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-04-13 21:09:07,485 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:09:07,485 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2025-04-13 21:09:07,485 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:09:20,272 WARN L286 SmtUtils]: Spent 9.21s on a formula simplification. DAG size of input: 96 DAG size of output: 79 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 21:09:21,975 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-13 21:09:23,652 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.68s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-13 21:09:24,997 INFO L116 PetriNetUnfolderBase]: 337/639 cut-off events. [2025-04-13 21:09:24,997 INFO L117 PetriNetUnfolderBase]: For 3261/3261 co-relation queries the response was YES. [2025-04-13 21:09:24,999 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3472 conditions, 639 events. 337/639 cut-off events. For 3261/3261 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 3011 event pairs, 5 based on Foata normal form. 4/623 useless extension candidates. Maximal degree in co-relation 3396. Up to 191 conditions per place. [2025-04-13 21:09:25,001 INFO L140 encePairwiseOnDemand]: 9/19 looper letters, 89 selfloop transitions, 112 changer transitions 5/206 dead transitions. [2025-04-13 21:09:25,001 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 206 transitions, 2193 flow [2025-04-13 21:09:25,002 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-13 21:09:25,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-04-13 21:09:25,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 151 transitions. [2025-04-13 21:09:25,003 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4182825484764543 [2025-04-13 21:09:25,003 INFO L175 Difference]: Start difference. First operand has 128 places, 121 transitions, 1222 flow. Second operand 19 states and 151 transitions. [2025-04-13 21:09:25,003 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 206 transitions, 2193 flow [2025-04-13 21:09:25,013 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 206 transitions, 2033 flow, removed 27 selfloop flow, removed 14 redundant places. [2025-04-13 21:09:25,019 INFO L231 Difference]: Finished difference. Result has 134 places, 149 transitions, 1649 flow [2025-04-13 21:09:25,019 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=1104, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=90, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=1649, PETRI_PLACES=134, PETRI_TRANSITIONS=149} [2025-04-13 21:09:25,019 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 114 predicate places. [2025-04-13 21:09:25,019 INFO L485 AbstractCegarLoop]: Abstraction has has 134 places, 149 transitions, 1649 flow [2025-04-13 21:09:25,020 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 3.9130434782608696) internal successors, (90), 23 states have internal predecessors, (90), 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-04-13 21:09:25,020 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:09:25,020 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:09:25,027 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-04-13 21:09:25,223 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-04-13 21:09:25,223 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:09:25,223 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:09:25,223 INFO L85 PathProgramCache]: Analyzing trace with hash 1183665795, now seen corresponding path program 1 times [2025-04-13 21:09:25,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:09:25,223 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606754852] [2025-04-13 21:09:25,224 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:09:25,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:09:25,229 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-13 21:09:25,246 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 21:09:25,246 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:09:25,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:09:25,350 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 21:09:25,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:09:25,350 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606754852] [2025-04-13 21:09:25,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606754852] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:09:25,350 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1833920008] [2025-04-13 21:09:25,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:09:25,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:09:25,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:09:25,352 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-04-13 21:09:25,353 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-04-13 21:09:25,405 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-13 21:09:25,458 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 21:09:25,458 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:09:25,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:09:25,459 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-13 21:09:25,460 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:09:25,499 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 21:09:25,499 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:09:25,573 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 21:09:25,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1833920008] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 21:09:25,574 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 21:09:25,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2025-04-13 21:09:25,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367848317] [2025-04-13 21:09:25,574 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 21:09:25,574 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 21:09:25,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:09:25,574 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 21:09:25,575 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2025-04-13 21:09:25,575 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2025-04-13 21:09:25,575 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 149 transitions, 1649 flow. Second operand has 13 states, 13 states have (on average 4.0) internal successors, (52), 13 states have internal predecessors, (52), 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-04-13 21:09:25,575 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:09:25,575 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2025-04-13 21:09:25,575 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:09:27,719 INFO L116 PetriNetUnfolderBase]: 342/655 cut-off events. [2025-04-13 21:09:27,719 INFO L117 PetriNetUnfolderBase]: For 3557/3557 co-relation queries the response was YES. [2025-04-13 21:09:27,721 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3748 conditions, 655 events. 342/655 cut-off events. For 3557/3557 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 3150 event pairs, 50 based on Foata normal form. 3/641 useless extension candidates. Maximal degree in co-relation 3669. Up to 206 conditions per place. [2025-04-13 21:09:27,724 INFO L140 encePairwiseOnDemand]: 13/19 looper letters, 116 selfloop transitions, 91 changer transitions 0/207 dead transitions. [2025-04-13 21:09:27,724 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 207 transitions, 2376 flow [2025-04-13 21:09:27,724 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 21:09:27,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-04-13 21:09:27,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 117 transitions. [2025-04-13 21:09:27,725 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3848684210526316 [2025-04-13 21:09:27,725 INFO L175 Difference]: Start difference. First operand has 134 places, 149 transitions, 1649 flow. Second operand 16 states and 117 transitions. [2025-04-13 21:09:27,725 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 207 transitions, 2376 flow [2025-04-13 21:09:27,738 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 207 transitions, 2162 flow, removed 78 selfloop flow, removed 4 redundant places. [2025-04-13 21:09:27,742 INFO L231 Difference]: Finished difference. Result has 148 places, 164 transitions, 1806 flow [2025-04-13 21:09:27,742 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=1457, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=76, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=1806, PETRI_PLACES=148, PETRI_TRANSITIONS=164} [2025-04-13 21:09:27,743 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 128 predicate places. [2025-04-13 21:09:27,743 INFO L485 AbstractCegarLoop]: Abstraction has has 148 places, 164 transitions, 1806 flow [2025-04-13 21:09:27,743 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.0) internal successors, (52), 13 states have internal predecessors, (52), 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-04-13 21:09:27,743 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:09:27,743 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:09:27,750 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-04-13 21:09:27,944 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:09:27,944 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:09:27,944 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:09:27,944 INFO L85 PathProgramCache]: Analyzing trace with hash 2063036533, now seen corresponding path program 6 times [2025-04-13 21:09:27,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:09:27,945 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144695257] [2025-04-13 21:09:27,945 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 21:09:27,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:09:27,949 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 16 statements into 2 equivalence classes. [2025-04-13 21:09:27,961 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 21:09:27,961 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 21:09:27,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:09:28,055 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 21:09:28,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:09:28,055 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144695257] [2025-04-13 21:09:28,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144695257] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:09:28,055 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1846164223] [2025-04-13 21:09:28,055 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 21:09:28,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:09:28,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:09:28,057 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-04-13 21:09:28,058 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-04-13 21:09:28,102 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 16 statements into 2 equivalence classes. [2025-04-13 21:09:28,130 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 21:09:28,130 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 21:09:28,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:09:28,132 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-13 21:09:28,133 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:09:28,186 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 21:09:28,186 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:09:28,283 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 21:09:28,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1846164223] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 21:09:28,283 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 21:09:28,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2025-04-13 21:09:28,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422261344] [2025-04-13 21:09:28,283 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 21:09:28,283 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 21:09:28,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:09:28,284 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 21:09:28,284 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2025-04-13 21:09:28,284 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2025-04-13 21:09:28,284 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 164 transitions, 1806 flow. Second operand has 13 states, 13 states have (on average 4.0) internal successors, (52), 13 states have internal predecessors, (52), 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-04-13 21:09:28,284 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:09:28,284 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2025-04-13 21:09:28,284 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:09:28,780 INFO L116 PetriNetUnfolderBase]: 400/775 cut-off events. [2025-04-13 21:09:28,780 INFO L117 PetriNetUnfolderBase]: For 4210/4210 co-relation queries the response was YES. [2025-04-13 21:09:28,782 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4340 conditions, 775 events. 400/775 cut-off events. For 4210/4210 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 3914 event pairs, 43 based on Foata normal form. 15/790 useless extension candidates. Maximal degree in co-relation 4222. Up to 208 conditions per place. [2025-04-13 21:09:28,785 INFO L140 encePairwiseOnDemand]: 13/19 looper letters, 122 selfloop transitions, 119 changer transitions 0/241 dead transitions. [2025-04-13 21:09:28,785 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 241 transitions, 2813 flow [2025-04-13 21:09:28,785 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 21:09:28,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-04-13 21:09:28,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 135 transitions. [2025-04-13 21:09:28,786 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.47368421052631576 [2025-04-13 21:09:28,786 INFO L175 Difference]: Start difference. First operand has 148 places, 164 transitions, 1806 flow. Second operand 15 states and 135 transitions. [2025-04-13 21:09:28,786 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 241 transitions, 2813 flow [2025-04-13 21:09:28,797 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 241 transitions, 2645 flow, removed 55 selfloop flow, removed 4 redundant places. [2025-04-13 21:09:28,799 INFO L231 Difference]: Finished difference. Result has 165 places, 191 transitions, 2370 flow [2025-04-13 21:09:28,799 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=1663, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=96, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=2370, PETRI_PLACES=165, PETRI_TRANSITIONS=191} [2025-04-13 21:09:28,800 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 145 predicate places. [2025-04-13 21:09:28,800 INFO L485 AbstractCegarLoop]: Abstraction has has 165 places, 191 transitions, 2370 flow [2025-04-13 21:09:28,800 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.0) internal successors, (52), 13 states have internal predecessors, (52), 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-04-13 21:09:28,800 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:09:28,800 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:09:28,808 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-04-13 21:09:29,004 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:09:29,004 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:09:29,004 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:09:29,004 INFO L85 PathProgramCache]: Analyzing trace with hash -1312367161, now seen corresponding path program 2 times [2025-04-13 21:09:29,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:09:29,004 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511420495] [2025-04-13 21:09:29,004 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 21:09:29,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:09:29,009 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-04-13 21:09:29,028 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 21:09:29,028 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 21:09:29,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:09:29,143 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 21:09:29,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:09:29,143 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511420495] [2025-04-13 21:09:29,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511420495] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:09:29,143 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1443100459] [2025-04-13 21:09:29,143 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 21:09:29,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:09:29,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:09:29,146 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-04-13 21:09:29,147 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-04-13 21:09:29,190 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-04-13 21:09:29,241 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 21:09:29,242 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 21:09:29,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:09:29,242 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-13 21:09:29,243 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:09:29,289 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 21:09:29,289 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:09:29,378 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 21:09:29,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1443100459] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 21:09:29,379 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 21:09:29,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-04-13 21:09:29,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853604204] [2025-04-13 21:09:29,379 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 21:09:29,379 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 21:09:29,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:09:29,379 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 21:09:29,379 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2025-04-13 21:09:29,380 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2025-04-13 21:09:29,380 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 191 transitions, 2370 flow. Second operand has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 12 states have internal predecessors, (47), 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-04-13 21:09:29,380 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:09:29,380 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2025-04-13 21:09:29,380 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:09:31,088 INFO L116 PetriNetUnfolderBase]: 458/859 cut-off events. [2025-04-13 21:09:31,088 INFO L117 PetriNetUnfolderBase]: For 5230/5230 co-relation queries the response was YES. [2025-04-13 21:09:31,091 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5213 conditions, 859 events. 458/859 cut-off events. For 5230/5230 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 4324 event pairs, 78 based on Foata normal form. 12/871 useless extension candidates. Maximal degree in co-relation 5074. Up to 382 conditions per place. [2025-04-13 21:09:31,094 INFO L140 encePairwiseOnDemand]: 13/19 looper letters, 149 selfloop transitions, 106 changer transitions 0/255 dead transitions. [2025-04-13 21:09:31,094 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 255 transitions, 3320 flow [2025-04-13 21:09:31,095 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 21:09:31,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-04-13 21:09:31,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 132 transitions. [2025-04-13 21:09:31,095 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4342105263157895 [2025-04-13 21:09:31,095 INFO L175 Difference]: Start difference. First operand has 165 places, 191 transitions, 2370 flow. Second operand 16 states and 132 transitions. [2025-04-13 21:09:31,095 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 255 transitions, 3320 flow [2025-04-13 21:09:31,113 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 255 transitions, 3150 flow, removed 72 selfloop flow, removed 5 redundant places. [2025-04-13 21:09:31,116 INFO L231 Difference]: Finished difference. Result has 179 places, 213 transitions, 2748 flow [2025-04-13 21:09:31,116 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=2183, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=188, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=87, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=2748, PETRI_PLACES=179, PETRI_TRANSITIONS=213} [2025-04-13 21:09:31,117 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 159 predicate places. [2025-04-13 21:09:31,117 INFO L485 AbstractCegarLoop]: Abstraction has has 179 places, 213 transitions, 2748 flow [2025-04-13 21:09:31,117 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 12 states have internal predecessors, (47), 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-04-13 21:09:31,117 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:09:31,117 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:09:31,123 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-04-13 21:09:31,317 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-04-13 21:09:31,317 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:09:31,318 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:09:31,318 INFO L85 PathProgramCache]: Analyzing trace with hash 390652855, now seen corresponding path program 3 times [2025-04-13 21:09:31,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:09:31,318 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758562499] [2025-04-13 21:09:31,318 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 21:09:31,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:09:31,324 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 16 statements into 2 equivalence classes. [2025-04-13 21:09:31,336 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 21:09:31,336 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 21:09:31,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:09:31,434 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 21:09:31,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:09:31,434 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758562499] [2025-04-13 21:09:31,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758562499] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:09:31,434 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1891145666] [2025-04-13 21:09:31,434 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 21:09:31,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:09:31,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:09:31,437 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-04-13 21:09:31,438 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-04-13 21:09:31,484 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 16 statements into 2 equivalence classes. [2025-04-13 21:09:31,741 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 21:09:31,741 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 21:09:31,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:09:31,742 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-13 21:09:31,743 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:09:31,787 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 21:09:31,787 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:09:31,857 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 21:09:31,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1891145666] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 21:09:31,857 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 21:09:31,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2025-04-13 21:09:31,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820389030] [2025-04-13 21:09:31,857 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 21:09:31,857 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 21:09:31,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:09:31,858 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 21:09:31,858 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2025-04-13 21:09:31,858 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2025-04-13 21:09:31,858 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 213 transitions, 2748 flow. Second operand has 13 states, 13 states have (on average 4.0) internal successors, (52), 13 states have internal predecessors, (52), 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-04-13 21:09:31,858 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:09:31,858 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2025-04-13 21:09:31,858 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:09:32,747 INFO L116 PetriNetUnfolderBase]: 684/1276 cut-off events. [2025-04-13 21:09:32,747 INFO L117 PetriNetUnfolderBase]: For 8271/8271 co-relation queries the response was YES. [2025-04-13 21:09:32,751 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7703 conditions, 1276 events. 684/1276 cut-off events. For 8271/8271 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 6993 event pairs, 37 based on Foata normal form. 21/1297 useless extension candidates. Maximal degree in co-relation 7549. Up to 386 conditions per place. [2025-04-13 21:09:32,756 INFO L140 encePairwiseOnDemand]: 12/19 looper letters, 189 selfloop transitions, 190 changer transitions 0/379 dead transitions. [2025-04-13 21:09:32,756 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 379 transitions, 5125 flow [2025-04-13 21:09:32,756 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-04-13 21:09:32,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2025-04-13 21:09:32,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 188 transitions. [2025-04-13 21:09:32,757 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3957894736842105 [2025-04-13 21:09:32,757 INFO L175 Difference]: Start difference. First operand has 179 places, 213 transitions, 2748 flow. Second operand 25 states and 188 transitions. [2025-04-13 21:09:32,757 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 379 transitions, 5125 flow [2025-04-13 21:09:32,780 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 379 transitions, 4742 flow, removed 155 selfloop flow, removed 4 redundant places. [2025-04-13 21:09:32,784 INFO L231 Difference]: Finished difference. Result has 213 places, 288 transitions, 4152 flow [2025-04-13 21:09:32,784 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=2520, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=212, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=128, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=4152, PETRI_PLACES=213, PETRI_TRANSITIONS=288} [2025-04-13 21:09:32,784 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 193 predicate places. [2025-04-13 21:09:32,784 INFO L485 AbstractCegarLoop]: Abstraction has has 213 places, 288 transitions, 4152 flow [2025-04-13 21:09:32,785 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.0) internal successors, (52), 13 states have internal predecessors, (52), 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-04-13 21:09:32,785 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:09:32,785 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:09:32,791 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-04-13 21:09:32,985 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-04-13 21:09:32,985 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:09:32,985 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:09:32,986 INFO L85 PathProgramCache]: Analyzing trace with hash 532611775, now seen corresponding path program 4 times [2025-04-13 21:09:32,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:09:32,986 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477850221] [2025-04-13 21:09:32,986 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 21:09:32,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:09:32,990 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 16 statements into 2 equivalence classes. [2025-04-13 21:09:33,002 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 21:09:33,002 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 21:09:33,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:09:33,092 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 21:09:33,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:09:33,092 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477850221] [2025-04-13 21:09:33,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477850221] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:09:33,092 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2047972552] [2025-04-13 21:09:33,092 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 21:09:33,092 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:09:33,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:09:33,094 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-04-13 21:09:33,095 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-04-13 21:09:33,144 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 16 statements into 2 equivalence classes. [2025-04-13 21:09:33,206 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 21:09:33,206 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 21:09:33,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:09:33,207 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-13 21:09:33,208 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:09:33,258 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 21:09:33,258 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:09:33,317 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 21:09:33,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2047972552] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 21:09:33,317 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 21:09:33,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2025-04-13 21:09:33,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898956210] [2025-04-13 21:09:33,317 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 21:09:33,317 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 21:09:33,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:09:33,318 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 21:09:33,318 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2025-04-13 21:09:33,318 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2025-04-13 21:09:33,318 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 213 places, 288 transitions, 4152 flow. Second operand has 13 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 13 states have internal predecessors, (50), 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-04-13 21:09:33,318 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:09:33,318 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2025-04-13 21:09:33,318 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:09:34,016 INFO L116 PetriNetUnfolderBase]: 685/1276 cut-off events. [2025-04-13 21:09:34,016 INFO L117 PetriNetUnfolderBase]: For 9953/9953 co-relation queries the response was YES. [2025-04-13 21:09:34,021 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8368 conditions, 1276 events. 685/1276 cut-off events. For 9953/9953 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 6952 event pairs, 38 based on Foata normal form. 6/1282 useless extension candidates. Maximal degree in co-relation 8207. Up to 368 conditions per place. [2025-04-13 21:09:34,027 INFO L140 encePairwiseOnDemand]: 13/19 looper letters, 184 selfloop transitions, 168 changer transitions 0/352 dead transitions. [2025-04-13 21:09:34,027 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 352 transitions, 5427 flow [2025-04-13 21:09:34,027 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 21:09:34,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-04-13 21:09:34,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 125 transitions. [2025-04-13 21:09:34,027 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.43859649122807015 [2025-04-13 21:09:34,028 INFO L175 Difference]: Start difference. First operand has 213 places, 288 transitions, 4152 flow. Second operand 15 states and 125 transitions. [2025-04-13 21:09:34,028 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 227 places, 352 transitions, 5427 flow [2025-04-13 21:09:34,069 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 352 transitions, 4970 flow, removed 147 selfloop flow, removed 11 redundant places. [2025-04-13 21:09:34,073 INFO L231 Difference]: Finished difference. Result has 219 places, 297 transitions, 4211 flow [2025-04-13 21:09:34,073 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=3699, PETRI_DIFFERENCE_MINUEND_PLACES=202, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=287, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=158, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=4211, PETRI_PLACES=219, PETRI_TRANSITIONS=297} [2025-04-13 21:09:34,073 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 199 predicate places. [2025-04-13 21:09:34,073 INFO L485 AbstractCegarLoop]: Abstraction has has 219 places, 297 transitions, 4211 flow [2025-04-13 21:09:34,074 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 13 states have internal predecessors, (50), 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-04-13 21:09:34,074 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:09:34,074 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:09:34,080 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-04-13 21:09:34,274 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-04-13 21:09:34,274 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:09:34,274 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:09:34,274 INFO L85 PathProgramCache]: Analyzing trace with hash 394083625, now seen corresponding path program 5 times [2025-04-13 21:09:34,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:09:34,275 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513295108] [2025-04-13 21:09:34,275 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 21:09:34,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:09:34,279 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-04-13 21:09:34,289 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 21:09:34,289 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 21:09:34,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:09:34,409 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 21:09:34,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:09:34,409 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513295108] [2025-04-13 21:09:34,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513295108] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:09:34,410 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1343580997] [2025-04-13 21:09:34,410 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 21:09:34,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:09:34,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:09:34,412 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-04-13 21:09:34,413 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-04-13 21:09:34,460 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-04-13 21:09:34,506 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 21:09:34,507 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 21:09:34,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:09:34,508 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-13 21:09:34,508 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:09:34,557 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 21:09:34,557 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:09:34,623 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 21:09:34,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1343580997] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 21:09:34,624 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 21:09:34,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2025-04-13 21:09:34,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708425443] [2025-04-13 21:09:34,624 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 21:09:34,624 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 21:09:34,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:09:34,624 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 21:09:34,624 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2025-04-13 21:09:34,625 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2025-04-13 21:09:34,625 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 297 transitions, 4211 flow. Second operand has 13 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 13 states have internal predecessors, (50), 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-04-13 21:09:34,625 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:09:34,625 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2025-04-13 21:09:34,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:09:35,548 INFO L116 PetriNetUnfolderBase]: 724/1341 cut-off events. [2025-04-13 21:09:35,548 INFO L117 PetriNetUnfolderBase]: For 9903/9903 co-relation queries the response was YES. [2025-04-13 21:09:35,553 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8735 conditions, 1341 events. 724/1341 cut-off events. For 9903/9903 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 7397 event pairs, 37 based on Foata normal form. 6/1347 useless extension candidates. Maximal degree in co-relation 8569. Up to 322 conditions per place. [2025-04-13 21:09:35,559 INFO L140 encePairwiseOnDemand]: 12/19 looper letters, 192 selfloop transitions, 194 changer transitions 0/386 dead transitions. [2025-04-13 21:09:35,559 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 386 transitions, 5803 flow [2025-04-13 21:09:35,559 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-13 21:09:35,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-04-13 21:09:35,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 143 transitions. [2025-04-13 21:09:35,560 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3961218836565097 [2025-04-13 21:09:35,560 INFO L175 Difference]: Start difference. First operand has 219 places, 297 transitions, 4211 flow. Second operand 19 states and 143 transitions. [2025-04-13 21:09:35,560 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 237 places, 386 transitions, 5803 flow [2025-04-13 21:09:35,598 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 232 places, 386 transitions, 5496 flow, removed 49 selfloop flow, removed 5 redundant places. [2025-04-13 21:09:35,602 INFO L231 Difference]: Finished difference. Result has 239 places, 317 transitions, 4629 flow [2025-04-13 21:09:35,603 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=3925, PETRI_DIFFERENCE_MINUEND_PLACES=214, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=297, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=174, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=4629, PETRI_PLACES=239, PETRI_TRANSITIONS=317} [2025-04-13 21:09:35,603 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 219 predicate places. [2025-04-13 21:09:35,603 INFO L485 AbstractCegarLoop]: Abstraction has has 239 places, 317 transitions, 4629 flow [2025-04-13 21:09:35,603 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 13 states have internal predecessors, (50), 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-04-13 21:09:35,603 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:09:35,603 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:09:35,609 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-04-13 21:09:35,803 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-04-13 21:09:35,803 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:09:35,804 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:09:35,804 INFO L85 PathProgramCache]: Analyzing trace with hash 1253552801, now seen corresponding path program 6 times [2025-04-13 21:09:35,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:09:35,804 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679889865] [2025-04-13 21:09:35,804 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 21:09:35,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:09:35,808 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 16 statements into 2 equivalence classes. [2025-04-13 21:09:35,820 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 21:09:35,820 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 21:09:35,820 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:09:35,900 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 21:09:35,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:09:35,900 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679889865] [2025-04-13 21:09:35,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679889865] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:09:35,900 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1229337304] [2025-04-13 21:09:35,901 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 21:09:35,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:09:35,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:09:35,902 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-04-13 21:09:35,903 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-04-13 21:09:35,950 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 16 statements into 2 equivalence classes. [2025-04-13 21:09:36,013 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 21:09:36,014 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 21:09:36,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:09:36,015 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-13 21:09:36,015 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:09:36,056 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 21:09:36,056 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:09:36,131 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 21:09:36,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1229337304] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 21:09:36,132 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 21:09:36,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-04-13 21:09:36,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599420932] [2025-04-13 21:09:36,132 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 21:09:36,132 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 21:09:36,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:09:36,132 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 21:09:36,132 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2025-04-13 21:09:36,132 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2025-04-13 21:09:36,132 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 239 places, 317 transitions, 4629 flow. Second operand has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 12 states have internal predecessors, (47), 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-04-13 21:09:36,132 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:09:36,133 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2025-04-13 21:09:36,133 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:09:36,705 INFO L116 PetriNetUnfolderBase]: 793/1452 cut-off events. [2025-04-13 21:09:36,705 INFO L117 PetriNetUnfolderBase]: For 10990/10990 co-relation queries the response was YES. [2025-04-13 21:09:36,710 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9699 conditions, 1452 events. 793/1452 cut-off events. For 10990/10990 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 7993 event pairs, 145 based on Foata normal form. 16/1468 useless extension candidates. Maximal degree in co-relation 9533. Up to 748 conditions per place. [2025-04-13 21:09:36,714 INFO L140 encePairwiseOnDemand]: 13/19 looper letters, 208 selfloop transitions, 171 changer transitions 0/379 dead transitions. [2025-04-13 21:09:36,714 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 250 places, 379 transitions, 5968 flow [2025-04-13 21:09:36,714 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-13 21:09:36,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-04-13 21:09:36,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 110 transitions. [2025-04-13 21:09:36,715 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.41353383458646614 [2025-04-13 21:09:36,715 INFO L175 Difference]: Start difference. First operand has 239 places, 317 transitions, 4629 flow. Second operand 14 states and 110 transitions. [2025-04-13 21:09:36,715 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 250 places, 379 transitions, 5968 flow [2025-04-13 21:09:36,758 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 241 places, 379 transitions, 5718 flow, removed 17 selfloop flow, removed 9 redundant places. [2025-04-13 21:09:36,763 INFO L231 Difference]: Finished difference. Result has 245 places, 336 transitions, 5218 flow [2025-04-13 21:09:36,763 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=4353, PETRI_DIFFERENCE_MINUEND_PLACES=228, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=313, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=151, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=5218, PETRI_PLACES=245, PETRI_TRANSITIONS=336} [2025-04-13 21:09:36,763 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 225 predicate places. [2025-04-13 21:09:36,763 INFO L485 AbstractCegarLoop]: Abstraction has has 245 places, 336 transitions, 5218 flow [2025-04-13 21:09:36,763 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 12 states have internal predecessors, (47), 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-04-13 21:09:36,763 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:09:36,764 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:09:36,770 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-04-13 21:09:36,964 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:09:36,964 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:09:36,964 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:09:36,964 INFO L85 PathProgramCache]: Analyzing trace with hash -687141211, now seen corresponding path program 7 times [2025-04-13 21:09:36,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:09:36,964 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565648220] [2025-04-13 21:09:36,965 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 21:09:36,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:09:36,969 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-13 21:09:36,977 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-13 21:09:36,977 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:09:36,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:09:37,338 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:09:37,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:09:37,338 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565648220] [2025-04-13 21:09:37,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565648220] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:09:37,338 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [648338427] [2025-04-13 21:09:37,338 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 21:09:37,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:09:37,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:09:37,340 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-04-13 21:09:37,341 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-04-13 21:09:37,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-13 21:09:37,399 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-13 21:09:37,399 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:09:37,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:09:37,400 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-04-13 21:09:37,401 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:09:37,427 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-13 21:09:38,994 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:09:38,994 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:09:41,333 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 228 treesize of output 202 [2025-04-13 21:09:41,431 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 21:09:41,431 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 9 new quantified variables, introduced 15 case distinctions, treesize of input 938 treesize of output 758 [2025-04-13 21:09:48,756 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:09:48,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [648338427] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 21:09:48,757 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 21:09:48,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 22 [2025-04-13 21:09:48,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079506759] [2025-04-13 21:09:48,757 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 21:09:48,757 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-04-13 21:09:48,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:09:48,757 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-04-13 21:09:48,758 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=429, Unknown=0, NotChecked=0, Total=552 [2025-04-13 21:09:48,758 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2025-04-13 21:09:48,758 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 245 places, 336 transitions, 5218 flow. Second operand has 24 states, 24 states have (on average 3.9583333333333335) internal successors, (95), 24 states have internal predecessors, (95), 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-04-13 21:09:48,758 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:09:48,758 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2025-04-13 21:09:48,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:09:49,405 INFO L116 PetriNetUnfolderBase]: 870/1647 cut-off events. [2025-04-13 21:09:49,405 INFO L117 PetriNetUnfolderBase]: For 14024/14024 co-relation queries the response was YES. [2025-04-13 21:09:49,412 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11048 conditions, 1647 events. 870/1647 cut-off events. For 14024/14024 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 9613 event pairs, 24 based on Foata normal form. 1/1648 useless extension candidates. Maximal degree in co-relation 10884. Up to 1104 conditions per place. [2025-04-13 21:09:49,417 INFO L140 encePairwiseOnDemand]: 9/19 looper letters, 251 selfloop transitions, 131 changer transitions 29/411 dead transitions. [2025-04-13 21:09:49,417 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 258 places, 411 transitions, 6809 flow [2025-04-13 21:09:49,417 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-13 21:09:49,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-04-13 21:09:49,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 96 transitions. [2025-04-13 21:09:49,418 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3609022556390977 [2025-04-13 21:09:49,418 INFO L175 Difference]: Start difference. First operand has 245 places, 336 transitions, 5218 flow. Second operand 14 states and 96 transitions. [2025-04-13 21:09:49,418 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 258 places, 411 transitions, 6809 flow [2025-04-13 21:09:49,475 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 246 places, 411 transitions, 6622 flow, removed 17 selfloop flow, removed 12 redundant places. [2025-04-13 21:09:49,480 INFO L231 Difference]: Finished difference. Result has 248 places, 368 transitions, 5932 flow [2025-04-13 21:09:49,480 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=5040, PETRI_DIFFERENCE_MINUEND_PLACES=233, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=336, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=86, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=206, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=5932, PETRI_PLACES=248, PETRI_TRANSITIONS=368} [2025-04-13 21:09:49,481 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 228 predicate places. [2025-04-13 21:09:49,481 INFO L485 AbstractCegarLoop]: Abstraction has has 248 places, 368 transitions, 5932 flow [2025-04-13 21:09:49,481 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 3.9583333333333335) internal successors, (95), 24 states have internal predecessors, (95), 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-04-13 21:09:49,481 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:09:49,481 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:09:49,487 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-04-13 21:09:49,681 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable19 [2025-04-13 21:09:49,681 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:09:49,682 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:09:49,682 INFO L85 PathProgramCache]: Analyzing trace with hash 875749415, now seen corresponding path program 8 times [2025-04-13 21:09:49,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:09:49,682 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192181638] [2025-04-13 21:09:49,682 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 21:09:49,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:09:49,686 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-04-13 21:09:49,695 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-04-13 21:09:49,695 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 21:09:49,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:09:49,820 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 21:09:49,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:09:49,821 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192181638] [2025-04-13 21:09:49,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192181638] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:09:49,821 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [391838768] [2025-04-13 21:09:49,821 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 21:09:49,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:09:49,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:09:49,823 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-04-13 21:09:49,824 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-04-13 21:09:49,873 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-04-13 21:09:49,917 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-04-13 21:09:49,917 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 21:09:49,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:09:49,918 INFO L256 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-04-13 21:09:49,921 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:09:49,977 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-13 21:09:51,874 INFO L325 Elim1Store]: treesize reduction 8, result has 84.9 percent of original size [2025-04-13 21:09:51,874 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 200 treesize of output 215 [2025-04-13 21:09:59,890 WARN L286 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-04-13 21:10:07,902 WARN L286 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-04-13 21:10:15,913 WARN L286 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-04-13 21:10:27,982 WARN L286 SmtUtils]: Spent 8.06s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-04-13 21:10:40,432 WARN L286 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-04-13 21:10:52,458 WARN L286 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-04-13 21:11:04,995 WARN L286 SmtUtils]: Spent 8.07s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-04-13 21:11:05,506 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:11:05,506 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:11:13,414 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 140 treesize of output 124 [2025-04-13 21:11:13,534 INFO L325 Elim1Store]: treesize reduction 5, result has 95.2 percent of original size [2025-04-13 21:11:13,534 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 465 treesize of output 394 [2025-04-13 21:11:18,329 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:11:18,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [391838768] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 21:11:18,329 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 21:11:18,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 10] total 26 [2025-04-13 21:11:18,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580572133] [2025-04-13 21:11:18,329 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 21:11:18,330 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-04-13 21:11:18,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:11:18,330 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-04-13 21:11:18,330 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=540, Unknown=0, NotChecked=0, Total=650 [2025-04-13 21:11:18,330 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2025-04-13 21:11:18,331 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 248 places, 368 transitions, 5932 flow. Second operand has 26 states, 26 states have (on average 3.8076923076923075) internal successors, (99), 26 states have internal predecessors, (99), 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-04-13 21:11:18,331 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:11:18,331 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2025-04-13 21:11:18,331 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:11:27,845 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-13 21:11:44,141 WARN L286 SmtUtils]: Spent 14.89s on a formula simplification. DAG size of input: 105 DAG size of output: 60 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 21:11:51,381 WARN L286 SmtUtils]: Spent 6.27s on a formula simplification. DAG size of input: 103 DAG size of output: 84 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 21:12:08,910 WARN L286 SmtUtils]: Spent 16.44s on a formula simplification. DAG size of input: 133 DAG size of output: 73 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 21:12:10,581 INFO L116 PetriNetUnfolderBase]: 1409/2533 cut-off events. [2025-04-13 21:12:10,582 INFO L117 PetriNetUnfolderBase]: For 25019/25019 co-relation queries the response was YES. [2025-04-13 21:12:10,591 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18423 conditions, 2533 events. 1409/2533 cut-off events. For 25019/25019 co-relation queries the response was YES. Maximal size of possible extension queue 215. Compared 15629 event pairs, 30 based on Foata normal form. 11/2544 useless extension candidates. Maximal degree in co-relation 18346. Up to 763 conditions per place. [2025-04-13 21:12:10,597 INFO L140 encePairwiseOnDemand]: 9/19 looper letters, 355 selfloop transitions, 355 changer transitions 9/719 dead transitions. [2025-04-13 21:12:10,597 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 280 places, 719 transitions, 11400 flow [2025-04-13 21:12:10,598 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2025-04-13 21:12:10,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2025-04-13 21:12:10,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 402 transitions. [2025-04-13 21:12:10,599 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4148606811145511 [2025-04-13 21:12:10,599 INFO L175 Difference]: Start difference. First operand has 248 places, 368 transitions, 5932 flow. Second operand 51 states and 402 transitions. [2025-04-13 21:12:10,599 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 280 places, 719 transitions, 11400 flow [2025-04-13 21:12:10,718 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 268 places, 719 transitions, 10857 flow, removed 144 selfloop flow, removed 12 redundant places. [2025-04-13 21:12:10,725 INFO L231 Difference]: Finished difference. Result has 281 places, 549 transitions, 9429 flow [2025-04-13 21:12:10,725 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=5588, PETRI_DIFFERENCE_MINUEND_PLACES=218, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=366, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=191, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=51, PETRI_FLOW=9429, PETRI_PLACES=281, PETRI_TRANSITIONS=549} [2025-04-13 21:12:10,726 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 261 predicate places. [2025-04-13 21:12:10,726 INFO L485 AbstractCegarLoop]: Abstraction has has 281 places, 549 transitions, 9429 flow [2025-04-13 21:12:10,726 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.8076923076923075) internal successors, (99), 26 states have internal predecessors, (99), 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-04-13 21:12:10,726 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:12:10,726 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:12:10,734 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-04-13 21:12:10,930 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:12:10,930 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:12:10,930 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:12:10,930 INFO L85 PathProgramCache]: Analyzing trace with hash -363367253, now seen corresponding path program 9 times [2025-04-13 21:12:10,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:12:10,930 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362245072] [2025-04-13 21:12:10,930 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 21:12:10,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:12:10,936 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 17 statements into 2 equivalence classes. [2025-04-13 21:12:10,946 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-04-13 21:12:10,947 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 21:12:10,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:12:11,096 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 21:12:11,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:12:11,096 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362245072] [2025-04-13 21:12:11,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362245072] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:12:11,096 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2043471819] [2025-04-13 21:12:11,096 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 21:12:11,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:12:11,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:12:11,098 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-04-13 21:12:11,099 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-04-13 21:12:11,153 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 17 statements into 2 equivalence classes. [2025-04-13 21:12:11,194 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-04-13 21:12:11,194 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 21:12:11,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:12:11,200 INFO L256 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-04-13 21:12:11,203 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:12:11,233 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-13 21:12:11,254 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-13 21:12:33,383 WARN L286 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-04-13 21:12:53,579 WARN L286 SmtUtils]: Spent 20.14s on a formula simplification. DAG size of input: 54 DAG size of output: 49 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 21:12:53,605 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 21:12:53,605 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 110 treesize of output 80 [2025-04-13 21:12:53,779 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:12:53,780 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:13:02,176 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 204 treesize of output 188 [2025-04-13 21:13:02,350 INFO L325 Elim1Store]: treesize reduction 5, result has 96.7 percent of original size [2025-04-13 21:13:02,351 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 15 case distinctions, treesize of input 8382 treesize of output 5629 [2025-04-13 21:14:40,809 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-13 21:14:49,980 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-13 21:15:13,810 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-13 21:15:44,255 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-13 21:15:45,154 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 101 [2025-04-13 21:15:45,154 WARN L249 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) stderr output: (error "out of memory") [2025-04-13 21:15:45,155 WARN L310 FreeRefinementEngine]: Global settings require throwing the following exception [2025-04-13 21:15:45,161 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-04-13 21:15:45,356 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:15:45,357 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:277) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.push(Scriptor.java:133) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.push(DiffWrapperScript.java:90) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.push(WrapperScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.push(HistoryRecordingScript.java:107) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:48) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.checkRedundancy(SimplifyDDA2.java:275) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convertForPreprocessedInputTerms(SimplifyDDA2.java:499) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:484) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:103) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:99) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.simplify(SimplifyDDA2.java:589) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:245) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplifyWithStatistics(SmtUtils.java:318) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify(QuantifierPusher.java:726) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:135) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:223) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:115) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:99) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:305) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:241) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:139) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:337) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:191) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:223) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:115) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:99) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:305) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:285) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:56) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:234) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:416) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:395) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:267) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:325) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:181) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:317) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:349) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:331) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:427) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:132) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 69 more [2025-04-13 21:15:45,361 INFO L158 Benchmark]: Toolchain (without parser) took 785130.50ms. Allocated memory was 125.8MB in the beginning and 801.1MB in the end (delta: 675.3MB). Free memory was 90.9MB in the beginning and 391.4MB in the end (delta: -300.5MB). Peak memory consumption was 538.2MB. Max. memory is 8.0GB. [2025-04-13 21:15:45,361 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 184.5MB. Free memory is still 107.4MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 21:15:45,361 INFO L158 Benchmark]: CACSL2BoogieTranslator took 256.36ms. Allocated memory is still 125.8MB. Free memory was 90.9MB in the beginning and 75.3MB in the end (delta: 15.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-13 21:15:45,361 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.80ms. Allocated memory is still 125.8MB. Free memory was 75.3MB in the beginning and 73.3MB in the end (delta: 2.0MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 21:15:45,361 INFO L158 Benchmark]: Boogie Preprocessor took 41.79ms. Allocated memory is still 125.8MB. Free memory was 73.3MB in the beginning and 71.1MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 21:15:45,361 INFO L158 Benchmark]: RCFGBuilder took 604.66ms. Allocated memory is still 125.8MB. Free memory was 71.1MB in the beginning and 70.0MB in the end (delta: 1.1MB). Peak memory consumption was 56.6MB. Max. memory is 8.0GB. [2025-04-13 21:15:45,361 INFO L158 Benchmark]: TraceAbstraction took 784186.97ms. Allocated memory was 125.8MB in the beginning and 801.1MB in the end (delta: 675.3MB). Free memory was 69.3MB in the beginning and 391.4MB in the end (delta: -322.0MB). Peak memory consumption was 519.4MB. Max. memory is 8.0GB. [2025-04-13 21:15:45,362 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.15ms. Allocated memory is still 184.5MB. Free memory is still 107.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 256.36ms. Allocated memory is still 125.8MB. Free memory was 90.9MB in the beginning and 75.3MB in the end (delta: 15.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 36.80ms. Allocated memory is still 125.8MB. Free memory was 75.3MB in the beginning and 73.3MB in the end (delta: 2.0MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 41.79ms. Allocated memory is still 125.8MB. Free memory was 73.3MB in the beginning and 71.1MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 604.66ms. Allocated memory is still 125.8MB. Free memory was 71.1MB in the beginning and 70.0MB in the end (delta: 1.1MB). Peak memory consumption was 56.6MB. Max. memory is 8.0GB. * TraceAbstraction took 784186.97ms. Allocated memory was 125.8MB in the beginning and 801.1MB in the end (delta: 675.3MB). Free memory was 69.3MB in the beginning and 391.4MB in the end (delta: -322.0MB). Peak memory consumption was 519.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...