/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis PETRI_NET -i ../../../trunk/examples/svcomp/weaver/unroll-cond-3.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 21:01:59,951 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 21:01:59,997 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2025-04-13 21:02:00,001 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 21:02:00,002 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 21:02:00,016 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 21:02:00,016 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 21:02:00,016 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 21:02:00,016 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 21:02:00,016 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 21:02:00,016 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 21:02:00,016 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 21:02:00,017 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 21:02:00,017 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 21:02:00,017 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 21:02:00,017 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 21:02:00,017 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 21:02:00,018 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 21:02:00,018 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 21:02:00,018 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 21:02:00,018 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 21:02:00,018 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 21:02:00,018 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 21:02:00,018 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 21:02:00,018 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 21:02:00,018 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 21:02:00,018 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 21:02:00,018 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 21:02:00,018 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 21:02:00,018 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 21:02:00,018 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 21:02:00,018 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 21:02:00,018 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 21:02:00,019 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 21:02:00,019 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 21:02:00,019 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 21:02:00,019 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 21:02:00,019 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 21:02:00,019 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 21:02:00,019 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 21:02:00,019 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 21:02:00,019 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 21:02:00,019 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 21:02:00,019 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 21:02:00,019 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 21:02:00,019 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 21:02:00,019 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 21:02:00,019 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Automaton type used in concurrency analysis -> PETRI_NET [2025-04-13 21:02:00,238 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 21:02:00,246 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 21:02:00,247 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 21:02:00,248 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 21:02:00,249 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 21:02:00,251 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/unroll-cond-3.wvr.c [2025-04-13 21:02:01,512 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78a2c8ae1/600c3e6f7c4c4a78b4d7971fe7b7f16d/FLAGc94085f5d [2025-04-13 21:02:01,744 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 21:02:01,745 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-cond-3.wvr.c [2025-04-13 21:02:01,751 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78a2c8ae1/600c3e6f7c4c4a78b4d7971fe7b7f16d/FLAGc94085f5d [2025-04-13 21:02:02,514 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78a2c8ae1/600c3e6f7c4c4a78b4d7971fe7b7f16d [2025-04-13 21:02:02,516 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 21:02:02,517 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 21:02:02,518 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 21:02:02,518 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 21:02:02,522 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 21:02:02,522 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 09:02:02" (1/1) ... [2025-04-13 21:02:02,524 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46ac9510 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:02:02, skipping insertion in model container [2025-04-13 21:02:02,524 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 09:02:02" (1/1) ... [2025-04-13 21:02:02,537 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 21:02:02,710 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-cond-3.wvr.c[2667,2680] [2025-04-13 21:02:02,725 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 21:02:02,733 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 21:02:02,767 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-cond-3.wvr.c[2667,2680] [2025-04-13 21:02:02,772 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 21:02:02,784 INFO L204 MainTranslator]: Completed translation [2025-04-13 21:02:02,786 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:02:02 WrapperNode [2025-04-13 21:02:02,786 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 21:02:02,786 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 21:02:02,787 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 21:02:02,787 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 21:02:02,790 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:02:02" (1/1) ... [2025-04-13 21:02:02,797 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:02:02" (1/1) ... [2025-04-13 21:02:02,818 INFO L138 Inliner]: procedures = 23, calls = 27, calls flagged for inlining = 13, calls inlined = 13, statements flattened = 146 [2025-04-13 21:02:02,819 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 21:02:02,819 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 21:02:02,819 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 21:02:02,819 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 21:02:02,825 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:02:02" (1/1) ... [2025-04-13 21:02:02,825 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:02:02" (1/1) ... [2025-04-13 21:02:02,827 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:02:02" (1/1) ... [2025-04-13 21:02:02,838 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [2, 7]. 78 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2025-04-13 21:02:02,839 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:02:02" (1/1) ... [2025-04-13 21:02:02,839 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:02:02" (1/1) ... [2025-04-13 21:02:02,842 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:02:02" (1/1) ... [2025-04-13 21:02:02,843 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:02:02" (1/1) ... [2025-04-13 21:02:02,845 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:02:02" (1/1) ... [2025-04-13 21:02:02,846 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:02:02" (1/1) ... [2025-04-13 21:02:02,846 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:02:02" (1/1) ... [2025-04-13 21:02:02,849 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 21:02:02,849 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-13 21:02:02,849 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-13 21:02:02,849 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-13 21:02:02,850 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:02:02" (1/1) ... [2025-04-13 21:02:02,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 21:02:02,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:02:02,872 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-13 21:02:02,877 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-13 21:02:02,889 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 21:02:02,889 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-13 21:02:02,889 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-13 21:02:02,889 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-13 21:02:02,889 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-13 21:02:02,889 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 21:02:02,889 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-13 21:02:02,889 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-13 21:02:02,890 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-13 21:02:02,890 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-13 21:02:02,890 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 21:02:02,890 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 21:02:02,890 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-13 21:02:02,890 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-13 21:02:02,891 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-13 21:02:02,961 INFO L234 CfgBuilder]: Building ICFG [2025-04-13 21:02:02,963 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 21:02:03,160 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 21:02:03,161 INFO L289 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 21:02:03,161 INFO L294 CfgBuilder]: Performing block encoding [2025-04-13 21:02:03,355 INFO L313 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 21:02:03,357 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 09:02:03 BoogieIcfgContainer [2025-04-13 21:02:03,357 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-13 21:02:03,358 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 21:02:03,359 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 21:02:03,362 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 21:02:03,362 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 09:02:02" (1/3) ... [2025-04-13 21:02:03,364 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a366468 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 09:02:03, skipping insertion in model container [2025-04-13 21:02:03,364 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:02:02" (2/3) ... [2025-04-13 21:02:03,365 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a366468 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 09:02:03, skipping insertion in model container [2025-04-13 21:02:03,365 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 09:02:03" (3/3) ... [2025-04-13 21:02:03,366 INFO L128 eAbstractionObserver]: Analyzing ICFG unroll-cond-3.wvr.c [2025-04-13 21:02:03,376 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 21:02:03,377 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG unroll-cond-3.wvr.c that has 3 procedures, 17 locations, 17 edges, 1 initial locations, 3 loop locations, and 1 error locations. [2025-04-13 21:02:03,377 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 21:02:03,433 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-13 21:02:03,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 23 places, 19 transitions, 52 flow [2025-04-13 21:02:03,481 INFO L116 PetriNetUnfolderBase]: 3/17 cut-off events. [2025-04-13 21:02:03,483 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-13 21:02:03,489 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 3. Compared 12 event pairs, 0 based on Foata normal form. 0/13 useless extension candidates. Maximal degree in co-relation 11. Up to 2 conditions per place. [2025-04-13 21:02:03,489 INFO L82 GeneralOperation]: Start removeDead. Operand has 23 places, 19 transitions, 52 flow [2025-04-13 21:02:03,491 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 20 places, 16 transitions, 44 flow [2025-04-13 21:02:03,499 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 21:02:03,510 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;@7b2083f0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 21:02:03,510 INFO L341 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-04-13 21:02:03,520 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 21:02:03,521 INFO L116 PetriNetUnfolderBase]: 3/15 cut-off events. [2025-04-13 21:02:03,521 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-13 21:02:03,521 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:02:03,523 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:02:03,523 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:02:03,527 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:02:03,527 INFO L85 PathProgramCache]: Analyzing trace with hash 1727187576, now seen corresponding path program 1 times [2025-04-13 21:02:03,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:02:03,536 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161145624] [2025-04-13 21:02:03,536 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:02:03,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:02:03,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-13 21:02:03,624 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-13 21:02:03,624 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:02:03,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:02:03,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:02:03,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:02:03,819 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161145624] [2025-04-13 21:02:03,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161145624] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:02:03,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:02:03,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 21:02:03,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607869147] [2025-04-13 21:02:03,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:02:03,827 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 21:02:03,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:02:03,846 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 21:02:03,847 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 21:02:03,848 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2025-04-13 21:02:03,850 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 20 places, 16 transitions, 44 flow. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:02:03,850 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:02:03,850 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2025-04-13 21:02:03,850 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:02:03,914 INFO L116 PetriNetUnfolderBase]: 38/70 cut-off events. [2025-04-13 21:02:03,915 INFO L117 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-04-13 21:02:03,915 INFO L83 FinitePrefix]: Finished finitePrefix Result has 156 conditions, 70 events. 38/70 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 123 event pairs, 22 based on Foata normal form. 0/54 useless extension candidates. Maximal degree in co-relation 120. Up to 70 conditions per place. [2025-04-13 21:02:03,916 INFO L140 encePairwiseOnDemand]: 16/19 looper letters, 15 selfloop transitions, 2 changer transitions 0/17 dead transitions. [2025-04-13 21:02:03,916 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 22 places, 17 transitions, 80 flow [2025-04-13 21:02:03,917 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 21:02:03,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 21:02:03,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 24 transitions. [2025-04-13 21:02:03,925 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.42105263157894735 [2025-04-13 21:02:03,926 INFO L175 Difference]: Start difference. First operand has 20 places, 16 transitions, 44 flow. Second operand 3 states and 24 transitions. [2025-04-13 21:02:03,926 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 22 places, 17 transitions, 80 flow [2025-04-13 21:02:03,928 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 18 places, 17 transitions, 72 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-04-13 21:02:03,930 INFO L231 Difference]: Finished difference. Result has 19 places, 17 transitions, 48 flow [2025-04-13 21:02:03,931 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=36, PETRI_DIFFERENCE_MINUEND_PLACES=16, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=48, PETRI_PLACES=19, PETRI_TRANSITIONS=17} [2025-04-13 21:02:03,933 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, -1 predicate places. [2025-04-13 21:02:03,933 INFO L485 AbstractCegarLoop]: Abstraction has has 19 places, 17 transitions, 48 flow [2025-04-13 21:02:03,933 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:02:03,933 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:02:03,933 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:02:03,933 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 21:02:03,934 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:02:03,934 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:02:03,934 INFO L85 PathProgramCache]: Analyzing trace with hash 836461973, now seen corresponding path program 1 times [2025-04-13 21:02:03,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:02:03,934 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814702533] [2025-04-13 21:02:03,934 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:02:03,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:02:03,943 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-13 21:02:03,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 21:02:03,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:02:03,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:02:04,266 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 21:02:04,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:02:04,267 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814702533] [2025-04-13 21:02:04,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814702533] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:02:04,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:02:04,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 21:02:04,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470812966] [2025-04-13 21:02:04,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:02:04,268 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 21:02:04,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:02:04,268 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 21:02:04,268 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-13 21:02:04,268 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2025-04-13 21:02:04,268 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 19 places, 17 transitions, 48 flow. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:02:04,268 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:02:04,268 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2025-04-13 21:02:04,268 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:02:04,556 INFO L116 PetriNetUnfolderBase]: 68/119 cut-off events. [2025-04-13 21:02:04,557 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-13 21:02:04,557 INFO L83 FinitePrefix]: Finished finitePrefix Result has 253 conditions, 119 events. 68/119 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 307 event pairs, 1 based on Foata normal form. 0/90 useless extension candidates. Maximal degree in co-relation 242. Up to 80 conditions per place. [2025-04-13 21:02:04,558 INFO L140 encePairwiseOnDemand]: 12/19 looper letters, 30 selfloop transitions, 12 changer transitions 0/42 dead transitions. [2025-04-13 21:02:04,558 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 42 transitions, 187 flow [2025-04-13 21:02:04,558 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 21:02:04,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 21:02:04,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 54 transitions. [2025-04-13 21:02:04,559 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.47368421052631576 [2025-04-13 21:02:04,559 INFO L175 Difference]: Start difference. First operand has 19 places, 17 transitions, 48 flow. Second operand 6 states and 54 transitions. [2025-04-13 21:02:04,559 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 24 places, 42 transitions, 187 flow [2025-04-13 21:02:04,559 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 23 places, 42 transitions, 183 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-04-13 21:02:04,561 INFO L231 Difference]: Finished difference. Result has 26 places, 28 transitions, 115 flow [2025-04-13 21:02:04,561 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=44, PETRI_DIFFERENCE_MINUEND_PLACES=18, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=10, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=115, PETRI_PLACES=26, PETRI_TRANSITIONS=28} [2025-04-13 21:02:04,561 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 6 predicate places. [2025-04-13 21:02:04,561 INFO L485 AbstractCegarLoop]: Abstraction has has 26 places, 28 transitions, 115 flow [2025-04-13 21:02:04,561 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:02:04,561 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:02:04,562 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:02:04,562 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 21:02:04,562 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:02:04,562 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:02:04,562 INFO L85 PathProgramCache]: Analyzing trace with hash -617230243, now seen corresponding path program 2 times [2025-04-13 21:02:04,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:02:04,562 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976351022] [2025-04-13 21:02:04,562 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 21:02:04,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:02:04,574 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-04-13 21:02:04,603 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 13 of 14 statements. [2025-04-13 21:02:04,604 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 21:02:04,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:02:04,787 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 21:02:04,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:02:04,788 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976351022] [2025-04-13 21:02:04,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976351022] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:02:04,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:02:04,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 21:02:04,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628534300] [2025-04-13 21:02:04,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:02:04,788 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 21:02:04,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:02:04,788 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 21:02:04,788 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-04-13 21:02:04,789 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2025-04-13 21:02:04,789 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 28 transitions, 115 flow. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:02:04,789 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:02:04,789 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2025-04-13 21:02:04,790 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:02:04,931 INFO L116 PetriNetUnfolderBase]: 77/133 cut-off events. [2025-04-13 21:02:04,931 INFO L117 PetriNetUnfolderBase]: For 44/44 co-relation queries the response was YES. [2025-04-13 21:02:04,932 INFO L83 FinitePrefix]: Finished finitePrefix Result has 421 conditions, 133 events. 77/133 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 336 event pairs, 9 based on Foata normal form. 0/108 useless extension candidates. Maximal degree in co-relation 402. Up to 89 conditions per place. [2025-04-13 21:02:04,933 INFO L140 encePairwiseOnDemand]: 12/19 looper letters, 28 selfloop transitions, 18 changer transitions 0/46 dead transitions. [2025-04-13 21:02:04,933 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 46 transitions, 276 flow [2025-04-13 21:02:04,934 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 21:02:04,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 21:02:04,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 52 transitions. [2025-04-13 21:02:04,937 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.45614035087719296 [2025-04-13 21:02:04,937 INFO L175 Difference]: Start difference. First operand has 26 places, 28 transitions, 115 flow. Second operand 6 states and 52 transitions. [2025-04-13 21:02:04,937 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 46 transitions, 276 flow [2025-04-13 21:02:04,938 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 46 transitions, 268 flow, removed 4 selfloop flow, removed 0 redundant places. [2025-04-13 21:02:04,939 INFO L231 Difference]: Finished difference. Result has 34 places, 36 transitions, 210 flow [2025-04-13 21:02:04,939 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=210, PETRI_PLACES=34, PETRI_TRANSITIONS=36} [2025-04-13 21:02:04,941 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2025-04-13 21:02:04,941 INFO L485 AbstractCegarLoop]: Abstraction has has 34 places, 36 transitions, 210 flow [2025-04-13 21:02:04,941 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:02:04,941 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:02:04,941 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:02:04,942 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 21:02:04,942 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:02:04,942 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:02:04,942 INFO L85 PathProgramCache]: Analyzing trace with hash 426236381, now seen corresponding path program 3 times [2025-04-13 21:02:04,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:02:04,943 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996921597] [2025-04-13 21:02:04,943 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 21:02:04,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:02:04,953 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 14 statements into 2 equivalence classes. [2025-04-13 21:02:04,965 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 13 of 14 statements. [2025-04-13 21:02:04,965 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 21:02:04,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:02:05,112 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 21:02:05,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:02:05,112 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996921597] [2025-04-13 21:02:05,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996921597] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:02:05,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:02:05,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 21:02:05,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464868785] [2025-04-13 21:02:05,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:02:05,113 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 21:02:05,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:02:05,113 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 21:02:05,113 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-04-13 21:02:05,113 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2025-04-13 21:02:05,113 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 36 transitions, 210 flow. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:02:05,113 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:02:05,113 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2025-04-13 21:02:05,113 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:02:05,202 INFO L116 PetriNetUnfolderBase]: 78/145 cut-off events. [2025-04-13 21:02:05,203 INFO L117 PetriNetUnfolderBase]: For 94/94 co-relation queries the response was YES. [2025-04-13 21:02:05,203 INFO L83 FinitePrefix]: Finished finitePrefix Result has 541 conditions, 145 events. 78/145 cut-off events. For 94/94 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 403 event pairs, 1 based on Foata normal form. 1/119 useless extension candidates. Maximal degree in co-relation 517. Up to 86 conditions per place. [2025-04-13 21:02:05,204 INFO L140 encePairwiseOnDemand]: 11/19 looper letters, 33 selfloop transitions, 19 changer transitions 2/54 dead transitions. [2025-04-13 21:02:05,204 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 54 transitions, 377 flow [2025-04-13 21:02:05,205 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 21:02:05,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 21:02:05,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 58 transitions. [2025-04-13 21:02:05,205 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5087719298245614 [2025-04-13 21:02:05,205 INFO L175 Difference]: Start difference. First operand has 34 places, 36 transitions, 210 flow. Second operand 6 states and 58 transitions. [2025-04-13 21:02:05,205 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 54 transitions, 377 flow [2025-04-13 21:02:05,207 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 54 transitions, 353 flow, removed 5 selfloop flow, removed 1 redundant places. [2025-04-13 21:02:05,207 INFO L231 Difference]: Finished difference. Result has 40 places, 38 transitions, 256 flow [2025-04-13 21:02:05,208 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=186, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=256, PETRI_PLACES=40, PETRI_TRANSITIONS=38} [2025-04-13 21:02:05,208 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 20 predicate places. [2025-04-13 21:02:05,208 INFO L485 AbstractCegarLoop]: Abstraction has has 40 places, 38 transitions, 256 flow [2025-04-13 21:02:05,208 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:02:05,208 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:02:05,208 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:02:05,208 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 21:02:05,208 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:02:05,209 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:02:05,209 INFO L85 PathProgramCache]: Analyzing trace with hash -554197767, now seen corresponding path program 4 times [2025-04-13 21:02:05,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:02:05,209 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945229379] [2025-04-13 21:02:05,209 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 21:02:05,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:02:05,215 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 14 statements into 2 equivalence classes. [2025-04-13 21:02:05,229 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 21:02:05,229 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 21:02:05,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:02:05,454 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 21:02:05,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:02:05,455 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945229379] [2025-04-13 21:02:05,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945229379] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:02:05,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:02:05,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 21:02:05,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58682405] [2025-04-13 21:02:05,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:02:05,455 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 21:02:05,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:02:05,455 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 21:02:05,456 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-13 21:02:05,456 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2025-04-13 21:02:05,456 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 38 transitions, 256 flow. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:02:05,456 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:02:05,456 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2025-04-13 21:02:05,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:02:05,602 INFO L116 PetriNetUnfolderBase]: 75/133 cut-off events. [2025-04-13 21:02:05,603 INFO L117 PetriNetUnfolderBase]: For 208/208 co-relation queries the response was YES. [2025-04-13 21:02:05,603 INFO L83 FinitePrefix]: Finished finitePrefix Result has 546 conditions, 133 events. 75/133 cut-off events. For 208/208 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 349 event pairs, 1 based on Foata normal form. 3/116 useless extension candidates. Maximal degree in co-relation 519. Up to 89 conditions per place. [2025-04-13 21:02:05,604 INFO L140 encePairwiseOnDemand]: 12/19 looper letters, 31 selfloop transitions, 18 changer transitions 0/49 dead transitions. [2025-04-13 21:02:05,604 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 49 transitions, 379 flow [2025-04-13 21:02:05,604 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 21:02:05,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 21:02:05,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 54 transitions. [2025-04-13 21:02:05,605 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.47368421052631576 [2025-04-13 21:02:05,605 INFO L175 Difference]: Start difference. First operand has 40 places, 38 transitions, 256 flow. Second operand 6 states and 54 transitions. [2025-04-13 21:02:05,605 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 49 transitions, 379 flow [2025-04-13 21:02:05,607 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 49 transitions, 355 flow, removed 3 selfloop flow, removed 2 redundant places. [2025-04-13 21:02:05,609 INFO L231 Difference]: Finished difference. Result has 44 places, 38 transitions, 275 flow [2025-04-13 21:02:05,609 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=275, PETRI_PLACES=44, PETRI_TRANSITIONS=38} [2025-04-13 21:02:05,609 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 24 predicate places. [2025-04-13 21:02:05,609 INFO L485 AbstractCegarLoop]: Abstraction has has 44 places, 38 transitions, 275 flow [2025-04-13 21:02:05,609 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:02:05,609 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:02:05,609 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:02:05,609 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 21:02:05,609 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:02:05,610 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:02:05,610 INFO L85 PathProgramCache]: Analyzing trace with hash -613799473, now seen corresponding path program 5 times [2025-04-13 21:02:05,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:02:05,610 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793920005] [2025-04-13 21:02:05,610 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 21:02:05,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:02:05,617 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-04-13 21:02:05,635 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 21:02:05,635 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 21:02:05,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:02:05,804 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 21:02:05,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:02:05,805 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793920005] [2025-04-13 21:02:05,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793920005] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:02:05,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:02:05,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 21:02:05,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21097861] [2025-04-13 21:02:05,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:02:05,805 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 21:02:05,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:02:05,807 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 21:02:05,807 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-04-13 21:02:05,807 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2025-04-13 21:02:05,807 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 38 transitions, 275 flow. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:02:05,807 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:02:05,807 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2025-04-13 21:02:05,807 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:02:05,900 INFO L116 PetriNetUnfolderBase]: 77/141 cut-off events. [2025-04-13 21:02:05,901 INFO L117 PetriNetUnfolderBase]: For 211/211 co-relation queries the response was YES. [2025-04-13 21:02:05,901 INFO L83 FinitePrefix]: Finished finitePrefix Result has 594 conditions, 141 events. 77/141 cut-off events. For 211/211 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 396 event pairs, 0 based on Foata normal form. 1/120 useless extension candidates. Maximal degree in co-relation 566. Up to 86 conditions per place. [2025-04-13 21:02:05,902 INFO L140 encePairwiseOnDemand]: 11/19 looper letters, 30 selfloop transitions, 20 changer transitions 2/52 dead transitions. [2025-04-13 21:02:05,902 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 52 transitions, 420 flow [2025-04-13 21:02:05,902 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 21:02:05,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-13 21:02:05,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 57 transitions. [2025-04-13 21:02:05,903 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.42857142857142855 [2025-04-13 21:02:05,903 INFO L175 Difference]: Start difference. First operand has 44 places, 38 transitions, 275 flow. Second operand 7 states and 57 transitions. [2025-04-13 21:02:05,903 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 52 transitions, 420 flow [2025-04-13 21:02:05,905 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 52 transitions, 384 flow, removed 1 selfloop flow, removed 4 redundant places. [2025-04-13 21:02:05,906 INFO L231 Difference]: Finished difference. Result has 48 places, 39 transitions, 299 flow [2025-04-13 21:02:05,906 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=239, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=299, PETRI_PLACES=48, PETRI_TRANSITIONS=39} [2025-04-13 21:02:05,907 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 28 predicate places. [2025-04-13 21:02:05,907 INFO L485 AbstractCegarLoop]: Abstraction has has 48 places, 39 transitions, 299 flow [2025-04-13 21:02:05,907 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:02:05,907 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:02:05,907 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:02:05,907 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-13 21:02:05,907 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:02:05,907 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:02:05,907 INFO L85 PathProgramCache]: Analyzing trace with hash -2130582553, now seen corresponding path program 6 times [2025-04-13 21:02:05,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:02:05,907 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901927612] [2025-04-13 21:02:05,908 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 21:02:05,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:02:05,914 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 14 statements into 2 equivalence classes. [2025-04-13 21:02:05,922 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 13 of 14 statements. [2025-04-13 21:02:05,923 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 21:02:05,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:02:06,006 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 21:02:06,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:02:06,007 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901927612] [2025-04-13 21:02:06,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901927612] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:02:06,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:02:06,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 21:02:06,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642677878] [2025-04-13 21:02:06,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:02:06,007 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 21:02:06,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:02:06,008 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 21:02:06,008 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 21:02:06,008 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2025-04-13 21:02:06,008 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 39 transitions, 299 flow. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:02:06,008 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:02:06,008 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2025-04-13 21:02:06,008 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:02:06,113 INFO L116 PetriNetUnfolderBase]: 104/185 cut-off events. [2025-04-13 21:02:06,113 INFO L117 PetriNetUnfolderBase]: For 364/364 co-relation queries the response was YES. [2025-04-13 21:02:06,114 INFO L83 FinitePrefix]: Finished finitePrefix Result has 779 conditions, 185 events. 104/185 cut-off events. For 364/364 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 544 event pairs, 20 based on Foata normal form. 0/149 useless extension candidates. Maximal degree in co-relation 749. Up to 74 conditions per place. [2025-04-13 21:02:06,115 INFO L140 encePairwiseOnDemand]: 13/19 looper letters, 39 selfloop transitions, 21 changer transitions 0/60 dead transitions. [2025-04-13 21:02:06,115 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 60 transitions, 508 flow [2025-04-13 21:02:06,117 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 21:02:06,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 21:02:06,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 56 transitions. [2025-04-13 21:02:06,118 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.49122807017543857 [2025-04-13 21:02:06,118 INFO L175 Difference]: Start difference. First operand has 48 places, 39 transitions, 299 flow. Second operand 6 states and 56 transitions. [2025-04-13 21:02:06,118 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 60 transitions, 508 flow [2025-04-13 21:02:06,120 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 60 transitions, 401 flow, removed 14 selfloop flow, removed 9 redundant places. [2025-04-13 21:02:06,121 INFO L231 Difference]: Finished difference. Result has 48 places, 44 transitions, 310 flow [2025-04-13 21:02:06,121 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=204, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=310, PETRI_PLACES=48, PETRI_TRANSITIONS=44} [2025-04-13 21:02:06,122 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 28 predicate places. [2025-04-13 21:02:06,122 INFO L485 AbstractCegarLoop]: Abstraction has has 48 places, 44 transitions, 310 flow [2025-04-13 21:02:06,122 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:02:06,122 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:02:06,122 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:02:06,122 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-13 21:02:06,122 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:02:06,124 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:02:06,124 INFO L85 PathProgramCache]: Analyzing trace with hash -1556520131, now seen corresponding path program 1 times [2025-04-13 21:02:06,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:02:06,124 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960140771] [2025-04-13 21:02:06,124 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:02:06,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:02:06,130 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-13 21:02:06,145 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 21:02:06,145 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:02:06,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:02:06,272 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 21:02:06,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:02:06,272 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960140771] [2025-04-13 21:02:06,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960140771] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:02:06,272 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [894038422] [2025-04-13 21:02:06,272 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:02:06,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:02:06,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:02:06,275 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 21:02:06,277 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-04-13 21:02:06,324 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-13 21:02:06,346 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 21:02:06,346 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:02:06,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:02:06,351 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-04-13 21:02:06,356 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:02:06,417 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-13 21:02:06,742 INFO L325 Elim1Store]: treesize reduction 39, result has 20.4 percent of original size [2025-04-13 21:02:06,743 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 152 treesize of output 86 [2025-04-13 21:02:06,783 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:02:06,783 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:02:07,592 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 318 treesize of output 280 [2025-04-13 21:02:07,745 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 21:02:07,746 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 12 new quantified variables, introduced 21 case distinctions, treesize of input 1221 treesize of output 881 [2025-04-13 21:02:24,400 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:02:24,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [894038422] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 21:02:24,400 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 21:02:24,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 7] total 21 [2025-04-13 21:02:24,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580585967] [2025-04-13 21:02:24,400 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 21:02:24,400 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-04-13 21:02:24,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:02:24,401 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-04-13 21:02:24,401 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=317, Unknown=0, NotChecked=0, Total=420 [2025-04-13 21:02:24,401 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2025-04-13 21:02:24,402 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 44 transitions, 310 flow. Second operand has 21 states, 21 states have (on average 4.142857142857143) internal successors, (87), 21 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:02:24,402 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:02:24,402 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2025-04-13 21:02:24,402 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:02:25,177 INFO L116 PetriNetUnfolderBase]: 231/422 cut-off events. [2025-04-13 21:02:25,177 INFO L117 PetriNetUnfolderBase]: For 757/757 co-relation queries the response was YES. [2025-04-13 21:02:25,178 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1760 conditions, 422 events. 231/422 cut-off events. For 757/757 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 1731 event pairs, 11 based on Foata normal form. 3/381 useless extension candidates. Maximal degree in co-relation 1620. Up to 149 conditions per place. [2025-04-13 21:02:25,180 INFO L140 encePairwiseOnDemand]: 9/19 looper letters, 75 selfloop transitions, 63 changer transitions 30/168 dead transitions. [2025-04-13 21:02:25,180 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 168 transitions, 1270 flow [2025-04-13 21:02:25,181 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-04-13 21:02:25,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2025-04-13 21:02:25,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 203 transitions. [2025-04-13 21:02:25,183 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3815789473684211 [2025-04-13 21:02:25,183 INFO L175 Difference]: Start difference. First operand has 48 places, 44 transitions, 310 flow. Second operand 28 states and 203 transitions. [2025-04-13 21:02:25,183 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 168 transitions, 1270 flow [2025-04-13 21:02:25,188 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 168 transitions, 1197 flow, removed 18 selfloop flow, removed 2 redundant places. [2025-04-13 21:02:25,190 INFO L231 Difference]: Finished difference. Result has 84 places, 82 transitions, 743 flow [2025-04-13 21:02:25,191 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=273, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=10, PETRI_DIFFERENCE_SUBTRAHEND_STATES=28, PETRI_FLOW=743, PETRI_PLACES=84, PETRI_TRANSITIONS=82} [2025-04-13 21:02:25,192 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 64 predicate places. [2025-04-13 21:02:25,192 INFO L485 AbstractCegarLoop]: Abstraction has has 84 places, 82 transitions, 743 flow [2025-04-13 21:02:25,192 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 4.142857142857143) internal successors, (87), 21 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:02:25,192 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:02:25,192 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:02:25,198 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:02:25,392 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:02:25,393 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:02:25,393 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:02:25,393 INFO L85 PathProgramCache]: Analyzing trace with hash -894085691, now seen corresponding path program 1 times [2025-04-13 21:02:25,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:02:25,393 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163117348] [2025-04-13 21:02:25,393 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:02:25,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:02:25,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-13 21:02:25,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 21:02:25,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:02:25,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:02:25,508 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 21:02:25,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:02:25,508 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163117348] [2025-04-13 21:02:25,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163117348] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:02:25,508 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [30141699] [2025-04-13 21:02:25,509 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:02:25,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:02:25,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:02:25,511 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:02:25,512 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:02:25,551 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-13 21:02:25,567 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 21:02:25,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:02:25,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:02:25,569 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-04-13 21:02:25,571 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:02:25,591 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-13 21:02:25,745 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-13 21:02:25,745 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 117 treesize of output 104 [2025-04-13 21:02:25,799 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:02:25,799 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:02:26,255 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 29 [2025-04-13 21:02:26,261 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-13 21:02:26,261 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 41 [2025-04-13 21:02:26,271 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 77 [2025-04-13 21:02:26,302 INFO L325 Elim1Store]: treesize reduction 24, result has 60.7 percent of original size [2025-04-13 21:02:26,302 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 216 treesize of output 164 [2025-04-13 21:02:26,432 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:02:26,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [30141699] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 21:02:26,432 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 21:02:26,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 19 [2025-04-13 21:02:26,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795357298] [2025-04-13 21:02:26,432 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 21:02:26,433 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-04-13 21:02:26,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:02:26,433 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-04-13 21:02:26,433 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=280, Unknown=0, NotChecked=0, Total=342 [2025-04-13 21:02:26,433 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2025-04-13 21:02:26,434 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 82 transitions, 743 flow. Second operand has 19 states, 19 states have (on average 4.2631578947368425) internal successors, (81), 19 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:02:26,434 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:02:26,434 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2025-04-13 21:02:26,434 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:02:28,411 INFO L116 PetriNetUnfolderBase]: 391/738 cut-off events. [2025-04-13 21:02:28,411 INFO L117 PetriNetUnfolderBase]: For 3078/3078 co-relation queries the response was YES. [2025-04-13 21:02:28,413 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3780 conditions, 738 events. 391/738 cut-off events. For 3078/3078 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 3573 event pairs, 15 based on Foata normal form. 11/747 useless extension candidates. Maximal degree in co-relation 3683. Up to 229 conditions per place. [2025-04-13 21:02:28,416 INFO L140 encePairwiseOnDemand]: 9/19 looper letters, 114 selfloop transitions, 67 changer transitions 66/247 dead transitions. [2025-04-13 21:02:28,416 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 247 transitions, 2350 flow [2025-04-13 21:02:28,416 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-04-13 21:02:28,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2025-04-13 21:02:28,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 264 transitions. [2025-04-13 21:02:28,417 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.42105263157894735 [2025-04-13 21:02:28,417 INFO L175 Difference]: Start difference. First operand has 84 places, 82 transitions, 743 flow. Second operand 33 states and 264 transitions. [2025-04-13 21:02:28,418 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 247 transitions, 2350 flow [2025-04-13 21:02:28,427 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 247 transitions, 2132 flow, removed 89 selfloop flow, removed 8 redundant places. [2025-04-13 21:02:28,429 INFO L231 Difference]: Finished difference. Result has 117 places, 102 transitions, 1071 flow [2025-04-13 21:02:28,429 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=631, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=33, PETRI_FLOW=1071, PETRI_PLACES=117, PETRI_TRANSITIONS=102} [2025-04-13 21:02:28,429 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 97 predicate places. [2025-04-13 21:02:28,430 INFO L485 AbstractCegarLoop]: Abstraction has has 117 places, 102 transitions, 1071 flow [2025-04-13 21:02:28,430 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 4.2631578947368425) internal successors, (81), 19 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:02:28,430 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:02:28,430 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:02:28,436 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-04-13 21:02:28,630 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2025-04-13 21:02:28,631 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:02:28,631 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:02:28,631 INFO L85 PathProgramCache]: Analyzing trace with hash 20200099, now seen corresponding path program 2 times [2025-04-13 21:02:28,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:02:28,631 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235073200] [2025-04-13 21:02:28,631 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 21:02:28,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:02:28,640 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-04-13 21:02:28,661 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 21:02:28,662 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 21:02:28,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:02:28,786 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 21:02:28,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:02:28,786 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235073200] [2025-04-13 21:02:28,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235073200] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:02:28,787 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [41678545] [2025-04-13 21:02:28,787 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 21:02:28,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:02:28,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:02:28,789 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:02:28,790 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:02:28,829 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-04-13 21:02:28,864 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 21:02:28,865 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 21:02:28,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:02:28,866 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-04-13 21:02:28,868 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:02:28,997 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 21:02:28,998 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:02:29,762 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-13 21:02:29,763 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 7 [2025-04-13 21:02:29,793 INFO L325 Elim1Store]: treesize reduction 5, result has 84.8 percent of original size [2025-04-13 21:02:29,794 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 42 [2025-04-13 21:02:29,817 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-13 21:02:29,817 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 7 [2025-04-13 21:02:29,831 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 11 treesize of output 3 [2025-04-13 21:02:29,875 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 21:02:29,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [41678545] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 21:02:29,876 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 21:02:29,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 6] total 17 [2025-04-13 21:02:29,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641604668] [2025-04-13 21:02:29,876 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 21:02:29,876 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-04-13 21:02:29,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:02:29,876 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-04-13 21:02:29,876 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2025-04-13 21:02:29,877 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2025-04-13 21:02:29,877 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 102 transitions, 1071 flow. Second operand has 17 states, 17 states have (on average 4.117647058823529) internal successors, (70), 17 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:02:29,877 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:02:29,877 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2025-04-13 21:02:29,877 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:03:17,160 WARN L286 SmtUtils]: Spent 46.66s on a formula simplification. DAG size of input: 73 DAG size of output: 70 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 21:03:58,229 WARN L286 SmtUtils]: Spent 41.02s on a formula simplification. DAG size of input: 84 DAG size of output: 60 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 21:03:59,107 INFO L116 PetriNetUnfolderBase]: 313/647 cut-off events. [2025-04-13 21:03:59,108 INFO L117 PetriNetUnfolderBase]: For 4504/4504 co-relation queries the response was YES. [2025-04-13 21:03:59,111 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3730 conditions, 647 events. 313/647 cut-off events. For 4504/4504 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 3324 event pairs, 23 based on Foata normal form. 10/656 useless extension candidates. Maximal degree in co-relation 3650. Up to 375 conditions per place. [2025-04-13 21:03:59,114 INFO L140 encePairwiseOnDemand]: 10/19 looper letters, 87 selfloop transitions, 73 changer transitions 11/171 dead transitions. [2025-04-13 21:03:59,115 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 171 transitions, 1974 flow [2025-04-13 21:03:59,115 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 21:03:59,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-04-13 21:03:59,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 123 transitions. [2025-04-13 21:03:59,117 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.40460526315789475 [2025-04-13 21:03:59,117 INFO L175 Difference]: Start difference. First operand has 117 places, 102 transitions, 1071 flow. Second operand 16 states and 123 transitions. [2025-04-13 21:03:59,117 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 171 transitions, 1974 flow [2025-04-13 21:03:59,131 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 171 transitions, 1607 flow, removed 149 selfloop flow, removed 20 redundant places. [2025-04-13 21:03:59,133 INFO L231 Difference]: Finished difference. Result has 112 places, 131 transitions, 1365 flow [2025-04-13 21:03:59,133 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=858, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=1365, PETRI_PLACES=112, PETRI_TRANSITIONS=131} [2025-04-13 21:03:59,134 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 92 predicate places. [2025-04-13 21:03:59,134 INFO L485 AbstractCegarLoop]: Abstraction has has 112 places, 131 transitions, 1365 flow [2025-04-13 21:03:59,134 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.117647058823529) internal successors, (70), 17 states have internal predecessors, (70), 0 states have call successors, (0), 0 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:03:59,134 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:03:59,134 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:03:59,142 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:03:59,334 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:03:59,335 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:03:59,335 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:03:59,335 INFO L85 PathProgramCache]: Analyzing trace with hash 106747759, now seen corresponding path program 3 times [2025-04-13 21:03:59,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:03:59,335 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128562627] [2025-04-13 21:03:59,335 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 21:03:59,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:03:59,340 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 15 statements into 2 equivalence classes. [2025-04-13 21:03:59,355 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 21:03:59,355 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 21:03:59,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:03:59,438 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:03:59,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:03:59,439 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128562627] [2025-04-13 21:03:59,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128562627] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:03:59,439 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1558401855] [2025-04-13 21:03:59,439 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 21:03:59,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:03:59,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:03:59,441 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:03:59,443 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:03:59,483 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 15 statements into 2 equivalence classes. [2025-04-13 21:03:59,508 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 21:03:59,508 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 21:03:59,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:03:59,509 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-04-13 21:03:59,510 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:03:59,647 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 21:03:59,647 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 28 treesize of output 23 [2025-04-13 21:03:59,665 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:03:59,665 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:03:59,754 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 21:03:59,754 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 154 treesize of output 154 [2025-04-13 21:04:00,340 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 21:04:00,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1558401855] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 21:04:00,340 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 21:04:00,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 6] total 17 [2025-04-13 21:04:00,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263268580] [2025-04-13 21:04:00,340 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 21:04:00,340 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-04-13 21:04:00,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:04:00,341 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-04-13 21:04:00,341 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2025-04-13 21:04:00,341 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2025-04-13 21:04:00,341 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 131 transitions, 1365 flow. Second operand has 17 states, 17 states have (on average 4.0588235294117645) internal successors, (69), 17 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:04:00,341 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:04:00,341 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2025-04-13 21:04:00,341 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:04:00,632 INFO L116 PetriNetUnfolderBase]: 312/651 cut-off events. [2025-04-13 21:04:00,633 INFO L117 PetriNetUnfolderBase]: For 3616/3616 co-relation queries the response was YES. [2025-04-13 21:04:00,634 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3569 conditions, 651 events. 312/651 cut-off events. For 3616/3616 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 3365 event pairs, 26 based on Foata normal form. 8/659 useless extension candidates. Maximal degree in co-relation 3459. Up to 438 conditions per place. [2025-04-13 21:04:00,637 INFO L140 encePairwiseOnDemand]: 10/19 looper letters, 103 selfloop transitions, 56 changer transitions 7/166 dead transitions. [2025-04-13 21:04:00,638 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 166 transitions, 1885 flow [2025-04-13 21:04:00,639 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-13 21:04:00,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-04-13 21:04:00,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 98 transitions. [2025-04-13 21:04:00,640 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3967611336032389 [2025-04-13 21:04:00,640 INFO L175 Difference]: Start difference. First operand has 112 places, 131 transitions, 1365 flow. Second operand 13 states and 98 transitions. [2025-04-13 21:04:00,640 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 166 transitions, 1885 flow [2025-04-13 21:04:00,654 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 166 transitions, 1782 flow, removed 35 selfloop flow, removed 6 redundant places. [2025-04-13 21:04:00,656 INFO L231 Difference]: Finished difference. Result has 120 places, 135 transitions, 1455 flow [2025-04-13 21:04:00,656 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=1266, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1455, PETRI_PLACES=120, PETRI_TRANSITIONS=135} [2025-04-13 21:04:00,657 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 100 predicate places. [2025-04-13 21:04:00,657 INFO L485 AbstractCegarLoop]: Abstraction has has 120 places, 135 transitions, 1455 flow [2025-04-13 21:04:00,657 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.0588235294117645) internal successors, (69), 17 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:04:00,657 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:04:00,658 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:04:00,663 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-04-13 21:04:00,858 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:04:00,858 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:04:00,859 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:04:00,859 INFO L85 PathProgramCache]: Analyzing trace with hash 23630869, now seen corresponding path program 4 times [2025-04-13 21:04:00,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:04:00,859 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898883600] [2025-04-13 21:04:00,859 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 21:04:00,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:04:00,865 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 15 statements into 2 equivalence classes. [2025-04-13 21:04:00,875 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 21:04:00,875 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 21:04:00,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:04:00,978 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 21:04:00,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:04:00,978 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898883600] [2025-04-13 21:04:00,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898883600] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:04:00,978 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1758351084] [2025-04-13 21:04:00,978 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 21:04:00,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:04:00,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:04:00,980 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:04:00,982 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:04:01,020 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 15 statements into 2 equivalence classes. [2025-04-13 21:04:01,034 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 21:04:01,034 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 21:04:01,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:04:01,035 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-04-13 21:04:01,037 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:04:01,163 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 21:04:01,163 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 115 treesize of output 109 [2025-04-13 21:04:01,280 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 21:04:01,281 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:04:01,509 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 21:04:01,510 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 150 treesize of output 119 [2025-04-13 21:04:01,728 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 21:04:01,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1758351084] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 21:04:01,729 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 21:04:01,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 6] total 18 [2025-04-13 21:04:01,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684504253] [2025-04-13 21:04:01,729 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 21:04:01,729 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-13 21:04:01,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:04:01,730 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-13 21:04:01,730 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2025-04-13 21:04:01,730 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2025-04-13 21:04:01,730 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 135 transitions, 1455 flow. Second operand has 18 states, 18 states have (on average 4.333333333333333) internal successors, (78), 18 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:04:01,730 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:04:01,730 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2025-04-13 21:04:01,730 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:04:02,374 INFO L116 PetriNetUnfolderBase]: 305/626 cut-off events. [2025-04-13 21:04:02,374 INFO L117 PetriNetUnfolderBase]: For 3566/3566 co-relation queries the response was YES. [2025-04-13 21:04:02,376 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3505 conditions, 626 events. 305/626 cut-off events. For 3566/3566 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 3137 event pairs, 24 based on Foata normal form. 4/630 useless extension candidates. Maximal degree in co-relation 3405. Up to 411 conditions per place. [2025-04-13 21:04:02,379 INFO L140 encePairwiseOnDemand]: 11/19 looper letters, 97 selfloop transitions, 59 changer transitions 6/162 dead transitions. [2025-04-13 21:04:02,379 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 162 transitions, 1882 flow [2025-04-13 21:04:02,379 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-13 21:04:02,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-04-13 21:04:02,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 101 transitions. [2025-04-13 21:04:02,380 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.37969924812030076 [2025-04-13 21:04:02,380 INFO L175 Difference]: Start difference. First operand has 120 places, 135 transitions, 1455 flow. Second operand 14 states and 101 transitions. [2025-04-13 21:04:02,380 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 162 transitions, 1882 flow [2025-04-13 21:04:02,392 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 162 transitions, 1829 flow, removed 6 selfloop flow, removed 5 redundant places. [2025-04-13 21:04:02,394 INFO L231 Difference]: Finished difference. Result has 130 places, 134 transitions, 1519 flow [2025-04-13 21:04:02,394 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=1391, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=1519, PETRI_PLACES=130, PETRI_TRANSITIONS=134} [2025-04-13 21:04:02,394 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 110 predicate places. [2025-04-13 21:04:02,394 INFO L485 AbstractCegarLoop]: Abstraction has has 130 places, 134 transitions, 1519 flow [2025-04-13 21:04:02,394 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.333333333333333) internal successors, (78), 18 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:04:02,395 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:04:02,395 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:04:02,401 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-04-13 21:04:02,599 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-04-13 21:04:02,599 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:04:02,599 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:04:02,599 INFO L85 PathProgramCache]: Analyzing trace with hash -1622299575, now seen corresponding path program 5 times [2025-04-13 21:04:02,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:04:02,599 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889634482] [2025-04-13 21:04:02,600 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 21:04:02,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:04:02,604 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-04-13 21:04:02,612 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 21:04:02,612 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 21:04:02,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:04:02,715 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 21:04:02,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:04:02,716 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889634482] [2025-04-13 21:04:02,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889634482] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:04:02,716 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1289893987] [2025-04-13 21:04:02,716 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 21:04:02,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:04:02,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:04:02,719 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:04:02,719 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:04:02,762 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-04-13 21:04:02,775 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 21:04:02,775 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 21:04:02,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:04:02,777 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-04-13 21:04:02,779 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:04:03,014 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 21:04:03,015 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 57 treesize of output 44 [2025-04-13 21:04:03,093 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 21:04:03,093 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:04:03,316 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 21:04:03,317 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 154 treesize of output 154 [2025-04-13 21:04:03,842 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 21:04:03,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1289893987] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 21:04:03,842 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 21:04:03,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 6] total 18 [2025-04-13 21:04:03,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677575327] [2025-04-13 21:04:03,842 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 21:04:03,842 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-13 21:04:03,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:04:03,843 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-13 21:04:03,843 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2025-04-13 21:04:03,843 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2025-04-13 21:04:03,843 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 134 transitions, 1519 flow. Second operand has 18 states, 18 states have (on average 4.333333333333333) internal successors, (78), 18 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:04:03,843 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:04:03,843 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2025-04-13 21:04:03,843 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:04:04,402 INFO L116 PetriNetUnfolderBase]: 322/691 cut-off events. [2025-04-13 21:04:04,402 INFO L117 PetriNetUnfolderBase]: For 4390/4390 co-relation queries the response was YES. [2025-04-13 21:04:04,404 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3934 conditions, 691 events. 322/691 cut-off events. For 4390/4390 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 3735 event pairs, 6 based on Foata normal form. 6/697 useless extension candidates. Maximal degree in co-relation 3810. Up to 370 conditions per place. [2025-04-13 21:04:04,406 INFO L140 encePairwiseOnDemand]: 10/19 looper letters, 93 selfloop transitions, 90 changer transitions 6/189 dead transitions. [2025-04-13 21:04:04,406 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 189 transitions, 2280 flow [2025-04-13 21:04:04,406 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 21:04:04,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-04-13 21:04:04,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 107 transitions. [2025-04-13 21:04:04,407 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3519736842105263 [2025-04-13 21:04:04,407 INFO L175 Difference]: Start difference. First operand has 130 places, 134 transitions, 1519 flow. Second operand 16 states and 107 transitions. [2025-04-13 21:04:04,407 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 189 transitions, 2280 flow [2025-04-13 21:04:04,420 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 189 transitions, 2162 flow, removed 3 selfloop flow, removed 10 redundant places. [2025-04-13 21:04:04,422 INFO L231 Difference]: Finished difference. Result has 138 places, 155 transitions, 1859 flow [2025-04-13 21:04:04,422 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=1403, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=69, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=1859, PETRI_PLACES=138, PETRI_TRANSITIONS=155} [2025-04-13 21:04:04,423 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 118 predicate places. [2025-04-13 21:04:04,423 INFO L485 AbstractCegarLoop]: Abstraction has has 138 places, 155 transitions, 1859 flow [2025-04-13 21:04:04,423 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.333333333333333) internal successors, (78), 18 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:04:04,423 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:04:04,423 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:04:04,429 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-04-13 21:04:04,623 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:04:04,624 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:04:04,624 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:04:04,624 INFO L85 PathProgramCache]: Analyzing trace with hash -1705416465, now seen corresponding path program 6 times [2025-04-13 21:04:04,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:04:04,624 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366049220] [2025-04-13 21:04:04,624 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 21:04:04,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:04:04,628 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 15 statements into 2 equivalence classes. [2025-04-13 21:04:04,636 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 21:04:04,637 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 21:04:04,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:04:04,734 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 21:04:04,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:04:04,734 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366049220] [2025-04-13 21:04:04,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366049220] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:04:04,734 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1520632790] [2025-04-13 21:04:04,734 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 21:04:04,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:04:04,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:04:04,736 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:04:04,738 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:04:04,779 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 15 statements into 2 equivalence classes. [2025-04-13 21:04:04,798 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 21:04:04,798 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 21:04:04,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:04:04,799 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-04-13 21:04:04,800 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:04:04,915 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 21:04:04,915 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 115 treesize of output 109 [2025-04-13 21:04:04,962 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 21:04:04,962 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:04:05,508 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 11 treesize of output 3 [2025-04-13 21:04:05,512 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 11 treesize of output 3 [2025-04-13 21:04:05,536 INFO L325 Elim1Store]: treesize reduction 5, result has 84.8 percent of original size [2025-04-13 21:04:05,536 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 42 [2025-04-13 21:04:05,561 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-13 21:04:05,561 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 7 [2025-04-13 21:04:05,577 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-13 21:04:05,577 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 7 [2025-04-13 21:04:05,646 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 21:04:05,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1520632790] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 21:04:05,646 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 21:04:05,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 6] total 17 [2025-04-13 21:04:05,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031061580] [2025-04-13 21:04:05,646 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 21:04:05,646 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-04-13 21:04:05,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:04:05,647 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-04-13 21:04:05,647 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2025-04-13 21:04:05,647 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2025-04-13 21:04:05,647 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 155 transitions, 1859 flow. Second operand has 17 states, 17 states have (on average 4.0588235294117645) internal successors, (69), 17 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:04:05,647 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:04:05,647 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2025-04-13 21:04:05,647 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:04:11,928 WARN L286 SmtUtils]: Spent 6.15s on a formula simplification. DAG size of input: 58 DAG size of output: 53 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 21:04:12,513 INFO L116 PetriNetUnfolderBase]: 480/1005 cut-off events. [2025-04-13 21:04:12,514 INFO L117 PetriNetUnfolderBase]: For 7732/7732 co-relation queries the response was YES. [2025-04-13 21:04:12,516 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6053 conditions, 1005 events. 480/1005 cut-off events. For 7732/7732 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 5943 event pairs, 14 based on Foata normal form. 8/1013 useless extension candidates. Maximal degree in co-relation 5841. Up to 485 conditions per place. [2025-04-13 21:04:12,520 INFO L140 encePairwiseOnDemand]: 10/19 looper letters, 127 selfloop transitions, 145 changer transitions 10/282 dead transitions. [2025-04-13 21:04:12,520 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 282 transitions, 3574 flow [2025-04-13 21:04:12,521 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-13 21:04:12,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2025-04-13 21:04:12,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 158 transitions. [2025-04-13 21:04:12,521 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.41578947368421054 [2025-04-13 21:04:12,522 INFO L175 Difference]: Start difference. First operand has 138 places, 155 transitions, 1859 flow. Second operand 20 states and 158 transitions. [2025-04-13 21:04:12,522 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 282 transitions, 3574 flow [2025-04-13 21:04:12,548 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 282 transitions, 3297 flow, removed 89 selfloop flow, removed 11 redundant places. [2025-04-13 21:04:12,551 INFO L231 Difference]: Finished difference. Result has 153 places, 216 transitions, 2818 flow [2025-04-13 21:04:12,551 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=1678, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=101, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=2818, PETRI_PLACES=153, PETRI_TRANSITIONS=216} [2025-04-13 21:04:12,552 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 133 predicate places. [2025-04-13 21:04:12,552 INFO L485 AbstractCegarLoop]: Abstraction has has 153 places, 216 transitions, 2818 flow [2025-04-13 21:04:12,552 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.0588235294117645) internal successors, (69), 17 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:04:12,552 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:04:12,552 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:04:12,558 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:04:12,754 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:04:12,754 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:04:12,754 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:04:12,754 INFO L85 PathProgramCache]: Analyzing trace with hash -1622894221, now seen corresponding path program 7 times [2025-04-13 21:04:12,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:04:12,754 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126480003] [2025-04-13 21:04:12,754 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 21:04:12,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:04:12,759 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-13 21:04:12,769 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 21:04:12,769 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:04:12,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:04:12,845 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 21:04:12,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:04:12,845 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126480003] [2025-04-13 21:04:12,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126480003] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:04:12,845 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1540705570] [2025-04-13 21:04:12,845 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 21:04:12,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:04:12,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:04:12,847 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:04:12,848 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:04:12,886 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-13 21:04:12,898 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 21:04:12,898 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:04:12,898 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:04:12,899 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-13 21:04:12,901 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:04:12,917 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-13 21:04:13,108 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 21:04:13,109 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 48 treesize of output 39 [2025-04-13 21:04:13,146 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:04:13,146 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:04:13,313 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 29 [2025-04-13 21:04:13,318 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-13 21:04:13,318 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 41 [2025-04-13 21:04:13,336 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:04:13,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1540705570] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 21:04:13,336 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 21:04:13,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8] total 21 [2025-04-13 21:04:13,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745483299] [2025-04-13 21:04:13,337 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 21:04:13,337 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-04-13 21:04:13,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:04:13,337 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-04-13 21:04:13,337 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=340, Unknown=0, NotChecked=0, Total=420 [2025-04-13 21:04:13,337 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2025-04-13 21:04:13,338 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 216 transitions, 2818 flow. Second operand has 21 states, 21 states have (on average 4.0) internal successors, (84), 21 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:04:13,338 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:04:13,338 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2025-04-13 21:04:13,338 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:04:13,989 INFO L116 PetriNetUnfolderBase]: 488/1017 cut-off events. [2025-04-13 21:04:13,989 INFO L117 PetriNetUnfolderBase]: For 8811/8811 co-relation queries the response was YES. [2025-04-13 21:04:13,992 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6629 conditions, 1017 events. 488/1017 cut-off events. For 8811/8811 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 6022 event pairs, 6 based on Foata normal form. 6/1023 useless extension candidates. Maximal degree in co-relation 6475. Up to 446 conditions per place. [2025-04-13 21:04:13,996 INFO L140 encePairwiseOnDemand]: 9/19 looper letters, 134 selfloop transitions, 128 changer transitions 4/266 dead transitions. [2025-04-13 21:04:13,996 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 266 transitions, 3761 flow [2025-04-13 21:04:13,996 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-13 21:04:13,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-04-13 21:04:13,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 120 transitions. [2025-04-13 21:04:13,997 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3508771929824561 [2025-04-13 21:04:13,997 INFO L175 Difference]: Start difference. First operand has 153 places, 216 transitions, 2818 flow. Second operand 18 states and 120 transitions. [2025-04-13 21:04:13,997 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 266 transitions, 3761 flow [2025-04-13 21:04:14,028 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 266 transitions, 3564 flow, removed 78 selfloop flow, removed 8 redundant places. [2025-04-13 21:04:14,031 INFO L231 Difference]: Finished difference. Result has 163 places, 223 transitions, 3053 flow [2025-04-13 21:04:14,032 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=2635, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=216, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=122, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=3053, PETRI_PLACES=163, PETRI_TRANSITIONS=223} [2025-04-13 21:04:14,032 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 143 predicate places. [2025-04-13 21:04:14,032 INFO L485 AbstractCegarLoop]: Abstraction has has 163 places, 223 transitions, 3053 flow [2025-04-13 21:04:14,032 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 4.0) internal successors, (84), 21 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:04:14,032 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:04:14,032 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:04:14,040 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:04:14,232 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-04-13 21:04:14,233 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:04:14,233 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:04:14,233 INFO L85 PathProgramCache]: Analyzing trace with hash -1708847235, now seen corresponding path program 8 times [2025-04-13 21:04:14,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:04:14,233 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269452594] [2025-04-13 21:04:14,233 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 21:04:14,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:04:14,237 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-04-13 21:04:14,245 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 21:04:14,245 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 21:04:14,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:04:14,312 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 21:04:14,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:04:14,312 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269452594] [2025-04-13 21:04:14,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269452594] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:04:14,312 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1227134938] [2025-04-13 21:04:14,312 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 21:04:14,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:04:14,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:04:14,314 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 21:04:14,316 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-04-13 21:04:14,352 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-04-13 21:04:14,392 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 21:04:14,392 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 21:04:14,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:04:14,392 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-04-13 21:04:14,394 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:04:14,411 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-13 21:04:14,528 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:04:14,528 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:04:27,677 WARN L286 SmtUtils]: Spent 11.90s on a formula simplification. DAG size of input: 36 DAG size of output: 21 (called from [L 182] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionTir.tryToEliminateOne) [2025-04-13 21:04:35,807 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 21:04:35,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1227134938] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 21:04:35,807 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 21:04:35,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 6] total 18 [2025-04-13 21:04:35,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811303004] [2025-04-13 21:04:35,808 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 21:04:35,808 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-13 21:04:35,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:04:35,808 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-13 21:04:35,808 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=230, Unknown=0, NotChecked=0, Total=306 [2025-04-13 21:04:35,808 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2025-04-13 21:04:35,809 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 223 transitions, 3053 flow. Second operand has 18 states, 18 states have (on average 4.0) internal successors, (72), 18 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:04:35,809 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:04:35,809 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2025-04-13 21:04:35,809 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:05:00,188 WARN L286 SmtUtils]: Spent 21.64s on a formula simplification. DAG size of input: 115 DAG size of output: 75 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 21:05:18,781 WARN L286 SmtUtils]: Spent 18.06s on a formula simplification. DAG size of input: 80 DAG size of output: 81 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 21:05:26,420 WARN L286 SmtUtils]: Spent 6.93s on a formula simplification. DAG size of input: 111 DAG size of output: 108 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 21:05:27,221 INFO L116 PetriNetUnfolderBase]: 488/993 cut-off events. [2025-04-13 21:05:27,221 INFO L117 PetriNetUnfolderBase]: For 8767/8767 co-relation queries the response was YES. [2025-04-13 21:05:27,224 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6621 conditions, 993 events. 488/993 cut-off events. For 8767/8767 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 5688 event pairs, 18 based on Foata normal form. 9/1002 useless extension candidates. Maximal degree in co-relation 6506. Up to 381 conditions per place. [2025-04-13 21:05:27,228 INFO L140 encePairwiseOnDemand]: 9/19 looper letters, 137 selfloop transitions, 145 changer transitions 11/293 dead transitions. [2025-04-13 21:05:27,228 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 293 transitions, 4109 flow [2025-04-13 21:05:27,229 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-04-13 21:05:27,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2025-04-13 21:05:27,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 196 transitions. [2025-04-13 21:05:27,230 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.35571687840290384 [2025-04-13 21:05:27,230 INFO L175 Difference]: Start difference. First operand has 163 places, 223 transitions, 3053 flow. Second operand 29 states and 196 transitions. [2025-04-13 21:05:27,230 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 293 transitions, 4109 flow [2025-04-13 21:05:27,263 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 293 transitions, 3740 flow, removed 62 selfloop flow, removed 12 redundant places. [2025-04-13 21:05:27,266 INFO L231 Difference]: Finished difference. Result has 184 places, 230 transitions, 3195 flow [2025-04-13 21:05:27,266 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=2685, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=221, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=130, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=29, PETRI_FLOW=3195, PETRI_PLACES=184, PETRI_TRANSITIONS=230} [2025-04-13 21:05:27,266 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 164 predicate places. [2025-04-13 21:05:27,266 INFO L485 AbstractCegarLoop]: Abstraction has has 184 places, 230 transitions, 3195 flow [2025-04-13 21:05:27,267 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.0) internal successors, (72), 18 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:05:27,267 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:05:27,267 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:05:27,273 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-04-13 21:05:27,467 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-04-13 21:05:27,467 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:05:27,468 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:05:27,468 INFO L85 PathProgramCache]: Analyzing trace with hash -964379145, now seen corresponding path program 9 times [2025-04-13 21:05:27,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:05:27,468 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513600518] [2025-04-13 21:05:27,468 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 21:05:27,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:05:27,472 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 16 statements into 2 equivalence classes. [2025-04-13 21:05:27,482 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 21:05:27,482 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 21:05:27,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:05:27,684 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 21:05:27,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:05:27,684 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513600518] [2025-04-13 21:05:27,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513600518] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:05:27,684 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1644592192] [2025-04-13 21:05:27,684 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 21:05:27,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:05:27,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:05:27,686 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 21:05:27,687 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-04-13 21:05:27,736 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 16 statements into 2 equivalence classes. [2025-04-13 21:05:27,758 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 21:05:27,758 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 21:05:27,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:05:27,759 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-04-13 21:05:27,760 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:05:27,781 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-13 21:05:27,986 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:05:27,987 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:05:29,048 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 105 treesize of output 93 [2025-04-13 21:05:29,092 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 21:05:29,093 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 6 new quantified variables, introduced 10 case distinctions, treesize of input 225 treesize of output 239 [2025-04-13 21:05:35,323 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:05:35,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1644592192] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 21:05:35,323 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 21:05:35,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8] total 21 [2025-04-13 21:05:35,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522278632] [2025-04-13 21:05:35,323 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 21:05:35,323 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-13 21:05:35,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:05:35,324 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-13 21:05:35,324 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=389, Unknown=0, NotChecked=0, Total=506 [2025-04-13 21:05:35,324 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2025-04-13 21:05:35,324 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 230 transitions, 3195 flow. Second operand has 23 states, 23 states have (on average 3.9130434782608696) internal successors, (90), 23 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:05:35,324 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:05:35,324 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2025-04-13 21:05:35,324 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:05:36,285 INFO L116 PetriNetUnfolderBase]: 470/947 cut-off events. [2025-04-13 21:05:36,285 INFO L117 PetriNetUnfolderBase]: For 7000/7000 co-relation queries the response was YES. [2025-04-13 21:05:36,288 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6321 conditions, 947 events. 470/947 cut-off events. For 7000/7000 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 5290 event pairs, 13 based on Foata normal form. 7/954 useless extension candidates. Maximal degree in co-relation 6202. Up to 491 conditions per place. [2025-04-13 21:05:36,291 INFO L140 encePairwiseOnDemand]: 9/19 looper letters, 121 selfloop transitions, 65 changer transitions 76/262 dead transitions. [2025-04-13 21:05:36,292 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 262 transitions, 3861 flow [2025-04-13 21:05:36,292 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 21:05:36,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-04-13 21:05:36,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 108 transitions. [2025-04-13 21:05:36,292 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.37894736842105264 [2025-04-13 21:05:36,293 INFO L175 Difference]: Start difference. First operand has 184 places, 230 transitions, 3195 flow. Second operand 15 states and 108 transitions. [2025-04-13 21:05:36,293 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 262 transitions, 3861 flow [2025-04-13 21:05:36,325 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 262 transitions, 3727 flow, removed 46 selfloop flow, removed 7 redundant places. [2025-04-13 21:05:36,327 INFO L231 Difference]: Finished difference. Result has 191 places, 173 transitions, 2422 flow [2025-04-13 21:05:36,328 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=3063, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=230, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=165, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=2422, PETRI_PLACES=191, PETRI_TRANSITIONS=173} [2025-04-13 21:05:36,328 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 171 predicate places. [2025-04-13 21:05:36,328 INFO L485 AbstractCegarLoop]: Abstraction has has 191 places, 173 transitions, 2422 flow [2025-04-13 21:05:36,328 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 3.9130434782608696) internal successors, (90), 23 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:05:36,328 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:05:36,328 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:05:36,334 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-04-13 21:05:36,528 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-04-13 21:05:36,529 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:05:36,529 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:05:36,529 INFO L85 PathProgramCache]: Analyzing trace with hash 1710604724, now seen corresponding path program 10 times [2025-04-13 21:05:36,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:05:36,529 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954405986] [2025-04-13 21:05:36,529 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 21:05:36,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:05:36,533 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 16 statements into 2 equivalence classes. [2025-04-13 21:05:36,538 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 21:05:36,538 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 21:05:36,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:05:36,638 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 21:05:36,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:05:36,639 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954405986] [2025-04-13 21:05:36,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954405986] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:05:36,639 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [43781385] [2025-04-13 21:05:36,639 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 21:05:36,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:05:36,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:05:36,641 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 21:05:36,641 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-04-13 21:05:36,685 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 16 statements into 2 equivalence classes. [2025-04-13 21:05:36,696 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 21:05:36,697 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 21:05:36,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:05:36,697 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-04-13 21:05:36,699 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:05:36,788 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 21:05:36,789 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 117 treesize of output 109 [2025-04-13 21:05:36,892 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 21:05:36,893 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:05:37,144 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 21:05:37,144 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 70 treesize of output 63 [2025-04-13 21:05:37,234 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 21:05:37,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [43781385] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 21:05:37,234 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 21:05:37,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2025-04-13 21:05:37,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672660308] [2025-04-13 21:05:37,235 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 21:05:37,235 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-04-13 21:05:37,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:05:37,235 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-04-13 21:05:37,235 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2025-04-13 21:05:37,235 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2025-04-13 21:05:37,235 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 173 transitions, 2422 flow. Second operand has 17 states, 17 states have (on average 4.470588235294118) internal successors, (76), 17 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:05:37,235 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:05:37,235 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2025-04-13 21:05:37,236 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:05:39,052 INFO L116 PetriNetUnfolderBase]: 384/751 cut-off events. [2025-04-13 21:05:39,052 INFO L117 PetriNetUnfolderBase]: For 6669/6669 co-relation queries the response was YES. [2025-04-13 21:05:39,055 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5225 conditions, 751 events. 384/751 cut-off events. For 6669/6669 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 3905 event pairs, 5 based on Foata normal form. 3/754 useless extension candidates. Maximal degree in co-relation 5142. Up to 289 conditions per place. [2025-04-13 21:05:39,058 INFO L140 encePairwiseOnDemand]: 11/19 looper letters, 139 selfloop transitions, 85 changer transitions 4/228 dead transitions. [2025-04-13 21:05:39,058 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 228 transitions, 3257 flow [2025-04-13 21:05:39,058 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 21:05:39,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-04-13 21:05:39,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 126 transitions. [2025-04-13 21:05:39,059 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4421052631578947 [2025-04-13 21:05:39,059 INFO L175 Difference]: Start difference. First operand has 191 places, 173 transitions, 2422 flow. Second operand 15 states and 126 transitions. [2025-04-13 21:05:39,059 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 228 transitions, 3257 flow [2025-04-13 21:05:39,082 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 228 transitions, 2960 flow, removed 48 selfloop flow, removed 16 redundant places. [2025-04-13 21:05:39,084 INFO L231 Difference]: Finished difference. Result has 161 places, 178 transitions, 2434 flow [2025-04-13 21:05:39,085 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=2159, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=172, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=80, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=2434, PETRI_PLACES=161, PETRI_TRANSITIONS=178} [2025-04-13 21:05:39,085 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 141 predicate places. [2025-04-13 21:05:39,085 INFO L485 AbstractCegarLoop]: Abstraction has has 161 places, 178 transitions, 2434 flow [2025-04-13 21:05:39,085 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.470588235294118) internal successors, (76), 17 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:05:39,085 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:05:39,085 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:05:39,091 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-04-13 21:05:39,285 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-04-13 21:05:39,286 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:05:39,286 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:05:39,286 INFO L85 PathProgramCache]: Analyzing trace with hash 1484840308, now seen corresponding path program 11 times [2025-04-13 21:05:39,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:05:39,286 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960086109] [2025-04-13 21:05:39,286 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 21:05:39,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:05:39,290 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-04-13 21:05:39,295 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 21:05:39,295 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 21:05:39,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:05:39,380 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 21:05:39,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:05:39,380 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960086109] [2025-04-13 21:05:39,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960086109] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:05:39,380 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1960545368] [2025-04-13 21:05:39,381 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 21:05:39,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:05:39,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:05:39,382 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 21:05:39,384 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-04-13 21:05:39,429 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-04-13 21:05:39,443 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 21:05:39,443 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 21:05:39,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:05:39,444 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-04-13 21:05:39,445 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:05:39,583 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-04-13 21:05:39,596 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 21:05:39,596 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:05:40,010 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 21:05:40,011 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 83 treesize of output 68 [2025-04-13 21:05:40,140 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 21:05:40,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1960545368] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 21:05:40,140 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 21:05:40,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2025-04-13 21:05:40,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629034810] [2025-04-13 21:05:40,140 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 21:05:40,141 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-04-13 21:05:40,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:05:40,141 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-04-13 21:05:40,141 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2025-04-13 21:05:40,141 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2025-04-13 21:05:40,141 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 178 transitions, 2434 flow. Second operand has 17 states, 17 states have (on average 4.529411764705882) internal successors, (77), 17 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:05:40,141 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:05:40,141 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2025-04-13 21:05:40,141 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:05:41,755 INFO L116 PetriNetUnfolderBase]: 382/738 cut-off events. [2025-04-13 21:05:41,756 INFO L117 PetriNetUnfolderBase]: For 4974/4974 co-relation queries the response was YES. [2025-04-13 21:05:41,758 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4971 conditions, 738 events. 382/738 cut-off events. For 4974/4974 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 3764 event pairs, 5 based on Foata normal form. 4/742 useless extension candidates. Maximal degree in co-relation 4895. Up to 292 conditions per place. [2025-04-13 21:05:41,761 INFO L140 encePairwiseOnDemand]: 11/19 looper letters, 138 selfloop transitions, 85 changer transitions 3/226 dead transitions. [2025-04-13 21:05:41,761 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 226 transitions, 3143 flow [2025-04-13 21:05:41,761 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 21:05:41,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-04-13 21:05:41,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 131 transitions. [2025-04-13 21:05:41,762 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4309210526315789 [2025-04-13 21:05:41,762 INFO L175 Difference]: Start difference. First operand has 161 places, 178 transitions, 2434 flow. Second operand 16 states and 131 transitions. [2025-04-13 21:05:41,762 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 226 transitions, 3143 flow [2025-04-13 21:05:41,780 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 226 transitions, 3045 flow, removed 26 selfloop flow, removed 7 redundant places. [2025-04-13 21:05:41,783 INFO L231 Difference]: Finished difference. Result has 168 places, 177 transitions, 2502 flow [2025-04-13 21:05:41,783 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=2317, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=176, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=83, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=2502, PETRI_PLACES=168, PETRI_TRANSITIONS=177} [2025-04-13 21:05:41,783 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 148 predicate places. [2025-04-13 21:05:41,783 INFO L485 AbstractCegarLoop]: Abstraction has has 168 places, 177 transitions, 2502 flow [2025-04-13 21:05:41,784 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.529411764705882) internal successors, (77), 17 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:05:41,784 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:05:41,784 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:05:41,789 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-04-13 21:05:41,984 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:05:41,984 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:05:41,984 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:05:41,985 INFO L85 PathProgramCache]: Analyzing trace with hash -1890563386, now seen corresponding path program 2 times [2025-04-13 21:05:41,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:05:41,985 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544592652] [2025-04-13 21:05:41,985 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 21:05:41,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:05:41,989 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-04-13 21:05:41,997 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 21:05:41,997 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 21:05:41,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:05:42,081 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 21:05:42,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:05:42,081 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544592652] [2025-04-13 21:05:42,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544592652] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:05:42,081 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [434705827] [2025-04-13 21:05:42,081 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 21:05:42,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:05:42,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:05:42,083 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 21:05:42,085 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-04-13 21:05:42,129 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-04-13 21:05:42,226 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 21:05:42,226 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 21:05:42,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:05:42,228 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-13 21:05:42,229 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:05:42,266 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 21:05:42,266 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:05:42,337 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 21:05:42,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [434705827] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 21:05:42,338 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 21:05:42,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-04-13 21:05:42,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637426414] [2025-04-13 21:05:42,338 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 21:05:42,338 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 21:05:42,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:05:42,338 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 21:05:42,338 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2025-04-13 21:05:42,338 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2025-04-13 21:05:42,339 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 177 transitions, 2502 flow. Second operand has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 12 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:05:42,339 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:05:42,339 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2025-04-13 21:05:42,339 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:05:43,124 INFO L116 PetriNetUnfolderBase]: 442/832 cut-off events. [2025-04-13 21:05:43,124 INFO L117 PetriNetUnfolderBase]: For 6105/6105 co-relation queries the response was YES. [2025-04-13 21:05:43,127 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5681 conditions, 832 events. 442/832 cut-off events. For 6105/6105 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 4308 event pairs, 74 based on Foata normal form. 6/838 useless extension candidates. Maximal degree in co-relation 5606. Up to 364 conditions per place. [2025-04-13 21:05:43,129 INFO L140 encePairwiseOnDemand]: 13/19 looper letters, 161 selfloop transitions, 95 changer transitions 0/256 dead transitions. [2025-04-13 21:05:43,130 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 256 transitions, 3637 flow [2025-04-13 21:05:43,130 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-13 21:05:43,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-04-13 21:05:43,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 139 transitions. [2025-04-13 21:05:43,130 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.43034055727554177 [2025-04-13 21:05:43,130 INFO L175 Difference]: Start difference. First operand has 168 places, 177 transitions, 2502 flow. Second operand 17 states and 139 transitions. [2025-04-13 21:05:43,131 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 256 transitions, 3637 flow [2025-04-13 21:05:43,151 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 256 transitions, 3410 flow, removed 21 selfloop flow, removed 14 redundant places. [2025-04-13 21:05:43,154 INFO L231 Difference]: Finished difference. Result has 175 places, 205 transitions, 2956 flow [2025-04-13 21:05:43,154 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=2297, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=177, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=72, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=2956, PETRI_PLACES=175, PETRI_TRANSITIONS=205} [2025-04-13 21:05:43,154 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 155 predicate places. [2025-04-13 21:05:43,154 INFO L485 AbstractCegarLoop]: Abstraction has has 175 places, 205 transitions, 2956 flow [2025-04-13 21:05:43,154 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 12 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:05:43,154 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:05:43,154 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:05:43,160 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-04-13 21:05:43,356 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable19 [2025-04-13 21:05:43,356 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:05:43,356 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:05:43,356 INFO L85 PathProgramCache]: Analyzing trace with hash -1971748666, now seen corresponding path program 3 times [2025-04-13 21:05:43,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:05:43,356 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482641021] [2025-04-13 21:05:43,356 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 21:05:43,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:05:43,360 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 16 statements into 2 equivalence classes. [2025-04-13 21:05:43,367 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 21:05:43,367 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 21:05:43,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:05:43,440 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 21:05:43,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:05:43,440 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482641021] [2025-04-13 21:05:43,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482641021] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:05:43,440 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1320725645] [2025-04-13 21:05:43,441 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 21:05:43,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:05:43,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:05:43,442 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 21:05:43,444 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-04-13 21:05:43,488 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 16 statements into 2 equivalence classes. [2025-04-13 21:05:43,520 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 21:05:43,521 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 21:05:43,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:05:43,522 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-13 21:05:43,522 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:05:43,547 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 21:05:43,547 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:05:43,638 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 21:05:43,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1320725645] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 21:05:43,638 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 21:05:43,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2025-04-13 21:05:43,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936225433] [2025-04-13 21:05:43,638 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 21:05:43,638 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 21:05:43,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:05:43,639 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 21:05:43,639 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-04-13 21:05:43,639 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2025-04-13 21:05:43,639 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 205 transitions, 2956 flow. Second operand has 11 states, 11 states have (on average 4.090909090909091) internal successors, (45), 11 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:05:43,639 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:05:43,639 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2025-04-13 21:05:43,639 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:05:44,948 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-13 21:05:45,191 INFO L116 PetriNetUnfolderBase]: 450/850 cut-off events. [2025-04-13 21:05:45,191 INFO L117 PetriNetUnfolderBase]: For 6712/6712 co-relation queries the response was YES. [2025-04-13 21:05:45,193 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5978 conditions, 850 events. 450/850 cut-off events. For 6712/6712 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 4448 event pairs, 46 based on Foata normal form. 18/868 useless extension candidates. Maximal degree in co-relation 5900. Up to 274 conditions per place. [2025-04-13 21:05:45,196 INFO L140 encePairwiseOnDemand]: 13/19 looper letters, 140 selfloop transitions, 119 changer transitions 0/259 dead transitions. [2025-04-13 21:05:45,196 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 259 transitions, 3804 flow [2025-04-13 21:05:45,197 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-13 21:05:45,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-04-13 21:05:45,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 132 transitions. [2025-04-13 21:05:45,197 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4086687306501548 [2025-04-13 21:05:45,197 INFO L175 Difference]: Start difference. First operand has 175 places, 205 transitions, 2956 flow. Second operand 17 states and 132 transitions. [2025-04-13 21:05:45,197 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 259 transitions, 3804 flow [2025-04-13 21:05:45,224 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 259 transitions, 3597 flow, removed 77 selfloop flow, removed 7 redundant places. [2025-04-13 21:05:45,227 INFO L231 Difference]: Finished difference. Result has 187 places, 213 transitions, 3145 flow [2025-04-13 21:05:45,228 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=2767, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=204, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=111, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=3145, PETRI_PLACES=187, PETRI_TRANSITIONS=213} [2025-04-13 21:05:45,228 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 167 predicate places. [2025-04-13 21:05:45,228 INFO L485 AbstractCegarLoop]: Abstraction has has 187 places, 213 transitions, 3145 flow [2025-04-13 21:05:45,228 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.090909090909091) internal successors, (45), 11 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:05:45,228 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:05:45,228 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:05:45,235 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-04-13 21:05:45,428 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:05:45,429 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:05:45,429 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:05:45,429 INFO L85 PathProgramCache]: Analyzing trace with hash -412502792, now seen corresponding path program 4 times [2025-04-13 21:05:45,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:05:45,429 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34800231] [2025-04-13 21:05:45,429 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 21:05:45,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:05:45,436 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 16 statements into 2 equivalence classes. [2025-04-13 21:05:45,441 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 21:05:45,441 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 21:05:45,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:05:45,547 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 21:05:45,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:05:45,547 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34800231] [2025-04-13 21:05:45,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34800231] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:05:45,548 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1339683573] [2025-04-13 21:05:45,548 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 21:05:45,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:05:45,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:05:45,549 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 21:05:45,550 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-04-13 21:05:45,590 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 16 statements into 2 equivalence classes. [2025-04-13 21:05:45,642 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 21:05:45,642 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 21:05:45,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:05:45,643 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-13 21:05:45,644 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:05:45,682 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 21:05:45,682 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:05:45,735 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 21:05:45,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1339683573] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 21:05:45,735 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 21:05:45,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2025-04-13 21:05:45,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289271985] [2025-04-13 21:05:45,735 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 21:05:45,736 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 21:05:45,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:05:45,736 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 21:05:45,736 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2025-04-13 21:05:45,736 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2025-04-13 21:05:45,736 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 213 transitions, 3145 flow. Second operand has 13 states, 13 states have (on average 4.076923076923077) internal successors, (53), 13 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:05:45,736 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:05:45,736 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2025-04-13 21:05:45,736 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:05:46,565 INFO L116 PetriNetUnfolderBase]: 629/1210 cut-off events. [2025-04-13 21:05:46,565 INFO L117 PetriNetUnfolderBase]: For 11500/11500 co-relation queries the response was YES. [2025-04-13 21:05:46,569 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8581 conditions, 1210 events. 629/1210 cut-off events. For 11500/11500 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 6892 event pairs, 34 based on Foata normal form. 12/1222 useless extension candidates. Maximal degree in co-relation 8500. Up to 385 conditions per place. [2025-04-13 21:05:46,573 INFO L140 encePairwiseOnDemand]: 12/19 looper letters, 176 selfloop transitions, 168 changer transitions 0/344 dead transitions. [2025-04-13 21:05:46,573 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 344 transitions, 5385 flow [2025-04-13 21:05:46,573 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-13 21:05:46,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-04-13 21:05:46,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 159 transitions. [2025-04-13 21:05:46,574 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.39849624060150374 [2025-04-13 21:05:46,574 INFO L175 Difference]: Start difference. First operand has 187 places, 213 transitions, 3145 flow. Second operand 21 states and 159 transitions. [2025-04-13 21:05:46,574 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 207 places, 344 transitions, 5385 flow [2025-04-13 21:05:46,613 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 344 transitions, 5240 flow, removed 30 selfloop flow, removed 9 redundant places. [2025-04-13 21:05:46,617 INFO L231 Difference]: Finished difference. Result has 209 places, 270 transitions, 4540 flow [2025-04-13 21:05:46,617 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=3015, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=212, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=119, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=4540, PETRI_PLACES=209, PETRI_TRANSITIONS=270} [2025-04-13 21:05:46,617 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 189 predicate places. [2025-04-13 21:05:46,617 INFO L485 AbstractCegarLoop]: Abstraction has has 209 places, 270 transitions, 4540 flow [2025-04-13 21:05:46,618 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.076923076923077) internal successors, (53), 13 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:05:46,618 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:05:46,618 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:05:46,623 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2025-04-13 21:05:46,818 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:05:46,818 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:05:46,819 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:05:46,819 INFO L85 PathProgramCache]: Analyzing trace with hash -45584450, now seen corresponding path program 5 times [2025-04-13 21:05:46,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:05:46,819 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119616643] [2025-04-13 21:05:46,819 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 21:05:46,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:05:46,823 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-04-13 21:05:46,829 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 21:05:46,829 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 21:05:46,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:05:46,957 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 21:05:46,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:05:46,957 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119616643] [2025-04-13 21:05:46,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119616643] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:05:46,957 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1049859505] [2025-04-13 21:05:46,957 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 21:05:46,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:05:46,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:05:46,959 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 21:05:46,959 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-04-13 21:05:47,001 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-04-13 21:05:47,034 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 21:05:47,035 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 21:05:47,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:05:47,035 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-13 21:05:47,036 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:05:47,075 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 21:05:47,075 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:05:47,120 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 21:05:47,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1049859505] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 21:05:47,120 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 21:05:47,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2025-04-13 21:05:47,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952138777] [2025-04-13 21:05:47,120 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 21:05:47,121 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 21:05:47,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:05:47,121 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 21:05:47,121 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2025-04-13 21:05:47,121 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2025-04-13 21:05:47,121 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 270 transitions, 4540 flow. Second operand has 13 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 13 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:05:47,121 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:05:47,121 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2025-04-13 21:05:47,121 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:05:47,587 INFO L116 PetriNetUnfolderBase]: 632/1219 cut-off events. [2025-04-13 21:05:47,588 INFO L117 PetriNetUnfolderBase]: For 13796/13796 co-relation queries the response was YES. [2025-04-13 21:05:47,592 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9397 conditions, 1219 events. 632/1219 cut-off events. For 13796/13796 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 6952 event pairs, 30 based on Foata normal form. 6/1225 useless extension candidates. Maximal degree in co-relation 9309. Up to 409 conditions per place. [2025-04-13 21:05:47,596 INFO L140 encePairwiseOnDemand]: 13/19 looper letters, 171 selfloop transitions, 161 changer transitions 0/332 dead transitions. [2025-04-13 21:05:47,596 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 332 transitions, 5932 flow [2025-04-13 21:05:47,597 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 21:05:47,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-04-13 21:05:47,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 125 transitions. [2025-04-13 21:05:47,597 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.43859649122807015 [2025-04-13 21:05:47,597 INFO L175 Difference]: Start difference. First operand has 209 places, 270 transitions, 4540 flow. Second operand 15 states and 125 transitions. [2025-04-13 21:05:47,597 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 223 places, 332 transitions, 5932 flow [2025-04-13 21:05:47,652 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 332 transitions, 5706 flow, removed 77 selfloop flow, removed 5 redundant places. [2025-04-13 21:05:47,656 INFO L231 Difference]: Finished difference. Result has 222 places, 282 transitions, 4945 flow [2025-04-13 21:05:47,657 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=4332, PETRI_DIFFERENCE_MINUEND_PLACES=204, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=270, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=149, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=4945, PETRI_PLACES=222, PETRI_TRANSITIONS=282} [2025-04-13 21:05:47,657 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 202 predicate places. [2025-04-13 21:05:47,657 INFO L485 AbstractCegarLoop]: Abstraction has has 222 places, 282 transitions, 4945 flow [2025-04-13 21:05:47,657 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 13 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:05:47,657 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:05:47,657 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:05:47,667 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-04-13 21:05:47,857 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-04-13 21:05:47,858 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:05:47,858 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:05:47,858 INFO L85 PathProgramCache]: Analyzing trace with hash -184112600, now seen corresponding path program 6 times [2025-04-13 21:05:47,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:05:47,858 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690223061] [2025-04-13 21:05:47,858 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 21:05:47,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:05:47,862 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 16 statements into 2 equivalence classes. [2025-04-13 21:05:47,870 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 21:05:47,870 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 21:05:47,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:05:48,014 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 21:05:48,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:05:48,015 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690223061] [2025-04-13 21:05:48,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690223061] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:05:48,015 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [765919676] [2025-04-13 21:05:48,015 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 21:05:48,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:05:48,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:05:48,018 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 21:05:48,019 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-04-13 21:05:48,068 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 16 statements into 2 equivalence classes. [2025-04-13 21:05:48,098 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 21:05:48,099 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 21:05:48,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:05:48,099 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-13 21:05:48,100 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:05:48,161 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 21:05:48,161 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:05:48,223 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 21:05:48,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [765919676] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 21:05:48,223 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 21:05:48,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2025-04-13 21:05:48,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363259587] [2025-04-13 21:05:48,224 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 21:05:48,224 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 21:05:48,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:05:48,225 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 21:05:48,225 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2025-04-13 21:05:48,225 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2025-04-13 21:05:48,225 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 282 transitions, 4945 flow. Second operand has 13 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 13 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:05:48,225 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:05:48,225 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2025-04-13 21:05:48,225 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:05:48,812 INFO L116 PetriNetUnfolderBase]: 629/1201 cut-off events. [2025-04-13 21:05:48,812 INFO L117 PetriNetUnfolderBase]: For 15026/15026 co-relation queries the response was YES. [2025-04-13 21:05:48,816 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9611 conditions, 1201 events. 629/1201 cut-off events. For 15026/15026 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 6761 event pairs, 30 based on Foata normal form. 6/1207 useless extension candidates. Maximal degree in co-relation 9518. Up to 378 conditions per place. [2025-04-13 21:05:48,819 INFO L140 encePairwiseOnDemand]: 12/19 looper letters, 170 selfloop transitions, 170 changer transitions 0/340 dead transitions. [2025-04-13 21:05:48,819 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 340 transitions, 6190 flow [2025-04-13 21:05:48,820 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-13 21:05:48,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-04-13 21:05:48,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 143 transitions. [2025-04-13 21:05:48,820 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3961218836565097 [2025-04-13 21:05:48,820 INFO L175 Difference]: Start difference. First operand has 222 places, 282 transitions, 4945 flow. Second operand 19 states and 143 transitions. [2025-04-13 21:05:48,820 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 238 places, 340 transitions, 6190 flow [2025-04-13 21:05:48,877 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 233 places, 340 transitions, 5936 flow, removed 63 selfloop flow, removed 5 redundant places. [2025-04-13 21:05:48,881 INFO L231 Difference]: Finished difference. Result has 234 places, 280 transitions, 5019 flow [2025-04-13 21:05:48,882 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=4653, PETRI_DIFFERENCE_MINUEND_PLACES=215, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=279, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=169, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=5019, PETRI_PLACES=234, PETRI_TRANSITIONS=280} [2025-04-13 21:05:48,882 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 214 predicate places. [2025-04-13 21:05:48,882 INFO L485 AbstractCegarLoop]: Abstraction has has 234 places, 280 transitions, 5019 flow [2025-04-13 21:05:48,882 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 13 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:05:48,882 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:05:48,882 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:05:48,888 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2025-04-13 21:05:49,083 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:05:49,083 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:05:49,083 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:05:49,083 INFO L85 PathProgramCache]: Analyzing trace with hash -105148600, now seen corresponding path program 7 times [2025-04-13 21:05:49,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:05:49,084 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445253381] [2025-04-13 21:05:49,084 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 21:05:49,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:05:49,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-13 21:05:49,093 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-13 21:05:49,093 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:05:49,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:05:49,218 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:05:49,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:05:49,219 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445253381] [2025-04-13 21:05:49,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445253381] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:05:49,219 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [430049911] [2025-04-13 21:05:49,219 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 21:05:49,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:05:49,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:05:49,221 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 21:05:49,224 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-04-13 21:05:49,272 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-13 21:05:49,310 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-13 21:05:49,310 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:05:49,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:05:49,311 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-04-13 21:05:49,312 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:05:49,348 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:05:49,348 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:05:49,440 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:05:49,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [430049911] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 21:05:49,440 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 21:05:49,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2025-04-13 21:05:49,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56462188] [2025-04-13 21:05:49,441 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 21:05:49,441 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 21:05:49,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:05:49,441 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 21:05:49,441 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2025-04-13 21:05:49,441 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2025-04-13 21:05:49,441 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 234 places, 280 transitions, 5019 flow. Second operand has 14 states, 14 states have (on average 4.0) internal successors, (56), 14 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:05:49,442 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:05:49,442 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2025-04-13 21:05:49,442 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:05:51,903 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-13 21:05:59,940 WARN L286 SmtUtils]: Spent 8.02s on a formula simplification. DAG size of input: 26 DAG size of output: 27 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 21:06:00,350 INFO L116 PetriNetUnfolderBase]: 633/1222 cut-off events. [2025-04-13 21:06:00,350 INFO L117 PetriNetUnfolderBase]: For 15249/15249 co-relation queries the response was YES. [2025-04-13 21:06:00,355 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9844 conditions, 1222 events. 633/1222 cut-off events. For 15249/15249 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 7002 event pairs, 65 based on Foata normal form. 15/1237 useless extension candidates. Maximal degree in co-relation 9750. Up to 335 conditions per place. [2025-04-13 21:06:00,358 INFO L140 encePairwiseOnDemand]: 13/19 looper letters, 198 selfloop transitions, 159 changer transitions 0/357 dead transitions. [2025-04-13 21:06:00,358 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 254 places, 357 transitions, 6397 flow [2025-04-13 21:06:00,358 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-13 21:06:00,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-04-13 21:06:00,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 146 transitions. [2025-04-13 21:06:00,359 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3659147869674185 [2025-04-13 21:06:00,359 INFO L175 Difference]: Start difference. First operand has 234 places, 280 transitions, 5019 flow. Second operand 21 states and 146 transitions. [2025-04-13 21:06:00,359 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 254 places, 357 transitions, 6397 flow [2025-04-13 21:06:00,429 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 236 places, 357 transitions, 6021 flow, removed 6 selfloop flow, removed 18 redundant places. [2025-04-13 21:06:00,434 INFO L231 Difference]: Finished difference. Result has 242 places, 290 transitions, 5210 flow [2025-04-13 21:06:00,434 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=4658, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=279, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=148, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=5210, PETRI_PLACES=242, PETRI_TRANSITIONS=290} [2025-04-13 21:06:00,434 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 222 predicate places. [2025-04-13 21:06:00,434 INFO L485 AbstractCegarLoop]: Abstraction has has 242 places, 290 transitions, 5210 flow [2025-04-13 21:06:00,434 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.0) internal successors, (56), 14 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:06:00,435 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:06:00,435 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:06:00,441 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2025-04-13 21:06:00,635 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:06:00,635 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:06:00,636 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:06:00,636 INFO L85 PathProgramCache]: Analyzing trace with hash 1556532422, now seen corresponding path program 1 times [2025-04-13 21:06:00,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:06:00,636 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981471689] [2025-04-13 21:06:00,636 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:06:00,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:06:00,641 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-13 21:06:00,646 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-13 21:06:00,646 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:06:00,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:06:00,733 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 21:06:00,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:06:00,733 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981471689] [2025-04-13 21:06:00,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981471689] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:06:00,734 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [487921540] [2025-04-13 21:06:00,734 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:06:00,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:06:00,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:06:00,736 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 21:06:00,737 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-04-13 21:06:00,784 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-13 21:06:00,820 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-13 21:06:00,821 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:06:00,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:06:00,822 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 49 conjuncts are in the unsatisfiable core [2025-04-13 21:06:00,824 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:06:00,843 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-13 21:06:00,883 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-13 21:06:01,154 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:06:01,154 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:06:02,355 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 21:06:02,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [487921540] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 21:06:02,356 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 21:06:02,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 7] total 22 [2025-04-13 21:06:02,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286788172] [2025-04-13 21:06:02,356 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 21:06:02,356 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-04-13 21:06:02,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:06:02,357 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-04-13 21:06:02,357 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=371, Unknown=0, NotChecked=0, Total=462 [2025-04-13 21:06:02,357 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2025-04-13 21:06:02,357 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 242 places, 290 transitions, 5210 flow. Second operand has 22 states, 22 states have (on average 3.8181818181818183) internal successors, (84), 22 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:06:02,357 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:06:02,357 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2025-04-13 21:06:02,357 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:06:13,536 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-13 21:06:13,623 INFO L116 PetriNetUnfolderBase]: 915/1709 cut-off events. [2025-04-13 21:06:13,623 INFO L117 PetriNetUnfolderBase]: For 21415/21415 co-relation queries the response was YES. [2025-04-13 21:06:13,630 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13885 conditions, 1709 events. 915/1709 cut-off events. For 21415/21415 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 10079 event pairs, 10 based on Foata normal form. 9/1718 useless extension candidates. Maximal degree in co-relation 13762. Up to 431 conditions per place. [2025-04-13 21:06:13,635 INFO L140 encePairwiseOnDemand]: 9/19 looper letters, 210 selfloop transitions, 318 changer transitions 9/537 dead transitions. [2025-04-13 21:06:13,635 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 282 places, 537 transitions, 9197 flow [2025-04-13 21:06:13,635 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2025-04-13 21:06:13,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2025-04-13 21:06:13,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 302 transitions. [2025-04-13 21:06:13,636 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.37844611528822053 [2025-04-13 21:06:13,636 INFO L175 Difference]: Start difference. First operand has 242 places, 290 transitions, 5210 flow. Second operand 42 states and 302 transitions. [2025-04-13 21:06:13,636 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 282 places, 537 transitions, 9197 flow [2025-04-13 21:06:13,719 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 274 places, 537 transitions, 8847 flow, removed 59 selfloop flow, removed 8 redundant places. [2025-04-13 21:06:13,725 INFO L231 Difference]: Finished difference. Result has 286 places, 408 transitions, 7955 flow [2025-04-13 21:06:13,725 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=4924, PETRI_DIFFERENCE_MINUEND_PLACES=233, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=289, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=202, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=42, PETRI_FLOW=7955, PETRI_PLACES=286, PETRI_TRANSITIONS=408} [2025-04-13 21:06:13,726 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 266 predicate places. [2025-04-13 21:06:13,726 INFO L485 AbstractCegarLoop]: Abstraction has has 286 places, 408 transitions, 7955 flow [2025-04-13 21:06:13,726 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 3.8181818181818183) internal successors, (84), 22 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:06:13,726 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:06:13,726 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:06:13,732 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2025-04-13 21:06:13,926 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:06:13,926 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:06:13,927 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:06:13,927 INFO L85 PathProgramCache]: Analyzing trace with hash -1107581356, now seen corresponding path program 12 times [2025-04-13 21:06:13,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:06:13,927 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951737567] [2025-04-13 21:06:13,927 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 21:06:13,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:06:13,931 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 17 statements into 2 equivalence classes. [2025-04-13 21:06:13,949 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-04-13 21:06:13,949 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 21:06:13,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:06:14,121 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 21:06:14,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:06:14,122 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951737567] [2025-04-13 21:06:14,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951737567] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:06:14,122 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1247456471] [2025-04-13 21:06:14,122 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 21:06:14,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:06:14,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:06:14,124 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 21:06:14,125 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-04-13 21:06:14,176 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 17 statements into 2 equivalence classes. [2025-04-13 21:06:14,222 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-04-13 21:06:14,223 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 21:06:14,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:06:14,227 INFO L256 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-04-13 21:06:14,229 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:06:14,325 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 21:06:14,325 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 34 treesize of output 23 [2025-04-13 21:06:14,329 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 21:06:14,329 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:06:14,757 INFO L325 Elim1Store]: treesize reduction 10, result has 84.6 percent of original size [2025-04-13 21:06:14,758 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 47 treesize of output 77 [2025-04-13 21:06:14,794 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 21:06:14,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1247456471] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 21:06:14,794 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 21:06:14,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 5] total 12 [2025-04-13 21:06:14,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98711255] [2025-04-13 21:06:14,794 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 21:06:14,795 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 21:06:14,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:06:14,795 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 21:06:14,795 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2025-04-13 21:06:14,795 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2025-04-13 21:06:14,795 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 286 places, 408 transitions, 7955 flow. Second operand has 14 states, 14 states have (on average 4.285714285714286) internal successors, (60), 14 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:06:14,795 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:06:14,795 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2025-04-13 21:06:14,795 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:06:15,157 INFO L116 PetriNetUnfolderBase]: 913/1708 cut-off events. [2025-04-13 21:06:15,158 INFO L117 PetriNetUnfolderBase]: For 24084/24084 co-relation queries the response was YES. [2025-04-13 21:06:15,165 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14844 conditions, 1708 events. 913/1708 cut-off events. For 24084/24084 co-relation queries the response was YES. Maximal size of possible extension queue 165. Compared 10103 event pairs, 70 based on Foata normal form. 1/1709 useless extension candidates. Maximal degree in co-relation 14708. Up to 1496 conditions per place. [2025-04-13 21:06:15,169 INFO L140 encePairwiseOnDemand]: 11/19 looper letters, 359 selfloop transitions, 67 changer transitions 3/429 dead transitions. [2025-04-13 21:06:15,170 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 293 places, 429 transitions, 8954 flow [2025-04-13 21:06:15,170 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 21:06:15,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-13 21:06:15,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 76 transitions. [2025-04-13 21:06:15,170 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4 [2025-04-13 21:06:15,170 INFO L175 Difference]: Start difference. First operand has 286 places, 408 transitions, 7955 flow. Second operand 10 states and 76 transitions. [2025-04-13 21:06:15,170 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 293 places, 429 transitions, 8954 flow [2025-04-13 21:06:15,305 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 279 places, 429 transitions, 8329 flow, removed 179 selfloop flow, removed 14 redundant places. [2025-04-13 21:06:15,311 INFO L231 Difference]: Finished difference. Result has 281 places, 410 transitions, 7541 flow [2025-04-13 21:06:15,311 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=7362, PETRI_DIFFERENCE_MINUEND_PLACES=270, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=408, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=341, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=7541, PETRI_PLACES=281, PETRI_TRANSITIONS=410} [2025-04-13 21:06:15,312 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 261 predicate places. [2025-04-13 21:06:15,312 INFO L485 AbstractCegarLoop]: Abstraction has has 281 places, 410 transitions, 7541 flow [2025-04-13 21:06:15,312 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.285714285714286) internal successors, (60), 14 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:06:15,312 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:06:15,312 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:06:15,318 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2025-04-13 21:06:15,516 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-04-13 21:06:15,516 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:06:15,516 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:06:15,516 INFO L85 PathProgramCache]: Analyzing trace with hash -204148264, now seen corresponding path program 8 times [2025-04-13 21:06:15,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:06:15,516 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448557600] [2025-04-13 21:06:15,516 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 21:06:15,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:06:15,521 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-04-13 21:06:15,529 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-04-13 21:06:15,529 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 21:06:15,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:06:15,627 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:06:15,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:06:15,627 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448557600] [2025-04-13 21:06:15,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448557600] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:06:15,627 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [921154508] [2025-04-13 21:06:15,627 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 21:06:15,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:06:15,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:06:15,629 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 21:06:15,631 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2025-04-13 21:06:15,680 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-04-13 21:06:15,783 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-04-13 21:06:15,784 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 21:06:15,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:06:15,785 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-04-13 21:06:15,785 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:06:15,817 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:06:15,817 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:06:15,913 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:06:15,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [921154508] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 21:06:15,914 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 21:06:15,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2025-04-13 21:06:15,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055915738] [2025-04-13 21:06:15,914 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 21:06:15,914 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 21:06:15,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:06:15,914 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 21:06:15,915 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2025-04-13 21:06:15,915 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2025-04-13 21:06:15,915 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 281 places, 410 transitions, 7541 flow. Second operand has 14 states, 14 states have (on average 4.071428571428571) internal successors, (57), 14 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:06:15,915 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:06:15,915 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2025-04-13 21:06:15,915 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:06:17,126 INFO L116 PetriNetUnfolderBase]: 1005/1914 cut-off events. [2025-04-13 21:06:17,127 INFO L117 PetriNetUnfolderBase]: For 26459/26459 co-relation queries the response was YES. [2025-04-13 21:06:17,136 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15389 conditions, 1914 events. 1005/1914 cut-off events. For 26459/26459 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 11851 event pairs, 156 based on Foata normal form. 33/1947 useless extension candidates. Maximal degree in co-relation 15257. Up to 826 conditions per place. [2025-04-13 21:06:17,143 INFO L140 encePairwiseOnDemand]: 13/19 looper letters, 314 selfloop transitions, 222 changer transitions 0/536 dead transitions. [2025-04-13 21:06:17,144 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 307 places, 536 transitions, 9993 flow [2025-04-13 21:06:17,144 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-13 21:06:17,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2025-04-13 21:06:17,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 214 transitions. [2025-04-13 21:06:17,145 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4171539961013645 [2025-04-13 21:06:17,145 INFO L175 Difference]: Start difference. First operand has 281 places, 410 transitions, 7541 flow. Second operand 27 states and 214 transitions. [2025-04-13 21:06:17,145 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 307 places, 536 transitions, 9993 flow [2025-04-13 21:06:17,289 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 300 places, 536 transitions, 9841 flow, removed 11 selfloop flow, removed 7 redundant places. [2025-04-13 21:06:17,296 INFO L231 Difference]: Finished difference. Result has 307 places, 453 transitions, 8951 flow [2025-04-13 21:06:17,296 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=7255, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=404, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=178, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=211, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=8951, PETRI_PLACES=307, PETRI_TRANSITIONS=453} [2025-04-13 21:06:17,297 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 287 predicate places. [2025-04-13 21:06:17,297 INFO L485 AbstractCegarLoop]: Abstraction has has 307 places, 453 transitions, 8951 flow [2025-04-13 21:06:17,297 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.071428571428571) internal successors, (57), 14 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:06:17,297 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:06:17,297 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:06:17,304 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2025-04-13 21:06:17,497 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-04-13 21:06:17,498 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:06:17,498 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:06:17,498 INFO L85 PathProgramCache]: Analyzing trace with hash 983144350, now seen corresponding path program 13 times [2025-04-13 21:06:17,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:06:17,498 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584960887] [2025-04-13 21:06:17,498 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 21:06:17,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:06:17,504 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-13 21:06:17,517 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-13 21:06:17,518 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:06:17,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:06:17,936 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:06:17,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:06:17,936 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584960887] [2025-04-13 21:06:17,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [584960887] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:06:17,936 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2059966612] [2025-04-13 21:06:17,936 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 21:06:17,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:06:17,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:06:17,938 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 21:06:17,939 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2025-04-13 21:06:17,985 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-13 21:06:18,011 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-13 21:06:18,011 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:06:18,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:06:18,012 INFO L256 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-13 21:06:18,013 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:06:18,153 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 21:06:18,153 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 38 treesize of output 25 [2025-04-13 21:06:18,176 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 21:06:18,176 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:06:18,747 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 21:06:18,748 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 144 treesize of output 145 [2025-04-13 21:06:19,552 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 21:06:19,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2059966612] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 21:06:19,553 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 21:06:19,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 21 [2025-04-13 21:06:19,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327000645] [2025-04-13 21:06:19,553 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 21:06:19,553 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-13 21:06:19,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:06:19,554 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-13 21:06:19,554 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=392, Unknown=0, NotChecked=0, Total=506 [2025-04-13 21:06:19,554 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2025-04-13 21:06:19,554 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 307 places, 453 transitions, 8951 flow. Second operand has 23 states, 23 states have (on average 3.9130434782608696) internal successors, (90), 23 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:06:19,554 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:06:19,554 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2025-04-13 21:06:19,554 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:06:23,678 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-13 21:06:28,062 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-13 21:06:29,466 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-13 21:06:34,259 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-13 21:06:39,540 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-13 21:06:43,546 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-13 21:06:47,592 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-13 21:06:51,621 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-13 21:06:56,159 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-13 21:06:56,579 INFO L116 PetriNetUnfolderBase]: 1153/2239 cut-off events. [2025-04-13 21:06:56,579 INFO L117 PetriNetUnfolderBase]: For 30895/30895 co-relation queries the response was YES. [2025-04-13 21:06:56,590 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18648 conditions, 2239 events. 1153/2239 cut-off events. For 30895/30895 co-relation queries the response was YES. Maximal size of possible extension queue 212. Compared 14737 event pairs, 12 based on Foata normal form. 9/2248 useless extension candidates. Maximal degree in co-relation 18460. Up to 1166 conditions per place. [2025-04-13 21:06:56,596 INFO L140 encePairwiseOnDemand]: 8/19 looper letters, 313 selfloop transitions, 286 changer transitions 15/614 dead transitions. [2025-04-13 21:06:56,597 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 347 places, 614 transitions, 12015 flow [2025-04-13 21:06:56,597 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2025-04-13 21:06:56,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2025-04-13 21:06:56,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 279 transitions. [2025-04-13 21:06:56,598 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3581514762516046 [2025-04-13 21:06:56,598 INFO L175 Difference]: Start difference. First operand has 307 places, 453 transitions, 8951 flow. Second operand 41 states and 279 transitions. [2025-04-13 21:06:56,598 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 347 places, 614 transitions, 12015 flow [2025-04-13 21:06:56,800 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 340 places, 614 transitions, 11462 flow, removed 196 selfloop flow, removed 7 redundant places. [2025-04-13 21:06:56,808 INFO L231 Difference]: Finished difference. Result has 355 places, 530 transitions, 10869 flow [2025-04-13 21:06:56,808 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=8430, PETRI_DIFFERENCE_MINUEND_PLACES=300, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=453, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=206, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=197, PETRI_DIFFERENCE_SUBTRAHEND_STATES=41, PETRI_FLOW=10869, PETRI_PLACES=355, PETRI_TRANSITIONS=530} [2025-04-13 21:06:56,809 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 335 predicate places. [2025-04-13 21:06:56,809 INFO L485 AbstractCegarLoop]: Abstraction has has 355 places, 530 transitions, 10869 flow [2025-04-13 21:06:56,809 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 3.9130434782608696) internal successors, (90), 23 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:06:56,809 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:06:56,809 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:06:56,816 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2025-04-13 21:06:57,010 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-04-13 21:06:57,010 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:06:57,010 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:06:57,011 INFO L85 PathProgramCache]: Analyzing trace with hash -645171010, now seen corresponding path program 9 times [2025-04-13 21:06:57,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:06:57,011 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245733305] [2025-04-13 21:06:57,011 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 21:06:57,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:06:57,015 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 17 statements into 2 equivalence classes. [2025-04-13 21:06:57,026 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-04-13 21:06:57,027 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 21:06:57,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:06:57,108 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 21:06:57,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:06:57,108 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245733305] [2025-04-13 21:06:57,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245733305] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:06:57,109 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1404582721] [2025-04-13 21:06:57,109 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 21:06:57,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:06:57,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:06:57,111 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 21:06:57,112 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2025-04-13 21:06:57,164 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 17 statements into 2 equivalence classes. [2025-04-13 21:06:57,209 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-04-13 21:06:57,209 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 21:06:57,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:06:57,210 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-04-13 21:06:57,211 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:06:57,243 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 21:06:57,244 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:06:57,405 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 21:06:57,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1404582721] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 21:06:57,405 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 21:06:57,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2025-04-13 21:06:57,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143446700] [2025-04-13 21:06:57,405 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 21:06:57,406 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 21:06:57,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:06:57,406 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 21:06:57,406 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2025-04-13 21:06:57,406 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2025-04-13 21:06:57,406 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 355 places, 530 transitions, 10869 flow. Second operand has 14 states, 14 states have (on average 3.9285714285714284) internal successors, (55), 14 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:06:57,406 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:06:57,406 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2025-04-13 21:06:57,406 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:07:03,374 INFO L116 PetriNetUnfolderBase]: 1240/2377 cut-off events. [2025-04-13 21:07:03,374 INFO L117 PetriNetUnfolderBase]: For 41643/41643 co-relation queries the response was YES. [2025-04-13 21:07:03,386 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20853 conditions, 2377 events. 1240/2377 cut-off events. For 41643/41643 co-relation queries the response was YES. Maximal size of possible extension queue 210. Compared 15541 event pairs, 143 based on Foata normal form. 30/2407 useless extension candidates. Maximal degree in co-relation 20699. Up to 823 conditions per place. [2025-04-13 21:07:03,393 INFO L140 encePairwiseOnDemand]: 13/19 looper letters, 304 selfloop transitions, 323 changer transitions 1/628 dead transitions. [2025-04-13 21:07:03,393 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 372 places, 628 transitions, 13527 flow [2025-04-13 21:07:03,393 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-13 21:07:03,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-04-13 21:07:03,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 157 transitions. [2025-04-13 21:07:03,394 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.37559808612440193 [2025-04-13 21:07:03,394 INFO L175 Difference]: Start difference. First operand has 355 places, 530 transitions, 10869 flow. Second operand 22 states and 157 transitions. [2025-04-13 21:07:03,394 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 372 places, 628 transitions, 13527 flow [2025-04-13 21:07:03,659 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 355 places, 628 transitions, 13224 flow, removed 73 selfloop flow, removed 17 redundant places. [2025-04-13 21:07:03,667 INFO L231 Difference]: Finished difference. Result has 361 places, 569 transitions, 12538 flow [2025-04-13 21:07:03,668 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=10569, PETRI_DIFFERENCE_MINUEND_PLACES=334, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=529, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=289, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=227, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=12538, PETRI_PLACES=361, PETRI_TRANSITIONS=569} [2025-04-13 21:07:03,668 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 341 predicate places. [2025-04-13 21:07:03,668 INFO L485 AbstractCegarLoop]: Abstraction has has 361 places, 569 transitions, 12538 flow [2025-04-13 21:07:03,668 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.9285714285714284) internal successors, (55), 14 states have internal predecessors, (55), 0 states have call successors, (0), 0 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:07:03,668 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:07:03,668 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:07:03,675 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2025-04-13 21:07:03,869 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:07:03,869 INFO L403 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:07:03,870 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:07:03,870 INFO L85 PathProgramCache]: Analyzing trace with hash 1895285132, now seen corresponding path program 14 times [2025-04-13 21:07:03,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:07:03,870 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128560432] [2025-04-13 21:07:03,870 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 21:07:03,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:07:03,875 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-04-13 21:07:03,882 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-04-13 21:07:03,882 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 21:07:03,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:07:04,075 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:07:04,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:07:04,075 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128560432] [2025-04-13 21:07:04,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128560432] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:07:04,075 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [634680325] [2025-04-13 21:07:04,075 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 21:07:04,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:07:04,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:07:04,077 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 21:07:04,078 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2025-04-13 21:07:04,126 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-04-13 21:07:04,150 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-04-13 21:07:04,151 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 21:07:04,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:07:04,152 INFO L256 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-13 21:07:04,153 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:07:04,250 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 21:07:04,250 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 34 treesize of output 23 [2025-04-13 21:07:04,253 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:07:04,253 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:07:04,679 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 21:07:04,679 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 182 treesize of output 159 [2025-04-13 21:07:05,303 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:07:05,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [634680325] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 21:07:05,303 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 21:07:05,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 6] total 13 [2025-04-13 21:07:05,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210642404] [2025-04-13 21:07:05,303 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 21:07:05,303 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 21:07:05,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:07:05,304 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 21:07:05,304 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2025-04-13 21:07:05,304 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2025-04-13 21:07:05,304 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 361 places, 569 transitions, 12538 flow. Second operand has 15 states, 15 states have (on average 4.266666666666667) internal successors, (64), 15 states have internal predecessors, (64), 0 states have call successors, (0), 0 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:07:05,304 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:07:05,304 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2025-04-13 21:07:05,304 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:07:06,144 INFO L116 PetriNetUnfolderBase]: 1240/2376 cut-off events. [2025-04-13 21:07:06,144 INFO L117 PetriNetUnfolderBase]: For 46695/46695 co-relation queries the response was YES. [2025-04-13 21:07:06,157 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21884 conditions, 2376 events. 1240/2376 cut-off events. For 46695/46695 co-relation queries the response was YES. Maximal size of possible extension queue 225. Compared 15595 event pairs, 91 based on Foata normal form. 1/2377 useless extension candidates. Maximal degree in co-relation 21729. Up to 2200 conditions per place. [2025-04-13 21:07:06,163 INFO L140 encePairwiseOnDemand]: 9/19 looper letters, 517 selfloop transitions, 72 changer transitions 5/594 dead transitions. [2025-04-13 21:07:06,164 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 373 places, 594 transitions, 13840 flow [2025-04-13 21:07:06,164 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-13 21:07:06,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-04-13 21:07:06,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 91 transitions. [2025-04-13 21:07:06,165 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3684210526315789 [2025-04-13 21:07:06,165 INFO L175 Difference]: Start difference. First operand has 361 places, 569 transitions, 12538 flow. Second operand 13 states and 91 transitions. [2025-04-13 21:07:06,165 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 373 places, 594 transitions, 13840 flow [2025-04-13 21:07:06,487 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 361 places, 594 transitions, 13360 flow, removed 122 selfloop flow, removed 12 redundant places. [2025-04-13 21:07:06,495 INFO L231 Difference]: Finished difference. Result has 363 places, 568 transitions, 12172 flow [2025-04-13 21:07:06,496 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=12058, PETRI_DIFFERENCE_MINUEND_PLACES=349, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=569, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=71, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=497, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=12172, PETRI_PLACES=363, PETRI_TRANSITIONS=568} [2025-04-13 21:07:06,496 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 343 predicate places. [2025-04-13 21:07:06,496 INFO L485 AbstractCegarLoop]: Abstraction has has 363 places, 568 transitions, 12172 flow [2025-04-13 21:07:06,496 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.266666666666667) internal successors, (64), 15 states have internal predecessors, (64), 0 states have call successors, (0), 0 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:07:06,496 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:07:06,496 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:07:06,503 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2025-04-13 21:07:06,697 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:07:06,697 INFO L403 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:07:06,697 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:07:06,698 INFO L85 PathProgramCache]: Analyzing trace with hash -563985730, now seen corresponding path program 10 times [2025-04-13 21:07:06,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:07:06,698 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648083227] [2025-04-13 21:07:06,698 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 21:07:06,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:07:06,702 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 17 statements into 2 equivalence classes. [2025-04-13 21:07:06,711 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-04-13 21:07:06,711 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 21:07:06,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:07:06,934 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:07:06,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:07:06,934 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648083227] [2025-04-13 21:07:06,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648083227] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:07:06,934 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [337539202] [2025-04-13 21:07:06,934 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 21:07:06,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:07:06,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:07:06,936 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 21:07:06,937 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2025-04-13 21:07:06,991 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 17 statements into 2 equivalence classes. [2025-04-13 21:07:07,028 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-04-13 21:07:07,028 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 21:07:07,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:07:07,029 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-13 21:07:07,030 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:07:07,090 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:07:07,090 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:07:07,244 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:07:07,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [337539202] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 21:07:07,244 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 21:07:07,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2025-04-13 21:07:07,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511235847] [2025-04-13 21:07:07,244 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 21:07:07,244 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 21:07:07,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:07:07,245 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 21:07:07,245 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2025-04-13 21:07:07,245 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2025-04-13 21:07:07,245 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 363 places, 568 transitions, 12172 flow. Second operand has 14 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 14 states have internal predecessors, (53), 0 states have call successors, (0), 0 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:07:07,245 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:07:07,245 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2025-04-13 21:07:07,245 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:07:08,881 INFO L116 PetriNetUnfolderBase]: 1374/2640 cut-off events. [2025-04-13 21:07:08,881 INFO L117 PetriNetUnfolderBase]: For 53072/53072 co-relation queries the response was YES. [2025-04-13 21:07:08,895 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24113 conditions, 2640 events. 1374/2640 cut-off events. For 53072/53072 co-relation queries the response was YES. Maximal size of possible extension queue 238. Compared 17745 event pairs, 159 based on Foata normal form. 12/2652 useless extension candidates. Maximal degree in co-relation 23958. Up to 976 conditions per place. [2025-04-13 21:07:08,903 INFO L140 encePairwiseOnDemand]: 13/19 looper letters, 283 selfloop transitions, 398 changer transitions 1/682 dead transitions. [2025-04-13 21:07:08,903 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 383 places, 682 transitions, 15440 flow [2025-04-13 21:07:08,903 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-13 21:07:08,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-04-13 21:07:08,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 161 transitions. [2025-04-13 21:07:08,904 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.40350877192982454 [2025-04-13 21:07:08,904 INFO L175 Difference]: Start difference. First operand has 363 places, 568 transitions, 12172 flow. Second operand 21 states and 161 transitions. [2025-04-13 21:07:08,904 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 383 places, 682 transitions, 15440 flow [2025-04-13 21:07:09,264 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 371 places, 682 transitions, 15269 flow, removed 11 selfloop flow, removed 12 redundant places. [2025-04-13 21:07:09,274 INFO L231 Difference]: Finished difference. Result has 376 places, 621 transitions, 14448 flow [2025-04-13 21:07:09,275 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=12011, PETRI_DIFFERENCE_MINUEND_PLACES=351, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=568, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=352, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=207, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=14448, PETRI_PLACES=376, PETRI_TRANSITIONS=621} [2025-04-13 21:07:09,275 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 356 predicate places. [2025-04-13 21:07:09,275 INFO L485 AbstractCegarLoop]: Abstraction has has 376 places, 621 transitions, 14448 flow [2025-04-13 21:07:09,275 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 14 states have internal predecessors, (53), 0 states have call successors, (0), 0 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:07:09,275 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:07:09,275 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:07:09,281 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2025-04-13 21:07:09,476 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2025-04-13 21:07:09,476 INFO L403 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:07:09,476 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:07:09,476 INFO L85 PathProgramCache]: Analyzing trace with hash -567416500, now seen corresponding path program 11 times [2025-04-13 21:07:09,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:07:09,477 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785154636] [2025-04-13 21:07:09,477 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 21:07:09,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:07:09,481 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-04-13 21:07:09,488 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-04-13 21:07:09,488 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 21:07:09,488 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:07:09,620 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:07:09,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:07:09,620 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785154636] [2025-04-13 21:07:09,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785154636] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:07:09,620 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [71681379] [2025-04-13 21:07:09,620 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 21:07:09,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:07:09,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:07:09,622 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 21:07:09,624 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2025-04-13 21:07:09,678 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-04-13 21:07:09,732 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-04-13 21:07:09,732 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 21:07:09,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:07:09,734 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-04-13 21:07:09,734 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:07:09,775 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:07:09,775 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:07:09,894 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:07:09,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [71681379] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 21:07:09,894 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 21:07:09,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2025-04-13 21:07:09,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345963683] [2025-04-13 21:07:09,895 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 21:07:09,895 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 21:07:09,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:07:09,895 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 21:07:09,895 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2025-04-13 21:07:09,895 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2025-04-13 21:07:09,895 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 376 places, 621 transitions, 14448 flow. Second operand has 14 states, 14 states have (on average 3.9285714285714284) internal successors, (55), 14 states have internal predecessors, (55), 0 states have call successors, (0), 0 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:07:09,895 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:07:09,895 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2025-04-13 21:07:09,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:07:11,218 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-13 21:07:12,933 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-13 21:07:15,332 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.40s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-13 21:07:16,220 INFO L116 PetriNetUnfolderBase]: 1347/2590 cut-off events. [2025-04-13 21:07:16,220 INFO L117 PetriNetUnfolderBase]: For 60140/60140 co-relation queries the response was YES. [2025-04-13 21:07:16,235 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24852 conditions, 2590 events. 1347/2590 cut-off events. For 60140/60140 co-relation queries the response was YES. Maximal size of possible extension queue 236. Compared 17399 event pairs, 238 based on Foata normal form. 33/2623 useless extension candidates. Maximal degree in co-relation 24693. Up to 1397 conditions per place. [2025-04-13 21:07:16,243 INFO L140 encePairwiseOnDemand]: 13/19 looper letters, 340 selfloop transitions, 325 changer transitions 1/666 dead transitions. [2025-04-13 21:07:16,243 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 396 places, 666 transitions, 15996 flow [2025-04-13 21:07:16,243 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-13 21:07:16,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-04-13 21:07:16,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 153 transitions. [2025-04-13 21:07:16,244 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.38345864661654133 [2025-04-13 21:07:16,244 INFO L175 Difference]: Start difference. First operand has 376 places, 621 transitions, 14448 flow. Second operand 21 states and 153 transitions. [2025-04-13 21:07:16,244 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 396 places, 666 transitions, 15996 flow [2025-04-13 21:07:16,652 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 385 places, 666 transitions, 15366 flow, removed 144 selfloop flow, removed 11 redundant places. [2025-04-13 21:07:16,661 INFO L231 Difference]: Finished difference. Result has 386 places, 619 transitions, 14404 flow [2025-04-13 21:07:16,662 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=13527, PETRI_DIFFERENCE_MINUEND_PLACES=365, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=611, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=320, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=290, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=14404, PETRI_PLACES=386, PETRI_TRANSITIONS=619} [2025-04-13 21:07:16,662 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 366 predicate places. [2025-04-13 21:07:16,662 INFO L485 AbstractCegarLoop]: Abstraction has has 386 places, 619 transitions, 14404 flow [2025-04-13 21:07:16,662 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.9285714285714284) internal successors, (55), 14 states have internal predecessors, (55), 0 states have call successors, (0), 0 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:07:16,662 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:07:16,662 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:07:16,668 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2025-04-13 21:07:16,864 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2025-04-13 21:07:16,864 INFO L403 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:07:16,865 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:07:16,865 INFO L85 PathProgramCache]: Analyzing trace with hash -1186647916, now seen corresponding path program 15 times [2025-04-13 21:07:16,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:07:16,865 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335738708] [2025-04-13 21:07:16,865 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 21:07:16,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:07:16,870 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 18 statements into 2 equivalence classes. [2025-04-13 21:07:16,876 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 21:07:16,876 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 21:07:16,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:07:16,942 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:07:16,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:07:16,942 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335738708] [2025-04-13 21:07:16,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335738708] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:07:16,942 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1033634723] [2025-04-13 21:07:16,942 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 21:07:16,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:07:16,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:07:16,944 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 21:07:16,945 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2025-04-13 21:07:16,994 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 18 statements into 2 equivalence classes. [2025-04-13 21:07:17,044 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 21:07:17,044 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 21:07:17,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:07:17,045 INFO L256 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-13 21:07:17,046 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:07:17,068 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:07:17,068 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:07:17,117 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:07:17,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1033634723] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 21:07:17,117 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 21:07:17,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-04-13 21:07:17,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456269150] [2025-04-13 21:07:17,117 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 21:07:17,117 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 21:07:17,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:07:17,118 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 21:07:17,118 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2025-04-13 21:07:17,118 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2025-04-13 21:07:17,118 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 386 places, 619 transitions, 14404 flow. Second operand has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 13 states have internal predecessors, (55), 0 states have call successors, (0), 0 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:07:17,118 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:07:17,118 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2025-04-13 21:07:17,118 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:07:26,409 INFO L116 PetriNetUnfolderBase]: 1722/3385 cut-off events. [2025-04-13 21:07:26,409 INFO L117 PetriNetUnfolderBase]: For 79939/79939 co-relation queries the response was YES. [2025-04-13 21:07:26,428 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32484 conditions, 3385 events. 1722/3385 cut-off events. For 79939/79939 co-relation queries the response was YES. Maximal size of possible extension queue 269. Compared 23894 event pairs, 124 based on Foata normal form. 70/3455 useless extension candidates. Maximal degree in co-relation 32323. Up to 844 conditions per place. [2025-04-13 21:07:26,438 INFO L140 encePairwiseOnDemand]: 13/19 looper letters, 555 selfloop transitions, 267 changer transitions 0/822 dead transitions. [2025-04-13 21:07:26,439 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 403 places, 822 transitions, 19937 flow [2025-04-13 21:07:26,439 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-13 21:07:26,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-04-13 21:07:26,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 170 transitions. [2025-04-13 21:07:26,440 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.49707602339181284 [2025-04-13 21:07:26,440 INFO L175 Difference]: Start difference. First operand has 386 places, 619 transitions, 14404 flow. Second operand 18 states and 170 transitions. [2025-04-13 21:07:26,440 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 403 places, 822 transitions, 19937 flow [2025-04-13 21:07:26,949 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 394 places, 822 transitions, 19560 flow, removed 75 selfloop flow, removed 9 redundant places. [2025-04-13 21:07:26,959 INFO L231 Difference]: Finished difference. Result has 398 places, 650 transitions, 15340 flow [2025-04-13 21:07:26,960 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=13576, PETRI_DIFFERENCE_MINUEND_PLACES=377, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=600, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=226, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=370, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=15340, PETRI_PLACES=398, PETRI_TRANSITIONS=650} [2025-04-13 21:07:26,960 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 378 predicate places. [2025-04-13 21:07:26,960 INFO L485 AbstractCegarLoop]: Abstraction has has 398 places, 650 transitions, 15340 flow [2025-04-13 21:07:26,960 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 13 states have internal predecessors, (55), 0 states have call successors, (0), 0 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:07:26,960 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:07:26,961 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:07:26,967 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2025-04-13 21:07:27,161 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:07:27,161 INFO L403 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:07:27,162 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:07:27,162 INFO L85 PathProgramCache]: Analyzing trace with hash 781364998, now seen corresponding path program 2 times [2025-04-13 21:07:27,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:07:27,162 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028833104] [2025-04-13 21:07:27,162 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 21:07:27,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:07:27,167 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-04-13 21:07:27,173 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 21:07:27,173 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 21:07:27,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:07:27,278 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:07:27,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:07:27,278 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028833104] [2025-04-13 21:07:27,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028833104] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:07:27,278 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2102504809] [2025-04-13 21:07:27,278 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 21:07:27,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:07:27,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:07:27,280 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 21:07:27,281 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2025-04-13 21:07:27,334 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-04-13 21:07:27,366 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 21:07:27,367 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 21:07:27,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:07:27,368 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-04-13 21:07:27,369 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:07:27,423 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 21:07:27,423 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:07:27,559 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:07:27,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2102504809] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 21:07:27,559 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 21:07:27,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8] total 18 [2025-04-13 21:07:27,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401668509] [2025-04-13 21:07:27,559 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 21:07:27,559 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-13 21:07:27,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:07:27,559 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-13 21:07:27,560 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2025-04-13 21:07:27,560 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2025-04-13 21:07:27,560 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 398 places, 650 transitions, 15340 flow. Second operand has 18 states, 18 states have (on average 3.7777777777777777) internal successors, (68), 18 states have internal predecessors, (68), 0 states have call successors, (0), 0 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:07:27,560 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:07:27,560 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2025-04-13 21:07:27,560 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:07:28,973 INFO L116 PetriNetUnfolderBase]: 1764/3475 cut-off events. [2025-04-13 21:07:28,974 INFO L117 PetriNetUnfolderBase]: For 86449/86449 co-relation queries the response was YES. [2025-04-13 21:07:28,993 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33854 conditions, 3475 events. 1764/3475 cut-off events. For 86449/86449 co-relation queries the response was YES. Maximal size of possible extension queue 275. Compared 24786 event pairs, 186 based on Foata normal form. 73/3548 useless extension candidates. Maximal degree in co-relation 33689. Up to 853 conditions per place. [2025-04-13 21:07:29,003 INFO L140 encePairwiseOnDemand]: 12/19 looper letters, 391 selfloop transitions, 357 changer transitions 6/754 dead transitions. [2025-04-13 21:07:29,003 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 418 places, 754 transitions, 18264 flow [2025-04-13 21:07:29,004 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-13 21:07:29,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-04-13 21:07:29,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 170 transitions. [2025-04-13 21:07:29,004 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.42606516290726815 [2025-04-13 21:07:29,004 INFO L175 Difference]: Start difference. First operand has 398 places, 650 transitions, 15340 flow. Second operand 21 states and 170 transitions. [2025-04-13 21:07:29,004 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 418 places, 754 transitions, 18264 flow [2025-04-13 21:07:29,640 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 402 places, 754 transitions, 17480 flow, removed 173 selfloop flow, removed 16 redundant places. [2025-04-13 21:07:29,651 INFO L231 Difference]: Finished difference. Result has 410 places, 673 transitions, 16199 flow [2025-04-13 21:07:29,652 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=14439, PETRI_DIFFERENCE_MINUEND_PLACES=382, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=644, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=327, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=294, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=16199, PETRI_PLACES=410, PETRI_TRANSITIONS=673} [2025-04-13 21:07:29,652 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 390 predicate places. [2025-04-13 21:07:29,652 INFO L485 AbstractCegarLoop]: Abstraction has has 410 places, 673 transitions, 16199 flow [2025-04-13 21:07:29,652 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.7777777777777777) internal successors, (68), 18 states have internal predecessors, (68), 0 states have call successors, (0), 0 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:07:29,652 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:07:29,653 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:07:29,659 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Ended with exit code 0 [2025-04-13 21:07:29,853 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:07:29,853 INFO L403 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:07:29,854 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:07:29,854 INFO L85 PathProgramCache]: Analyzing trace with hash 859119508, now seen corresponding path program 3 times [2025-04-13 21:07:29,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:07:29,854 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245398388] [2025-04-13 21:07:29,854 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 21:07:29,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:07:29,860 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 18 statements into 2 equivalence classes. [2025-04-13 21:07:29,873 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 21:07:29,873 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 21:07:29,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:07:30,041 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:07:30,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:07:30,041 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245398388] [2025-04-13 21:07:30,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245398388] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:07:30,041 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1695061181] [2025-04-13 21:07:30,041 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 21:07:30,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:07:30,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:07:30,043 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 21:07:30,045 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2025-04-13 21:07:30,098 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 18 statements into 2 equivalence classes. [2025-04-13 21:07:30,129 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 21:07:30,130 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 21:07:30,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:07:30,130 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-13 21:07:30,131 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:07:30,190 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:07:30,190 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:07:30,277 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 21:07:30,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1695061181] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 21:07:30,277 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 21:07:30,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 17 [2025-04-13 21:07:30,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203348093] [2025-04-13 21:07:30,277 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 21:07:30,277 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-04-13 21:07:30,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:07:30,278 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-04-13 21:07:30,278 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2025-04-13 21:07:30,278 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2025-04-13 21:07:30,278 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 410 places, 673 transitions, 16199 flow. Second operand has 17 states, 17 states have (on average 3.764705882352941) internal successors, (64), 17 states have internal predecessors, (64), 0 states have call successors, (0), 0 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:07:30,278 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:07:30,278 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2025-04-13 21:07:30,278 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:07:31,614 INFO L116 PetriNetUnfolderBase]: 1731/3380 cut-off events. [2025-04-13 21:07:31,614 INFO L117 PetriNetUnfolderBase]: For 86219/86219 co-relation queries the response was YES. [2025-04-13 21:07:31,633 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33794 conditions, 3380 events. 1731/3380 cut-off events. For 86219/86219 co-relation queries the response was YES. Maximal size of possible extension queue 266. Compared 23727 event pairs, 238 based on Foata normal form. 21/3401 useless extension candidates. Maximal degree in co-relation 33630. Up to 1064 conditions per place. [2025-04-13 21:07:31,643 INFO L140 encePairwiseOnDemand]: 13/19 looper letters, 382 selfloop transitions, 349 changer transitions 0/731 dead transitions. [2025-04-13 21:07:31,643 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 427 places, 731 transitions, 17984 flow [2025-04-13 21:07:31,643 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-13 21:07:31,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-04-13 21:07:31,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 155 transitions. [2025-04-13 21:07:31,644 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4293628808864266 [2025-04-13 21:07:31,644 INFO L175 Difference]: Start difference. First operand has 410 places, 673 transitions, 16199 flow. Second operand 19 states and 155 transitions. [2025-04-13 21:07:31,644 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 427 places, 731 transitions, 17984 flow [2025-04-13 21:07:32,239 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 417 places, 731 transitions, 17356 flow, removed 92 selfloop flow, removed 10 redundant places. [2025-04-13 21:07:32,260 INFO L231 Difference]: Finished difference. Result has 419 places, 666 transitions, 16046 flow [2025-04-13 21:07:32,261 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=15212, PETRI_DIFFERENCE_MINUEND_PLACES=399, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=661, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=344, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=315, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=16046, PETRI_PLACES=419, PETRI_TRANSITIONS=666} [2025-04-13 21:07:32,261 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 399 predicate places. [2025-04-13 21:07:32,261 INFO L485 AbstractCegarLoop]: Abstraction has has 419 places, 666 transitions, 16046 flow [2025-04-13 21:07:32,261 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.764705882352941) internal successors, (64), 17 states have internal predecessors, (64), 0 states have call successors, (0), 0 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:07:32,262 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:07:32,262 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:07:32,268 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2025-04-13 21:07:32,462 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:07:32,462 INFO L403 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:07:32,463 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:07:32,463 INFO L85 PathProgramCache]: Analyzing trace with hash 230053218, now seen corresponding path program 16 times [2025-04-13 21:07:32,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:07:32,463 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561164013] [2025-04-13 21:07:32,463 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 21:07:32,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:07:32,468 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 18 statements into 2 equivalence classes. [2025-04-13 21:07:32,476 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 21:07:32,476 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 21:07:32,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:07:32,603 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:07:32,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:07:32,603 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561164013] [2025-04-13 21:07:32,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561164013] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:07:32,603 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2642613] [2025-04-13 21:07:32,603 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 21:07:32,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:07:32,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:07:32,605 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 21:07:32,607 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2025-04-13 21:07:32,663 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 18 statements into 2 equivalence classes. [2025-04-13 21:07:32,696 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 21:07:32,696 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 21:07:32,696 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:07:32,697 INFO L256 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-13 21:07:32,698 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:07:32,718 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 21:07:32,718 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:07:32,797 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 21:07:32,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2642613] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 21:07:32,798 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 21:07:32,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 14 [2025-04-13 21:07:32,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222115733] [2025-04-13 21:07:32,798 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 21:07:32,798 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 21:07:32,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:07:32,798 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 21:07:32,798 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2025-04-13 21:07:32,799 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2025-04-13 21:07:32,799 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 419 places, 666 transitions, 16046 flow. Second operand has 14 states, 14 states have (on average 3.9285714285714284) internal successors, (55), 14 states have internal predecessors, (55), 0 states have call successors, (0), 0 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:07:32,799 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:07:32,799 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2025-04-13 21:07:32,799 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:07:50,245 INFO L116 PetriNetUnfolderBase]: 1725/3360 cut-off events. [2025-04-13 21:07:50,245 INFO L117 PetriNetUnfolderBase]: For 84215/84215 co-relation queries the response was YES. [2025-04-13 21:07:50,266 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33788 conditions, 3360 events. 1725/3360 cut-off events. For 84215/84215 co-relation queries the response was YES. Maximal size of possible extension queue 262. Compared 23446 event pairs, 134 based on Foata normal form. 2/3362 useless extension candidates. Maximal degree in co-relation 33623. Up to 822 conditions per place. [2025-04-13 21:07:50,278 INFO L140 encePairwiseOnDemand]: 13/19 looper letters, 551 selfloop transitions, 321 changer transitions 3/875 dead transitions. [2025-04-13 21:07:50,278 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 440 places, 875 transitions, 21975 flow [2025-04-13 21:07:50,279 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-13 21:07:50,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2025-04-13 21:07:50,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 189 transitions. [2025-04-13 21:07:50,279 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.43249427917620137 [2025-04-13 21:07:50,279 INFO L175 Difference]: Start difference. First operand has 419 places, 666 transitions, 16046 flow. Second operand 23 states and 189 transitions. [2025-04-13 21:07:50,279 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 440 places, 875 transitions, 21975 flow [2025-04-13 21:07:50,932 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 427 places, 875 transitions, 21392 flow, removed 31 selfloop flow, removed 13 redundant places. [2025-04-13 21:07:50,944 INFO L231 Difference]: Finished difference. Result has 427 places, 681 transitions, 16526 flow [2025-04-13 21:07:50,944 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=15505, PETRI_DIFFERENCE_MINUEND_PLACES=405, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=663, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=301, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=362, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=16526, PETRI_PLACES=427, PETRI_TRANSITIONS=681} [2025-04-13 21:07:50,944 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 407 predicate places. [2025-04-13 21:07:50,945 INFO L485 AbstractCegarLoop]: Abstraction has has 427 places, 681 transitions, 16526 flow [2025-04-13 21:07:50,945 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.9285714285714284) internal successors, (55), 14 states have internal predecessors, (55), 0 states have call successors, (0), 0 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:07:50,945 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:07:50,945 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:07:50,951 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Ended with exit code 0 [2025-04-13 21:07:51,145 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2025-04-13 21:07:51,146 INFO L403 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:07:51,146 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:07:51,146 INFO L85 PathProgramCache]: Analyzing trace with hash 25371814, now seen corresponding path program 17 times [2025-04-13 21:07:51,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:07:51,146 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184907548] [2025-04-13 21:07:51,146 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 21:07:51,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:07:51,154 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-04-13 21:07:51,159 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 21:07:51,159 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 21:07:51,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:07:51,250 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 21:07:51,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:07:51,250 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184907548] [2025-04-13 21:07:51,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184907548] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:07:51,250 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1393039827] [2025-04-13 21:07:51,250 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 21:07:51,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:07:51,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:07:51,252 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 21:07:51,253 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2025-04-13 21:07:51,307 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-04-13 21:07:51,351 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 21:07:51,351 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 21:07:51,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:07:51,352 INFO L256 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-04-13 21:07:51,353 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:07:51,423 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 21:07:51,423 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:07:51,492 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 21:07:51,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1393039827] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 21:07:51,492 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 21:07:51,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 14 [2025-04-13 21:07:51,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679773911] [2025-04-13 21:07:51,492 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 21:07:51,492 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 21:07:51,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:07:51,493 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 21:07:51,493 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2025-04-13 21:07:51,493 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2025-04-13 21:07:51,493 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 427 places, 681 transitions, 16526 flow. Second operand has 14 states, 14 states have (on average 4.0) internal successors, (56), 14 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:07:51,493 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:07:51,493 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2025-04-13 21:07:51,493 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:07:52,715 INFO L116 PetriNetUnfolderBase]: 1741/3383 cut-off events. [2025-04-13 21:07:52,715 INFO L117 PetriNetUnfolderBase]: For 84538/84538 co-relation queries the response was YES. [2025-04-13 21:07:52,741 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34290 conditions, 3383 events. 1741/3383 cut-off events. For 84538/84538 co-relation queries the response was YES. Maximal size of possible extension queue 265. Compared 23603 event pairs, 124 based on Foata normal form. 4/3387 useless extension candidates. Maximal degree in co-relation 34126. Up to 896 conditions per place. [2025-04-13 21:07:52,756 INFO L140 encePairwiseOnDemand]: 13/19 looper letters, 463 selfloop transitions, 290 changer transitions 12/765 dead transitions. [2025-04-13 21:07:52,756 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 439 places, 765 transitions, 19313 flow [2025-04-13 21:07:52,757 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 21:07:52,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-04-13 21:07:52,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 126 transitions. [2025-04-13 21:07:52,757 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4144736842105263 [2025-04-13 21:07:52,758 INFO L175 Difference]: Start difference. First operand has 427 places, 681 transitions, 16526 flow. Second operand 16 states and 126 transitions. [2025-04-13 21:07:52,758 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 439 places, 765 transitions, 19313 flow [2025-04-13 21:07:53,441 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 424 places, 765 transitions, 18180 flow, removed 224 selfloop flow, removed 15 redundant places. [2025-04-13 21:07:53,452 INFO L231 Difference]: Finished difference. Result has 428 places, 688 transitions, 16307 flow [2025-04-13 21:07:53,453 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=15412, PETRI_DIFFERENCE_MINUEND_PLACES=409, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=679, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=275, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=397, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=16307, PETRI_PLACES=428, PETRI_TRANSITIONS=688} [2025-04-13 21:07:53,454 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 408 predicate places. [2025-04-13 21:07:53,454 INFO L485 AbstractCegarLoop]: Abstraction has has 428 places, 688 transitions, 16307 flow [2025-04-13 21:07:53,454 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.0) internal successors, (56), 14 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:07:53,454 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:07:53,454 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:07:53,460 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Ended with exit code 0 [2025-04-13 21:07:53,654 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2025-04-13 21:07:53,655 INFO L403 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:07:53,655 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:07:53,655 INFO L85 PathProgramCache]: Analyzing trace with hash -802103002, now seen corresponding path program 4 times [2025-04-13 21:07:53,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:07:53,655 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707662685] [2025-04-13 21:07:53,655 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 21:07:53,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:07:53,660 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 18 statements into 2 equivalence classes. [2025-04-13 21:07:53,665 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 21:07:53,665 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 21:07:53,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:07:53,834 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:07:53,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:07:53,834 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707662685] [2025-04-13 21:07:53,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707662685] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:07:53,834 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2048750523] [2025-04-13 21:07:53,834 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 21:07:53,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:07:53,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:07:53,837 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 21:07:53,838 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2025-04-13 21:07:53,890 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 18 statements into 2 equivalence classes. [2025-04-13 21:07:53,949 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 21:07:53,949 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 21:07:53,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:07:53,950 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-04-13 21:07:53,951 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:07:54,057 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:07:54,057 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:07:54,277 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:07:54,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2048750523] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 21:07:54,277 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 21:07:54,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 18 [2025-04-13 21:07:54,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811185419] [2025-04-13 21:07:54,277 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 21:07:54,278 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-13 21:07:54,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:07:54,278 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-13 21:07:54,278 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2025-04-13 21:07:54,278 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2025-04-13 21:07:54,278 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 428 places, 688 transitions, 16307 flow. Second operand has 18 states, 18 states have (on average 3.611111111111111) internal successors, (65), 18 states have internal predecessors, (65), 0 states have call successors, (0), 0 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:07:54,278 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:07:54,278 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2025-04-13 21:07:54,278 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:08:01,583 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-13 21:08:02,766 INFO L116 PetriNetUnfolderBase]: 1908/3691 cut-off events. [2025-04-13 21:08:02,766 INFO L117 PetriNetUnfolderBase]: For 87208/87208 co-relation queries the response was YES. [2025-04-13 21:08:02,787 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35989 conditions, 3691 events. 1908/3691 cut-off events. For 87208/87208 co-relation queries the response was YES. Maximal size of possible extension queue 295. Compared 26191 event pairs, 161 based on Foata normal form. 20/3711 useless extension candidates. Maximal degree in co-relation 35832. Up to 998 conditions per place. [2025-04-13 21:08:02,798 INFO L140 encePairwiseOnDemand]: 12/19 looper letters, 453 selfloop transitions, 486 changer transitions 0/939 dead transitions. [2025-04-13 21:08:02,798 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 460 places, 939 transitions, 22413 flow [2025-04-13 21:08:02,799 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2025-04-13 21:08:02,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2025-04-13 21:08:02,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 308 transitions. [2025-04-13 21:08:02,799 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4156545209176788 [2025-04-13 21:08:02,799 INFO L175 Difference]: Start difference. First operand has 428 places, 688 transitions, 16307 flow. Second operand 39 states and 308 transitions. [2025-04-13 21:08:02,799 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 460 places, 939 transitions, 22413 flow [2025-04-13 21:08:03,370 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 451 places, 939 transitions, 21953 flow, removed 45 selfloop flow, removed 9 redundant places. [2025-04-13 21:08:03,383 INFO L231 Difference]: Finished difference. Result has 462 places, 787 transitions, 19743 flow [2025-04-13 21:08:03,384 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=15913, PETRI_DIFFERENCE_MINUEND_PLACES=413, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=688, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=395, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=280, PETRI_DIFFERENCE_SUBTRAHEND_STATES=39, PETRI_FLOW=19743, PETRI_PLACES=462, PETRI_TRANSITIONS=787} [2025-04-13 21:08:03,384 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 442 predicate places. [2025-04-13 21:08:03,384 INFO L485 AbstractCegarLoop]: Abstraction has has 462 places, 787 transitions, 19743 flow [2025-04-13 21:08:03,384 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.611111111111111) internal successors, (65), 18 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:08:03,385 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:08:03,385 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:08:03,391 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Ended with exit code 0 [2025-04-13 21:08:03,585 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2025-04-13 21:08:03,585 INFO L403 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:08:03,586 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:08:03,586 INFO L85 PathProgramCache]: Analyzing trace with hash -138585784, now seen corresponding path program 5 times [2025-04-13 21:08:03,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:08:03,586 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230470613] [2025-04-13 21:08:03,586 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 21:08:03,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:08:03,590 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-04-13 21:08:03,596 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 21:08:03,596 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 21:08:03,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:08:03,713 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:08:03,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:08:03,714 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230470613] [2025-04-13 21:08:03,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230470613] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:08:03,714 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1282815240] [2025-04-13 21:08:03,714 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 21:08:03,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:08:03,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:08:03,716 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 21:08:03,716 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2025-04-13 21:08:03,831 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-04-13 21:08:03,926 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 21:08:03,926 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 21:08:03,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:08:03,927 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 51 conjuncts are in the unsatisfiable core [2025-04-13 21:08:03,929 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:08:03,992 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:08:04,403 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:08:04,403 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:08:32,332 WARN L286 SmtUtils]: Spent 6.68s on a formula simplification. DAG size of input: 116 DAG size of output: 114 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 21:08:41,418 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:08:41,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1282815240] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 21:08:41,418 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 21:08:41,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11, 8] total 25 [2025-04-13 21:08:41,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907736798] [2025-04-13 21:08:41,418 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 21:08:41,419 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-04-13 21:08:41,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:08:41,419 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-04-13 21:08:41,419 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=496, Unknown=0, NotChecked=0, Total=600 [2025-04-13 21:08:41,419 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2025-04-13 21:08:41,419 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 462 places, 787 transitions, 19743 flow. Second operand has 25 states, 25 states have (on average 3.72) internal successors, (93), 25 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:08:41,419 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:08:41,419 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2025-04-13 21:08:41,419 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:09:02,485 WARN L286 SmtUtils]: Spent 20.37s on a formula simplification that was a NOOP. DAG size: 140 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 21:09:05,444 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.65s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-13 21:09:07,675 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-13 21:09:21,607 WARN L286 SmtUtils]: Spent 6.89s on a formula simplification. DAG size of input: 129 DAG size of output: 106 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 21:09:48,936 WARN L286 SmtUtils]: Spent 23.06s on a formula simplification that was a NOOP. DAG size: 173 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 21:10:09,027 WARN L286 SmtUtils]: Spent 19.85s on a formula simplification that was a NOOP. DAG size: 222 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 21:10:12,560 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.90s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-13 21:10:16,157 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.60s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-13 21:10:17,390 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-13 21:11:04,533 WARN L286 SmtUtils]: Spent 46.31s on a formula simplification that was a NOOP. DAG size: 222 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 21:11:06,880 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.32s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-13 21:11:11,585 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-13 21:11:19,985 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-13 21:11:23,202 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.22s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-13 21:11:27,208 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-13 21:11:31,210 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-13 21:11:33,084 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.87s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-13 21:11:37,086 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-13 21:11:39,756 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.67s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-13 21:11:43,773 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-13 21:11:46,481 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.70s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-13 21:12:23,030 WARN L286 SmtUtils]: Spent 32.17s on a formula simplification that was a NOOP. DAG size: 199 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 21:12:24,978 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-13 21:12:29,946 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-13 21:12:35,765 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.96s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-13 21:12:57,656 WARN L286 SmtUtils]: Spent 16.59s on a formula simplification that was a NOOP. DAG size: 199 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 21:13:07,655 WARN L286 SmtUtils]: Spent 6.47s on a formula simplification that was a NOOP. DAG size: 169 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 21:13:14,605 WARN L286 SmtUtils]: Spent 6.00s on a formula simplification. DAG size of input: 204 DAG size of output: 172 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 21:13:21,372 INFO L116 PetriNetUnfolderBase]: 2143/4110 cut-off events. [2025-04-13 21:13:21,372 INFO L117 PetriNetUnfolderBase]: For 109612/109612 co-relation queries the response was YES. [2025-04-13 21:13:21,393 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42292 conditions, 4110 events. 2143/4110 cut-off events. For 109612/109612 co-relation queries the response was YES. Maximal size of possible extension queue 345. Compared 29591 event pairs, 45 based on Foata normal form. 12/4122 useless extension candidates. Maximal degree in co-relation 42129. Up to 1908 conditions per place. [2025-04-13 21:13:21,403 INFO L140 encePairwiseOnDemand]: 8/19 looper letters, 499 selfloop transitions, 521 changer transitions 13/1033 dead transitions. [2025-04-13 21:13:21,403 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 518 places, 1033 transitions, 25574 flow [2025-04-13 21:13:21,404 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2025-04-13 21:13:21,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2025-04-13 21:13:21,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 393 transitions. [2025-04-13 21:13:21,405 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3628808864265928 [2025-04-13 21:13:21,405 INFO L175 Difference]: Start difference. First operand has 462 places, 787 transitions, 19743 flow. Second operand 57 states and 393 transitions. [2025-04-13 21:13:21,405 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 518 places, 1033 transitions, 25574 flow [2025-04-13 21:13:22,109 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 507 places, 1033 transitions, 24669 flow, removed 343 selfloop flow, removed 11 redundant places. [2025-04-13 21:13:22,123 INFO L231 Difference]: Finished difference. Result has 518 places, 892 transitions, 23554 flow [2025-04-13 21:13:22,123 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=18972, PETRI_DIFFERENCE_MINUEND_PLACES=451, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=787, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=424, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=318, PETRI_DIFFERENCE_SUBTRAHEND_STATES=57, PETRI_FLOW=23554, PETRI_PLACES=518, PETRI_TRANSITIONS=892} [2025-04-13 21:13:22,124 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 498 predicate places. [2025-04-13 21:13:22,124 INFO L485 AbstractCegarLoop]: Abstraction has has 518 places, 892 transitions, 23554 flow [2025-04-13 21:13:22,124 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 3.72) internal successors, (93), 25 states have internal predecessors, (93), 0 states have call successors, (0), 0 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:13:22,124 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:13:22,124 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:13:22,130 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Ended with exit code 0 [2025-04-13 21:13:22,324 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2025-04-13 21:13:22,325 INFO L403 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:13:22,325 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:13:22,325 INFO L85 PathProgramCache]: Analyzing trace with hash -840888542, now seen corresponding path program 6 times [2025-04-13 21:13:22,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:13:22,325 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428472893] [2025-04-13 21:13:22,325 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 21:13:22,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:13:22,330 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 18 statements into 2 equivalence classes. [2025-04-13 21:13:22,338 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 21:13:22,338 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 21:13:22,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:13:22,464 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:13:22,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:13:22,464 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428472893] [2025-04-13 21:13:22,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428472893] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:13:22,464 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [347334325] [2025-04-13 21:13:22,464 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 21:13:22,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:13:22,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:13:22,466 INFO L229 MonitoredProcess]: Starting monitored process 35 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:13:22,468 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2025-04-13 21:13:22,543 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 18 statements into 2 equivalence classes. [2025-04-13 21:13:22,599 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 21:13:22,599 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 21:13:22,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:13:22,600 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-04-13 21:13:22,600 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:13:22,644 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:13:22,644 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:13:22,767 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:13:22,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [347334325] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 21:13:22,767 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 21:13:22,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 18 [2025-04-13 21:13:22,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611033423] [2025-04-13 21:13:22,767 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 21:13:22,768 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-13 21:13:22,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:13:22,768 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-13 21:13:22,768 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=231, Unknown=0, NotChecked=0, Total=306 [2025-04-13 21:13:22,768 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2025-04-13 21:13:22,768 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 518 places, 892 transitions, 23554 flow. Second operand has 18 states, 18 states have (on average 3.611111111111111) internal successors, (65), 18 states have internal predecessors, (65), 0 states have call successors, (0), 0 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:13:22,768 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:13:22,768 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2025-04-13 21:13:22,768 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:13:26,576 INFO L116 PetriNetUnfolderBase]: 2204/4194 cut-off events. [2025-04-13 21:13:26,577 INFO L117 PetriNetUnfolderBase]: For 125295/125295 co-relation queries the response was YES. [2025-04-13 21:13:26,607 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44681 conditions, 4194 events. 2204/4194 cut-off events. For 125295/125295 co-relation queries the response was YES. Maximal size of possible extension queue 366. Compared 30078 event pairs, 406 based on Foata normal form. 4/4198 useless extension candidates. Maximal degree in co-relation 44507. Up to 1978 conditions per place. [2025-04-13 21:13:26,627 INFO L140 encePairwiseOnDemand]: 13/19 looper letters, 780 selfloop transitions, 232 changer transitions 0/1012 dead transitions. [2025-04-13 21:13:26,627 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 540 places, 1012 transitions, 27705 flow [2025-04-13 21:13:26,627 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-13 21:13:26,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2025-04-13 21:13:26,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 160 transitions. [2025-04-13 21:13:26,628 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3508771929824561 [2025-04-13 21:13:26,628 INFO L175 Difference]: Start difference. First operand has 518 places, 892 transitions, 23554 flow. Second operand 24 states and 160 transitions. [2025-04-13 21:13:26,628 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 540 places, 1012 transitions, 27705 flow [2025-04-13 21:13:27,766 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 518 places, 1012 transitions, 26799 flow, removed 345 selfloop flow, removed 22 redundant places. [2025-04-13 21:13:27,780 INFO L231 Difference]: Finished difference. Result has 521 places, 917 transitions, 24034 flow [2025-04-13 21:13:27,781 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=22703, PETRI_DIFFERENCE_MINUEND_PLACES=495, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=891, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=206, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=661, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=24034, PETRI_PLACES=521, PETRI_TRANSITIONS=917} [2025-04-13 21:13:27,781 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 501 predicate places. [2025-04-13 21:13:27,781 INFO L485 AbstractCegarLoop]: Abstraction has has 521 places, 917 transitions, 24034 flow [2025-04-13 21:13:27,781 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.611111111111111) internal successors, (65), 18 states have internal predecessors, (65), 0 states have call successors, (0), 0 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:13:27,781 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:13:27,781 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:13:27,787 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Ended with exit code 0 [2025-04-13 21:13:27,982 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:13:27,982 INFO L403 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:13:27,983 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:13:27,983 INFO L85 PathProgramCache]: Analyzing trace with hash 2117107472, now seen corresponding path program 18 times [2025-04-13 21:13:27,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:13:27,983 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325940092] [2025-04-13 21:13:27,983 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 21:13:27,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:13:27,987 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 18 statements into 2 equivalence classes. [2025-04-13 21:13:27,994 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 21:13:27,994 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 21:13:27,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:13:28,083 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:13:28,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:13:28,083 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325940092] [2025-04-13 21:13:28,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325940092] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:13:28,083 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [873667281] [2025-04-13 21:13:28,083 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 21:13:28,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:13:28,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:13:28,085 INFO L229 MonitoredProcess]: Starting monitored process 36 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:13:28,086 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2025-04-13 21:13:28,140 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 18 statements into 2 equivalence classes. [2025-04-13 21:13:28,194 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 21:13:28,195 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 21:13:28,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:13:28,195 INFO L256 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-13 21:13:28,196 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:13:28,278 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:13:28,278 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:13:28,383 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 21:13:28,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [873667281] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 21:13:28,383 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 21:13:28,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 14 [2025-04-13 21:13:28,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279647975] [2025-04-13 21:13:28,383 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 21:13:28,384 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 21:13:28,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:13:28,384 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 21:13:28,384 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2025-04-13 21:13:28,384 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2025-04-13 21:13:28,384 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 521 places, 917 transitions, 24034 flow. Second operand has 14 states, 14 states have (on average 4.357142857142857) internal successors, (61), 14 states have internal predecessors, (61), 0 states have call successors, (0), 0 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:13:28,384 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:13:28,384 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2025-04-13 21:13:28,384 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:13:33,233 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-13 21:13:34,330 INFO L116 PetriNetUnfolderBase]: 2249/4304 cut-off events. [2025-04-13 21:13:34,330 INFO L117 PetriNetUnfolderBase]: For 134439/134439 co-relation queries the response was YES. [2025-04-13 21:13:34,356 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45533 conditions, 4304 events. 2249/4304 cut-off events. For 134439/134439 co-relation queries the response was YES. Maximal size of possible extension queue 374. Compared 31329 event pairs, 394 based on Foata normal form. 20/4324 useless extension candidates. Maximal degree in co-relation 45347. Up to 2436 conditions per place. [2025-04-13 21:13:34,371 INFO L140 encePairwiseOnDemand]: 12/19 looper letters, 602 selfloop transitions, 392 changer transitions 0/994 dead transitions. [2025-04-13 21:13:34,371 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 537 places, 994 transitions, 26907 flow [2025-04-13 21:13:34,371 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-13 21:13:34,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-04-13 21:13:34,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 135 transitions. [2025-04-13 21:13:34,372 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4179566563467492 [2025-04-13 21:13:34,372 INFO L175 Difference]: Start difference. First operand has 521 places, 917 transitions, 24034 flow. Second operand 17 states and 135 transitions. [2025-04-13 21:13:34,372 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 537 places, 994 transitions, 26907 flow [2025-04-13 21:13:35,474 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 516 places, 994 transitions, 26574 flow, removed 37 selfloop flow, removed 21 redundant places. [2025-04-13 21:13:35,488 INFO L231 Difference]: Finished difference. Result has 521 places, 944 transitions, 25596 flow [2025-04-13 21:13:35,489 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=23560, PETRI_DIFFERENCE_MINUEND_PLACES=500, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=912, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=361, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=540, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=25596, PETRI_PLACES=521, PETRI_TRANSITIONS=944} [2025-04-13 21:13:35,489 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 501 predicate places. [2025-04-13 21:13:35,489 INFO L485 AbstractCegarLoop]: Abstraction has has 521 places, 944 transitions, 25596 flow [2025-04-13 21:13:35,489 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.357142857142857) internal successors, (61), 14 states have internal predecessors, (61), 0 states have call successors, (0), 0 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:13:35,489 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:13:35,490 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:13:35,496 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2025-04-13 21:13:35,690 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable41 [2025-04-13 21:13:35,690 INFO L403 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:13:35,690 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:13:35,691 INFO L85 PathProgramCache]: Analyzing trace with hash -646622142, now seen corresponding path program 7 times [2025-04-13 21:13:35,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:13:35,691 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387058384] [2025-04-13 21:13:35,691 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 21:13:35,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:13:35,696 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-13 21:13:35,703 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 21:13:35,703 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:13:35,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:13:35,825 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 21:13:35,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:13:35,825 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387058384] [2025-04-13 21:13:35,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387058384] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:13:35,825 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1870481308] [2025-04-13 21:13:35,825 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 21:13:35,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:13:35,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:13:35,827 INFO L229 MonitoredProcess]: Starting monitored process 37 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:13:35,828 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2025-04-13 21:13:35,882 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-13 21:13:35,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 21:13:35,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:13:35,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:13:35,925 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-04-13 21:13:35,925 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:13:35,997 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 21:13:35,998 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:13:36,198 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 21:13:36,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1870481308] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 21:13:36,198 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 21:13:36,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17 [2025-04-13 21:13:36,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929921811] [2025-04-13 21:13:36,198 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 21:13:36,199 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-04-13 21:13:36,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:13:36,199 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-04-13 21:13:36,199 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2025-04-13 21:13:36,199 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2025-04-13 21:13:36,199 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 521 places, 944 transitions, 25596 flow. Second operand has 17 states, 17 states have (on average 3.764705882352941) internal successors, (64), 17 states have internal predecessors, (64), 0 states have call successors, (0), 0 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:13:36,199 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:13:36,199 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2025-04-13 21:13:36,199 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:13:40,630 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.37s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-13 21:13:54,068 WARN L286 SmtUtils]: Spent 8.04s on a formula simplification. DAG size of input: 38 DAG size of output: 38 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 21:13:56,306 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.96s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-13 21:13:58,213 INFO L116 PetriNetUnfolderBase]: 2418/4615 cut-off events. [2025-04-13 21:13:58,213 INFO L117 PetriNetUnfolderBase]: For 158683/158683 co-relation queries the response was YES. [2025-04-13 21:13:58,242 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51013 conditions, 4615 events. 2418/4615 cut-off events. For 158683/158683 co-relation queries the response was YES. Maximal size of possible extension queue 406. Compared 34067 event pairs, 286 based on Foata normal form. 6/4621 useless extension candidates. Maximal degree in co-relation 50836. Up to 1722 conditions per place. [2025-04-13 21:13:58,258 INFO L140 encePairwiseOnDemand]: 12/19 looper letters, 532 selfloop transitions, 593 changer transitions 0/1125 dead transitions. [2025-04-13 21:13:58,258 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 556 places, 1125 transitions, 31075 flow [2025-04-13 21:13:58,259 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-04-13 21:13:58,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2025-04-13 21:13:58,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 277 transitions. [2025-04-13 21:13:58,259 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.40497076023391815 [2025-04-13 21:13:58,259 INFO L175 Difference]: Start difference. First operand has 521 places, 944 transitions, 25596 flow. Second operand 36 states and 277 transitions. [2025-04-13 21:13:58,259 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 556 places, 1125 transitions, 31075 flow [2025-04-13 21:13:59,564 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 551 places, 1125 transitions, 30967 flow, removed 21 selfloop flow, removed 5 redundant places. [2025-04-13 21:13:59,580 INFO L231 Difference]: Finished difference. Result has 564 places, 1035 transitions, 30030 flow [2025-04-13 21:13:59,581 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=25488, PETRI_DIFFERENCE_MINUEND_PLACES=516, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=944, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=509, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=394, PETRI_DIFFERENCE_SUBTRAHEND_STATES=36, PETRI_FLOW=30030, PETRI_PLACES=564, PETRI_TRANSITIONS=1035} [2025-04-13 21:13:59,581 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 544 predicate places. [2025-04-13 21:13:59,581 INFO L485 AbstractCegarLoop]: Abstraction has has 564 places, 1035 transitions, 30030 flow [2025-04-13 21:13:59,581 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.764705882352941) internal successors, (64), 17 states have internal predecessors, (64), 0 states have call successors, (0), 0 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:13:59,581 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:13:59,581 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:13:59,587 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Ended with exit code 0 [2025-04-13 21:13:59,782 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:13:59,782 INFO L403 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:13:59,782 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:13:59,783 INFO L85 PathProgramCache]: Analyzing trace with hash -1647500542, now seen corresponding path program 19 times [2025-04-13 21:13:59,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:13:59,783 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672571327] [2025-04-13 21:13:59,783 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 21:13:59,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:13:59,787 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-13 21:13:59,792 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 21:13:59,792 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:13:59,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:13:59,852 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 21:13:59,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:13:59,852 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672571327] [2025-04-13 21:13:59,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672571327] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:13:59,852 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1215971632] [2025-04-13 21:13:59,853 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 21:13:59,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:13:59,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:13:59,854 INFO L229 MonitoredProcess]: Starting monitored process 38 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:13:59,855 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2025-04-13 21:13:59,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-13 21:13:59,959 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 21:13:59,959 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:13:59,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:13:59,960 INFO L256 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-04-13 21:13:59,960 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:14:00,002 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 21:14:00,003 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:14:00,285 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 21:14:00,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1215971632] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 21:14:00,285 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 21:14:00,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 12 [2025-04-13 21:14:00,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149088054] [2025-04-13 21:14:00,285 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 21:14:00,285 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 21:14:00,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:14:00,286 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 21:14:00,286 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2025-04-13 21:14:00,286 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2025-04-13 21:14:00,286 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 564 places, 1035 transitions, 30030 flow. Second operand has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 12 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:14:00,286 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:14:00,286 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2025-04-13 21:14:00,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:14:04,634 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-13 21:14:08,696 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-13 21:14:12,711 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 21:14:16,727 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 21:14:20,736 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 21:14:24,754 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 21:14:28,781 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 21:14:32,816 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 21:14:36,894 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 21:14:38,565 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 21:14:39,680 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 21:14:42,000 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.23s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 21:14:46,647 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 21:14:50,662 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 21:14:54,800 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 21:14:56,151 INFO L116 PetriNetUnfolderBase]: 2416/4613 cut-off events. [2025-04-13 21:14:56,151 INFO L117 PetriNetUnfolderBase]: For 178470/178470 co-relation queries the response was YES. [2025-04-13 21:14:56,181 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53669 conditions, 4613 events. 2416/4613 cut-off events. For 178470/178470 co-relation queries the response was YES. Maximal size of possible extension queue 405. Compared 34017 event pairs, 483 based on Foata normal form. 2/4615 useless extension candidates. Maximal degree in co-relation 53470. Up to 2003 conditions per place. [2025-04-13 21:14:56,195 INFO L140 encePairwiseOnDemand]: 13/19 looper letters, 810 selfloop transitions, 282 changer transitions 7/1099 dead transitions. [2025-04-13 21:14:56,195 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 576 places, 1099 transitions, 33429 flow [2025-04-13 21:14:56,195 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-13 21:14:56,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-04-13 21:14:56,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 90 transitions. [2025-04-13 21:14:56,196 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3643724696356275 [2025-04-13 21:14:56,196 INFO L175 Difference]: Start difference. First operand has 564 places, 1035 transitions, 30030 flow. Second operand 13 states and 90 transitions. [2025-04-13 21:14:56,196 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 576 places, 1099 transitions, 33429 flow [2025-04-13 21:14:57,628 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 560 places, 1099 transitions, 32440 flow, removed 350 selfloop flow, removed 16 redundant places. [2025-04-13 21:14:57,644 INFO L231 Difference]: Finished difference. Result has 560 places, 1030 transitions, 29544 flow [2025-04-13 21:14:57,645 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=29104, PETRI_DIFFERENCE_MINUEND_PLACES=548, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1034, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=282, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=752, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=29544, PETRI_PLACES=560, PETRI_TRANSITIONS=1030} [2025-04-13 21:14:57,645 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 540 predicate places. [2025-04-13 21:14:57,645 INFO L485 AbstractCegarLoop]: Abstraction has has 560 places, 1030 transitions, 29544 flow [2025-04-13 21:14:57,645 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 12 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:14:57,645 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:14:57,645 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:14:57,651 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Forceful destruction successful, exit code 0 [2025-04-13 21:14:57,846 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:14:57,846 INFO L403 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:14:57,846 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:14:57,846 INFO L85 PathProgramCache]: Analyzing trace with hash 1284029896, now seen corresponding path program 20 times [2025-04-13 21:14:57,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:14:57,846 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490272552] [2025-04-13 21:14:57,846 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 21:14:57,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:14:57,851 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-04-13 21:14:57,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:14:57,858 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 21:14:57,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:14:58,069 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 21:14:58,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:14:58,070 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490272552] [2025-04-13 21:14:58,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490272552] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:14:58,070 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [7593410] [2025-04-13 21:14:58,070 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 21:14:58,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:14:58,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:14:58,071 INFO L229 MonitoredProcess]: Starting monitored process 39 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:14:58,072 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2025-04-13 21:14:58,130 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-04-13 21:14:58,171 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 21:14:58,171 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 21:14:58,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:14:58,171 INFO L256 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-13 21:14:58,172 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:14:58,215 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 21:14:58,215 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:14:58,314 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 21:14:58,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [7593410] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 21:14:58,315 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 21:14:58,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2025-04-13 21:14:58,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261587990] [2025-04-13 21:14:58,315 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 21:14:58,315 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 21:14:58,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:14:58,315 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 21:14:58,315 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2025-04-13 21:14:58,315 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2025-04-13 21:14:58,316 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 560 places, 1030 transitions, 29544 flow. Second operand has 15 states, 15 states have (on average 3.933333333333333) internal successors, (59), 15 states have internal predecessors, (59), 0 states have call successors, (0), 0 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:14:58,316 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:14:58,316 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2025-04-13 21:14:58,316 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:15:02,886 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-13 21:15:04,205 INFO L116 PetriNetUnfolderBase]: 2430/4663 cut-off events. [2025-04-13 21:15:04,205 INFO L117 PetriNetUnfolderBase]: For 171466/171466 co-relation queries the response was YES. [2025-04-13 21:15:04,235 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53415 conditions, 4663 events. 2430/4663 cut-off events. For 171466/171466 co-relation queries the response was YES. Maximal size of possible extension queue 410. Compared 34555 event pairs, 481 based on Foata normal form. 4/4667 useless extension candidates. Maximal degree in co-relation 53217. Up to 2262 conditions per place. [2025-04-13 21:15:04,253 INFO L140 encePairwiseOnDemand]: 13/19 looper letters, 826 selfloop transitions, 282 changer transitions 9/1117 dead transitions. [2025-04-13 21:15:04,253 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 570 places, 1117 transitions, 33277 flow [2025-04-13 21:15:04,253 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-13 21:15:04,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-04-13 21:15:04,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 111 transitions. [2025-04-13 21:15:04,254 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.34365325077399383 [2025-04-13 21:15:04,254 INFO L175 Difference]: Start difference. First operand has 560 places, 1030 transitions, 29544 flow. Second operand 17 states and 111 transitions. [2025-04-13 21:15:04,254 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 570 places, 1117 transitions, 33277 flow [2025-04-13 21:15:05,638 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 559 places, 1117 transitions, 32531 flow, removed 34 selfloop flow, removed 11 redundant places. [2025-04-13 21:15:05,654 INFO L231 Difference]: Finished difference. Result has 561 places, 1024 transitions, 29485 flow [2025-04-13 21:15:05,654 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=28802, PETRI_DIFFERENCE_MINUEND_PLACES=543, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1029, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=281, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=747, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=29485, PETRI_PLACES=561, PETRI_TRANSITIONS=1024} [2025-04-13 21:15:05,655 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 541 predicate places. [2025-04-13 21:15:05,655 INFO L485 AbstractCegarLoop]: Abstraction has has 561 places, 1024 transitions, 29485 flow [2025-04-13 21:15:05,655 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.933333333333333) internal successors, (59), 15 states have internal predecessors, (59), 0 states have call successors, (0), 0 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:15:05,655 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:15:05,655 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:15:05,661 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Ended with exit code 0 [2025-04-13 21:15:05,855 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable44 [2025-04-13 21:15:05,856 INFO L403 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:15:05,856 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:15:05,856 INFO L85 PathProgramCache]: Analyzing trace with hash -497273182, now seen corresponding path program 21 times [2025-04-13 21:15:05,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:15:05,856 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056614001] [2025-04-13 21:15:05,856 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 21:15:05,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:15:05,861 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 18 statements into 3 equivalence classes. [2025-04-13 21:15:05,869 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 21:15:05,869 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 21:15:05,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:15:05,981 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 21:15:05,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:15:05,981 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056614001] [2025-04-13 21:15:05,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056614001] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:15:05,981 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [679161109] [2025-04-13 21:15:05,981 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 21:15:05,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:15:05,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:15:05,983 INFO L229 MonitoredProcess]: Starting monitored process 40 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:15:05,985 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2025-04-13 21:15:06,043 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 18 statements into 3 equivalence classes. [2025-04-13 21:15:06,083 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 21:15:06,083 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 21:15:06,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:15:06,084 INFO L256 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 49 conjuncts are in the unsatisfiable core [2025-04-13 21:15:06,086 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:15:06,121 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:15:06,404 WARN L195 Elim1Store]: Array PQE input equivalent to false [2025-04-13 21:15:06,404 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:15:06,404 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:15:08,393 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 21:15:08,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [679161109] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 21:15:08,394 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 21:15:08,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 8] total 23 [2025-04-13 21:15:08,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146179019] [2025-04-13 21:15:08,394 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 21:15:08,394 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-13 21:15:08,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:15:08,394 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-13 21:15:08,394 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=389, Unknown=0, NotChecked=0, Total=506 [2025-04-13 21:15:08,395 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2025-04-13 21:15:08,395 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 561 places, 1024 transitions, 29485 flow. Second operand has 23 states, 23 states have (on average 3.782608695652174) internal successors, (87), 23 states have internal predecessors, (87), 0 states have call successors, (0), 0 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:15:08,395 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:15:08,395 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2025-04-13 21:15:08,395 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:15:17,940 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-13 21:15:25,758 WARN L286 SmtUtils]: Spent 5.03s on a formula simplification. DAG size of input: 137 DAG size of output: 124 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 21:15:32,159 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-13 21:15:33,865 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.71s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-13 21:15:40,667 WARN L286 SmtUtils]: Spent 6.42s on a formula simplification. DAG size of input: 149 DAG size of output: 133 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 21:15:43,570 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-13 21:15:46,725 INFO L116 PetriNetUnfolderBase]: 2519/4860 cut-off events. [2025-04-13 21:15:46,726 INFO L117 PetriNetUnfolderBase]: For 186778/186778 co-relation queries the response was YES. [2025-04-13 21:15:46,757 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55673 conditions, 4860 events. 2519/4860 cut-off events. For 186778/186778 co-relation queries the response was YES. Maximal size of possible extension queue 428. Compared 36561 event pairs, 64 based on Foata normal form. 35/4895 useless extension candidates. Maximal degree in co-relation 55530. Up to 2909 conditions per place. [2025-04-13 21:15:46,771 INFO L140 encePairwiseOnDemand]: 8/19 looper letters, 678 selfloop transitions, 494 changer transitions 14/1186 dead transitions. [2025-04-13 21:15:46,771 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 602 places, 1186 transitions, 33856 flow [2025-04-13 21:15:46,772 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2025-04-13 21:15:46,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2025-04-13 21:15:46,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 337 transitions. [2025-04-13 21:15:46,772 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3619763694951665 [2025-04-13 21:15:46,772 INFO L175 Difference]: Start difference. First operand has 561 places, 1024 transitions, 29485 flow. Second operand 49 states and 337 transitions. [2025-04-13 21:15:46,773 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 602 places, 1186 transitions, 33856 flow [2025-04-13 21:15:48,128 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 591 places, 1186 transitions, 33717 flow, removed 31 selfloop flow, removed 11 redundant places. [2025-04-13 21:15:48,146 INFO L231 Difference]: Finished difference. Result has 604 places, 1069 transitions, 32257 flow [2025-04-13 21:15:48,146 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=28796, PETRI_DIFFERENCE_MINUEND_PLACES=543, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1005, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=442, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=541, PETRI_DIFFERENCE_SUBTRAHEND_STATES=49, PETRI_FLOW=32257, PETRI_PLACES=604, PETRI_TRANSITIONS=1069} [2025-04-13 21:15:48,146 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 584 predicate places. [2025-04-13 21:15:48,146 INFO L485 AbstractCegarLoop]: Abstraction has has 604 places, 1069 transitions, 32257 flow [2025-04-13 21:15:48,147 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 3.782608695652174) internal successors, (87), 23 states have internal predecessors, (87), 0 states have call successors, (0), 0 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:15:48,147 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:15:48,147 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:15:48,153 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Forceful destruction successful, exit code 0 [2025-04-13 21:15:48,347 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2025-04-13 21:15:48,347 INFO L403 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:15:48,348 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:15:48,348 INFO L85 PathProgramCache]: Analyzing trace with hash 1694992480, now seen corresponding path program 12 times [2025-04-13 21:15:48,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:15:48,348 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617438053] [2025-04-13 21:15:48,348 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 21:15:48,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:15:48,352 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 18 statements into 2 equivalence classes. [2025-04-13 21:15:48,359 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 21:15:48,359 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 21:15:48,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:15:48,474 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:15:48,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:15:48,474 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617438053] [2025-04-13 21:15:48,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617438053] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:15:48,474 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [952869888] [2025-04-13 21:15:48,474 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 21:15:48,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:15:48,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:15:48,476 INFO L229 MonitoredProcess]: Starting monitored process 41 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:15:48,478 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2025-04-13 21:15:48,542 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 18 statements into 2 equivalence classes. [2025-04-13 21:15:48,632 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 21:15:48,632 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 21:15:48,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:15:48,633 INFO L256 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-04-13 21:15:48,633 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:15:48,681 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:15:48,681 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:15:48,793 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:15:48,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [952869888] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 21:15:48,794 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 21:15:48,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17 [2025-04-13 21:15:48,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629874272] [2025-04-13 21:15:48,794 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 21:15:48,794 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-04-13 21:15:48,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:15:48,794 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-04-13 21:15:48,794 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2025-04-13 21:15:48,794 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2025-04-13 21:15:48,795 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 604 places, 1069 transitions, 32257 flow. Second operand has 17 states, 17 states have (on average 3.764705882352941) internal successors, (64), 17 states have internal predecessors, (64), 0 states have call successors, (0), 0 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:15:48,795 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:15:48,795 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2025-04-13 21:15:48,795 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:15:54,065 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-13 21:15:56,313 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.74s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-13 21:15:59,317 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-13 21:16:02,717 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.96s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-13 21:16:06,830 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-13 21:16:09,137 INFO L116 PetriNetUnfolderBase]: 3012/5712 cut-off events. [2025-04-13 21:16:09,137 INFO L117 PetriNetUnfolderBase]: For 249969/249969 co-relation queries the response was YES. [2025-04-13 21:16:09,188 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69221 conditions, 5712 events. 3012/5712 cut-off events. For 249969/249969 co-relation queries the response was YES. Maximal size of possible extension queue 448. Compared 43137 event pairs, 65 based on Foata normal form. 21/5733 useless extension candidates. Maximal degree in co-relation 69065. Up to 1740 conditions per place. [2025-04-13 21:16:09,215 INFO L140 encePairwiseOnDemand]: 12/19 looper letters, 642 selfloop transitions, 743 changer transitions 0/1385 dead transitions. [2025-04-13 21:16:09,215 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 631 places, 1385 transitions, 43143 flow [2025-04-13 21:16:09,215 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-04-13 21:16:09,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2025-04-13 21:16:09,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 216 transitions. [2025-04-13 21:16:09,216 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.37894736842105264 [2025-04-13 21:16:09,216 INFO L175 Difference]: Start difference. First operand has 604 places, 1069 transitions, 32257 flow. Second operand 30 states and 216 transitions. [2025-04-13 21:16:09,216 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 631 places, 1385 transitions, 43143 flow [2025-04-13 21:16:11,152 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 595 places, 1385 transitions, 42190 flow, removed 237 selfloop flow, removed 36 redundant places. [2025-04-13 21:16:11,172 INFO L231 Difference]: Finished difference. Result has 600 places, 1221 transitions, 37976 flow [2025-04-13 21:16:11,172 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=31435, PETRI_DIFFERENCE_MINUEND_PLACES=566, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1068, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=634, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=413, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=37976, PETRI_PLACES=600, PETRI_TRANSITIONS=1221} [2025-04-13 21:16:11,173 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 580 predicate places. [2025-04-13 21:16:11,173 INFO L485 AbstractCegarLoop]: Abstraction has has 600 places, 1221 transitions, 37976 flow [2025-04-13 21:16:11,173 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.764705882352941) internal successors, (64), 17 states have internal predecessors, (64), 0 states have call successors, (0), 0 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:16:11,173 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:16:11,173 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:16:11,179 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Ended with exit code 0 [2025-04-13 21:16:11,373 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable46 [2025-04-13 21:16:11,373 INFO L403 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:16:11,374 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:16:11,374 INFO L85 PathProgramCache]: Analyzing trace with hash 1496503051, now seen corresponding path program 22 times [2025-04-13 21:16:11,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:16:11,374 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094321601] [2025-04-13 21:16:11,374 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 21:16:11,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:16:11,379 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 18 statements into 2 equivalence classes. [2025-04-13 21:16:11,386 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 21:16:11,386 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 21:16:11,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:16:11,817 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:16:11,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:16:11,817 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094321601] [2025-04-13 21:16:11,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094321601] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:16:11,817 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1519069297] [2025-04-13 21:16:11,817 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 21:16:11,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:16:11,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:16:11,819 INFO L229 MonitoredProcess]: Starting monitored process 42 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:16:11,820 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2025-04-13 21:16:11,879 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 18 statements into 2 equivalence classes. [2025-04-13 21:16:11,897 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 21:16:11,897 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 21:16:11,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:16:11,898 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-04-13 21:16:11,899 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:16:12,074 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 21:16:12,075 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 38 treesize of output 25 [2025-04-13 21:16:12,097 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 21:16:12,097 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:16:13,137 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 21:16:13,137 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 148 treesize of output 140 [2025-04-13 21:16:14,196 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 21:16:14,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1519069297] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 21:16:14,196 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 21:16:14,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 7] total 24 [2025-04-13 21:16:14,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089241052] [2025-04-13 21:16:14,196 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 21:16:14,197 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-04-13 21:16:14,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:16:14,197 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-04-13 21:16:14,197 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=515, Unknown=0, NotChecked=0, Total=650 [2025-04-13 21:16:14,197 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2025-04-13 21:16:14,197 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 600 places, 1221 transitions, 37976 flow. Second operand has 26 states, 26 states have (on average 3.769230769230769) internal successors, (98), 26 states have internal predecessors, (98), 0 states have call successors, (0), 0 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:16:14,197 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:16:14,197 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2025-04-13 21:16:14,197 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:16:18,607 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] Received shutdown request... [2025-04-13 21:16:21,534 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-04-13 21:16:21,542 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-04-13 21:16:22,540 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Ended with exit code 0 [2025-04-13 21:16:22,742 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2025-04-13 21:16:22,773 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 137 [2025-04-13 21:16:22,777 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2025-04-13 21:16:22,777 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2025-04-13 21:16:22,778 WARN L610 AbstractCegarLoop]: Verification canceled: while executing Executor. [2025-04-13 21:16:22,782 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2025-04-13 21:16:22,782 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2025-04-13 21:16:22,783 INFO L422 BasicCegarLoop]: Path program histogram: [22, 12, 7, 6, 1] [2025-04-13 21:16:22,790 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-13 21:16:22,790 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-13 21:16:22,794 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 09:16:22 BasicIcfg [2025-04-13 21:16:22,794 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-13 21:16:22,794 INFO L158 Benchmark]: Toolchain (without parser) took 860277.14ms. Allocated memory was 155.2MB in the beginning and 826.3MB in the end (delta: 671.1MB). Free memory was 110.0MB in the beginning and 142.0MB in the end (delta: -32.0MB). Peak memory consumption was 638.0MB. Max. memory is 8.0GB. [2025-04-13 21:16:22,794 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 167.8MB. Free memory is still 94.5MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 21:16:22,795 INFO L158 Benchmark]: CACSL2BoogieTranslator took 267.72ms. Allocated memory is still 155.2MB. Free memory was 109.2MB in the beginning and 94.1MB in the end (delta: 15.0MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-13 21:16:22,795 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.27ms. Allocated memory is still 155.2MB. Free memory was 94.1MB in the beginning and 92.5MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 21:16:22,795 INFO L158 Benchmark]: Boogie Preprocessor took 29.63ms. Allocated memory is still 155.2MB. Free memory was 92.5MB in the beginning and 90.0MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 21:16:22,795 INFO L158 Benchmark]: RCFGBuilder took 507.86ms. Allocated memory is still 155.2MB. Free memory was 90.0MB in the beginning and 34.7MB in the end (delta: 55.4MB). Peak memory consumption was 54.5MB. Max. memory is 8.0GB. [2025-04-13 21:16:22,795 INFO L158 Benchmark]: TraceAbstraction took 859435.49ms. Allocated memory was 155.2MB in the beginning and 826.3MB in the end (delta: 671.1MB). Free memory was 33.8MB in the beginning and 142.0MB in the end (delta: -108.2MB). Peak memory consumption was 566.7MB. Max. memory is 8.0GB. [2025-04-13 21:16:22,796 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22ms. Allocated memory is still 167.8MB. Free memory is still 94.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 267.72ms. Allocated memory is still 155.2MB. Free memory was 109.2MB in the beginning and 94.1MB in the end (delta: 15.0MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 32.27ms. Allocated memory is still 155.2MB. Free memory was 94.1MB in the beginning and 92.5MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 29.63ms. Allocated memory is still 155.2MB. Free memory was 92.5MB in the beginning and 90.0MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 507.86ms. Allocated memory is still 155.2MB. Free memory was 90.0MB in the beginning and 34.7MB in the end (delta: 55.4MB). Peak memory consumption was 54.5MB. Max. memory is 8.0GB. * TraceAbstraction took 859435.49ms. Allocated memory was 155.2MB in the beginning and 826.3MB in the end (delta: 671.1MB). Free memory was 33.8MB in the beginning and 142.0MB in the end (delta: -108.2MB). Peak memory consumption was 566.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 99]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while executing Executor. - TimeoutResultAtElement [Line: 94]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while executing Executor. - TimeoutResultAtElement [Line: 93]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 25 locations, 29 edges, 3 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 859.3s, OverallIterations: 48, TraceHistogramMax: 3, PathProgramHistogramMax: 22, EmptinessCheckTime: 0.0s, AutomataDifference: 735.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 33 mSolverCounterUnknown, 3960 SdHoareTripleChecker+Valid, 253.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3960 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 250.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 886 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 21226 IncrementalHoareTripleChecker+Invalid, 22146 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 886 mSolverCounterUnsat, 0 mSDtfsCounter, 21226 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2525 GetRequests, 1323 SyntacticMatches, 6 SemanticMatches, 1196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9466 ImplicationChecksByTransitivity, 457.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=37976occurred in iteration=47, InterpolantAutomatonStates: 959, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 2.2s SatisfiabilityAnalysisTime, 111.2s InterpolantComputationTime, 1469 NumberOfCodeBlocks, 1466 NumberOfCodeBlocksAsserted, 159 NumberOfCheckSat, 2025 ConstructedInterpolants, 13 QuantifiedInterpolants, 29026 SizeOfPredicates, 536 NumberOfNonLiveVariables, 6240 ConjunctsInSsa, 842 ConjunctsInUnsatCore, 130 InterpolantComputations, 7 PerfectInterpolantSequences, 309/633 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown