/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis PETRI_NET -i ../../../trunk/examples/svcomp/weaver/unroll-2.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 21:00:27,447 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 21:00:27,496 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2025-04-13 21:00:27,500 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 21:00:27,501 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 21:00:27,519 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 21:00:27,520 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 21:00:27,520 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 21:00:27,520 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 21:00:27,521 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 21:00:27,522 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 21:00:27,522 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 21:00:27,522 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 21:00:27,522 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 21:00:27,522 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 21:00:27,523 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 21:00:27,523 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 21:00:27,523 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 21:00:27,523 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 21:00:27,523 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 21:00:27,523 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 21:00:27,523 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 21:00:27,523 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 21:00:27,523 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 21:00:27,523 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 21:00:27,523 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 21:00:27,523 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 21:00:27,523 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 21:00:27,523 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 21:00:27,523 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 21:00:27,524 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 21:00:27,524 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 21:00:27,524 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 21:00:27,524 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 21:00:27,524 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 21:00:27,524 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 21:00:27,524 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 21:00:27,524 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 21:00:27,524 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 21:00:27,524 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 21:00:27,524 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 21:00:27,524 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 21:00:27,524 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 21:00:27,524 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 21:00:27,525 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 21:00:27,525 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 21:00:27,525 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 21:00:27,525 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Automaton type used in concurrency analysis -> PETRI_NET [2025-04-13 21:00:27,739 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 21:00:27,746 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 21:00:27,747 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 21:00:27,748 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 21:00:27,750 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 21:00:27,751 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/unroll-2.wvr.c [2025-04-13 21:00:29,079 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c83a217f/3b9aac5b506448d2b729169f8ed96fe3/FLAG4209750b6 [2025-04-13 21:00:29,303 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 21:00:29,304 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-2.wvr.c [2025-04-13 21:00:29,311 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c83a217f/3b9aac5b506448d2b729169f8ed96fe3/FLAG4209750b6 [2025-04-13 21:00:30,080 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c83a217f/3b9aac5b506448d2b729169f8ed96fe3 [2025-04-13 21:00:30,082 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 21:00:30,083 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 21:00:30,085 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 21:00:30,085 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 21:00:30,089 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 21:00:30,090 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 09:00:30" (1/1) ... [2025-04-13 21:00:30,090 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3957eb7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:00:30, skipping insertion in model container [2025-04-13 21:00:30,090 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 09:00:30" (1/1) ... [2025-04-13 21:00:30,103 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 21:00:30,284 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-2.wvr.c[2454,2467] [2025-04-13 21:00:30,294 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 21:00:30,303 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 21:00:30,335 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-2.wvr.c[2454,2467] [2025-04-13 21:00:30,339 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 21:00:30,354 INFO L204 MainTranslator]: Completed translation [2025-04-13 21:00:30,355 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:00:30 WrapperNode [2025-04-13 21:00:30,356 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 21:00:30,357 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 21:00:30,357 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 21:00:30,357 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 21:00:30,363 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:00:30" (1/1) ... [2025-04-13 21:00:30,371 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:00:30" (1/1) ... [2025-04-13 21:00:30,393 INFO L138 Inliner]: procedures = 23, calls = 22, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 118 [2025-04-13 21:00:30,397 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 21:00:30,398 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 21:00:30,398 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 21:00:30,398 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 21:00:30,404 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:00:30" (1/1) ... [2025-04-13 21:00:30,404 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:00:30" (1/1) ... [2025-04-13 21:00:30,406 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:00:30" (1/1) ... [2025-04-13 21:00:30,424 INFO L175 MemorySlicer]: Split 6 memory accesses to 2 slices as follows [2, 4]. 67 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2025-04-13 21:00:30,424 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:00:30" (1/1) ... [2025-04-13 21:00:30,424 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:00:30" (1/1) ... [2025-04-13 21:00:30,428 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:00:30" (1/1) ... [2025-04-13 21:00:30,428 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:00:30" (1/1) ... [2025-04-13 21:00:30,432 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:00:30" (1/1) ... [2025-04-13 21:00:30,433 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:00:30" (1/1) ... [2025-04-13 21:00:30,434 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:00:30" (1/1) ... [2025-04-13 21:00:30,440 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 21:00:30,445 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-13 21:00:30,445 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-13 21:00:30,445 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-13 21:00:30,446 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:00:30" (1/1) ... [2025-04-13 21:00:30,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 21:00:30,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:00:30,472 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-13 21:00:30,477 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-13 21:00:30,490 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 21:00:30,490 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-13 21:00:30,490 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-13 21:00:30,490 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-13 21:00:30,490 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-13 21:00:30,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 21:00:30,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-13 21:00:30,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-13 21:00:30,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-13 21:00:30,490 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-13 21:00:30,490 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 21:00:30,490 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 21:00:30,490 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-13 21:00:30,490 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-13 21:00:30,491 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-13 21:00:30,573 INFO L234 CfgBuilder]: Building ICFG [2025-04-13 21:00:30,575 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 21:00:30,749 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 21:00:30,750 INFO L289 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 21:00:30,750 INFO L294 CfgBuilder]: Performing block encoding [2025-04-13 21:00:30,946 INFO L313 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 21:00:30,946 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 09:00:30 BoogieIcfgContainer [2025-04-13 21:00:30,946 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-13 21:00:30,959 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 21:00:30,959 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 21:00:30,962 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 21:00:30,962 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 09:00:30" (1/3) ... [2025-04-13 21:00:30,963 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39357a5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 09:00:30, skipping insertion in model container [2025-04-13 21:00:30,963 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:00:30" (2/3) ... [2025-04-13 21:00:30,963 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39357a5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 09:00:30, skipping insertion in model container [2025-04-13 21:00:30,963 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 09:00:30" (3/3) ... [2025-04-13 21:00:30,964 INFO L128 eAbstractionObserver]: Analyzing ICFG unroll-2.wvr.c [2025-04-13 21:00:30,975 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 21:00:30,976 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG unroll-2.wvr.c that has 3 procedures, 17 locations, 17 edges, 1 initial locations, 3 loop locations, and 1 error locations. [2025-04-13 21:00:30,977 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 21:00:31,017 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-13 21:00:31,042 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 23 places, 19 transitions, 52 flow [2025-04-13 21:00:31,058 INFO L116 PetriNetUnfolderBase]: 3/17 cut-off events. [2025-04-13 21:00:31,059 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-13 21:00:31,061 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26 conditions, 17 events. 3/17 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 10 event pairs, 0 based on Foata normal form. 0/13 useless extension candidates. Maximal degree in co-relation 11. Up to 2 conditions per place. [2025-04-13 21:00:31,062 INFO L82 GeneralOperation]: Start removeDead. Operand has 23 places, 19 transitions, 52 flow [2025-04-13 21:00:31,063 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 20 places, 16 transitions, 44 flow [2025-04-13 21:00:31,069 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 21:00:31,082 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;@3eb3d64c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 21:00:31,082 INFO L341 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-04-13 21:00:31,086 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 21:00:31,087 INFO L116 PetriNetUnfolderBase]: 3/15 cut-off events. [2025-04-13 21:00:31,087 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-13 21:00:31,087 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:00:31,087 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:00:31,087 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:00:31,092 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:00:31,092 INFO L85 PathProgramCache]: Analyzing trace with hash 316307394, now seen corresponding path program 1 times [2025-04-13 21:00:31,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:00:31,098 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044662885] [2025-04-13 21:00:31,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:00:31,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:00:31,153 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-13 21:00:31,184 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-13 21:00:31,185 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:00:31,185 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:00:31,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:00:31,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:00:31,309 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044662885] [2025-04-13 21:00:31,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044662885] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:00:31,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:00:31,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-13 21:00:31,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775562276] [2025-04-13 21:00:31,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:00:31,315 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 21:00:31,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:00:31,335 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 21:00:31,336 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 21:00:31,337 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2025-04-13 21:00:31,338 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 20 places, 16 transitions, 44 flow. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:00:31,338 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:00:31,339 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2025-04-13 21:00:31,339 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:00:31,415 INFO L116 PetriNetUnfolderBase]: 69/124 cut-off events. [2025-04-13 21:00:31,415 INFO L117 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2025-04-13 21:00:31,416 INFO L83 FinitePrefix]: Finished finitePrefix Result has 272 conditions, 124 events. 69/124 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 320 event pairs, 22 based on Foata normal form. 1/94 useless extension candidates. Maximal degree in co-relation 220. Up to 72 conditions per place. [2025-04-13 21:00:31,417 INFO L140 encePairwiseOnDemand]: 15/19 looper letters, 23 selfloop transitions, 3 changer transitions 1/27 dead transitions. [2025-04-13 21:00:31,419 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 22 places, 27 transitions, 129 flow [2025-04-13 21:00:31,420 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 21:00:31,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 21:00:31,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 34 transitions. [2025-04-13 21:00:31,429 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5964912280701754 [2025-04-13 21:00:31,430 INFO L175 Difference]: Start difference. First operand has 20 places, 16 transitions, 44 flow. Second operand 3 states and 34 transitions. [2025-04-13 21:00:31,431 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 22 places, 27 transitions, 129 flow [2025-04-13 21:00:31,436 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 18 places, 27 transitions, 115 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-04-13 21:00:31,437 INFO L231 Difference]: Finished difference. Result has 19 places, 18 transitions, 55 flow [2025-04-13 21:00:31,439 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=36, PETRI_DIFFERENCE_MINUEND_PLACES=16, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=55, PETRI_PLACES=19, PETRI_TRANSITIONS=18} [2025-04-13 21:00:31,443 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, -1 predicate places. [2025-04-13 21:00:31,444 INFO L485 AbstractCegarLoop]: Abstraction has has 19 places, 18 transitions, 55 flow [2025-04-13 21:00:31,444 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:00:31,444 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:00:31,444 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:00:31,444 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 21:00:31,445 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:00:31,445 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:00:31,445 INFO L85 PathProgramCache]: Analyzing trace with hash 613651025, now seen corresponding path program 1 times [2025-04-13 21:00:31,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:00:31,445 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846914734] [2025-04-13 21:00:31,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:00:31,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:00:31,460 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-13 21:00:31,482 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 21:00:31,483 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:00:31,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:00:31,578 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 21:00:31,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:00:31,579 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846914734] [2025-04-13 21:00:31,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846914734] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:00:31,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:00:31,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 21:00:31,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925541223] [2025-04-13 21:00:31,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:00:31,580 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 21:00:31,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:00:31,581 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 21:00:31,581 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 21:00:31,581 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2025-04-13 21:00:31,581 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 19 places, 18 transitions, 55 flow. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:00:31,581 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:00:31,581 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2025-04-13 21:00:31,581 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:00:31,673 INFO L116 PetriNetUnfolderBase]: 69/125 cut-off events. [2025-04-13 21:00:31,673 INFO L117 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2025-04-13 21:00:31,674 INFO L83 FinitePrefix]: Finished finitePrefix Result has 307 conditions, 125 events. 69/125 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 298 event pairs, 44 based on Foata normal form. 0/124 useless extension candidates. Maximal degree in co-relation 110. Up to 125 conditions per place. [2025-04-13 21:00:31,675 INFO L140 encePairwiseOnDemand]: 16/19 looper letters, 17 selfloop transitions, 2 changer transitions 0/19 dead transitions. [2025-04-13 21:00:31,675 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 21 places, 19 transitions, 95 flow [2025-04-13 21:00:31,676 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 21:00:31,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 21:00:31,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 24 transitions. [2025-04-13 21:00:31,676 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.42105263157894735 [2025-04-13 21:00:31,676 INFO L175 Difference]: Start difference. First operand has 19 places, 18 transitions, 55 flow. Second operand 3 states and 24 transitions. [2025-04-13 21:00:31,677 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 21 places, 19 transitions, 95 flow [2025-04-13 21:00:31,677 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 20 places, 19 transitions, 92 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-13 21:00:31,677 INFO L231 Difference]: Finished difference. Result has 21 places, 19 transitions, 64 flow [2025-04-13 21:00:31,678 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=18, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=64, PETRI_PLACES=21, PETRI_TRANSITIONS=19} [2025-04-13 21:00:31,678 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 1 predicate places. [2025-04-13 21:00:31,678 INFO L485 AbstractCegarLoop]: Abstraction has has 21 places, 19 transitions, 64 flow [2025-04-13 21:00:31,678 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:00:31,678 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:00:31,678 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:00:31,678 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 21:00:31,678 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:00:31,679 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:00:31,679 INFO L85 PathProgramCache]: Analyzing trace with hash -756821922, now seen corresponding path program 1 times [2025-04-13 21:00:31,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:00:31,679 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539559571] [2025-04-13 21:00:31,679 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:00:31,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:00:31,691 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-13 21:00:31,711 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 21:00:31,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:00:31,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:00:31,871 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 21:00:31,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:00:31,872 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539559571] [2025-04-13 21:00:31,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539559571] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:00:31,872 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2145184697] [2025-04-13 21:00:31,872 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:00:31,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:00:31,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:00:31,874 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 21:00:31,876 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-04-13 21:00:31,923 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-13 21:00:31,947 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 21:00:31,947 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:00:31,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:00:31,949 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-13 21:00:31,952 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:00:31,987 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 21:00:31,987 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:00:32,038 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 21:00:32,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2145184697] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 21:00:32,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 21:00:32,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 5] total 6 [2025-04-13 21:00:32,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079181708] [2025-04-13 21:00:32,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:00:32,040 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 21:00:32,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:00:32,041 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 21:00:32,041 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-04-13 21:00:32,041 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2025-04-13 21:00:32,042 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 21 places, 19 transitions, 64 flow. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:00:32,042 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:00:32,042 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2025-04-13 21:00:32,042 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:00:32,149 INFO L116 PetriNetUnfolderBase]: 76/137 cut-off events. [2025-04-13 21:00:32,149 INFO L117 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2025-04-13 21:00:32,149 INFO L83 FinitePrefix]: Finished finitePrefix Result has 329 conditions, 137 events. 76/137 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 370 event pairs, 22 based on Foata normal form. 5/141 useless extension candidates. Maximal degree in co-relation 316. Up to 71 conditions per place. [2025-04-13 21:00:32,150 INFO L140 encePairwiseOnDemand]: 15/19 looper letters, 28 selfloop transitions, 4 changer transitions 1/33 dead transitions. [2025-04-13 21:00:32,150 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 33 transitions, 166 flow [2025-04-13 21:00:32,151 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 21:00:32,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-13 21:00:32,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 41 transitions. [2025-04-13 21:00:32,152 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5394736842105263 [2025-04-13 21:00:32,152 INFO L175 Difference]: Start difference. First operand has 21 places, 19 transitions, 64 flow. Second operand 4 states and 41 transitions. [2025-04-13 21:00:32,152 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 24 places, 33 transitions, 166 flow [2025-04-13 21:00:32,153 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 23 places, 33 transitions, 162 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-04-13 21:00:32,153 INFO L231 Difference]: Finished difference. Result has 25 places, 21 transitions, 86 flow [2025-04-13 21:00:32,153 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=20, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=86, PETRI_PLACES=25, PETRI_TRANSITIONS=21} [2025-04-13 21:00:32,154 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 5 predicate places. [2025-04-13 21:00:32,154 INFO L485 AbstractCegarLoop]: Abstraction has has 25 places, 21 transitions, 86 flow [2025-04-13 21:00:32,154 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:00:32,154 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:00:32,154 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:00:32,162 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-04-13 21:00:32,359 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-13 21:00:32,359 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:00:32,360 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:00:32,360 INFO L85 PathProgramCache]: Analyzing trace with hash 890707805, now seen corresponding path program 1 times [2025-04-13 21:00:32,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:00:32,360 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773445258] [2025-04-13 21:00:32,360 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:00:32,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:00:32,366 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-13 21:00:32,380 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 21:00:32,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:00:32,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:00:32,509 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 21:00:32,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:00:32,509 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773445258] [2025-04-13 21:00:32,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773445258] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:00:32,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:00:32,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 21:00:32,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963866444] [2025-04-13 21:00:32,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:00:32,510 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 21:00:32,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:00:32,510 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 21:00:32,510 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 21:00:32,510 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2025-04-13 21:00:32,510 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 21 transitions, 86 flow. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:00:32,511 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:00:32,511 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2025-04-13 21:00:32,511 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:00:32,637 INFO L116 PetriNetUnfolderBase]: 85/165 cut-off events. [2025-04-13 21:00:32,638 INFO L117 PetriNetUnfolderBase]: For 145/145 co-relation queries the response was YES. [2025-04-13 21:00:32,638 INFO L83 FinitePrefix]: Finished finitePrefix Result has 459 conditions, 165 events. 85/165 cut-off events. For 145/145 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 564 event pairs, 24 based on Foata normal form. 9/173 useless extension candidates. Maximal degree in co-relation 440. Up to 93 conditions per place. [2025-04-13 21:00:32,639 INFO L140 encePairwiseOnDemand]: 14/19 looper letters, 31 selfloop transitions, 4 changer transitions 7/42 dead transitions. [2025-04-13 21:00:32,639 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 42 transitions, 241 flow [2025-04-13 21:00:32,639 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 21:00:32,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 21:00:32,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 48 transitions. [2025-04-13 21:00:32,640 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5052631578947369 [2025-04-13 21:00:32,640 INFO L175 Difference]: Start difference. First operand has 25 places, 21 transitions, 86 flow. Second operand 5 states and 48 transitions. [2025-04-13 21:00:32,640 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 42 transitions, 241 flow [2025-04-13 21:00:32,641 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 42 transitions, 236 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-04-13 21:00:32,642 INFO L231 Difference]: Finished difference. Result has 31 places, 23 transitions, 113 flow [2025-04-13 21:00:32,642 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=113, PETRI_PLACES=31, PETRI_TRANSITIONS=23} [2025-04-13 21:00:32,642 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 11 predicate places. [2025-04-13 21:00:32,642 INFO L485 AbstractCegarLoop]: Abstraction has has 31 places, 23 transitions, 113 flow [2025-04-13 21:00:32,643 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:00:32,643 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:00:32,643 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:00:32,643 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 21:00:32,643 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:00:32,643 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:00:32,643 INFO L85 PathProgramCache]: Analyzing trace with hash -54005661, now seen corresponding path program 2 times [2025-04-13 21:00:32,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:00:32,643 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565251232] [2025-04-13 21:00:32,644 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 21:00:32,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:00:32,651 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-04-13 21:00:32,658 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 21:00:32,658 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 21:00:32,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:00:32,735 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 21:00:32,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:00:32,735 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565251232] [2025-04-13 21:00:32,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565251232] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:00:32,735 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1823892749] [2025-04-13 21:00:32,736 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 21:00:32,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:00:32,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:00:32,739 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 21:00:32,742 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-13 21:00:32,783 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-04-13 21:00:32,802 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 21:00:32,802 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 21:00:32,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:00:32,803 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-13 21:00:32,804 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:00:32,830 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 21:00:32,831 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:00:32,893 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 21:00:32,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1823892749] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 21:00:32,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 21:00:32,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 5] total 6 [2025-04-13 21:00:32,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765605835] [2025-04-13 21:00:32,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:00:32,894 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 21:00:32,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:00:32,895 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 21:00:32,895 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-04-13 21:00:32,895 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2025-04-13 21:00:32,895 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 23 transitions, 113 flow. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:00:32,895 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:00:32,895 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2025-04-13 21:00:32,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:00:32,976 INFO L116 PetriNetUnfolderBase]: 87/164 cut-off events. [2025-04-13 21:00:32,976 INFO L117 PetriNetUnfolderBase]: For 214/214 co-relation queries the response was YES. [2025-04-13 21:00:32,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 570 conditions, 164 events. 87/164 cut-off events. For 214/214 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 496 event pairs, 25 based on Foata normal form. 4/167 useless extension candidates. Maximal degree in co-relation 548. Up to 103 conditions per place. [2025-04-13 21:00:32,978 INFO L140 encePairwiseOnDemand]: 15/19 looper letters, 28 selfloop transitions, 4 changer transitions 3/35 dead transitions. [2025-04-13 21:00:32,978 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 35 transitions, 232 flow [2025-04-13 21:00:32,979 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 21:00:32,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-13 21:00:32,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2025-04-13 21:00:32,979 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5263157894736842 [2025-04-13 21:00:32,979 INFO L175 Difference]: Start difference. First operand has 31 places, 23 transitions, 113 flow. Second operand 4 states and 40 transitions. [2025-04-13 21:00:32,979 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 35 transitions, 232 flow [2025-04-13 21:00:32,981 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 35 transitions, 219 flow, removed 4 selfloop flow, removed 2 redundant places. [2025-04-13 21:00:32,981 INFO L231 Difference]: Finished difference. Result has 33 places, 25 transitions, 132 flow [2025-04-13 21:00:32,981 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=132, PETRI_PLACES=33, PETRI_TRANSITIONS=25} [2025-04-13 21:00:32,982 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 13 predicate places. [2025-04-13 21:00:32,982 INFO L485 AbstractCegarLoop]: Abstraction has has 33 places, 25 transitions, 132 flow [2025-04-13 21:00:32,982 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:00:32,982 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:00:32,982 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:00:32,988 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-13 21:00:33,182 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:00:33,183 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:00:33,183 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:00:33,183 INFO L85 PathProgramCache]: Analyzing trace with hash 47987038, now seen corresponding path program 2 times [2025-04-13 21:00:33,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:00:33,183 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148791690] [2025-04-13 21:00:33,183 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 21:00:33,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:00:33,193 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-04-13 21:00:33,210 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 21:00:33,211 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 21:00:33,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:00:33,271 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 21:00:33,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:00:33,271 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148791690] [2025-04-13 21:00:33,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148791690] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:00:33,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:00:33,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 21:00:33,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198689105] [2025-04-13 21:00:33,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:00:33,271 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 21:00:33,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:00:33,272 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 21:00:33,272 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 21:00:33,272 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2025-04-13 21:00:33,272 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 25 transitions, 132 flow. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:00:33,272 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:00:33,272 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2025-04-13 21:00:33,272 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:00:33,346 INFO L116 PetriNetUnfolderBase]: 97/186 cut-off events. [2025-04-13 21:00:33,346 INFO L117 PetriNetUnfolderBase]: For 337/337 co-relation queries the response was YES. [2025-04-13 21:00:33,347 INFO L83 FinitePrefix]: Finished finitePrefix Result has 654 conditions, 186 events. 97/186 cut-off events. For 337/337 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 588 event pairs, 35 based on Foata normal form. 4/189 useless extension candidates. Maximal degree in co-relation 631. Up to 126 conditions per place. [2025-04-13 21:00:33,349 INFO L140 encePairwiseOnDemand]: 15/19 looper letters, 32 selfloop transitions, 6 changer transitions 3/41 dead transitions. [2025-04-13 21:00:33,349 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 41 transitions, 294 flow [2025-04-13 21:00:33,349 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 21:00:33,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-13 21:00:33,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2025-04-13 21:00:33,351 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5 [2025-04-13 21:00:33,351 INFO L175 Difference]: Start difference. First operand has 33 places, 25 transitions, 132 flow. Second operand 4 states and 38 transitions. [2025-04-13 21:00:33,351 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 41 transitions, 294 flow [2025-04-13 21:00:33,353 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 41 transitions, 291 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-13 21:00:33,353 INFO L231 Difference]: Finished difference. Result has 37 places, 27 transitions, 169 flow [2025-04-13 21:00:33,354 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=169, PETRI_PLACES=37, PETRI_TRANSITIONS=27} [2025-04-13 21:00:33,354 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 17 predicate places. [2025-04-13 21:00:33,354 INFO L485 AbstractCegarLoop]: Abstraction has has 37 places, 27 transitions, 169 flow [2025-04-13 21:00:33,354 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:00:33,354 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:00:33,354 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:00:33,354 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-13 21:00:33,356 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:00:33,357 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:00:33,357 INFO L85 PathProgramCache]: Analyzing trace with hash -645753631, now seen corresponding path program 3 times [2025-04-13 21:00:33,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:00:33,357 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595775693] [2025-04-13 21:00:33,357 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 21:00:33,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:00:33,365 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 15 statements into 2 equivalence classes. [2025-04-13 21:00:33,378 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 21:00:33,378 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 21:00:33,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:00:33,452 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 21:00:33,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:00:33,452 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595775693] [2025-04-13 21:00:33,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595775693] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:00:33,452 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1807530813] [2025-04-13 21:00:33,452 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 21:00:33,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:00:33,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:00:33,454 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 21:00:33,456 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-13 21:00:33,498 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 15 statements into 2 equivalence classes. [2025-04-13 21:00:33,515 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 21:00:33,515 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 21:00:33,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:00:33,517 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-13 21:00:33,518 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:00:33,534 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 21:00:33,534 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:00:33,590 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 21:00:33,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1807530813] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 21:00:33,591 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 21:00:33,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2025-04-13 21:00:33,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243041703] [2025-04-13 21:00:33,591 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 21:00:33,591 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 21:00:33,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:00:33,592 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 21:00:33,592 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-04-13 21:00:33,592 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2025-04-13 21:00:33,592 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 27 transitions, 169 flow. Second operand has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:00:33,592 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:00:33,592 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2025-04-13 21:00:33,592 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:00:33,731 INFO L116 PetriNetUnfolderBase]: 125/235 cut-off events. [2025-04-13 21:00:33,732 INFO L117 PetriNetUnfolderBase]: For 633/633 co-relation queries the response was YES. [2025-04-13 21:00:33,732 INFO L83 FinitePrefix]: Finished finitePrefix Result has 989 conditions, 235 events. 125/235 cut-off events. For 633/633 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 852 event pairs, 29 based on Foata normal form. 18/252 useless extension candidates. Maximal degree in co-relation 964. Up to 117 conditions per place. [2025-04-13 21:00:33,733 INFO L140 encePairwiseOnDemand]: 14/19 looper letters, 37 selfloop transitions, 12 changer transitions 9/58 dead transitions. [2025-04-13 21:00:33,734 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 58 transitions, 485 flow [2025-04-13 21:00:33,734 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 21:00:33,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 21:00:33,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 58 transitions. [2025-04-13 21:00:33,734 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5087719298245614 [2025-04-13 21:00:33,734 INFO L175 Difference]: Start difference. First operand has 37 places, 27 transitions, 169 flow. Second operand 6 states and 58 transitions. [2025-04-13 21:00:33,734 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 58 transitions, 485 flow [2025-04-13 21:00:33,739 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 58 transitions, 436 flow, removed 19 selfloop flow, removed 1 redundant places. [2025-04-13 21:00:33,740 INFO L231 Difference]: Finished difference. Result has 43 places, 33 transitions, 251 flow [2025-04-13 21:00:33,740 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=251, PETRI_PLACES=43, PETRI_TRANSITIONS=33} [2025-04-13 21:00:33,740 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 23 predicate places. [2025-04-13 21:00:33,740 INFO L485 AbstractCegarLoop]: Abstraction has has 43 places, 33 transitions, 251 flow [2025-04-13 21:00:33,740 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:00:33,740 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:00:33,740 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:00:33,748 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-04-13 21:00:33,946 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:00:33,946 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:00:33,946 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:00:33,947 INFO L85 PathProgramCache]: Analyzing trace with hash 1157742352, now seen corresponding path program 3 times [2025-04-13 21:00:33,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:00:33,947 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504758656] [2025-04-13 21:00:33,947 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 21:00:33,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:00:33,953 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 16 statements into 2 equivalence classes. [2025-04-13 21:00:33,959 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 21:00:33,960 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 21:00:33,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:00:34,009 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 21:00:34,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:00:34,009 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504758656] [2025-04-13 21:00:34,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504758656] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:00:34,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:00:34,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 21:00:34,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227136638] [2025-04-13 21:00:34,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:00:34,010 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 21:00:34,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:00:34,010 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 21:00:34,010 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-13 21:00:34,010 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2025-04-13 21:00:34,010 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 33 transitions, 251 flow. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:00:34,011 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:00:34,011 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2025-04-13 21:00:34,011 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:00:34,073 INFO L116 PetriNetUnfolderBase]: 113/200 cut-off events. [2025-04-13 21:00:34,073 INFO L117 PetriNetUnfolderBase]: For 617/617 co-relation queries the response was YES. [2025-04-13 21:00:34,074 INFO L83 FinitePrefix]: Finished finitePrefix Result has 905 conditions, 200 events. 113/200 cut-off events. For 617/617 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 593 event pairs, 40 based on Foata normal form. 7/206 useless extension candidates. Maximal degree in co-relation 878. Up to 143 conditions per place. [2025-04-13 21:00:34,075 INFO L140 encePairwiseOnDemand]: 15/19 looper letters, 32 selfloop transitions, 13 changer transitions 1/46 dead transitions. [2025-04-13 21:00:34,075 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 46 transitions, 438 flow [2025-04-13 21:00:34,076 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 21:00:34,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-13 21:00:34,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 37 transitions. [2025-04-13 21:00:34,076 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4868421052631579 [2025-04-13 21:00:34,076 INFO L175 Difference]: Start difference. First operand has 43 places, 33 transitions, 251 flow. Second operand 4 states and 37 transitions. [2025-04-13 21:00:34,077 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 46 transitions, 438 flow [2025-04-13 21:00:34,079 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 46 transitions, 393 flow, removed 18 selfloop flow, removed 2 redundant places. [2025-04-13 21:00:34,079 INFO L231 Difference]: Finished difference. Result has 44 places, 36 transitions, 293 flow [2025-04-13 21:00:34,080 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=224, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=293, PETRI_PLACES=44, PETRI_TRANSITIONS=36} [2025-04-13 21:00:34,081 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 24 predicate places. [2025-04-13 21:00:34,081 INFO L485 AbstractCegarLoop]: Abstraction has has 44 places, 36 transitions, 293 flow [2025-04-13 21:00:34,081 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:00:34,081 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:00:34,081 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:00:34,081 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-13 21:00:34,081 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:00:34,082 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:00:34,082 INFO L85 PathProgramCache]: Analyzing trace with hash 239076101, now seen corresponding path program 1 times [2025-04-13 21:00:34,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:00:34,082 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436303611] [2025-04-13 21:00:34,082 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:00:34,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:00:34,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-13 21:00:34,112 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-13 21:00:34,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:00:34,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:00:34,573 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:00:34,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:00:34,573 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436303611] [2025-04-13 21:00:34,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436303611] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:00:34,573 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1342277248] [2025-04-13 21:00:34,573 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:00:34,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:00:34,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:00:34,575 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 21:00:34,577 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-04-13 21:00:34,617 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-13 21:00:34,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-13 21:00:34,633 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:00:34,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:00:34,634 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-13 21:00:34,636 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:00:34,673 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-13 21:00:34,806 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:00:34,806 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:00:34,963 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 90 [2025-04-13 21:00:35,082 INFO L325 Elim1Store]: treesize reduction 5, result has 95.2 percent of original size [2025-04-13 21:00:35,083 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 419 treesize of output 360 [2025-04-13 21:00:37,234 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:00:37,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1342277248] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 21:00:37,234 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 21:00:37,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2025-04-13 21:00:37,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561646535] [2025-04-13 21:00:37,234 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 21:00:37,235 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-04-13 21:00:37,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:00:37,235 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-04-13 21:00:37,235 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=262, Unknown=0, NotChecked=0, Total=342 [2025-04-13 21:00:37,235 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2025-04-13 21:00:37,235 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 36 transitions, 293 flow. Second operand has 19 states, 19 states have (on average 4.473684210526316) internal successors, (85), 19 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:00:37,236 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:00:37,236 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2025-04-13 21:00:37,236 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:00:37,608 INFO L116 PetriNetUnfolderBase]: 289/508 cut-off events. [2025-04-13 21:00:37,608 INFO L117 PetriNetUnfolderBase]: For 1349/1349 co-relation queries the response was YES. [2025-04-13 21:00:37,609 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2278 conditions, 508 events. 289/508 cut-off events. For 1349/1349 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1933 event pairs, 36 based on Foata normal form. 2/508 useless extension candidates. Maximal degree in co-relation 1994. Up to 225 conditions per place. [2025-04-13 21:00:37,611 INFO L140 encePairwiseOnDemand]: 13/19 looper letters, 52 selfloop transitions, 23 changer transitions 43/118 dead transitions. [2025-04-13 21:00:37,611 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 118 transitions, 1080 flow [2025-04-13 21:00:37,615 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 21:00:37,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-04-13 21:00:37,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 104 transitions. [2025-04-13 21:00:37,616 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.49760765550239233 [2025-04-13 21:00:37,616 INFO L175 Difference]: Start difference. First operand has 44 places, 36 transitions, 293 flow. Second operand 11 states and 104 transitions. [2025-04-13 21:00:37,616 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 118 transitions, 1080 flow [2025-04-13 21:00:37,620 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 118 transitions, 1012 flow, removed 6 selfloop flow, removed 3 redundant places. [2025-04-13 21:00:37,621 INFO L231 Difference]: Finished difference. Result has 56 places, 50 transitions, 480 flow [2025-04-13 21:00:37,621 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=269, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=480, PETRI_PLACES=56, PETRI_TRANSITIONS=50} [2025-04-13 21:00:37,621 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 36 predicate places. [2025-04-13 21:00:37,621 INFO L485 AbstractCegarLoop]: Abstraction has has 56 places, 50 transitions, 480 flow [2025-04-13 21:00:37,621 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 4.473684210526316) internal successors, (85), 19 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:00:37,622 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:00:37,622 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:00:37,628 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-13 21:00:37,826 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:00:37,827 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:00:37,828 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:00:37,828 INFO L85 PathProgramCache]: Analyzing trace with hash -941618009, now seen corresponding path program 2 times [2025-04-13 21:00:37,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:00:37,828 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608240138] [2025-04-13 21:00:37,828 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 21:00:37,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:00:37,837 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-04-13 21:00:37,857 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 21:00:37,857 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 21:00:37,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:00:38,465 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:00:38,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:00:38,465 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608240138] [2025-04-13 21:00:38,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608240138] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:00:38,465 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [849805544] [2025-04-13 21:00:38,465 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 21:00:38,465 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:00:38,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:00:38,467 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 21:00:38,469 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-04-13 21:00:38,501 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-04-13 21:00:38,516 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 21:00:38,516 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 21:00:38,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:00:38,517 INFO L256 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-04-13 21:00:38,518 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:00:38,618 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 21:00:38,618 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 20 [2025-04-13 21:00:38,623 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 21:00:38,623 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:00:38,689 INFO L325 Elim1Store]: treesize reduction 10, result has 84.6 percent of original size [2025-04-13 21:00:38,689 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 74 [2025-04-13 21:00:38,714 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 21:00:38,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [849805544] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 21:00:38,714 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 21:00:38,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 3] total 14 [2025-04-13 21:00:38,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464423772] [2025-04-13 21:00:38,714 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 21:00:38,714 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-13 21:00:38,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:00:38,715 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-13 21:00:38,715 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2025-04-13 21:00:38,715 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2025-04-13 21:00:38,715 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 50 transitions, 480 flow. Second operand has 16 states, 16 states have (on average 4.8125) internal successors, (77), 16 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:00:38,715 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:00:38,715 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2025-04-13 21:00:38,715 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:00:39,022 INFO L116 PetriNetUnfolderBase]: 267/475 cut-off events. [2025-04-13 21:00:39,022 INFO L117 PetriNetUnfolderBase]: For 1451/1451 co-relation queries the response was YES. [2025-04-13 21:00:39,023 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2295 conditions, 475 events. 267/475 cut-off events. For 1451/1451 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1768 event pairs, 43 based on Foata normal form. 1/474 useless extension candidates. Maximal degree in co-relation 2254. Up to 312 conditions per place. [2025-04-13 21:00:39,025 INFO L140 encePairwiseOnDemand]: 13/19 looper letters, 74 selfloop transitions, 36 changer transitions 1/111 dead transitions. [2025-04-13 21:00:39,026 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 111 transitions, 1109 flow [2025-04-13 21:00:39,026 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 21:00:39,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-04-13 21:00:39,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 109 transitions. [2025-04-13 21:00:39,027 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3824561403508772 [2025-04-13 21:00:39,027 INFO L175 Difference]: Start difference. First operand has 56 places, 50 transitions, 480 flow. Second operand 15 states and 109 transitions. [2025-04-13 21:00:39,027 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 111 transitions, 1109 flow [2025-04-13 21:00:39,030 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 111 transitions, 1034 flow, removed 30 selfloop flow, removed 4 redundant places. [2025-04-13 21:00:39,031 INFO L231 Difference]: Finished difference. Result has 65 places, 72 transitions, 752 flow [2025-04-13 21:00:39,032 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=427, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=752, PETRI_PLACES=65, PETRI_TRANSITIONS=72} [2025-04-13 21:00:39,032 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 45 predicate places. [2025-04-13 21:00:39,032 INFO L485 AbstractCegarLoop]: Abstraction has has 65 places, 72 transitions, 752 flow [2025-04-13 21:00:39,032 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.8125) internal successors, (77), 16 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:00:39,032 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:00:39,032 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:00:39,039 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-04-13 21:00:39,234 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,SelfDestructingSolverStorable9 [2025-04-13 21:00:39,234 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:00:39,234 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:00:39,234 INFO L85 PathProgramCache]: Analyzing trace with hash -1704103865, now seen corresponding path program 3 times [2025-04-13 21:00:39,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:00:39,235 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378046548] [2025-04-13 21:00:39,235 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 21:00:39,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:00:39,240 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 18 statements into 2 equivalence classes. [2025-04-13 21:00:39,248 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 21:00:39,248 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 21:00:39,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:00:39,719 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:00:39,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:00:39,720 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378046548] [2025-04-13 21:00:39,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378046548] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:00:39,720 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1154103707] [2025-04-13 21:00:39,720 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 21:00:39,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:00:39,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:00:39,722 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 21:00:39,723 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-04-13 21:00:39,763 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 18 statements into 2 equivalence classes. [2025-04-13 21:00:39,777 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 21:00:39,778 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 21:00:39,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:00:39,778 INFO L256 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-04-13 21:00:39,779 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:00:39,879 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 21:00:39,880 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 20 [2025-04-13 21:00:39,884 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 21:00:39,884 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:00:39,963 INFO L325 Elim1Store]: treesize reduction 10, result has 84.6 percent of original size [2025-04-13 21:00:39,964 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 74 [2025-04-13 21:00:39,991 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 21:00:39,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1154103707] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 21:00:39,991 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 21:00:39,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 3] total 14 [2025-04-13 21:00:39,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235052814] [2025-04-13 21:00:39,992 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 21:00:39,992 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-13 21:00:39,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:00:39,992 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-13 21:00:39,992 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2025-04-13 21:00:39,992 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2025-04-13 21:00:39,992 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 72 transitions, 752 flow. Second operand has 16 states, 16 states have (on average 4.8125) internal successors, (77), 16 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:00:39,993 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:00:39,993 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2025-04-13 21:00:39,993 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:00:40,326 INFO L116 PetriNetUnfolderBase]: 387/682 cut-off events. [2025-04-13 21:00:40,326 INFO L117 PetriNetUnfolderBase]: For 2019/2019 co-relation queries the response was YES. [2025-04-13 21:00:40,328 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3285 conditions, 682 events. 387/682 cut-off events. For 2019/2019 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 2839 event pairs, 64 based on Foata normal form. 1/682 useless extension candidates. Maximal degree in co-relation 2855. Up to 443 conditions per place. [2025-04-13 21:00:40,331 INFO L140 encePairwiseOnDemand]: 13/19 looper letters, 97 selfloop transitions, 41 changer transitions 1/139 dead transitions. [2025-04-13 21:00:40,331 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 139 transitions, 1483 flow [2025-04-13 21:00:40,331 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-13 21:00:40,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-04-13 21:00:40,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 120 transitions. [2025-04-13 21:00:40,332 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3715170278637771 [2025-04-13 21:00:40,332 INFO L175 Difference]: Start difference. First operand has 65 places, 72 transitions, 752 flow. Second operand 17 states and 120 transitions. [2025-04-13 21:00:40,332 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 139 transitions, 1483 flow [2025-04-13 21:00:40,337 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 139 transitions, 1396 flow, removed 35 selfloop flow, removed 3 redundant places. [2025-04-13 21:00:40,338 INFO L231 Difference]: Finished difference. Result has 82 places, 96 transitions, 1060 flow [2025-04-13 21:00:40,338 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=665, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=1060, PETRI_PLACES=82, PETRI_TRANSITIONS=96} [2025-04-13 21:00:40,339 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 62 predicate places. [2025-04-13 21:00:40,339 INFO L485 AbstractCegarLoop]: Abstraction has has 82 places, 96 transitions, 1060 flow [2025-04-13 21:00:40,339 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.8125) internal successors, (77), 16 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:00:40,339 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:00:40,339 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:00:40,345 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-13 21:00:40,539 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:00:40,540 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:00:40,540 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:00:40,540 INFO L85 PathProgramCache]: Analyzing trace with hash -877121149, now seen corresponding path program 4 times [2025-04-13 21:00:40,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:00:40,540 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167013628] [2025-04-13 21:00:40,540 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 21:00:40,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:00:40,545 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 19 statements into 2 equivalence classes. [2025-04-13 21:00:40,551 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 21:00:40,551 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 21:00:40,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:00:40,656 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 21:00:40,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:00:40,657 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167013628] [2025-04-13 21:00:40,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167013628] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:00:40,657 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1192027874] [2025-04-13 21:00:40,657 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 21:00:40,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:00:40,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:00:40,659 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 21:00:40,660 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-04-13 21:00:40,697 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 19 statements into 2 equivalence classes. [2025-04-13 21:00:40,713 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 21:00:40,713 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 21:00:40,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:00:40,714 INFO L256 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-13 21:00:40,715 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:00:40,773 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 21:00:40,773 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:00:40,925 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 21:00:40,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1192027874] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 21:00:40,925 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 21:00:40,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 16 [2025-04-13 21:00:40,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791265234] [2025-04-13 21:00:40,925 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 21:00:40,925 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-13 21:00:40,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:00:40,926 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-13 21:00:40,926 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2025-04-13 21:00:40,926 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2025-04-13 21:00:40,926 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 96 transitions, 1060 flow. Second operand has 16 states, 16 states have (on average 4.125) internal successors, (66), 16 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:00:40,926 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:00:40,926 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2025-04-13 21:00:40,926 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:00:53,441 INFO L116 PetriNetUnfolderBase]: 580/1031 cut-off events. [2025-04-13 21:00:53,441 INFO L117 PetriNetUnfolderBase]: For 3078/3078 co-relation queries the response was YES. [2025-04-13 21:00:53,444 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4983 conditions, 1031 events. 580/1031 cut-off events. For 3078/3078 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 4775 event pairs, 71 based on Foata normal form. 10/1041 useless extension candidates. Maximal degree in co-relation 4598. Up to 361 conditions per place. [2025-04-13 21:00:53,448 INFO L140 encePairwiseOnDemand]: 14/19 looper letters, 127 selfloop transitions, 49 changer transitions 0/176 dead transitions. [2025-04-13 21:00:53,448 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 176 transitions, 2038 flow [2025-04-13 21:00:53,448 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 21:00:53,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-04-13 21:00:53,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 102 transitions. [2025-04-13 21:00:53,449 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4880382775119617 [2025-04-13 21:00:53,449 INFO L175 Difference]: Start difference. First operand has 82 places, 96 transitions, 1060 flow. Second operand 11 states and 102 transitions. [2025-04-13 21:00:53,450 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 176 transitions, 2038 flow [2025-04-13 21:00:53,456 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 176 transitions, 1827 flow, removed 94 selfloop flow, removed 6 redundant places. [2025-04-13 21:00:53,459 INFO L231 Difference]: Finished difference. Result has 93 places, 115 transitions, 1316 flow [2025-04-13 21:00:53,459 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=913, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1316, PETRI_PLACES=93, PETRI_TRANSITIONS=115} [2025-04-13 21:00:53,460 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 73 predicate places. [2025-04-13 21:00:53,460 INFO L485 AbstractCegarLoop]: Abstraction has has 93 places, 115 transitions, 1316 flow [2025-04-13 21:00:53,460 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.125) internal successors, (66), 16 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:00:53,460 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:00:53,460 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:00:53,468 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-04-13 21:00:53,661 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:00:53,661 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:00:53,661 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:00:53,662 INFO L85 PathProgramCache]: Analyzing trace with hash 590728222, now seen corresponding path program 5 times [2025-04-13 21:00:53,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:00:53,662 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441258475] [2025-04-13 21:00:53,662 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 21:00:53,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:00:53,667 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-04-13 21:00:53,681 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 21:00:53,681 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 21:00:53,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:00:53,798 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 21:00:53,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:00:53,798 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441258475] [2025-04-13 21:00:53,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441258475] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:00:53,798 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [726345955] [2025-04-13 21:00:53,798 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 21:00:53,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:00:53,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:00:53,800 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 21:00:53,801 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-04-13 21:00:53,840 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-04-13 21:00:53,893 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 21:00:53,893 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 21:00:53,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:00:53,895 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-04-13 21:00:53,896 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:00:53,946 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-13 21:00:54,156 INFO L325 Elim1Store]: treesize reduction 34, result has 30.6 percent of original size [2025-04-13 21:00:54,156 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 117 treesize of output 54 [2025-04-13 21:00:54,185 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:00:54,185 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:00:54,919 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 336 treesize of output 296 [2025-04-13 21:00:55,263 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 21:00:55,263 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 15 new quantified variables, introduced 36 case distinctions, treesize of input 1971 treesize of output 1263 [2025-04-13 21:01:22,752 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-13 21:01:34,076 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-13 21:01:35,936 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-13 21:01:36,442 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-13 21:02:09,583 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-13 21:02:14,379 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-13 21:02:29,486 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-13 21:02:33,000 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-13 21:02:41,157 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-13 21:03:08,050 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-13 21:03:15,658 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-13 21:03:16,254 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-13 21:03:18,203 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-13 21:03:20,588 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-13 21:03:23,706 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-13 21:03:26,655 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-13 21:03:29,122 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-13 21:03:30,241 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-13 21:03:32,877 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-13 21:03:34,627 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-13 21:03:55,393 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-13 21:04:52,260 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-13 21:04:54,250 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-13 21:04:55,022 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-13 21:04:55,492 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-13 21:04:59,001 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-13 21:04:59,597 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-13 21:05:02,259 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-13 21:05:02,536 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-13 21:05:03,198 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-13 21:05:03,524 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-13 21:05:43,123 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-13 21:05:55,995 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-13 21:06:06,499 WARN L249 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) stderr output: (error "out of memory") [2025-04-13 21:06:06,500 WARN L310 FreeRefinementEngine]: Global settings require throwing the following exception [2025-04-13 21:06:06,500 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 101 [2025-04-13 21:06:06,507 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-04-13 21:06:06,700 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,SelfDestructingSolverStorable12 [2025-04-13 21:06:06,701 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:277) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.push(Scriptor.java:133) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.push(DiffWrapperScript.java:90) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.push(WrapperScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.push(HistoryRecordingScript.java:107) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:48) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.checkRedundancy(SimplifyDDA2.java:275) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convertForPreprocessedInputTerms(SimplifyDDA2.java:499) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:484) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:103) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:99) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.simplify(SimplifyDDA2.java:589) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:245) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplifyWithStatistics(SmtUtils.java:318) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify(QuantifierPusher.java:726) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:135) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:223) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:115) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:99) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:305) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:241) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:139) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:337) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:191) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:223) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:115) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:99) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:305) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:285) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:56) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:234) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:416) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:395) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:267) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:325) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:181) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:317) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:349) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:331) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:427) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:132) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 69 more [2025-04-13 21:06:06,706 INFO L158 Benchmark]: Toolchain (without parser) took 336622.93ms. Allocated memory was 125.8MB in the beginning and 830.5MB in the end (delta: 704.6MB). Free memory was 92.1MB in the beginning and 646.6MB in the end (delta: -554.5MB). Peak memory consumption was 518.3MB. Max. memory is 8.0GB. [2025-04-13 21:06:06,706 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 142.6MB. Free memory is still 78.8MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 21:06:06,707 INFO L158 Benchmark]: CACSL2BoogieTranslator took 271.38ms. Allocated memory is still 125.8MB. Free memory was 91.8MB in the beginning and 77.1MB in the end (delta: 14.7MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2025-04-13 21:06:06,707 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.67ms. Allocated memory is still 125.8MB. Free memory was 77.1MB in the beginning and 75.2MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 21:06:06,707 INFO L158 Benchmark]: Boogie Preprocessor took 42.84ms. Allocated memory is still 125.8MB. Free memory was 75.2MB in the beginning and 73.2MB in the end (delta: 2.0MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 21:06:06,707 INFO L158 Benchmark]: RCFGBuilder took 501.81ms. Allocated memory is still 125.8MB. Free memory was 73.2MB in the beginning and 28.8MB in the end (delta: 44.3MB). Peak memory consumption was 41.9MB. Max. memory is 8.0GB. [2025-04-13 21:06:06,707 INFO L158 Benchmark]: TraceAbstraction took 335746.78ms. Allocated memory was 125.8MB in the beginning and 830.5MB in the end (delta: 704.6MB). Free memory was 89.4MB in the beginning and 646.6MB in the end (delta: -557.2MB). Peak memory consumption was 512.4MB. Max. memory is 8.0GB. [2025-04-13 21:06:06,708 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.19ms. Allocated memory is still 142.6MB. Free memory is still 78.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 271.38ms. Allocated memory is still 125.8MB. Free memory was 91.8MB in the beginning and 77.1MB in the end (delta: 14.7MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 40.67ms. Allocated memory is still 125.8MB. Free memory was 77.1MB in the beginning and 75.2MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 42.84ms. Allocated memory is still 125.8MB. Free memory was 75.2MB in the beginning and 73.2MB in the end (delta: 2.0MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 501.81ms. Allocated memory is still 125.8MB. Free memory was 73.2MB in the beginning and 28.8MB in the end (delta: 44.3MB). Peak memory consumption was 41.9MB. Max. memory is 8.0GB. * TraceAbstraction took 335746.78ms. Allocated memory was 125.8MB in the beginning and 830.5MB in the end (delta: 704.6MB). Free memory was 89.4MB in the beginning and 646.6MB in the end (delta: -557.2MB). Peak memory consumption was 512.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...