/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_IcfgBuilder.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis PETRI_NET --preprocessor.replace.while.statements.and.if-then-else.statements false -i ../../../trunk/examples/svcomp/weaver/chl-chromosome-trans.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-14 00:33:13,695 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-14 00:33:13,754 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-14 00:33:13,757 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-14 00:33:13,757 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-14 00:33:13,774 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-14 00:33:13,775 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-14 00:33:13,775 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-14 00:33:13,775 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-14 00:33:13,775 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-14 00:33:13,775 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-14 00:33:13,775 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-14 00:33:13,776 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-14 00:33:13,776 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-14 00:33:13,776 INFO L153 SettingsManager]: * Use SBE=true [2025-04-14 00:33:13,776 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-14 00:33:13,776 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-14 00:33:13,777 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-14 00:33:13,777 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-14 00:33:13,777 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-14 00:33:13,777 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-14 00:33:13,777 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-14 00:33:13,777 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-14 00:33:13,777 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-14 00:33:13,777 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-14 00:33:13,777 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-14 00:33:13,777 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-14 00:33:13,777 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-14 00:33:13,777 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-14 00:33:13,777 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 00:33:13,777 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 00:33:13,777 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 00:33:13,777 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 00:33:13,777 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-14 00:33:13,777 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 00:33:13,777 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 00:33:13,777 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 00:33:13,777 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 00:33:13,778 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-14 00:33:13,778 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-14 00:33:13,778 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-14 00:33:13,778 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-14 00:33:13,778 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-14 00:33:13,778 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-14 00:33:13,778 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-14 00:33:13,778 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-14 00:33:13,778 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-14 00:33:13,778 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Replace while statements and if-then-else statements -> false [2025-04-14 00:33:13,988 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-14 00:33:13,995 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-14 00:33:13,997 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-14 00:33:13,998 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-14 00:33:13,999 INFO L274 PluginConnector]: CDTParser initialized [2025-04-14 00:33:14,000 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/chl-chromosome-trans.wvr.c [2025-04-14 00:33:15,293 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6469ed81b/a6581b9601fa4219aee88ba895eb53a0/FLAG26ce4f06b [2025-04-14 00:33:15,502 INFO L389 CDTParser]: Found 1 translation units. [2025-04-14 00:33:15,502 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-chromosome-trans.wvr.c [2025-04-14 00:33:15,508 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6469ed81b/a6581b9601fa4219aee88ba895eb53a0/FLAG26ce4f06b [2025-04-14 00:33:16,293 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6469ed81b/a6581b9601fa4219aee88ba895eb53a0 [2025-04-14 00:33:16,295 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-14 00:33:16,296 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-14 00:33:16,297 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-14 00:33:16,297 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-14 00:33:16,301 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-14 00:33:16,301 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 12:33:16" (1/1) ... [2025-04-14 00:33:16,302 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36adc07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:33:16, skipping insertion in model container [2025-04-14 00:33:16,302 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 12:33:16" (1/1) ... [2025-04-14 00:33:16,317 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-14 00:33:16,493 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/chl-chromosome-trans.wvr.c[3073,3086] [2025-04-14 00:33:16,502 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 00:33:16,510 INFO L200 MainTranslator]: Completed pre-run [2025-04-14 00:33:16,540 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/chl-chromosome-trans.wvr.c[3073,3086] [2025-04-14 00:33:16,543 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 00:33:16,553 INFO L204 MainTranslator]: Completed translation [2025-04-14 00:33:16,553 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:33:16 WrapperNode [2025-04-14 00:33:16,553 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-14 00:33:16,554 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-14 00:33:16,554 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-14 00:33:16,554 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-14 00:33:16,558 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:33:16" (1/1) ... [2025-04-14 00:33:16,565 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:33:16" (1/1) ... [2025-04-14 00:33:16,590 INFO L138 Inliner]: procedures = 25, calls = 31, calls flagged for inlining = 16, calls inlined = 24, statements flattened = 249 [2025-04-14 00:33:16,590 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-14 00:33:16,591 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-14 00:33:16,591 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-14 00:33:16,591 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-14 00:33:16,596 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:33:16" (1/1) ... [2025-04-14 00:33:16,596 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:33:16" (1/1) ... [2025-04-14 00:33:16,603 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:33:16" (1/1) ... [2025-04-14 00:33:16,615 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 3 writes are split as follows [0, 3]. [2025-04-14 00:33:16,616 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:33:16" (1/1) ... [2025-04-14 00:33:16,616 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:33:16" (1/1) ... [2025-04-14 00:33:16,624 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:33:16" (1/1) ... [2025-04-14 00:33:16,625 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:33:16" (1/1) ... [2025-04-14 00:33:16,626 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:33:16" (1/1) ... [2025-04-14 00:33:16,627 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:33:16" (1/1) ... [2025-04-14 00:33:16,633 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-14 00:33:16,636 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-14 00:33:16,636 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-14 00:33:16,636 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-14 00:33:16,637 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:33:16" (1/1) ... [2025-04-14 00:33:16,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 00:33:16,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:33:16,660 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-14 00:33:16,668 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-14 00:33:16,688 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-14 00:33:16,688 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-14 00:33:16,688 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-14 00:33:16,688 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-14 00:33:16,688 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-14 00:33:16,688 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-14 00:33:16,688 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-14 00:33:16,688 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-14 00:33:16,688 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-14 00:33:16,688 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-14 00:33:16,688 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-14 00:33:16,688 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-14 00:33:16,688 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-14 00:33:16,688 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-14 00:33:16,688 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-14 00:33:16,688 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-14 00:33:16,689 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-14 00:33:16,798 INFO L256 CfgBuilder]: Building ICFG [2025-04-14 00:33:16,799 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-14 00:33:17,209 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-14 00:33:17,209 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-14 00:33:17,209 INFO L318 CfgBuilder]: Performing block encoding [2025-04-14 00:33:17,544 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-14 00:33:17,545 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 12:33:17 BoogieIcfgContainer [2025-04-14 00:33:17,545 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-14 00:33:17,546 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-14 00:33:17,546 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-14 00:33:17,550 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-14 00:33:17,550 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 12:33:16" (1/3) ... [2025-04-14 00:33:17,551 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9f81a84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 12:33:17, skipping insertion in model container [2025-04-14 00:33:17,551 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:33:16" (2/3) ... [2025-04-14 00:33:17,551 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9f81a84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 12:33:17, skipping insertion in model container [2025-04-14 00:33:17,551 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 12:33:17" (3/3) ... [2025-04-14 00:33:17,552 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-chromosome-trans.wvr.c [2025-04-14 00:33:17,564 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-14 00:33:17,565 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-chromosome-trans.wvr.c that has 4 procedures, 25 locations, 27 edges, 1 initial locations, 6 loop locations, and 1 error locations. [2025-04-14 00:33:17,566 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-14 00:33:17,621 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-14 00:33:17,643 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 30 transitions, 81 flow [2025-04-14 00:33:17,669 INFO L116 PetriNetUnfolderBase]: 6/27 cut-off events. [2025-04-14 00:33:17,671 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-14 00:33:17,674 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40 conditions, 27 events. 6/27 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 16 event pairs, 0 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 21. Up to 2 conditions per place. [2025-04-14 00:33:17,674 INFO L82 GeneralOperation]: Start removeDead. Operand has 34 places, 30 transitions, 81 flow [2025-04-14 00:33:17,675 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 30 places, 26 transitions, 70 flow [2025-04-14 00:33:17,685 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-14 00:33:17,692 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;@4c8afc00, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 00:33:17,692 INFO L341 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-04-14 00:33:17,705 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-14 00:33:17,705 INFO L116 PetriNetUnfolderBase]: 6/25 cut-off events. [2025-04-14 00:33:17,705 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-14 00:33:17,705 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:33:17,706 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:33:17,706 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 00:33:17,710 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:33:17,710 INFO L85 PathProgramCache]: Analyzing trace with hash 330303741, now seen corresponding path program 1 times [2025-04-14 00:33:17,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:33:17,715 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129027719] [2025-04-14 00:33:17,716 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:33:17,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:33:17,806 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-14 00:33:17,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-14 00:33:17,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:33:17,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:33:18,078 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-14 00:33:18,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:33:18,078 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129027719] [2025-04-14 00:33:18,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129027719] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:33:18,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:33:18,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 00:33:18,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482340652] [2025-04-14 00:33:18,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:33:18,086 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 00:33:18,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:33:18,104 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 00:33:18,106 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 00:33:18,108 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2025-04-14 00:33:18,109 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 26 transitions, 70 flow. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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-14 00:33:18,109 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:33:18,109 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2025-04-14 00:33:18,110 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:33:18,232 INFO L116 PetriNetUnfolderBase]: 202/301 cut-off events. [2025-04-14 00:33:18,232 INFO L117 PetriNetUnfolderBase]: For 33/33 co-relation queries the response was YES. [2025-04-14 00:33:18,233 INFO L83 FinitePrefix]: Finished finitePrefix Result has 646 conditions, 301 events. 202/301 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 697 event pairs, 124 based on Foata normal form. 0/223 useless extension candidates. Maximal degree in co-relation 534. Up to 299 conditions per place. [2025-04-14 00:33:18,237 INFO L140 encePairwiseOnDemand]: 23/30 looper letters, 23 selfloop transitions, 6 changer transitions 0/29 dead transitions. [2025-04-14 00:33:18,237 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 29 transitions, 134 flow [2025-04-14 00:33:18,239 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 00:33:18,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-14 00:33:18,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 41 transitions. [2025-04-14 00:33:18,250 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.45555555555555555 [2025-04-14 00:33:18,251 INFO L175 Difference]: Start difference. First operand has 30 places, 26 transitions, 70 flow. Second operand 3 states and 41 transitions. [2025-04-14 00:33:18,251 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 29 transitions, 134 flow [2025-04-14 00:33:18,255 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 29 transitions, 122 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-04-14 00:33:18,257 INFO L231 Difference]: Finished difference. Result has 27 places, 29 transitions, 90 flow [2025-04-14 00:33:18,258 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=90, PETRI_PLACES=27, PETRI_TRANSITIONS=29} [2025-04-14 00:33:18,261 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, -3 predicate places. [2025-04-14 00:33:18,262 INFO L485 AbstractCegarLoop]: Abstraction has has 27 places, 29 transitions, 90 flow [2025-04-14 00:33:18,262 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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-14 00:33:18,262 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:33:18,262 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:33:18,262 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-14 00:33:18,262 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 00:33:18,263 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:33:18,263 INFO L85 PathProgramCache]: Analyzing trace with hash 943876491, now seen corresponding path program 1 times [2025-04-14 00:33:18,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:33:18,263 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053419844] [2025-04-14 00:33:18,263 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:33:18,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:33:18,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-14 00:33:18,298 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-14 00:33:18,300 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:33:18,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:33:18,469 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 00:33:18,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:33:18,469 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053419844] [2025-04-14 00:33:18,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053419844] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:33:18,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:33:18,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 00:33:18,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313405299] [2025-04-14 00:33:18,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:33:18,470 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 00:33:18,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:33:18,471 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 00:33:18,471 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-14 00:33:18,471 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2025-04-14 00:33:18,471 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 29 transitions, 90 flow. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 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-14 00:33:18,471 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:33:18,471 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2025-04-14 00:33:18,471 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:33:18,591 INFO L116 PetriNetUnfolderBase]: 306/450 cut-off events. [2025-04-14 00:33:18,591 INFO L117 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2025-04-14 00:33:18,592 INFO L83 FinitePrefix]: Finished finitePrefix Result has 930 conditions, 450 events. 306/450 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1212 event pairs, 124 based on Foata normal form. 1/327 useless extension candidates. Maximal degree in co-relation 899. Up to 302 conditions per place. [2025-04-14 00:33:18,596 INFO L140 encePairwiseOnDemand]: 27/30 looper letters, 37 selfloop transitions, 2 changer transitions 2/41 dead transitions. [2025-04-14 00:33:18,596 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 41 transitions, 199 flow [2025-04-14 00:33:18,596 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 00:33:18,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-14 00:33:18,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 48 transitions. [2025-04-14 00:33:18,597 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5333333333333333 [2025-04-14 00:33:18,597 INFO L175 Difference]: Start difference. First operand has 27 places, 29 transitions, 90 flow. Second operand 3 states and 48 transitions. [2025-04-14 00:33:18,597 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 41 transitions, 199 flow [2025-04-14 00:33:18,597 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 41 transitions, 193 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-14 00:33:18,598 INFO L231 Difference]: Finished difference. Result has 29 places, 30 transitions, 96 flow [2025-04-14 00:33:18,598 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=96, PETRI_PLACES=29, PETRI_TRANSITIONS=30} [2025-04-14 00:33:18,599 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, -1 predicate places. [2025-04-14 00:33:18,599 INFO L485 AbstractCegarLoop]: Abstraction has has 29 places, 30 transitions, 96 flow [2025-04-14 00:33:18,599 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 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-14 00:33:18,599 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:33:18,599 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:33:18,599 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-14 00:33:18,599 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 00:33:18,602 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:33:18,602 INFO L85 PathProgramCache]: Analyzing trace with hash -785173250, now seen corresponding path program 1 times [2025-04-14 00:33:18,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:33:18,602 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329094008] [2025-04-14 00:33:18,602 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:33:18,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:33:18,617 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-14 00:33:18,634 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-14 00:33:18,634 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:33:18,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:33:18,750 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-14 00:33:18,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:33:18,751 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329094008] [2025-04-14 00:33:18,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329094008] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:33:18,751 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [11852735] [2025-04-14 00:33:18,751 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:33:18,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:33:18,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:33:18,753 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-14 00:33:18,755 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-14 00:33:18,823 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-14 00:33:18,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-14 00:33:18,859 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:33:18,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:33:18,861 INFO L256 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-14 00:33:18,864 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:33:18,903 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-14 00:33:18,904 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:33:18,928 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-14 00:33:18,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [11852735] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:33:18,928 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:33:18,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 8 [2025-04-14 00:33:18,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720163320] [2025-04-14 00:33:18,928 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:33:18,928 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-14 00:33:18,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:33:18,929 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-14 00:33:18,929 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2025-04-14 00:33:18,929 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2025-04-14 00:33:18,929 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 30 transitions, 96 flow. Second operand has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 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-14 00:33:18,929 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:33:18,929 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2025-04-14 00:33:18,929 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:33:19,072 INFO L116 PetriNetUnfolderBase]: 306/459 cut-off events. [2025-04-14 00:33:19,072 INFO L117 PetriNetUnfolderBase]: For 80/80 co-relation queries the response was YES. [2025-04-14 00:33:19,073 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1044 conditions, 459 events. 306/459 cut-off events. For 80/80 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1196 event pairs, 202 based on Foata normal form. 0/377 useless extension candidates. Maximal degree in co-relation 982. Up to 448 conditions per place. [2025-04-14 00:33:19,078 INFO L140 encePairwiseOnDemand]: 23/30 looper letters, 24 selfloop transitions, 15 changer transitions 0/39 dead transitions. [2025-04-14 00:33:19,078 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 39 transitions, 210 flow [2025-04-14 00:33:19,078 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 00:33:19,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-14 00:33:19,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 65 transitions. [2025-04-14 00:33:19,079 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3611111111111111 [2025-04-14 00:33:19,079 INFO L175 Difference]: Start difference. First operand has 29 places, 30 transitions, 96 flow. Second operand 6 states and 65 transitions. [2025-04-14 00:33:19,079 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 39 transitions, 210 flow [2025-04-14 00:33:19,080 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 39 transitions, 208 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-14 00:33:19,081 INFO L231 Difference]: Finished difference. Result has 36 places, 39 transitions, 190 flow [2025-04-14 00:33:19,081 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=190, PETRI_PLACES=36, PETRI_TRANSITIONS=39} [2025-04-14 00:33:19,081 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 6 predicate places. [2025-04-14 00:33:19,081 INFO L485 AbstractCegarLoop]: Abstraction has has 36 places, 39 transitions, 190 flow [2025-04-14 00:33:19,082 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 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-14 00:33:19,082 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:33:19,082 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:33:19,092 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-04-14 00:33:19,282 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:33:19,282 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 00:33:19,283 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:33:19,283 INFO L85 PathProgramCache]: Analyzing trace with hash -2097902412, now seen corresponding path program 2 times [2025-04-14 00:33:19,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:33:19,283 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007680299] [2025-04-14 00:33:19,283 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:33:19,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:33:19,305 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-04-14 00:33:19,329 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 20 of 33 statements. [2025-04-14 00:33:19,329 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 00:33:19,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:33:19,485 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-04-14 00:33:19,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:33:19,485 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007680299] [2025-04-14 00:33:19,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007680299] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:33:19,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:33:19,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 00:33:19,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751433046] [2025-04-14 00:33:19,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:33:19,486 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 00:33:19,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:33:19,486 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 00:33:19,486 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-14 00:33:19,486 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2025-04-14 00:33:19,486 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 39 transitions, 190 flow. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 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-14 00:33:19,487 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:33:19,487 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2025-04-14 00:33:19,487 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:33:19,677 INFO L116 PetriNetUnfolderBase]: 502/754 cut-off events. [2025-04-14 00:33:19,677 INFO L117 PetriNetUnfolderBase]: For 85/85 co-relation queries the response was YES. [2025-04-14 00:33:19,679 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1702 conditions, 754 events. 502/754 cut-off events. For 85/85 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 2547 event pairs, 202 based on Foata normal form. 17/623 useless extension candidates. Maximal degree in co-relation 1613. Up to 460 conditions per place. [2025-04-14 00:33:19,682 INFO L140 encePairwiseOnDemand]: 26/30 looper letters, 63 selfloop transitions, 3 changer transitions 2/68 dead transitions. [2025-04-14 00:33:19,683 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 68 transitions, 405 flow [2025-04-14 00:33:19,683 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 00:33:19,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-14 00:33:19,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 66 transitions. [2025-04-14 00:33:19,683 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.55 [2025-04-14 00:33:19,684 INFO L175 Difference]: Start difference. First operand has 36 places, 39 transitions, 190 flow. Second operand 4 states and 66 transitions. [2025-04-14 00:33:19,684 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 68 transitions, 405 flow [2025-04-14 00:33:19,685 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 68 transitions, 381 flow, removed 9 selfloop flow, removed 1 redundant places. [2025-04-14 00:33:19,686 INFO L231 Difference]: Finished difference. Result has 40 places, 41 transitions, 186 flow [2025-04-14 00:33:19,686 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=186, PETRI_PLACES=40, PETRI_TRANSITIONS=41} [2025-04-14 00:33:19,688 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 10 predicate places. [2025-04-14 00:33:19,688 INFO L485 AbstractCegarLoop]: Abstraction has has 40 places, 41 transitions, 186 flow [2025-04-14 00:33:19,689 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 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-14 00:33:19,689 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:33:19,689 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:33:19,689 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-14 00:33:19,689 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 00:33:19,689 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:33:19,689 INFO L85 PathProgramCache]: Analyzing trace with hash -708441988, now seen corresponding path program 3 times [2025-04-14 00:33:19,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:33:19,690 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255380602] [2025-04-14 00:33:19,690 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 00:33:19,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:33:19,709 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 33 statements into 3 equivalence classes. [2025-04-14 00:33:19,722 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 20 of 33 statements. [2025-04-14 00:33:19,722 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-14 00:33:19,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:33:19,854 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-04-14 00:33:19,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:33:19,855 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255380602] [2025-04-14 00:33:19,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255380602] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:33:19,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:33:19,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 00:33:19,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506640129] [2025-04-14 00:33:19,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:33:19,855 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 00:33:19,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:33:19,856 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 00:33:19,856 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-14 00:33:19,856 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2025-04-14 00:33:19,856 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 41 transitions, 186 flow. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 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-14 00:33:19,856 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:33:19,856 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2025-04-14 00:33:19,856 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:33:20,070 INFO L116 PetriNetUnfolderBase]: 560/836 cut-off events. [2025-04-14 00:33:20,071 INFO L117 PetriNetUnfolderBase]: For 440/440 co-relation queries the response was YES. [2025-04-14 00:33:20,072 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2238 conditions, 836 events. 560/836 cut-off events. For 440/440 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2949 event pairs, 97 based on Foata normal form. 24/738 useless extension candidates. Maximal degree in co-relation 2158. Up to 567 conditions per place. [2025-04-14 00:33:20,075 INFO L140 encePairwiseOnDemand]: 24/30 looper letters, 58 selfloop transitions, 5 changer transitions 1/64 dead transitions. [2025-04-14 00:33:20,075 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 64 transitions, 392 flow [2025-04-14 00:33:20,075 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 00:33:20,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-14 00:33:20,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 58 transitions. [2025-04-14 00:33:20,076 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.48333333333333334 [2025-04-14 00:33:20,076 INFO L175 Difference]: Start difference. First operand has 40 places, 41 transitions, 186 flow. Second operand 4 states and 58 transitions. [2025-04-14 00:33:20,076 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 64 transitions, 392 flow [2025-04-14 00:33:20,077 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 64 transitions, 381 flow, removed 3 selfloop flow, removed 1 redundant places. [2025-04-14 00:33:20,078 INFO L231 Difference]: Finished difference. Result has 44 places, 43 transitions, 211 flow [2025-04-14 00:33:20,078 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=211, PETRI_PLACES=44, PETRI_TRANSITIONS=43} [2025-04-14 00:33:20,079 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 14 predicate places. [2025-04-14 00:33:20,079 INFO L485 AbstractCegarLoop]: Abstraction has has 44 places, 43 transitions, 211 flow [2025-04-14 00:33:20,079 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 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-14 00:33:20,079 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:33:20,079 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:33:20,079 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-14 00:33:20,079 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 00:33:20,080 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:33:20,080 INFO L85 PathProgramCache]: Analyzing trace with hash 1189207750, now seen corresponding path program 4 times [2025-04-14 00:33:20,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:33:20,080 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784286301] [2025-04-14 00:33:20,080 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 00:33:20,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:33:20,094 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 33 statements into 2 equivalence classes. [2025-04-14 00:33:20,107 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-04-14 00:33:20,107 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 00:33:20,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:33:20,255 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-04-14 00:33:20,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:33:20,255 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784286301] [2025-04-14 00:33:20,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784286301] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:33:20,255 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [328283053] [2025-04-14 00:33:20,255 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 00:33:20,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:33:20,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:33:20,257 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-14 00:33:20,258 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-14 00:33:20,331 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 33 statements into 2 equivalence classes. [2025-04-14 00:33:20,371 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-04-14 00:33:20,371 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 00:33:20,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:33:20,373 INFO L256 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-14 00:33:20,375 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:33:20,441 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-04-14 00:33:20,441 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:33:20,509 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-04-14 00:33:20,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [328283053] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:33:20,509 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:33:20,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 17 [2025-04-14 00:33:20,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526234033] [2025-04-14 00:33:20,509 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:33:20,509 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-04-14 00:33:20,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:33:20,510 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-04-14 00:33:20,510 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=166, Unknown=0, NotChecked=0, Total=272 [2025-04-14 00:33:20,510 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2025-04-14 00:33:20,510 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 43 transitions, 211 flow. Second operand has 17 states, 17 states have (on average 5.411764705882353) internal successors, (92), 17 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:33:20,510 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:33:20,510 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2025-04-14 00:33:20,510 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:33:20,647 INFO L116 PetriNetUnfolderBase]: 560/839 cut-off events. [2025-04-14 00:33:20,647 INFO L117 PetriNetUnfolderBase]: For 922/922 co-relation queries the response was YES. [2025-04-14 00:33:20,648 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2370 conditions, 839 events. 560/839 cut-off events. For 922/922 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2689 event pairs, 371 based on Foata normal form. 1/718 useless extension candidates. Maximal degree in co-relation 2275. Up to 825 conditions per place. [2025-04-14 00:33:20,650 INFO L140 encePairwiseOnDemand]: 23/30 looper letters, 28 selfloop transitions, 18 changer transitions 0/46 dead transitions. [2025-04-14 00:33:20,650 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 46 transitions, 321 flow [2025-04-14 00:33:20,651 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-14 00:33:20,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-14 00:33:20,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 65 transitions. [2025-04-14 00:33:20,651 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.30952380952380953 [2025-04-14 00:33:20,651 INFO L175 Difference]: Start difference. First operand has 44 places, 43 transitions, 211 flow. Second operand 7 states and 65 transitions. [2025-04-14 00:33:20,651 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 46 transitions, 321 flow [2025-04-14 00:33:20,653 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 46 transitions, 318 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-14 00:33:20,653 INFO L231 Difference]: Finished difference. Result has 50 places, 46 transitions, 276 flow [2025-04-14 00:33:20,654 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=276, PETRI_PLACES=50, PETRI_TRANSITIONS=46} [2025-04-14 00:33:20,654 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 20 predicate places. [2025-04-14 00:33:20,654 INFO L485 AbstractCegarLoop]: Abstraction has has 50 places, 46 transitions, 276 flow [2025-04-14 00:33:20,654 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 5.411764705882353) internal successors, (92), 17 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:33:20,654 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:33:20,654 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:33:20,661 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-04-14 00:33:20,859 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,SelfDestructingSolverStorable5 [2025-04-14 00:33:20,859 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 00:33:20,859 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:33:20,859 INFO L85 PathProgramCache]: Analyzing trace with hash 19031392, now seen corresponding path program 5 times [2025-04-14 00:33:20,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:33:20,859 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741175368] [2025-04-14 00:33:20,860 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 00:33:20,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:33:20,872 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 36 statements into 4 equivalence classes. [2025-04-14 00:33:20,903 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 36 of 36 statements. [2025-04-14 00:33:20,903 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-14 00:33:20,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:33:21,093 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-14 00:33:21,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:33:21,093 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741175368] [2025-04-14 00:33:21,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [741175368] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:33:21,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:33:21,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-14 00:33:21,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514006447] [2025-04-14 00:33:21,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:33:21,093 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 00:33:21,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:33:21,094 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 00:33:21,094 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-14 00:33:21,094 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2025-04-14 00:33:21,094 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 46 transitions, 276 flow. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 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-14 00:33:21,094 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:33:21,094 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2025-04-14 00:33:21,094 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:33:21,351 INFO L116 PetriNetUnfolderBase]: 986/1479 cut-off events. [2025-04-14 00:33:21,351 INFO L117 PetriNetUnfolderBase]: For 1272/1272 co-relation queries the response was YES. [2025-04-14 00:33:21,353 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4087 conditions, 1479 events. 986/1479 cut-off events. For 1272/1272 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 5980 event pairs, 359 based on Foata normal form. 16/1265 useless extension candidates. Maximal degree in co-relation 3972. Up to 869 conditions per place. [2025-04-14 00:33:21,359 INFO L140 encePairwiseOnDemand]: 25/30 looper letters, 73 selfloop transitions, 3 changer transitions 14/90 dead transitions. [2025-04-14 00:33:21,359 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 90 transitions, 633 flow [2025-04-14 00:33:21,360 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 00:33:21,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 00:33:21,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 75 transitions. [2025-04-14 00:33:21,360 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5 [2025-04-14 00:33:21,360 INFO L175 Difference]: Start difference. First operand has 50 places, 46 transitions, 276 flow. Second operand 5 states and 75 transitions. [2025-04-14 00:33:21,360 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 90 transitions, 633 flow [2025-04-14 00:33:21,362 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 90 transitions, 597 flow, removed 6 selfloop flow, removed 4 redundant places. [2025-04-14 00:33:21,363 INFO L231 Difference]: Finished difference. Result has 53 places, 48 transitions, 262 flow [2025-04-14 00:33:21,365 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=240, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=262, PETRI_PLACES=53, PETRI_TRANSITIONS=48} [2025-04-14 00:33:21,366 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 23 predicate places. [2025-04-14 00:33:21,366 INFO L485 AbstractCegarLoop]: Abstraction has has 53 places, 48 transitions, 262 flow [2025-04-14 00:33:21,366 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 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-14 00:33:21,366 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:33:21,367 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:33:21,367 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-14 00:33:21,367 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 00:33:21,367 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:33:21,367 INFO L85 PathProgramCache]: Analyzing trace with hash -684454976, now seen corresponding path program 6 times [2025-04-14 00:33:21,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:33:21,368 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961217901] [2025-04-14 00:33:21,368 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 00:33:21,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:33:21,382 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 36 statements into 4 equivalence classes. [2025-04-14 00:33:21,398 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 20 of 36 statements. [2025-04-14 00:33:21,399 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-14 00:33:21,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:33:21,518 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-04-14 00:33:21,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:33:21,518 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961217901] [2025-04-14 00:33:21,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961217901] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:33:21,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:33:21,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 00:33:21,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856522511] [2025-04-14 00:33:21,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:33:21,519 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 00:33:21,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:33:21,519 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 00:33:21,519 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-14 00:33:21,519 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2025-04-14 00:33:21,519 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 48 transitions, 262 flow. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 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-14 00:33:21,519 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:33:21,519 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2025-04-14 00:33:21,519 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:33:21,732 INFO L116 PetriNetUnfolderBase]: 780/1155 cut-off events. [2025-04-14 00:33:21,732 INFO L117 PetriNetUnfolderBase]: For 1708/1708 co-relation queries the response was YES. [2025-04-14 00:33:21,735 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3724 conditions, 1155 events. 780/1155 cut-off events. For 1708/1708 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 4270 event pairs, 306 based on Foata normal form. 48/1076 useless extension candidates. Maximal degree in co-relation 3623. Up to 792 conditions per place. [2025-04-14 00:33:21,738 INFO L140 encePairwiseOnDemand]: 26/30 looper letters, 67 selfloop transitions, 6 changer transitions 2/75 dead transitions. [2025-04-14 00:33:21,738 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 75 transitions, 521 flow [2025-04-14 00:33:21,739 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 00:33:21,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-14 00:33:21,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 62 transitions. [2025-04-14 00:33:21,739 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5166666666666667 [2025-04-14 00:33:21,740 INFO L175 Difference]: Start difference. First operand has 53 places, 48 transitions, 262 flow. Second operand 4 states and 62 transitions. [2025-04-14 00:33:21,740 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 75 transitions, 521 flow [2025-04-14 00:33:21,742 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 75 transitions, 504 flow, removed 6 selfloop flow, removed 2 redundant places. [2025-04-14 00:33:21,744 INFO L231 Difference]: Finished difference. Result has 54 places, 49 transitions, 279 flow [2025-04-14 00:33:21,744 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=256, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=279, PETRI_PLACES=54, PETRI_TRANSITIONS=49} [2025-04-14 00:33:21,744 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 24 predicate places. [2025-04-14 00:33:21,744 INFO L485 AbstractCegarLoop]: Abstraction has has 54 places, 49 transitions, 279 flow [2025-04-14 00:33:21,744 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 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-14 00:33:21,744 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:33:21,745 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:33:21,745 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-14 00:33:21,745 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 00:33:21,745 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:33:21,745 INFO L85 PathProgramCache]: Analyzing trace with hash -1919810653, now seen corresponding path program 1 times [2025-04-14 00:33:21,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:33:21,745 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871022642] [2025-04-14 00:33:21,745 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:33:21,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:33:21,760 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-04-14 00:33:21,788 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-04-14 00:33:21,788 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:33:21,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:33:22,025 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-04-14 00:33:22,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:33:22,025 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871022642] [2025-04-14 00:33:22,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871022642] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:33:22,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:33:22,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-14 00:33:22,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168455787] [2025-04-14 00:33:22,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:33:22,026 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 00:33:22,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:33:22,026 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 00:33:22,026 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-14 00:33:22,026 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2025-04-14 00:33:22,026 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 49 transitions, 279 flow. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 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-14 00:33:22,026 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:33:22,026 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2025-04-14 00:33:22,026 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:33:22,326 INFO L116 PetriNetUnfolderBase]: 952/1403 cut-off events. [2025-04-14 00:33:22,326 INFO L117 PetriNetUnfolderBase]: For 2465/2465 co-relation queries the response was YES. [2025-04-14 00:33:22,328 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4578 conditions, 1403 events. 952/1403 cut-off events. For 2465/2465 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 5447 event pairs, 267 based on Foata normal form. 24/1284 useless extension candidates. Maximal degree in co-relation 4477. Up to 728 conditions per place. [2025-04-14 00:33:22,332 INFO L140 encePairwiseOnDemand]: 25/30 looper letters, 82 selfloop transitions, 6 changer transitions 0/88 dead transitions. [2025-04-14 00:33:22,332 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 88 transitions, 633 flow [2025-04-14 00:33:22,332 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 00:33:22,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 00:33:22,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 75 transitions. [2025-04-14 00:33:22,334 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5 [2025-04-14 00:33:22,334 INFO L175 Difference]: Start difference. First operand has 54 places, 49 transitions, 279 flow. Second operand 5 states and 75 transitions. [2025-04-14 00:33:22,334 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 88 transitions, 633 flow [2025-04-14 00:33:22,337 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 88 transitions, 593 flow, removed 6 selfloop flow, removed 3 redundant places. [2025-04-14 00:33:22,338 INFO L231 Difference]: Finished difference. Result has 57 places, 52 transitions, 305 flow [2025-04-14 00:33:22,338 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=263, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=305, PETRI_PLACES=57, PETRI_TRANSITIONS=52} [2025-04-14 00:33:22,339 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 27 predicate places. [2025-04-14 00:33:22,340 INFO L485 AbstractCegarLoop]: Abstraction has has 57 places, 52 transitions, 305 flow [2025-04-14 00:33:22,340 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 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-14 00:33:22,340 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:33:22,340 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:33:22,340 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-14 00:33:22,340 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 00:33:22,340 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:33:22,340 INFO L85 PathProgramCache]: Analyzing trace with hash 370520823, now seen corresponding path program 2 times [2025-04-14 00:33:22,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:33:22,340 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39750696] [2025-04-14 00:33:22,340 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:33:22,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:33:22,354 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-04-14 00:33:22,383 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-04-14 00:33:22,383 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 00:33:22,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:33:22,587 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-04-14 00:33:22,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:33:22,587 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39750696] [2025-04-14 00:33:22,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39750696] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:33:22,588 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [259105109] [2025-04-14 00:33:22,588 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:33:22,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:33:22,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:33:22,591 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-14 00:33:22,592 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-14 00:33:22,677 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-04-14 00:33:22,720 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-04-14 00:33:22,720 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 00:33:22,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:33:22,722 INFO L256 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-14 00:33:22,724 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:33:22,770 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-04-14 00:33:22,770 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:33:22,819 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-04-14 00:33:22,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [259105109] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-14 00:33:22,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-14 00:33:22,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 8 [2025-04-14 00:33:22,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782868893] [2025-04-14 00:33:22,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:33:22,820 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 00:33:22,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:33:22,820 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 00:33:22,820 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-04-14 00:33:22,820 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2025-04-14 00:33:22,820 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 52 transitions, 305 flow. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 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-14 00:33:22,820 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:33:22,820 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2025-04-14 00:33:22,820 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:33:23,059 INFO L116 PetriNetUnfolderBase]: 1006/1479 cut-off events. [2025-04-14 00:33:23,059 INFO L117 PetriNetUnfolderBase]: For 2857/2857 co-relation queries the response was YES. [2025-04-14 00:33:23,062 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5103 conditions, 1479 events. 1006/1479 cut-off events. For 2857/2857 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 5660 event pairs, 158 based on Foata normal form. 22/1354 useless extension candidates. Maximal degree in co-relation 5000. Up to 615 conditions per place. [2025-04-14 00:33:23,065 INFO L140 encePairwiseOnDemand]: 23/30 looper letters, 86 selfloop transitions, 8 changer transitions 4/98 dead transitions. [2025-04-14 00:33:23,065 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 98 transitions, 745 flow [2025-04-14 00:33:23,066 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 00:33:23,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 00:33:23,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 71 transitions. [2025-04-14 00:33:23,066 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.47333333333333333 [2025-04-14 00:33:23,066 INFO L175 Difference]: Start difference. First operand has 57 places, 52 transitions, 305 flow. Second operand 5 states and 71 transitions. [2025-04-14 00:33:23,067 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 98 transitions, 745 flow [2025-04-14 00:33:23,073 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 98 transitions, 733 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-14 00:33:23,074 INFO L231 Difference]: Finished difference. Result has 62 places, 55 transitions, 359 flow [2025-04-14 00:33:23,074 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=301, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=359, PETRI_PLACES=62, PETRI_TRANSITIONS=55} [2025-04-14 00:33:23,077 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 32 predicate places. [2025-04-14 00:33:23,077 INFO L485 AbstractCegarLoop]: Abstraction has has 62 places, 55 transitions, 359 flow [2025-04-14 00:33:23,077 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 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-14 00:33:23,077 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:33:23,077 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:33:23,090 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-14 00:33:23,278 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-14 00:33:23,278 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 00:33:23,278 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:33:23,278 INFO L85 PathProgramCache]: Analyzing trace with hash 502121787, now seen corresponding path program 3 times [2025-04-14 00:33:23,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:33:23,278 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261544347] [2025-04-14 00:33:23,278 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 00:33:23,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:33:23,291 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 37 statements into 4 equivalence classes. [2025-04-14 00:33:23,315 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 28 of 37 statements. [2025-04-14 00:33:23,315 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-14 00:33:23,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:33:23,449 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-04-14 00:33:23,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:33:23,449 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261544347] [2025-04-14 00:33:23,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261544347] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:33:23,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:33:23,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-14 00:33:23,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512100984] [2025-04-14 00:33:23,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:33:23,450 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 00:33:23,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:33:23,450 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 00:33:23,450 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-14 00:33:23,450 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2025-04-14 00:33:23,450 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 55 transitions, 359 flow. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 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-14 00:33:23,450 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:33:23,450 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2025-04-14 00:33:23,450 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:33:23,737 INFO L116 PetriNetUnfolderBase]: 962/1409 cut-off events. [2025-04-14 00:33:23,738 INFO L117 PetriNetUnfolderBase]: For 3476/3476 co-relation queries the response was YES. [2025-04-14 00:33:23,741 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5070 conditions, 1409 events. 962/1409 cut-off events. For 3476/3476 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 5332 event pairs, 285 based on Foata normal form. 22/1288 useless extension candidates. Maximal degree in co-relation 4964. Up to 750 conditions per place. [2025-04-14 00:33:23,745 INFO L140 encePairwiseOnDemand]: 25/30 looper letters, 77 selfloop transitions, 10 changer transitions 4/91 dead transitions. [2025-04-14 00:33:23,745 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 91 transitions, 695 flow [2025-04-14 00:33:23,745 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 00:33:23,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 00:33:23,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 76 transitions. [2025-04-14 00:33:23,746 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5066666666666667 [2025-04-14 00:33:23,746 INFO L175 Difference]: Start difference. First operand has 62 places, 55 transitions, 359 flow. Second operand 5 states and 76 transitions. [2025-04-14 00:33:23,746 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 91 transitions, 695 flow [2025-04-14 00:33:23,751 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 91 transitions, 680 flow, removed 3 selfloop flow, removed 2 redundant places. [2025-04-14 00:33:23,752 INFO L231 Difference]: Finished difference. Result has 65 places, 56 transitions, 377 flow [2025-04-14 00:33:23,752 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=350, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=377, PETRI_PLACES=65, PETRI_TRANSITIONS=56} [2025-04-14 00:33:23,752 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 35 predicate places. [2025-04-14 00:33:23,752 INFO L485 AbstractCegarLoop]: Abstraction has has 65 places, 56 transitions, 377 flow [2025-04-14 00:33:23,752 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 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-14 00:33:23,752 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:33:23,752 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:33:23,753 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-14 00:33:23,753 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 00:33:23,753 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:33:23,753 INFO L85 PathProgramCache]: Analyzing trace with hash -746574759, now seen corresponding path program 4 times [2025-04-14 00:33:23,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:33:23,753 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405440906] [2025-04-14 00:33:23,753 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 00:33:23,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:33:23,766 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 37 statements into 2 equivalence classes. [2025-04-14 00:33:23,784 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-04-14 00:33:23,784 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 00:33:23,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:33:23,993 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-04-14 00:33:23,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:33:23,993 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405440906] [2025-04-14 00:33:23,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405440906] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:33:23,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:33:23,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-14 00:33:23,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891937637] [2025-04-14 00:33:23,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:33:23,994 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 00:33:23,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:33:23,994 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 00:33:23,994 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-14 00:33:23,994 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2025-04-14 00:33:23,994 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 56 transitions, 377 flow. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 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-14 00:33:23,994 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:33:23,994 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2025-04-14 00:33:23,994 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:33:24,233 INFO L116 PetriNetUnfolderBase]: 906/1328 cut-off events. [2025-04-14 00:33:24,233 INFO L117 PetriNetUnfolderBase]: For 3703/3703 co-relation queries the response was YES. [2025-04-14 00:33:24,235 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4914 conditions, 1328 events. 906/1328 cut-off events. For 3703/3703 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 4853 event pairs, 290 based on Foata normal form. 12/1201 useless extension candidates. Maximal degree in co-relation 4807. Up to 900 conditions per place. [2025-04-14 00:33:24,238 INFO L140 encePairwiseOnDemand]: 25/30 looper letters, 71 selfloop transitions, 8 changer transitions 14/93 dead transitions. [2025-04-14 00:33:24,238 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 93 transitions, 751 flow [2025-04-14 00:33:24,239 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 00:33:24,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 00:33:24,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 71 transitions. [2025-04-14 00:33:24,239 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.47333333333333333 [2025-04-14 00:33:24,239 INFO L175 Difference]: Start difference. First operand has 65 places, 56 transitions, 377 flow. Second operand 5 states and 71 transitions. [2025-04-14 00:33:24,239 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 93 transitions, 751 flow [2025-04-14 00:33:24,244 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 93 transitions, 719 flow, removed 4 selfloop flow, removed 4 redundant places. [2025-04-14 00:33:24,244 INFO L231 Difference]: Finished difference. Result has 66 places, 60 transitions, 427 flow [2025-04-14 00:33:24,245 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=353, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=427, PETRI_PLACES=66, PETRI_TRANSITIONS=60} [2025-04-14 00:33:24,245 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 36 predicate places. [2025-04-14 00:33:24,245 INFO L485 AbstractCegarLoop]: Abstraction has has 66 places, 60 transitions, 427 flow [2025-04-14 00:33:24,246 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 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-14 00:33:24,246 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:33:24,246 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:33:24,246 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-14 00:33:24,246 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 00:33:24,246 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:33:24,246 INFO L85 PathProgramCache]: Analyzing trace with hash 765809825, now seen corresponding path program 5 times [2025-04-14 00:33:24,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:33:24,246 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105308473] [2025-04-14 00:33:24,246 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 00:33:24,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:33:24,257 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 37 statements into 4 equivalence classes. [2025-04-14 00:33:24,274 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 37 of 37 statements. [2025-04-14 00:33:24,274 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-14 00:33:24,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:33:24,418 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-04-14 00:33:24,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:33:24,418 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105308473] [2025-04-14 00:33:24,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105308473] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:33:24,418 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [827415533] [2025-04-14 00:33:24,418 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 00:33:24,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:33:24,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:33:24,420 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-14 00:33:24,422 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-14 00:33:24,508 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 37 statements into 4 equivalence classes. [2025-04-14 00:33:24,712 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 37 of 37 statements. [2025-04-14 00:33:24,712 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-14 00:33:24,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:33:24,715 INFO L256 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-04-14 00:33:24,716 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:33:24,882 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-14 00:33:24,882 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:33:24,966 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-04-14 00:33:24,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [827415533] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-14 00:33:24,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-14 00:33:24,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 8] total 15 [2025-04-14 00:33:24,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972064031] [2025-04-14 00:33:24,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:33:24,967 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-14 00:33:24,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:33:24,967 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-14 00:33:24,968 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2025-04-14 00:33:24,968 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2025-04-14 00:33:24,968 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 60 transitions, 427 flow. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:33:24,968 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:33:24,968 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2025-04-14 00:33:24,968 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:33:25,304 INFO L116 PetriNetUnfolderBase]: 1350/1955 cut-off events. [2025-04-14 00:33:25,306 INFO L117 PetriNetUnfolderBase]: For 4542/4542 co-relation queries the response was YES. [2025-04-14 00:33:25,312 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7120 conditions, 1955 events. 1350/1955 cut-off events. For 4542/4542 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 8032 event pairs, 154 based on Foata normal form. 1/1733 useless extension candidates. Maximal degree in co-relation 7012. Up to 1137 conditions per place. [2025-04-14 00:33:25,319 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 101 selfloop transitions, 26 changer transitions 4/131 dead transitions. [2025-04-14 00:33:25,319 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 131 transitions, 1126 flow [2025-04-14 00:33:25,319 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 00:33:25,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-14 00:33:25,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 88 transitions. [2025-04-14 00:33:25,321 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4888888888888889 [2025-04-14 00:33:25,321 INFO L175 Difference]: Start difference. First operand has 66 places, 60 transitions, 427 flow. Second operand 6 states and 88 transitions. [2025-04-14 00:33:25,321 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 131 transitions, 1126 flow [2025-04-14 00:33:25,333 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 131 transitions, 1078 flow, removed 11 selfloop flow, removed 2 redundant places. [2025-04-14 00:33:25,334 INFO L231 Difference]: Finished difference. Result has 73 places, 83 transitions, 717 flow [2025-04-14 00:33:25,334 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=409, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=717, PETRI_PLACES=73, PETRI_TRANSITIONS=83} [2025-04-14 00:33:25,334 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 43 predicate places. [2025-04-14 00:33:25,335 INFO L485 AbstractCegarLoop]: Abstraction has has 73 places, 83 transitions, 717 flow [2025-04-14 00:33:25,335 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:33:25,335 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:33:25,335 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:33:25,343 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-04-14 00:33:25,540 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:33:25,540 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 00:33:25,541 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:33:25,541 INFO L85 PathProgramCache]: Analyzing trace with hash -1401359449, now seen corresponding path program 6 times [2025-04-14 00:33:25,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:33:25,541 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670945608] [2025-04-14 00:33:25,541 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 00:33:25,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:33:25,553 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 37 statements into 4 equivalence classes. [2025-04-14 00:33:25,584 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 31 of 37 statements. [2025-04-14 00:33:25,584 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-14 00:33:25,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:33:25,744 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-04-14 00:33:25,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:33:25,745 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670945608] [2025-04-14 00:33:25,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670945608] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:33:25,745 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1241116843] [2025-04-14 00:33:25,745 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 00:33:25,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:33:25,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:33:25,748 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-14 00:33:25,749 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-14 00:33:25,824 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 37 statements into 4 equivalence classes. [2025-04-14 00:33:25,860 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 31 of 37 statements. [2025-04-14 00:33:25,860 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-14 00:33:25,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:33:25,862 INFO L256 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-14 00:33:25,863 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:33:25,923 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-04-14 00:33:25,923 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:33:25,998 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-04-14 00:33:25,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1241116843] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-14 00:33:25,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-14 00:33:25,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 10 [2025-04-14 00:33:25,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514337238] [2025-04-14 00:33:25,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:33:25,999 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 00:33:25,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:33:25,999 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 00:33:25,999 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-04-14 00:33:26,000 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2025-04-14 00:33:26,000 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 83 transitions, 717 flow. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 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-14 00:33:26,000 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:33:26,000 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2025-04-14 00:33:26,000 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:33:26,261 INFO L116 PetriNetUnfolderBase]: 1312/1896 cut-off events. [2025-04-14 00:33:26,261 INFO L117 PetriNetUnfolderBase]: For 7525/7525 co-relation queries the response was YES. [2025-04-14 00:33:26,265 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7841 conditions, 1896 events. 1312/1896 cut-off events. For 7525/7525 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 7453 event pairs, 202 based on Foata normal form. 36/1831 useless extension candidates. Maximal degree in co-relation 7727. Up to 1186 conditions per place. [2025-04-14 00:33:26,272 INFO L140 encePairwiseOnDemand]: 23/30 looper letters, 85 selfloop transitions, 26 changer transitions 1/112 dead transitions. [2025-04-14 00:33:26,272 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 112 transitions, 1101 flow [2025-04-14 00:33:26,272 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 00:33:26,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 00:33:26,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2025-04-14 00:33:26,273 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.44666666666666666 [2025-04-14 00:33:26,273 INFO L175 Difference]: Start difference. First operand has 73 places, 83 transitions, 717 flow. Second operand 5 states and 67 transitions. [2025-04-14 00:33:26,273 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 112 transitions, 1101 flow [2025-04-14 00:33:26,283 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 112 transitions, 1083 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-04-14 00:33:26,285 INFO L231 Difference]: Finished difference. Result has 77 places, 82 transitions, 771 flow [2025-04-14 00:33:26,285 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=677, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=771, PETRI_PLACES=77, PETRI_TRANSITIONS=82} [2025-04-14 00:33:26,285 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 47 predicate places. [2025-04-14 00:33:26,285 INFO L485 AbstractCegarLoop]: Abstraction has has 77 places, 82 transitions, 771 flow [2025-04-14 00:33:26,285 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 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-14 00:33:26,285 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:33:26,285 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:33:26,292 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-14 00:33:26,486 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,SelfDestructingSolverStorable13 [2025-04-14 00:33:26,486 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 00:33:26,487 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:33:26,487 INFO L85 PathProgramCache]: Analyzing trace with hash 1758637411, now seen corresponding path program 1 times [2025-04-14 00:33:26,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:33:26,487 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130085414] [2025-04-14 00:33:26,487 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:33:26,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:33:26,497 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-04-14 00:33:26,537 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-04-14 00:33:26,537 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:33:26,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:33:27,322 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-14 00:33:27,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:33:27,323 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130085414] [2025-04-14 00:33:27,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130085414] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:33:27,323 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [583747761] [2025-04-14 00:33:27,323 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:33:27,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:33:27,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:33:27,327 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-14 00:33:27,328 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-14 00:33:27,418 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-04-14 00:33:27,461 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-04-14 00:33:27,462 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:33:27,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:33:27,463 INFO L256 TraceCheckSpWp]: Trace formula consists of 431 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-04-14 00:33:27,466 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:33:27,700 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 00:33:27,701 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 40 treesize of output 52 [2025-04-14 00:33:27,718 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-14 00:33:27,718 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:33:28,049 INFO L325 Elim1Store]: treesize reduction 32, result has 73.6 percent of original size [2025-04-14 00:33:28,049 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 46 treesize of output 102 [2025-04-14 00:33:28,167 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-14 00:33:28,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [583747761] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:33:28,167 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:33:28,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 8] total 27 [2025-04-14 00:33:28,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148318527] [2025-04-14 00:33:28,167 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:33:28,168 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-04-14 00:33:28,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:33:28,168 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-04-14 00:33:28,168 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=659, Unknown=0, NotChecked=0, Total=756 [2025-04-14 00:33:28,169 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2025-04-14 00:33:28,169 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 82 transitions, 771 flow. Second operand has 28 states, 28 states have (on average 5.285714285714286) internal successors, (148), 28 states have internal predecessors, (148), 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-14 00:33:28,169 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:33:28,169 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2025-04-14 00:33:28,169 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:33:29,463 INFO L116 PetriNetUnfolderBase]: 2610/3765 cut-off events. [2025-04-14 00:33:29,464 INFO L117 PetriNetUnfolderBase]: For 14348/14348 co-relation queries the response was YES. [2025-04-14 00:33:29,477 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15601 conditions, 3765 events. 2610/3765 cut-off events. For 14348/14348 co-relation queries the response was YES. Maximal size of possible extension queue 231. Compared 17393 event pairs, 298 based on Foata normal form. 1/3515 useless extension candidates. Maximal degree in co-relation 15485. Up to 1293 conditions per place. [2025-04-14 00:33:29,497 INFO L140 encePairwiseOnDemand]: 19/30 looper letters, 167 selfloop transitions, 84 changer transitions 9/260 dead transitions. [2025-04-14 00:33:29,497 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 260 transitions, 2592 flow [2025-04-14 00:33:29,498 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-14 00:33:29,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-04-14 00:33:29,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 199 transitions. [2025-04-14 00:33:29,499 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.39019607843137255 [2025-04-14 00:33:29,499 INFO L175 Difference]: Start difference. First operand has 77 places, 82 transitions, 771 flow. Second operand 17 states and 199 transitions. [2025-04-14 00:33:29,499 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 260 transitions, 2592 flow [2025-04-14 00:33:29,530 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 260 transitions, 2476 flow, removed 13 selfloop flow, removed 4 redundant places. [2025-04-14 00:33:29,533 INFO L231 Difference]: Finished difference. Result has 96 places, 153 transitions, 1714 flow [2025-04-14 00:33:29,533 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=732, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=1714, PETRI_PLACES=96, PETRI_TRANSITIONS=153} [2025-04-14 00:33:29,533 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 66 predicate places. [2025-04-14 00:33:29,533 INFO L485 AbstractCegarLoop]: Abstraction has has 96 places, 153 transitions, 1714 flow [2025-04-14 00:33:29,533 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 5.285714285714286) internal successors, (148), 28 states have internal predecessors, (148), 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-14 00:33:29,533 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:33:29,533 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:33:29,540 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-04-14 00:33:29,734 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-04-14 00:33:29,734 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 00:33:29,734 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:33:29,734 INFO L85 PathProgramCache]: Analyzing trace with hash 2051704291, now seen corresponding path program 2 times [2025-04-14 00:33:29,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:33:29,734 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964640643] [2025-04-14 00:33:29,735 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:33:29,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:33:29,749 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 2 equivalence classes. [2025-04-14 00:33:29,777 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-04-14 00:33:29,777 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 00:33:29,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:33:30,442 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-14 00:33:30,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:33:30,442 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964640643] [2025-04-14 00:33:30,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964640643] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:33:30,442 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [577216130] [2025-04-14 00:33:30,442 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:33:30,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:33:30,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:33:30,445 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-14 00:33:30,446 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-14 00:33:30,533 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 2 equivalence classes. [2025-04-14 00:33:30,566 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-04-14 00:33:30,567 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 00:33:30,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:33:30,568 INFO L256 TraceCheckSpWp]: Trace formula consists of 431 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-04-14 00:33:30,569 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:33:30,832 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 00:33:30,832 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 40 treesize of output 40 [2025-04-14 00:33:30,877 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-14 00:33:30,877 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:33:31,147 INFO L325 Elim1Store]: treesize reduction 32, result has 73.6 percent of original size [2025-04-14 00:33:31,147 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 46 treesize of output 102 [2025-04-14 00:33:31,257 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-14 00:33:31,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [577216130] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:33:31,257 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:33:31,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 8] total 28 [2025-04-14 00:33:31,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689796811] [2025-04-14 00:33:31,257 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:33:31,257 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-04-14 00:33:31,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:33:31,258 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-04-14 00:33:31,258 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=696, Unknown=0, NotChecked=0, Total=812 [2025-04-14 00:33:31,258 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2025-04-14 00:33:31,258 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 153 transitions, 1714 flow. Second operand has 29 states, 29 states have (on average 5.206896551724138) internal successors, (151), 29 states have internal predecessors, (151), 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-14 00:33:31,259 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:33:31,259 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2025-04-14 00:33:31,259 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:33:32,532 INFO L116 PetriNetUnfolderBase]: 2894/4175 cut-off events. [2025-04-14 00:33:32,532 INFO L117 PetriNetUnfolderBase]: For 22268/22268 co-relation queries the response was YES. [2025-04-14 00:33:32,542 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19782 conditions, 4175 events. 2894/4175 cut-off events. For 22268/22268 co-relation queries the response was YES. Maximal size of possible extension queue 263. Compared 19747 event pairs, 369 based on Foata normal form. 1/4176 useless extension candidates. Maximal degree in co-relation 19658. Up to 1419 conditions per place. [2025-04-14 00:33:32,553 INFO L140 encePairwiseOnDemand]: 19/30 looper letters, 169 selfloop transitions, 100 changer transitions 43/312 dead transitions. [2025-04-14 00:33:32,553 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 312 transitions, 3434 flow [2025-04-14 00:33:32,553 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-14 00:33:32,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-04-14 00:33:32,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 241 transitions. [2025-04-14 00:33:32,555 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3825396825396825 [2025-04-14 00:33:32,556 INFO L175 Difference]: Start difference. First operand has 96 places, 153 transitions, 1714 flow. Second operand 21 states and 241 transitions. [2025-04-14 00:33:32,556 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 312 transitions, 3434 flow [2025-04-14 00:33:32,605 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 312 transitions, 3371 flow, removed 30 selfloop flow, removed 2 redundant places. [2025-04-14 00:33:32,609 INFO L231 Difference]: Finished difference. Result has 122 places, 173 transitions, 2161 flow [2025-04-14 00:33:32,609 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=1661, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=81, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=2161, PETRI_PLACES=122, PETRI_TRANSITIONS=173} [2025-04-14 00:33:32,610 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 92 predicate places. [2025-04-14 00:33:32,610 INFO L485 AbstractCegarLoop]: Abstraction has has 122 places, 173 transitions, 2161 flow [2025-04-14 00:33:32,610 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 5.206896551724138) internal successors, (151), 29 states have internal predecessors, (151), 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-14 00:33:32,610 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:33:32,610 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:33:32,616 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-14 00:33:32,810 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:33:32,811 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 00:33:32,811 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:33:32,811 INFO L85 PathProgramCache]: Analyzing trace with hash 1849033805, now seen corresponding path program 3 times [2025-04-14 00:33:32,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:33:32,811 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411475553] [2025-04-14 00:33:32,812 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 00:33:32,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:33:32,823 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 38 statements into 4 equivalence classes. [2025-04-14 00:33:32,859 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 29 of 38 statements. [2025-04-14 00:33:32,859 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-14 00:33:32,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:33:33,380 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-14 00:33:33,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:33:33,380 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411475553] [2025-04-14 00:33:33,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411475553] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:33:33,380 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [646228715] [2025-04-14 00:33:33,380 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 00:33:33,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:33:33,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:33:33,382 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-14 00:33:33,383 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-14 00:33:33,462 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 38 statements into 4 equivalence classes. [2025-04-14 00:33:33,496 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 29 of 38 statements. [2025-04-14 00:33:33,497 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-14 00:33:33,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:33:33,499 INFO L256 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-04-14 00:33:33,501 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:33:33,704 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 00:33:33,705 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 40 treesize of output 40 [2025-04-14 00:33:33,755 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-14 00:33:33,755 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:33:33,985 INFO L325 Elim1Store]: treesize reduction 32, result has 73.6 percent of original size [2025-04-14 00:33:33,986 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 46 treesize of output 102 [2025-04-14 00:33:34,070 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-14 00:33:34,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [646228715] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:33:34,070 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:33:34,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 8] total 28 [2025-04-14 00:33:34,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129175205] [2025-04-14 00:33:34,071 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:33:34,071 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-04-14 00:33:34,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:33:34,071 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-04-14 00:33:34,072 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=691, Unknown=0, NotChecked=0, Total=812 [2025-04-14 00:33:34,072 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2025-04-14 00:33:34,072 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 173 transitions, 2161 flow. Second operand has 29 states, 29 states have (on average 5.206896551724138) internal successors, (151), 29 states have internal predecessors, (151), 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-14 00:33:34,072 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:33:34,072 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2025-04-14 00:33:34,072 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:33:35,254 INFO L116 PetriNetUnfolderBase]: 2675/3865 cut-off events. [2025-04-14 00:33:35,254 INFO L117 PetriNetUnfolderBase]: For 37735/37735 co-relation queries the response was YES. [2025-04-14 00:33:35,264 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23671 conditions, 3865 events. 2675/3865 cut-off events. For 37735/37735 co-relation queries the response was YES. Maximal size of possible extension queue 237. Compared 18054 event pairs, 463 based on Foata normal form. 1/3866 useless extension candidates. Maximal degree in co-relation 23539. Up to 1454 conditions per place. [2025-04-14 00:33:35,277 INFO L140 encePairwiseOnDemand]: 19/30 looper letters, 169 selfloop transitions, 94 changer transitions 3/266 dead transitions. [2025-04-14 00:33:35,277 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 266 transitions, 3410 flow [2025-04-14 00:33:35,279 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-14 00:33:35,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-04-14 00:33:35,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 176 transitions. [2025-04-14 00:33:35,280 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2025-04-14 00:33:35,280 INFO L175 Difference]: Start difference. First operand has 122 places, 173 transitions, 2161 flow. Second operand 16 states and 176 transitions. [2025-04-14 00:33:35,280 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 266 transitions, 3410 flow [2025-04-14 00:33:35,357 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 266 transitions, 3256 flow, removed 40 selfloop flow, removed 9 redundant places. [2025-04-14 00:33:35,360 INFO L231 Difference]: Finished difference. Result has 127 places, 177 transitions, 2266 flow [2025-04-14 00:33:35,360 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=2017, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=173, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=90, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=2266, PETRI_PLACES=127, PETRI_TRANSITIONS=177} [2025-04-14 00:33:35,360 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 97 predicate places. [2025-04-14 00:33:35,360 INFO L485 AbstractCegarLoop]: Abstraction has has 127 places, 177 transitions, 2266 flow [2025-04-14 00:33:35,360 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 5.206896551724138) internal successors, (151), 29 states have internal predecessors, (151), 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-14 00:33:35,360 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:33:35,360 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:33:35,367 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-14 00:33:35,561 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,SelfDestructingSolverStorable16 [2025-04-14 00:33:35,561 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 00:33:35,562 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:33:35,562 INFO L85 PathProgramCache]: Analyzing trace with hash 128923771, now seen corresponding path program 4 times [2025-04-14 00:33:35,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:33:35,562 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442307298] [2025-04-14 00:33:35,562 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 00:33:35,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:33:35,573 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 38 statements into 2 equivalence classes. [2025-04-14 00:33:35,608 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-04-14 00:33:35,608 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 00:33:35,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:33:36,296 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-14 00:33:36,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:33:36,296 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442307298] [2025-04-14 00:33:36,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442307298] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:33:36,296 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2124857329] [2025-04-14 00:33:36,296 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 00:33:36,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:33:36,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:33:36,298 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-14 00:33:36,299 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-14 00:33:36,409 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 38 statements into 2 equivalence classes. [2025-04-14 00:33:36,449 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-04-14 00:33:36,449 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 00:33:36,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:33:36,452 INFO L256 TraceCheckSpWp]: Trace formula consists of 431 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-04-14 00:33:36,453 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:33:36,583 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 00:33:36,583 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 40 treesize of output 52 [2025-04-14 00:33:36,617 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-14 00:33:36,617 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:33:40,975 INFO L325 Elim1Store]: treesize reduction 32, result has 73.6 percent of original size [2025-04-14 00:33:40,975 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 46 treesize of output 102 [2025-04-14 00:33:41,094 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-14 00:33:41,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2124857329] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:33:41,094 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:33:41,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 8] total 27 [2025-04-14 00:33:41,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087709013] [2025-04-14 00:33:41,094 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:33:41,094 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-04-14 00:33:41,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:33:41,095 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-04-14 00:33:41,095 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=655, Unknown=1, NotChecked=0, Total=756 [2025-04-14 00:33:41,095 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2025-04-14 00:33:41,096 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 177 transitions, 2266 flow. Second operand has 28 states, 28 states have (on average 5.107142857142857) internal successors, (143), 28 states have internal predecessors, (143), 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-14 00:33:41,096 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:33:41,096 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2025-04-14 00:33:41,096 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:33:44,406 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.11s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 00:33:46,158 INFO L116 PetriNetUnfolderBase]: 2689/3891 cut-off events. [2025-04-14 00:33:46,158 INFO L117 PetriNetUnfolderBase]: For 41812/41812 co-relation queries the response was YES. [2025-04-14 00:33:46,170 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24494 conditions, 3891 events. 2689/3891 cut-off events. For 41812/41812 co-relation queries the response was YES. Maximal size of possible extension queue 238. Compared 18229 event pairs, 466 based on Foata normal form. 1/3881 useless extension candidates. Maximal degree in co-relation 24360. Up to 1429 conditions per place. [2025-04-14 00:33:46,181 INFO L140 encePairwiseOnDemand]: 19/30 looper letters, 171 selfloop transitions, 104 changer transitions 3/278 dead transitions. [2025-04-14 00:33:46,181 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 278 transitions, 3548 flow [2025-04-14 00:33:46,181 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-14 00:33:46,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-04-14 00:33:46,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 206 transitions. [2025-04-14 00:33:46,182 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.36140350877192984 [2025-04-14 00:33:46,182 INFO L175 Difference]: Start difference. First operand has 127 places, 177 transitions, 2266 flow. Second operand 19 states and 206 transitions. [2025-04-14 00:33:46,182 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 278 transitions, 3548 flow [2025-04-14 00:33:46,247 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 278 transitions, 3412 flow, removed 6 selfloop flow, removed 11 redundant places. [2025-04-14 00:33:46,250 INFO L231 Difference]: Finished difference. Result has 135 places, 179 transitions, 2373 flow [2025-04-14 00:33:46,250 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=2131, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=177, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=102, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=2373, PETRI_PLACES=135, PETRI_TRANSITIONS=179} [2025-04-14 00:33:46,251 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 105 predicate places. [2025-04-14 00:33:46,251 INFO L485 AbstractCegarLoop]: Abstraction has has 135 places, 179 transitions, 2373 flow [2025-04-14 00:33:46,251 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 5.107142857142857) internal successors, (143), 28 states have internal predecessors, (143), 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-14 00:33:46,251 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:33:46,251 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:33:46,261 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-04-14 00:33:46,451 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,SelfDestructingSolverStorable17 [2025-04-14 00:33:46,452 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 00:33:46,452 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:33:46,452 INFO L85 PathProgramCache]: Analyzing trace with hash 496940095, now seen corresponding path program 5 times [2025-04-14 00:33:46,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:33:46,452 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399439164] [2025-04-14 00:33:46,452 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 00:33:46,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:33:46,463 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 38 statements into 4 equivalence classes. [2025-04-14 00:33:46,499 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 38 of 38 statements. [2025-04-14 00:33:46,499 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-14 00:33:46,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:33:47,209 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-04-14 00:33:47,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:33:47,209 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399439164] [2025-04-14 00:33:47,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399439164] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:33:47,209 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2135992445] [2025-04-14 00:33:47,209 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 00:33:47,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:33:47,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:33:47,213 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-14 00:33:47,221 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-14 00:33:47,317 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 38 statements into 4 equivalence classes. [2025-04-14 00:33:47,574 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 38 of 38 statements. [2025-04-14 00:33:47,574 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-14 00:33:47,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:33:47,577 INFO L256 TraceCheckSpWp]: Trace formula consists of 431 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-04-14 00:33:47,578 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:33:47,884 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 00:33:47,885 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 40 treesize of output 48 [2025-04-14 00:33:47,931 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-14 00:33:47,931 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:33:48,278 INFO L325 Elim1Store]: treesize reduction 32, result has 73.6 percent of original size [2025-04-14 00:33:48,278 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 46 treesize of output 102 [2025-04-14 00:33:48,382 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-14 00:33:48,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2135992445] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:33:48,382 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:33:48,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 8] total 29 [2025-04-14 00:33:48,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300623479] [2025-04-14 00:33:48,382 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:33:48,383 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-04-14 00:33:48,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:33:48,383 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-04-14 00:33:48,383 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=761, Unknown=0, NotChecked=0, Total=870 [2025-04-14 00:33:48,383 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2025-04-14 00:33:48,384 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 179 transitions, 2373 flow. Second operand has 30 states, 30 states have (on average 5.2) internal successors, (156), 30 states have internal predecessors, (156), 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-14 00:33:48,384 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:33:48,384 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2025-04-14 00:33:48,384 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:33:50,928 INFO L116 PetriNetUnfolderBase]: 3146/4581 cut-off events. [2025-04-14 00:33:50,928 INFO L117 PetriNetUnfolderBase]: For 50709/50709 co-relation queries the response was YES. [2025-04-14 00:33:50,942 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29447 conditions, 4581 events. 3146/4581 cut-off events. For 50709/50709 co-relation queries the response was YES. Maximal size of possible extension queue 279. Compared 22283 event pairs, 414 based on Foata normal form. 1/4582 useless extension candidates. Maximal degree in co-relation 29312. Up to 1377 conditions per place. [2025-04-14 00:33:50,953 INFO L140 encePairwiseOnDemand]: 13/30 looper letters, 227 selfloop transitions, 164 changer transitions 22/413 dead transitions. [2025-04-14 00:33:50,953 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 413 transitions, 5253 flow [2025-04-14 00:33:50,954 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-04-14 00:33:50,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2025-04-14 00:33:50,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 365 transitions. [2025-04-14 00:33:50,955 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.35784313725490197 [2025-04-14 00:33:50,955 INFO L175 Difference]: Start difference. First operand has 135 places, 179 transitions, 2373 flow. Second operand 34 states and 365 transitions. [2025-04-14 00:33:50,955 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 413 transitions, 5253 flow [2025-04-14 00:33:51,036 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 413 transitions, 5041 flow, removed 1 selfloop flow, removed 16 redundant places. [2025-04-14 00:33:51,040 INFO L231 Difference]: Finished difference. Result has 167 places, 250 transitions, 3712 flow [2025-04-14 00:33:51,040 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=2215, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=179, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=97, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=34, PETRI_FLOW=3712, PETRI_PLACES=167, PETRI_TRANSITIONS=250} [2025-04-14 00:33:51,040 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 137 predicate places. [2025-04-14 00:33:51,040 INFO L485 AbstractCegarLoop]: Abstraction has has 167 places, 250 transitions, 3712 flow [2025-04-14 00:33:51,040 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 5.2) internal successors, (156), 30 states have internal predecessors, (156), 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-14 00:33:51,040 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:33:51,040 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:33:51,047 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-04-14 00:33:51,241 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:33:51,241 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 00:33:51,241 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:33:51,241 INFO L85 PathProgramCache]: Analyzing trace with hash -9155511, now seen corresponding path program 6 times [2025-04-14 00:33:51,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:33:51,242 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226149200] [2025-04-14 00:33:51,242 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 00:33:51,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:33:51,253 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 38 statements into 4 equivalence classes. [2025-04-14 00:33:51,276 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 32 of 38 statements. [2025-04-14 00:33:51,276 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-14 00:33:51,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:33:51,836 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-14 00:33:51,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:33:51,837 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226149200] [2025-04-14 00:33:51,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226149200] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:33:51,837 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1027782151] [2025-04-14 00:33:51,837 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 00:33:51,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:33:51,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:33:51,839 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-14 00:33:51,840 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-14 00:33:51,940 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 38 statements into 4 equivalence classes. [2025-04-14 00:33:51,973 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 32 of 38 statements. [2025-04-14 00:33:51,974 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-14 00:33:51,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:33:51,975 INFO L256 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-04-14 00:33:51,978 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:33:52,267 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 00:33:52,267 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 40 treesize of output 40 [2025-04-14 00:33:52,315 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-14 00:33:52,315 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:33:52,665 INFO L325 Elim1Store]: treesize reduction 32, result has 73.6 percent of original size [2025-04-14 00:33:52,666 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 46 treesize of output 102 [2025-04-14 00:33:52,802 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-14 00:33:52,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1027782151] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:33:52,803 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:33:52,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 8] total 28 [2025-04-14 00:33:52,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831777420] [2025-04-14 00:33:52,803 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:33:52,803 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-04-14 00:33:52,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:33:52,803 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-04-14 00:33:52,804 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=696, Unknown=0, NotChecked=0, Total=812 [2025-04-14 00:33:52,804 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2025-04-14 00:33:52,804 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 250 transitions, 3712 flow. Second operand has 29 states, 29 states have (on average 5.206896551724138) internal successors, (151), 29 states have internal predecessors, (151), 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-14 00:33:52,804 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:33:52,804 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2025-04-14 00:33:52,804 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:33:54,321 INFO L116 PetriNetUnfolderBase]: 3184/4639 cut-off events. [2025-04-14 00:33:54,321 INFO L117 PetriNetUnfolderBase]: For 78656/78656 co-relation queries the response was YES. [2025-04-14 00:33:54,340 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36187 conditions, 4639 events. 3184/4639 cut-off events. For 78656/78656 co-relation queries the response was YES. Maximal size of possible extension queue 283. Compared 22655 event pairs, 656 based on Foata normal form. 1/4640 useless extension candidates. Maximal degree in co-relation 36033. Up to 1950 conditions per place. [2025-04-14 00:33:54,354 INFO L140 encePairwiseOnDemand]: 19/30 looper letters, 214 selfloop transitions, 126 changer transitions 6/346 dead transitions. [2025-04-14 00:33:54,354 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 346 transitions, 5275 flow [2025-04-14 00:33:54,354 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-14 00:33:54,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-04-14 00:33:54,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 202 transitions. [2025-04-14 00:33:54,355 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.37407407407407406 [2025-04-14 00:33:54,355 INFO L175 Difference]: Start difference. First operand has 167 places, 250 transitions, 3712 flow. Second operand 18 states and 202 transitions. [2025-04-14 00:33:54,355 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 346 transitions, 5275 flow [2025-04-14 00:33:54,553 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 346 transitions, 4865 flow, removed 97 selfloop flow, removed 15 redundant places. [2025-04-14 00:33:54,557 INFO L231 Difference]: Finished difference. Result has 171 places, 256 transitions, 3683 flow [2025-04-14 00:33:54,557 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=3311, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=250, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=121, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=3683, PETRI_PLACES=171, PETRI_TRANSITIONS=256} [2025-04-14 00:33:54,557 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 141 predicate places. [2025-04-14 00:33:54,557 INFO L485 AbstractCegarLoop]: Abstraction has has 171 places, 256 transitions, 3683 flow [2025-04-14 00:33:54,558 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 5.206896551724138) internal successors, (151), 29 states have internal predecessors, (151), 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-14 00:33:54,558 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:33:54,558 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:33:54,564 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-14 00:33:54,759 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:33:54,759 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 00:33:54,759 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:33:54,759 INFO L85 PathProgramCache]: Analyzing trace with hash -1908077913, now seen corresponding path program 7 times [2025-04-14 00:33:54,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:33:54,759 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710129944] [2025-04-14 00:33:54,760 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 00:33:54,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:33:54,770 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-04-14 00:33:54,796 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-04-14 00:33:54,796 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:33:54,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:33:55,687 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-14 00:33:55,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:33:55,687 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710129944] [2025-04-14 00:33:55,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710129944] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:33:55,687 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2079761901] [2025-04-14 00:33:55,688 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 00:33:55,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:33:55,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:33:55,690 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-14 00:33:55,691 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-14 00:33:55,790 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-04-14 00:33:55,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-04-14 00:33:55,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:33:55,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:33:55,830 INFO L256 TraceCheckSpWp]: Trace formula consists of 431 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-04-14 00:33:55,831 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:33:55,961 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 00:33:55,961 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 40 treesize of output 52 [2025-04-14 00:33:55,989 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-14 00:33:55,990 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:34:00,339 INFO L325 Elim1Store]: treesize reduction 32, result has 73.6 percent of original size [2025-04-14 00:34:00,339 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 46 treesize of output 102 [2025-04-14 00:34:00,460 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-14 00:34:00,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2079761901] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:34:00,460 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:34:00,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 8] total 26 [2025-04-14 00:34:00,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215544183] [2025-04-14 00:34:00,461 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:34:00,461 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-04-14 00:34:00,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:34:00,461 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-04-14 00:34:00,462 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=599, Unknown=1, NotChecked=0, Total=702 [2025-04-14 00:34:00,462 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2025-04-14 00:34:00,462 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 256 transitions, 3683 flow. Second operand has 27 states, 27 states have (on average 5.148148148148148) internal successors, (139), 27 states have internal predecessors, (139), 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-14 00:34:00,462 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:34:00,462 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2025-04-14 00:34:00,462 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:34:04,542 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 00:34:06,337 INFO L116 PetriNetUnfolderBase]: 3198/4665 cut-off events. [2025-04-14 00:34:06,338 INFO L117 PetriNetUnfolderBase]: For 78324/78324 co-relation queries the response was YES. [2025-04-14 00:34:06,357 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36214 conditions, 4665 events. 3198/4665 cut-off events. For 78324/78324 co-relation queries the response was YES. Maximal size of possible extension queue 285. Compared 22854 event pairs, 679 based on Foata normal form. 1/4666 useless extension candidates. Maximal degree in co-relation 36064. Up to 1980 conditions per place. [2025-04-14 00:34:06,373 INFO L140 encePairwiseOnDemand]: 19/30 looper letters, 217 selfloop transitions, 117 changer transitions 7/341 dead transitions. [2025-04-14 00:34:06,374 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 341 transitions, 5165 flow [2025-04-14 00:34:06,374 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-14 00:34:06,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-04-14 00:34:06,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 178 transitions. [2025-04-14 00:34:06,375 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.37083333333333335 [2025-04-14 00:34:06,375 INFO L175 Difference]: Start difference. First operand has 171 places, 256 transitions, 3683 flow. Second operand 16 states and 178 transitions. [2025-04-14 00:34:06,375 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 341 transitions, 5165 flow [2025-04-14 00:34:06,535 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 341 transitions, 4921 flow, removed 27 selfloop flow, removed 14 redundant places. [2025-04-14 00:34:06,539 INFO L231 Difference]: Finished difference. Result has 173 places, 259 transitions, 3741 flow [2025-04-14 00:34:06,539 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=3444, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=256, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=114, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=3741, PETRI_PLACES=173, PETRI_TRANSITIONS=259} [2025-04-14 00:34:06,539 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 143 predicate places. [2025-04-14 00:34:06,539 INFO L485 AbstractCegarLoop]: Abstraction has has 173 places, 259 transitions, 3741 flow [2025-04-14 00:34:06,539 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 5.148148148148148) internal successors, (139), 27 states have internal predecessors, (139), 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-14 00:34:06,539 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:34:06,539 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:34:06,546 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-04-14 00:34:06,740 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2025-04-14 00:34:06,740 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 00:34:06,740 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:34:06,740 INFO L85 PathProgramCache]: Analyzing trace with hash -1551454989, now seen corresponding path program 8 times [2025-04-14 00:34:06,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:34:06,741 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430750031] [2025-04-14 00:34:06,741 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:34:06,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:34:06,750 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 2 equivalence classes. [2025-04-14 00:34:06,827 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-04-14 00:34:06,828 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 00:34:06,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:34:07,583 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-14 00:34:07,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:34:07,583 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430750031] [2025-04-14 00:34:07,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430750031] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:34:07,583 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [255049246] [2025-04-14 00:34:07,583 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:34:07,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:34:07,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:34:07,585 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-14 00:34:07,587 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-14 00:34:07,707 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 2 equivalence classes. [2025-04-14 00:34:07,741 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-04-14 00:34:07,741 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 00:34:07,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:34:07,743 INFO L256 TraceCheckSpWp]: Trace formula consists of 431 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-04-14 00:34:07,744 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:34:07,979 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 00:34:07,980 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 40 treesize of output 40 [2025-04-14 00:34:08,059 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-14 00:34:08,060 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:34:08,431 INFO L325 Elim1Store]: treesize reduction 32, result has 73.6 percent of original size [2025-04-14 00:34:08,431 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 46 treesize of output 102 [2025-04-14 00:34:08,505 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-14 00:34:08,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [255049246] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:34:08,506 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:34:08,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 8] total 28 [2025-04-14 00:34:08,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741030261] [2025-04-14 00:34:08,506 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:34:08,506 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-04-14 00:34:08,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:34:08,507 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-04-14 00:34:08,507 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=691, Unknown=0, NotChecked=0, Total=812 [2025-04-14 00:34:08,507 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2025-04-14 00:34:08,507 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 259 transitions, 3741 flow. Second operand has 29 states, 29 states have (on average 5.206896551724138) internal successors, (151), 29 states have internal predecessors, (151), 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-14 00:34:08,507 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:34:08,507 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2025-04-14 00:34:08,507 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:34:10,285 INFO L116 PetriNetUnfolderBase]: 3198/4664 cut-off events. [2025-04-14 00:34:10,286 INFO L117 PetriNetUnfolderBase]: For 78753/78753 co-relation queries the response was YES. [2025-04-14 00:34:10,301 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36133 conditions, 4664 events. 3198/4664 cut-off events. For 78753/78753 co-relation queries the response was YES. Maximal size of possible extension queue 285. Compared 22864 event pairs, 648 based on Foata normal form. 1/4665 useless extension candidates. Maximal degree in co-relation 35982. Up to 1943 conditions per place. [2025-04-14 00:34:10,312 INFO L140 encePairwiseOnDemand]: 19/30 looper letters, 216 selfloop transitions, 128 changer transitions 6/350 dead transitions. [2025-04-14 00:34:10,312 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 350 transitions, 5235 flow [2025-04-14 00:34:10,312 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-14 00:34:10,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-04-14 00:34:10,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 207 transitions. [2025-04-14 00:34:10,313 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3631578947368421 [2025-04-14 00:34:10,313 INFO L175 Difference]: Start difference. First operand has 173 places, 259 transitions, 3741 flow. Second operand 19 states and 207 transitions. [2025-04-14 00:34:10,313 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 350 transitions, 5235 flow [2025-04-14 00:34:10,450 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 350 transitions, 5039 flow, removed 10 selfloop flow, removed 13 redundant places. [2025-04-14 00:34:10,454 INFO L231 Difference]: Finished difference. Result has 179 places, 260 transitions, 3832 flow [2025-04-14 00:34:10,455 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=3545, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=259, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=127, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=3832, PETRI_PLACES=179, PETRI_TRANSITIONS=260} [2025-04-14 00:34:10,455 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 149 predicate places. [2025-04-14 00:34:10,455 INFO L485 AbstractCegarLoop]: Abstraction has has 179 places, 260 transitions, 3832 flow [2025-04-14 00:34:10,455 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 5.206896551724138) internal successors, (151), 29 states have internal predecessors, (151), 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-14 00:34:10,455 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:34:10,455 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:34:10,463 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-14 00:34:10,656 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,SelfDestructingSolverStorable21 [2025-04-14 00:34:10,656 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 00:34:10,657 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:34:10,657 INFO L85 PathProgramCache]: Analyzing trace with hash 38785139, now seen corresponding path program 9 times [2025-04-14 00:34:10,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:34:10,657 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030780623] [2025-04-14 00:34:10,657 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 00:34:10,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:34:10,667 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 38 statements into 4 equivalence classes. [2025-04-14 00:34:10,683 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 29 of 38 statements. [2025-04-14 00:34:10,683 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-14 00:34:10,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:34:11,454 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-14 00:34:11,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:34:11,455 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030780623] [2025-04-14 00:34:11,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030780623] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:34:11,455 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1607313737] [2025-04-14 00:34:11,455 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 00:34:11,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:34:11,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:34:11,461 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-14 00:34:11,462 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-14 00:34:11,564 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 38 statements into 4 equivalence classes. [2025-04-14 00:34:11,589 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 29 of 38 statements. [2025-04-14 00:34:11,589 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-14 00:34:11,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:34:11,591 INFO L256 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-04-14 00:34:11,592 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:34:11,812 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 00:34:11,812 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 40 treesize of output 40 [2025-04-14 00:34:11,854 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-14 00:34:11,855 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:34:12,213 INFO L325 Elim1Store]: treesize reduction 8, result has 96.1 percent of original size [2025-04-14 00:34:12,213 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 54 treesize of output 210 [2025-04-14 00:34:18,475 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-14 00:34:18,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1607313737] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:34:18,475 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:34:18,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 8] total 27 [2025-04-14 00:34:18,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433032980] [2025-04-14 00:34:18,476 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:34:18,476 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-04-14 00:34:18,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:34:18,476 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-04-14 00:34:18,477 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=647, Unknown=0, NotChecked=0, Total=756 [2025-04-14 00:34:18,477 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2025-04-14 00:34:18,477 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 260 transitions, 3832 flow. Second operand has 28 states, 28 states have (on average 5.285714285714286) internal successors, (148), 28 states have internal predecessors, (148), 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-14 00:34:18,477 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:34:18,477 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2025-04-14 00:34:18,477 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:34:20,501 INFO L116 PetriNetUnfolderBase]: 3692/5450 cut-off events. [2025-04-14 00:34:20,502 INFO L117 PetriNetUnfolderBase]: For 96946/96946 co-relation queries the response was YES. [2025-04-14 00:34:20,529 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42465 conditions, 5450 events. 3692/5450 cut-off events. For 96946/96946 co-relation queries the response was YES. Maximal size of possible extension queue 333. Compared 28297 event pairs, 851 based on Foata normal form. 3/5453 useless extension candidates. Maximal degree in co-relation 42313. Up to 3988 conditions per place. [2025-04-14 00:34:20,550 INFO L140 encePairwiseOnDemand]: 17/30 looper letters, 268 selfloop transitions, 145 changer transitions 5/418 dead transitions. [2025-04-14 00:34:20,550 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 418 transitions, 6432 flow [2025-04-14 00:34:20,550 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-14 00:34:20,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2025-04-14 00:34:20,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 242 transitions. [2025-04-14 00:34:20,551 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3507246376811594 [2025-04-14 00:34:20,551 INFO L175 Difference]: Start difference. First operand has 179 places, 260 transitions, 3832 flow. Second operand 23 states and 242 transitions. [2025-04-14 00:34:20,551 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 418 transitions, 6432 flow [2025-04-14 00:34:20,753 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 418 transitions, 6176 flow, removed 6 selfloop flow, removed 16 redundant places. [2025-04-14 00:34:20,757 INFO L231 Difference]: Finished difference. Result has 195 places, 316 transitions, 4927 flow [2025-04-14 00:34:20,758 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=3624, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=260, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=94, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=151, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=4927, PETRI_PLACES=195, PETRI_TRANSITIONS=316} [2025-04-14 00:34:20,758 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 165 predicate places. [2025-04-14 00:34:20,758 INFO L485 AbstractCegarLoop]: Abstraction has has 195 places, 316 transitions, 4927 flow [2025-04-14 00:34:20,758 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 5.285714285714286) internal successors, (148), 28 states have internal predecessors, (148), 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-14 00:34:20,758 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:34:20,758 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:34:20,765 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-14 00:34:20,959 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:34:20,959 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 00:34:20,960 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:34:20,960 INFO L85 PathProgramCache]: Analyzing trace with hash 1625820993, now seen corresponding path program 10 times [2025-04-14 00:34:20,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:34:20,960 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772837856] [2025-04-14 00:34:20,960 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 00:34:20,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:34:20,970 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 38 statements into 2 equivalence classes. [2025-04-14 00:34:20,991 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-04-14 00:34:20,991 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 00:34:20,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:34:21,835 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-14 00:34:21,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:34:21,835 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772837856] [2025-04-14 00:34:21,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772837856] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:34:21,835 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [665659348] [2025-04-14 00:34:21,835 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 00:34:21,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:34:21,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:34:21,837 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-14 00:34:21,838 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-14 00:34:21,946 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 38 statements into 2 equivalence classes. [2025-04-14 00:34:21,982 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-04-14 00:34:21,982 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 00:34:21,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:34:21,984 INFO L256 TraceCheckSpWp]: Trace formula consists of 431 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-04-14 00:34:21,985 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:34:22,167 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 00:34:22,167 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 40 treesize of output 52 [2025-04-14 00:34:22,227 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-14 00:34:22,227 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:34:26,643 INFO L325 Elim1Store]: treesize reduction 8, result has 96.1 percent of original size [2025-04-14 00:34:26,643 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 54 treesize of output 210 [2025-04-14 00:34:33,153 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-14 00:34:33,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [665659348] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:34:33,153 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:34:33,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 8] total 27 [2025-04-14 00:34:33,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296120068] [2025-04-14 00:34:33,154 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:34:33,154 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-04-14 00:34:33,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:34:33,154 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-04-14 00:34:33,154 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=660, Unknown=1, NotChecked=0, Total=756 [2025-04-14 00:34:33,155 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2025-04-14 00:34:33,155 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 316 transitions, 4927 flow. Second operand has 28 states, 28 states have (on average 5.107142857142857) internal successors, (143), 28 states have internal predecessors, (143), 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-14 00:34:33,155 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:34:33,155 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2025-04-14 00:34:33,155 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:34:35,168 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.85s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 00:34:39,191 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 [1] [2025-04-14 00:34:41,677 INFO L116 PetriNetUnfolderBase]: 3988/5867 cut-off events. [2025-04-14 00:34:41,677 INFO L117 PetriNetUnfolderBase]: For 126981/126981 co-relation queries the response was YES. [2025-04-14 00:34:41,705 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49040 conditions, 5867 events. 3988/5867 cut-off events. For 126981/126981 co-relation queries the response was YES. Maximal size of possible extension queue 362. Compared 30678 event pairs, 855 based on Foata normal form. 3/5870 useless extension candidates. Maximal degree in co-relation 48878. Up to 4696 conditions per place. [2025-04-14 00:34:41,725 INFO L140 encePairwiseOnDemand]: 18/30 looper letters, 250 selfloop transitions, 150 changer transitions 8/408 dead transitions. [2025-04-14 00:34:41,725 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 408 transitions, 6799 flow [2025-04-14 00:34:41,726 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-14 00:34:41,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-04-14 00:34:41,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 176 transitions. [2025-04-14 00:34:41,726 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.32592592592592595 [2025-04-14 00:34:41,726 INFO L175 Difference]: Start difference. First operand has 195 places, 316 transitions, 4927 flow. Second operand 18 states and 176 transitions. [2025-04-14 00:34:41,726 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 408 transitions, 6799 flow [2025-04-14 00:34:42,055 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 408 transitions, 6576 flow, removed 105 selfloop flow, removed 5 redundant places. [2025-04-14 00:34:42,061 INFO L231 Difference]: Finished difference. Result has 211 places, 339 transitions, 5540 flow [2025-04-14 00:34:42,061 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=4758, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=316, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=130, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=172, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=5540, PETRI_PLACES=211, PETRI_TRANSITIONS=339} [2025-04-14 00:34:42,061 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 181 predicate places. [2025-04-14 00:34:42,061 INFO L485 AbstractCegarLoop]: Abstraction has has 211 places, 339 transitions, 5540 flow [2025-04-14 00:34:42,061 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 5.107142857142857) internal successors, (143), 28 states have internal predecessors, (143), 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-14 00:34:42,061 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:34:42,062 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:34:42,068 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-14 00:34:42,262 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:34:42,262 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 00:34:42,263 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:34:42,263 INFO L85 PathProgramCache]: Analyzing trace with hash -1105616263, now seen corresponding path program 11 times [2025-04-14 00:34:42,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:34:42,263 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183145316] [2025-04-14 00:34:42,263 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 00:34:42,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:34:42,275 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 38 statements into 4 equivalence classes. [2025-04-14 00:34:42,310 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 38 of 38 statements. [2025-04-14 00:34:42,310 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-14 00:34:42,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:34:43,066 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-14 00:34:43,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:34:43,066 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183145316] [2025-04-14 00:34:43,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183145316] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:34:43,066 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1034038275] [2025-04-14 00:34:43,066 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 00:34:43,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:34:43,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:34:43,069 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 00:34:43,070 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-04-14 00:34:43,185 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 38 statements into 4 equivalence classes. [2025-04-14 00:34:43,541 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 38 of 38 statements. [2025-04-14 00:34:43,542 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-14 00:34:43,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:34:43,544 INFO L256 TraceCheckSpWp]: Trace formula consists of 431 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-04-14 00:34:43,546 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:34:43,781 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 00:34:43,781 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 40 treesize of output 48 [2025-04-14 00:34:43,885 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-14 00:34:43,885 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:34:44,280 INFO L325 Elim1Store]: treesize reduction 8, result has 96.1 percent of original size [2025-04-14 00:34:44,280 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 54 treesize of output 210 [2025-04-14 00:34:50,740 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-14 00:34:50,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1034038275] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:34:50,740 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:34:50,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 8] total 31 [2025-04-14 00:34:50,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505661049] [2025-04-14 00:34:50,741 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:34:50,741 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-04-14 00:34:50,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:34:50,741 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-04-14 00:34:50,741 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=874, Unknown=0, NotChecked=0, Total=992 [2025-04-14 00:34:50,741 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2025-04-14 00:34:50,742 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 339 transitions, 5540 flow. Second operand has 32 states, 32 states have (on average 5.3125) internal successors, (170), 32 states have internal predecessors, (170), 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-14 00:34:50,742 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:34:50,742 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2025-04-14 00:34:50,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:34:54,817 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 00:34:56,996 INFO L116 PetriNetUnfolderBase]: 4132/6138 cut-off events. [2025-04-14 00:34:56,997 INFO L117 PetriNetUnfolderBase]: For 158314/158314 co-relation queries the response was YES. [2025-04-14 00:34:57,025 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54475 conditions, 6138 events. 4132/6138 cut-off events. For 158314/158314 co-relation queries the response was YES. Maximal size of possible extension queue 367. Compared 32803 event pairs, 931 based on Foata normal form. 9/6147 useless extension candidates. Maximal degree in co-relation 54309. Up to 4834 conditions per place. [2025-04-14 00:34:57,048 INFO L140 encePairwiseOnDemand]: 17/30 looper letters, 281 selfloop transitions, 157 changer transitions 3/441 dead transitions. [2025-04-14 00:34:57,048 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 441 transitions, 7548 flow [2025-04-14 00:34:57,049 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-14 00:34:57,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2025-04-14 00:34:57,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 205 transitions. [2025-04-14 00:34:57,049 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3416666666666667 [2025-04-14 00:34:57,049 INFO L175 Difference]: Start difference. First operand has 211 places, 339 transitions, 5540 flow. Second operand 20 states and 205 transitions. [2025-04-14 00:34:57,049 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 229 places, 441 transitions, 7548 flow [2025-04-14 00:34:57,400 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 219 places, 441 transitions, 7289 flow, removed 57 selfloop flow, removed 10 redundant places. [2025-04-14 00:34:57,405 INFO L231 Difference]: Finished difference. Result has 226 places, 361 transitions, 6120 flow [2025-04-14 00:34:57,406 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=5290, PETRI_DIFFERENCE_MINUEND_PLACES=200, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=339, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=138, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=195, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=6120, PETRI_PLACES=226, PETRI_TRANSITIONS=361} [2025-04-14 00:34:57,406 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 196 predicate places. [2025-04-14 00:34:57,406 INFO L485 AbstractCegarLoop]: Abstraction has has 226 places, 361 transitions, 6120 flow [2025-04-14 00:34:57,406 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 5.3125) internal successors, (170), 32 states have internal predecessors, (170), 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-14 00:34:57,406 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:34:57,406 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:34:57,414 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-04-14 00:34:57,606 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2025-04-14 00:34:57,607 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 00:34:57,607 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:34:57,607 INFO L85 PathProgramCache]: Analyzing trace with hash -1089665051, now seen corresponding path program 12 times [2025-04-14 00:34:57,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:34:57,607 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814121985] [2025-04-14 00:34:57,607 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 00:34:57,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:34:57,617 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 38 statements into 4 equivalence classes. [2025-04-14 00:34:57,632 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 32 of 38 statements. [2025-04-14 00:34:57,632 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-14 00:34:57,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:34:58,247 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-14 00:34:58,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:34:58,248 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814121985] [2025-04-14 00:34:58,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814121985] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:34:58,248 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1965935666] [2025-04-14 00:34:58,248 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 00:34:58,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:34:58,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:34:58,250 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 00:34:58,260 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-04-14 00:34:58,410 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 38 statements into 4 equivalence classes. [2025-04-14 00:34:58,450 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 32 of 38 statements. [2025-04-14 00:34:58,451 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-14 00:34:58,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:34:58,452 INFO L256 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-04-14 00:34:58,454 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:34:58,646 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 00:34:58,646 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 40 treesize of output 40 [2025-04-14 00:34:58,715 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-14 00:34:58,715 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:34:59,121 INFO L325 Elim1Store]: treesize reduction 8, result has 96.1 percent of original size [2025-04-14 00:34:59,121 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 54 treesize of output 210 [2025-04-14 00:35:09,191 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-14 00:35:09,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1965935666] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:35:09,192 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:35:09,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 8] total 27 [2025-04-14 00:35:09,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012955972] [2025-04-14 00:35:09,192 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:35:09,193 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-04-14 00:35:09,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:35:09,193 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-04-14 00:35:09,193 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=633, Unknown=0, NotChecked=0, Total=756 [2025-04-14 00:35:09,193 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2025-04-14 00:35:09,194 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 226 places, 361 transitions, 6120 flow. Second operand has 28 states, 28 states have (on average 5.25) internal successors, (147), 28 states have internal predecessors, (147), 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-14 00:35:09,194 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:35:09,194 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2025-04-14 00:35:09,194 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:35:13,276 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 [1] [2025-04-14 00:35:15,056 INFO L116 PetriNetUnfolderBase]: 4147/6177 cut-off events. [2025-04-14 00:35:15,056 INFO L117 PetriNetUnfolderBase]: For 186061/186061 co-relation queries the response was YES. [2025-04-14 00:35:15,088 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57465 conditions, 6177 events. 4147/6177 cut-off events. For 186061/186061 co-relation queries the response was YES. Maximal size of possible extension queue 370. Compared 33221 event pairs, 976 based on Foata normal form. 3/6159 useless extension candidates. Maximal degree in co-relation 57292. Up to 4971 conditions per place. [2025-04-14 00:35:15,119 INFO L140 encePairwiseOnDemand]: 19/30 looper letters, 269 selfloop transitions, 154 changer transitions 1/424 dead transitions. [2025-04-14 00:35:15,120 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 424 transitions, 7647 flow [2025-04-14 00:35:15,120 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-14 00:35:15,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-04-14 00:35:15,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 168 transitions. [2025-04-14 00:35:15,121 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.32941176470588235 [2025-04-14 00:35:15,121 INFO L175 Difference]: Start difference. First operand has 226 places, 361 transitions, 6120 flow. Second operand 17 states and 168 transitions. [2025-04-14 00:35:15,121 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 242 places, 424 transitions, 7647 flow [2025-04-14 00:35:15,572 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 230 places, 424 transitions, 7347 flow, removed 84 selfloop flow, removed 12 redundant places. [2025-04-14 00:35:15,577 INFO L231 Difference]: Finished difference. Result has 231 places, 364 transitions, 6227 flow [2025-04-14 00:35:15,577 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=5844, PETRI_DIFFERENCE_MINUEND_PLACES=214, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=361, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=151, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=207, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=6227, PETRI_PLACES=231, PETRI_TRANSITIONS=364} [2025-04-14 00:35:15,578 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 201 predicate places. [2025-04-14 00:35:15,578 INFO L485 AbstractCegarLoop]: Abstraction has has 231 places, 364 transitions, 6227 flow [2025-04-14 00:35:15,578 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 5.25) internal successors, (147), 28 states have internal predecessors, (147), 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-14 00:35:15,578 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:35:15,578 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:35:15,584 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2025-04-14 00:35:15,782 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-04-14 00:35:15,782 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 00:35:15,782 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:35:15,783 INFO L85 PathProgramCache]: Analyzing trace with hash -1994950847, now seen corresponding path program 13 times [2025-04-14 00:35:15,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:35:15,783 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687233582] [2025-04-14 00:35:15,783 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 00:35:15,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:35:15,793 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-04-14 00:35:15,810 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-04-14 00:35:15,810 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:35:15,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:35:16,506 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-14 00:35:16,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:35:16,506 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687233582] [2025-04-14 00:35:16,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687233582] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:35:16,506 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2038422836] [2025-04-14 00:35:16,506 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 00:35:16,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:35:16,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:35:16,508 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 00:35:16,509 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-04-14 00:35:16,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-04-14 00:35:16,670 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-04-14 00:35:16,670 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:35:16,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:35:16,672 INFO L256 TraceCheckSpWp]: Trace formula consists of 431 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-04-14 00:35:16,674 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:35:16,791 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 00:35:16,791 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 40 treesize of output 52 [2025-04-14 00:35:16,873 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-04-14 00:35:16,874 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:35:17,231 INFO L325 Elim1Store]: treesize reduction 8, result has 96.5 percent of original size [2025-04-14 00:35:17,231 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 64 treesize of output 236 [2025-04-14 00:35:26,687 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-04-14 00:35:26,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2038422836] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:35:26,688 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:35:26,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 8] total 28 [2025-04-14 00:35:26,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192731029] [2025-04-14 00:35:26,688 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:35:26,688 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-04-14 00:35:26,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:35:26,688 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-04-14 00:35:26,688 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=689, Unknown=0, NotChecked=0, Total=812 [2025-04-14 00:35:26,688 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2025-04-14 00:35:26,689 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 231 places, 364 transitions, 6227 flow. Second operand has 29 states, 29 states have (on average 5.172413793103448) internal successors, (150), 29 states have internal predecessors, (150), 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-14 00:35:26,689 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:35:26,689 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2025-04-14 00:35:26,689 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:35:29,142 INFO L116 PetriNetUnfolderBase]: 4484/6701 cut-off events. [2025-04-14 00:35:29,142 INFO L117 PetriNetUnfolderBase]: For 183939/183939 co-relation queries the response was YES. [2025-04-14 00:35:29,177 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60524 conditions, 6701 events. 4484/6701 cut-off events. For 183939/183939 co-relation queries the response was YES. Maximal size of possible extension queue 408. Compared 36831 event pairs, 1012 based on Foata normal form. 3/6704 useless extension candidates. Maximal degree in co-relation 60352. Up to 5149 conditions per place. [2025-04-14 00:35:29,203 INFO L140 encePairwiseOnDemand]: 17/30 looper letters, 276 selfloop transitions, 200 changer transitions 5/481 dead transitions. [2025-04-14 00:35:29,203 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 252 places, 481 transitions, 8742 flow [2025-04-14 00:35:29,204 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-14 00:35:29,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-04-14 00:35:29,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 218 transitions. [2025-04-14 00:35:29,204 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3303030303030303 [2025-04-14 00:35:29,204 INFO L175 Difference]: Start difference. First operand has 231 places, 364 transitions, 6227 flow. Second operand 22 states and 218 transitions. [2025-04-14 00:35:29,204 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 252 places, 481 transitions, 8742 flow [2025-04-14 00:35:29,666 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 237 places, 481 transitions, 8476 flow, removed 6 selfloop flow, removed 15 redundant places. [2025-04-14 00:35:29,674 INFO L231 Difference]: Finished difference. Result has 242 places, 404 transitions, 7318 flow [2025-04-14 00:35:29,675 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=5984, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=364, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=164, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=189, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=7318, PETRI_PLACES=242, PETRI_TRANSITIONS=404} [2025-04-14 00:35:29,675 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 212 predicate places. [2025-04-14 00:35:29,675 INFO L485 AbstractCegarLoop]: Abstraction has has 242 places, 404 transitions, 7318 flow [2025-04-14 00:35:29,675 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 5.172413793103448) internal successors, (150), 29 states have internal predecessors, (150), 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-14 00:35:29,675 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:35:29,675 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:35:29,682 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2025-04-14 00:35:29,876 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-04-14 00:35:29,876 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 00:35:29,877 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:35:29,877 INFO L85 PathProgramCache]: Analyzing trace with hash 1239499803, now seen corresponding path program 14 times [2025-04-14 00:35:29,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:35:29,877 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815730709] [2025-04-14 00:35:29,877 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:35:29,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:35:29,887 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 2 equivalence classes. [2025-04-14 00:35:29,899 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-04-14 00:35:29,899 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 00:35:29,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:35:30,455 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-14 00:35:30,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:35:30,455 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815730709] [2025-04-14 00:35:30,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815730709] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:35:30,455 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1778861190] [2025-04-14 00:35:30,455 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:35:30,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:35:30,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:35:30,457 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 00:35:30,458 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-04-14 00:35:30,582 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 2 equivalence classes. [2025-04-14 00:35:30,617 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-04-14 00:35:30,617 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 00:35:30,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:35:30,619 INFO L256 TraceCheckSpWp]: Trace formula consists of 431 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-04-14 00:35:30,620 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:35:30,748 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 00:35:30,748 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 40 treesize of output 52 [2025-04-14 00:35:30,827 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-04-14 00:35:30,827 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:35:35,345 INFO L325 Elim1Store]: treesize reduction 4, result has 98.8 percent of original size [2025-04-14 00:35:35,345 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 89 treesize of output 347 [2025-04-14 00:37:02,388 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-14 00:37:02,388 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 101 [2025-04-14 00:37:02,389 WARN L310 FreeRefinementEngine]: Global settings require throwing the following exception [2025-04-14 00:37:02,397 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2025-04-14 00:37:02,589 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:37:02,590 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.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.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) ... 68 more [2025-04-14 00:37:02,594 INFO L158 Benchmark]: Toolchain (without parser) took 226298.32ms. Allocated memory was 142.6MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 101.1MB in the beginning and 492.7MB in the end (delta: -391.6MB). Peak memory consumption was 1.2GB. Max. memory is 8.0GB. [2025-04-14 00:37:02,594 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 155.2MB. Free memory is still 83.0MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 00:37:02,595 INFO L158 Benchmark]: CACSL2BoogieTranslator took 256.51ms. Allocated memory is still 142.6MB. Free memory was 101.1MB in the beginning and 85.3MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2025-04-14 00:37:02,595 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.09ms. Allocated memory is still 142.6MB. Free memory was 85.3MB in the beginning and 82.6MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 00:37:02,595 INFO L158 Benchmark]: Boogie Preprocessor took 45.16ms. Allocated memory is still 142.6MB. Free memory was 82.6MB in the beginning and 80.5MB in the end (delta: 2.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-14 00:37:02,595 INFO L158 Benchmark]: IcfgBuilder took 908.55ms. Allocated memory is still 142.6MB. Free memory was 80.5MB in the beginning and 54.7MB in the end (delta: 25.8MB). Peak memory consumption was 61.4MB. Max. memory is 8.0GB. [2025-04-14 00:37:02,595 INFO L158 Benchmark]: TraceAbstraction took 225048.01ms. Allocated memory was 142.6MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 54.0MB in the beginning and 492.7MB in the end (delta: -438.6MB). Peak memory consumption was 1.2GB. Max. memory is 8.0GB. [2025-04-14 00:37:02,596 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.22ms. Allocated memory is still 155.2MB. Free memory is still 83.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 256.51ms. Allocated memory is still 142.6MB. Free memory was 101.1MB in the beginning and 85.3MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 36.09ms. Allocated memory is still 142.6MB. Free memory was 85.3MB in the beginning and 82.6MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 45.16ms. Allocated memory is still 142.6MB. Free memory was 82.6MB in the beginning and 80.5MB in the end (delta: 2.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * IcfgBuilder took 908.55ms. Allocated memory is still 142.6MB. Free memory was 80.5MB in the beginning and 54.7MB in the end (delta: 25.8MB). Peak memory consumption was 61.4MB. Max. memory is 8.0GB. * TraceAbstraction took 225048.01ms. Allocated memory was 142.6MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 54.0MB in the beginning and 492.7MB in the end (delta: -438.6MB). Peak memory consumption was 1.2GB. 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...