/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/chl-chromosome-subst.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 19:58:47,796 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 19:58:47,848 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 19:58:47,851 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 19:58:47,851 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 19:58:47,874 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 19:58:47,875 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 19:58:47,875 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 19:58:47,875 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 19:58:47,875 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 19:58:47,876 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 19:58:47,876 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 19:58:47,876 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 19:58:47,876 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 19:58:47,876 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 19:58:47,877 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 19:58:47,877 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 19:58:47,877 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 19:58:47,877 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 19:58:47,877 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 19:58:47,877 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 19:58:47,877 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 19:58:47,877 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 19:58:47,877 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 19:58:47,877 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 19:58:47,877 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 19:58:47,877 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 19:58:47,877 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 19:58:47,877 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 19:58:47,877 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 19:58:47,878 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 19:58:47,878 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 19:58:47,878 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 19:58:47,878 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 19:58:47,878 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 19:58:47,878 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 19:58:47,878 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 19:58:47,878 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 19:58:47,878 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 19:58:47,878 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 19:58:47,878 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 19:58:47,878 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 19:58:47,878 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 19:58:47,878 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 19:58:47,879 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 19:58:47,879 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 19:58:47,879 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 19:58:47,879 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 19:58:48,123 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 19:58:48,131 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 19:58:48,132 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 19:58:48,134 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 19:58:48,134 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 19:58:48,135 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/chl-chromosome-subst.wvr.c [2025-04-13 19:58:49,400 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e70441aa9/0d245cd2c8bf45058c5db95e888df3a6/FLAG17e80bb2c [2025-04-13 19:58:49,604 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 19:58:49,604 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-chromosome-subst.wvr.c [2025-04-13 19:58:49,610 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e70441aa9/0d245cd2c8bf45058c5db95e888df3a6/FLAG17e80bb2c [2025-04-13 19:58:50,449 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e70441aa9/0d245cd2c8bf45058c5db95e888df3a6 [2025-04-13 19:58:50,451 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 19:58:50,452 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 19:58:50,453 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 19:58:50,453 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 19:58:50,455 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 19:58:50,456 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 07:58:50" (1/1) ... [2025-04-13 19:58:50,456 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@bf4bb81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:58:50, skipping insertion in model container [2025-04-13 19:58:50,456 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 07:58:50" (1/1) ... [2025-04-13 19:58:50,469 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 19:58:50,652 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-chromosome-subst.wvr.c[3136,3149] [2025-04-13 19:58:50,665 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 19:58:50,675 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 19:58:50,700 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-chromosome-subst.wvr.c[3136,3149] [2025-04-13 19:58:50,703 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 19:58:50,712 INFO L204 MainTranslator]: Completed translation [2025-04-13 19:58:50,713 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:58:50 WrapperNode [2025-04-13 19:58:50,713 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 19:58:50,714 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 19:58:50,714 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 19:58:50,714 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 19:58:50,718 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:58:50" (1/1) ... [2025-04-13 19:58:50,729 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:58:50" (1/1) ... [2025-04-13 19:58:50,757 INFO L138 Inliner]: procedures = 25, calls = 32, calls flagged for inlining = 17, calls inlined = 25, statements flattened = 253 [2025-04-13 19:58:50,758 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 19:58:50,758 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 19:58:50,758 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 19:58:50,758 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 19:58:50,764 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:58:50" (1/1) ... [2025-04-13 19:58:50,765 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:58:50" (1/1) ... [2025-04-13 19:58:50,768 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:58:50" (1/1) ... [2025-04-13 19:58:50,790 INFO L175 MemorySlicer]: Split 11 memory accesses to 2 slices as follows [2, 9]. 82 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 3 writes are split as follows [0, 3]. [2025-04-13 19:58:50,790 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:58:50" (1/1) ... [2025-04-13 19:58:50,790 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:58:50" (1/1) ... [2025-04-13 19:58:50,804 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:58:50" (1/1) ... [2025-04-13 19:58:50,805 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:58:50" (1/1) ... [2025-04-13 19:58:50,810 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:58:50" (1/1) ... [2025-04-13 19:58:50,811 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:58:50" (1/1) ... [2025-04-13 19:58:50,812 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:58:50" (1/1) ... [2025-04-13 19:58:50,815 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 19:58:50,816 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-13 19:58:50,816 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-13 19:58:50,816 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-13 19:58:50,817 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:58:50" (1/1) ... [2025-04-13 19:58:50,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 19:58:50,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:58:50,853 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 19:58:50,858 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 19:58:50,874 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 19:58:50,874 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-13 19:58:50,874 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-13 19:58:50,874 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-13 19:58:50,874 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-13 19:58:50,874 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-13 19:58:50,874 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-13 19:58:50,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 19:58:50,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-13 19:58:50,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-13 19:58:50,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-13 19:58:50,874 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-13 19:58:50,874 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 19:58:50,874 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 19:58:50,874 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-13 19:58:50,874 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-13 19:58:50,875 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 19:58:50,974 INFO L234 CfgBuilder]: Building ICFG [2025-04-13 19:58:50,977 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 19:58:51,308 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 19:58:51,309 INFO L289 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 19:58:51,309 INFO L294 CfgBuilder]: Performing block encoding [2025-04-13 19:58:51,608 INFO L313 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 19:58:51,609 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 07:58:51 BoogieIcfgContainer [2025-04-13 19:58:51,609 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-13 19:58:51,610 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 19:58:51,610 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 19:58:51,613 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 19:58:51,614 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 07:58:50" (1/3) ... [2025-04-13 19:58:51,615 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bbd3e5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 07:58:51, skipping insertion in model container [2025-04-13 19:58:51,615 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:58:50" (2/3) ... [2025-04-13 19:58:51,615 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bbd3e5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 07:58:51, skipping insertion in model container [2025-04-13 19:58:51,615 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 07:58:51" (3/3) ... [2025-04-13 19:58:51,616 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-chromosome-subst.wvr.c [2025-04-13 19:58:51,626 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 19:58:51,627 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-chromosome-subst.wvr.c that has 4 procedures, 25 locations, 27 edges, 1 initial locations, 6 loop locations, and 1 error locations. [2025-04-13 19:58:51,627 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 19:58:51,670 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-13 19:58:51,690 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 30 transitions, 81 flow [2025-04-13 19:58:51,709 INFO L116 PetriNetUnfolderBase]: 6/27 cut-off events. [2025-04-13 19:58:51,710 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-13 19:58:51,712 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40 conditions, 27 events. 6/27 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 18 event pairs, 0 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 21. Up to 2 conditions per place. [2025-04-13 19:58:51,712 INFO L82 GeneralOperation]: Start removeDead. Operand has 34 places, 30 transitions, 81 flow [2025-04-13 19:58:51,713 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 30 places, 26 transitions, 70 flow [2025-04-13 19:58:51,719 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 19:58:51,730 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;@6b55577b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 19:58:51,730 INFO L341 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-04-13 19:58:51,740 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 19:58:51,740 INFO L116 PetriNetUnfolderBase]: 6/25 cut-off events. [2025-04-13 19:58:51,740 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-13 19:58:51,740 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:58:51,740 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:58:51,742 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 19:58:51,746 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:58:51,746 INFO L85 PathProgramCache]: Analyzing trace with hash 1749514172, now seen corresponding path program 1 times [2025-04-13 19:58:51,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:58:51,752 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329350952] [2025-04-13 19:58:51,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:58:51,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:58:51,808 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-13 19:58:51,841 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 19:58:51,842 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:58:51,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:58:52,130 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 19:58:52,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:58:52,130 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329350952] [2025-04-13 19:58:52,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329350952] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:58:52,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:58:52,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 19:58:52,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830764125] [2025-04-13 19:58:52,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:58:52,138 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 19:58:52,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:58:52,156 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 19:58:52,156 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 19:58:52,157 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2025-04-13 19:58:52,159 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 26 transitions, 70 flow. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:58:52,159 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:58:52,159 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2025-04-13 19:58:52,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:58:52,293 INFO L116 PetriNetUnfolderBase]: 202/301 cut-off events. [2025-04-13 19:58:52,294 INFO L117 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2025-04-13 19:58:52,296 INFO L83 FinitePrefix]: Finished finitePrefix Result has 646 conditions, 301 events. 202/301 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 694 event pairs, 124 based on Foata normal form. 0/223 useless extension candidates. Maximal degree in co-relation 534. Up to 299 conditions per place. [2025-04-13 19:58:52,299 INFO L140 encePairwiseOnDemand]: 23/30 looper letters, 23 selfloop transitions, 6 changer transitions 0/29 dead transitions. [2025-04-13 19:58:52,299 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 29 transitions, 134 flow [2025-04-13 19:58:52,300 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 19:58:52,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 19:58:52,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 41 transitions. [2025-04-13 19:58:52,309 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.45555555555555555 [2025-04-13 19:58:52,310 INFO L175 Difference]: Start difference. First operand has 30 places, 26 transitions, 70 flow. Second operand 3 states and 41 transitions. [2025-04-13 19:58:52,311 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 29 transitions, 134 flow [2025-04-13 19:58:52,315 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 29 transitions, 122 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-04-13 19:58:52,317 INFO L231 Difference]: Finished difference. Result has 27 places, 29 transitions, 90 flow [2025-04-13 19:58:52,319 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=90, PETRI_PLACES=27, PETRI_TRANSITIONS=29} [2025-04-13 19:58:52,322 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, -3 predicate places. [2025-04-13 19:58:52,323 INFO L485 AbstractCegarLoop]: Abstraction has has 27 places, 29 transitions, 90 flow [2025-04-13 19:58:52,323 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:58:52,323 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:58:52,323 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:58:52,323 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 19:58:52,323 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 19:58:52,324 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:58:52,324 INFO L85 PathProgramCache]: Analyzing trace with hash -1944104984, now seen corresponding path program 1 times [2025-04-13 19:58:52,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:58:52,324 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869725789] [2025-04-13 19:58:52,324 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:58:52,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:58:52,340 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-13 19:58:52,366 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 19:58:52,366 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:58:52,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:58:52,567 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 19:58:52,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:58:52,567 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869725789] [2025-04-13 19:58:52,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869725789] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:58:52,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:58:52,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 19:58:52,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543425312] [2025-04-13 19:58:52,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:58:52,569 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 19:58:52,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:58:52,569 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 19:58:52,569 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-13 19:58:52,570 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2025-04-13 19:58:52,570 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 29 transitions, 90 flow. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:58:52,570 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:58:52,570 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2025-04-13 19:58:52,570 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:58:52,699 INFO L116 PetriNetUnfolderBase]: 341/505 cut-off events. [2025-04-13 19:58:52,699 INFO L117 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-04-13 19:58:52,700 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1048 conditions, 505 events. 341/505 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1534 event pairs, 124 based on Foata normal form. 1/369 useless extension candidates. Maximal degree in co-relation 1017. Up to 302 conditions per place. [2025-04-13 19:58:52,705 INFO L140 encePairwiseOnDemand]: 27/30 looper letters, 39 selfloop transitions, 2 changer transitions 4/45 dead transitions. [2025-04-13 19:58:52,705 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 45 transitions, 217 flow [2025-04-13 19:58:52,705 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 19:58:52,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 19:58:52,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 52 transitions. [2025-04-13 19:58:52,706 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5777777777777777 [2025-04-13 19:58:52,706 INFO L175 Difference]: Start difference. First operand has 27 places, 29 transitions, 90 flow. Second operand 3 states and 52 transitions. [2025-04-13 19:58:52,706 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 45 transitions, 217 flow [2025-04-13 19:58:52,707 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 45 transitions, 211 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-13 19:58:52,708 INFO L231 Difference]: Finished difference. Result has 29 places, 30 transitions, 96 flow [2025-04-13 19:58:52,709 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=96, PETRI_PLACES=29, PETRI_TRANSITIONS=30} [2025-04-13 19:58:52,709 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, -1 predicate places. [2025-04-13 19:58:52,709 INFO L485 AbstractCegarLoop]: Abstraction has has 29 places, 30 transitions, 96 flow [2025-04-13 19:58:52,710 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:58:52,710 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:58:52,710 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:58:52,710 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 19:58:52,710 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 19:58:52,711 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:58:52,711 INFO L85 PathProgramCache]: Analyzing trace with hash 1464693783, now seen corresponding path program 1 times [2025-04-13 19:58:52,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:58:52,711 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353411612] [2025-04-13 19:58:52,711 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:58:52,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:58:52,726 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-13 19:58:52,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 19:58:52,740 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:58:52,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:58:52,870 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 19:58:52,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:58:52,871 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353411612] [2025-04-13 19:58:52,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353411612] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 19:58:52,871 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1280526280] [2025-04-13 19:58:52,871 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:58:52,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:58:52,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:58:52,873 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 19:58:52,875 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 19:58:52,938 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-13 19:58:52,984 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 19:58:52,984 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:58:52,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:58:52,986 INFO L256 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-13 19:58:52,990 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 19:58:53,034 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 19:58:53,034 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 19:58:53,059 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 19:58:53,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1280526280] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 19:58:53,059 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 19:58:53,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 8 [2025-04-13 19:58:53,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989136395] [2025-04-13 19:58:53,059 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 19:58:53,060 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 19:58:53,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:58:53,060 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 19:58:53,060 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2025-04-13 19:58:53,060 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2025-04-13 19:58:53,060 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 30 transitions, 96 flow. Second operand has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:58:53,061 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:58:53,061 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2025-04-13 19:58:53,061 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:58:53,179 INFO L116 PetriNetUnfolderBase]: 341/514 cut-off events. [2025-04-13 19:58:53,179 INFO L117 PetriNetUnfolderBase]: For 135/135 co-relation queries the response was YES. [2025-04-13 19:58:53,180 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1178 conditions, 514 events. 341/514 cut-off events. For 135/135 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1402 event pairs, 228 based on Foata normal form. 0/427 useless extension candidates. Maximal degree in co-relation 1116. Up to 503 conditions per place. [2025-04-13 19:58:53,181 INFO L140 encePairwiseOnDemand]: 23/30 looper letters, 24 selfloop transitions, 15 changer transitions 0/39 dead transitions. [2025-04-13 19:58:53,181 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 39 transitions, 210 flow [2025-04-13 19:58:53,181 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 19:58:53,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 19:58:53,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 65 transitions. [2025-04-13 19:58:53,182 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3611111111111111 [2025-04-13 19:58:53,182 INFO L175 Difference]: Start difference. First operand has 29 places, 30 transitions, 96 flow. Second operand 6 states and 65 transitions. [2025-04-13 19:58:53,182 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 39 transitions, 210 flow [2025-04-13 19:58:53,183 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 39 transitions, 208 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-13 19:58:53,183 INFO L231 Difference]: Finished difference. Result has 36 places, 39 transitions, 190 flow [2025-04-13 19:58:53,183 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=190, PETRI_PLACES=36, PETRI_TRANSITIONS=39} [2025-04-13 19:58:53,184 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 6 predicate places. [2025-04-13 19:58:53,184 INFO L485 AbstractCegarLoop]: Abstraction has has 36 places, 39 transitions, 190 flow [2025-04-13 19:58:53,184 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:58:53,184 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:58:53,184 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:58:53,191 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 19:58:53,388 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:58:53,388 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 19:58:53,388 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:58:53,388 INFO L85 PathProgramCache]: Analyzing trace with hash -17848501, now seen corresponding path program 2 times [2025-04-13 19:58:53,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:58:53,389 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448005512] [2025-04-13 19:58:53,389 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 19:58:53,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:58:53,404 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-04-13 19:58:53,428 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 20 of 33 statements. [2025-04-13 19:58:53,428 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 19:58:53,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:58:53,760 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-04-13 19:58:53,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:58:53,761 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448005512] [2025-04-13 19:58:53,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448005512] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:58:53,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:58:53,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 19:58:53,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892186922] [2025-04-13 19:58:53,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:58:53,761 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 19:58:53,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:58:53,762 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 19:58:53,762 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-13 19:58:53,762 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2025-04-13 19:58:53,762 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 39 transitions, 190 flow. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 0 states have call successors, (0), 0 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 19:58:53,762 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:58:53,762 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2025-04-13 19:58:53,762 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:58:54,051 INFO L116 PetriNetUnfolderBase]: 681/1009 cut-off events. [2025-04-13 19:58:54,052 INFO L117 PetriNetUnfolderBase]: For 181/181 co-relation queries the response was YES. [2025-04-13 19:58:54,053 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2258 conditions, 1009 events. 681/1009 cut-off events. For 181/181 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 3580 event pairs, 228 based on Foata normal form. 1/802 useless extension candidates. Maximal degree in co-relation 2169. Up to 539 conditions per place. [2025-04-13 19:58:54,058 INFO L140 encePairwiseOnDemand]: 25/30 looper letters, 61 selfloop transitions, 5 changer transitions 1/67 dead transitions. [2025-04-13 19:58:54,058 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 67 transitions, 401 flow [2025-04-13 19:58:54,058 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 19:58:54,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-13 19:58:54,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 65 transitions. [2025-04-13 19:58:54,059 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5416666666666666 [2025-04-13 19:58:54,059 INFO L175 Difference]: Start difference. First operand has 36 places, 39 transitions, 190 flow. Second operand 4 states and 65 transitions. [2025-04-13 19:58:54,059 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 67 transitions, 401 flow [2025-04-13 19:58:54,061 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 67 transitions, 377 flow, removed 9 selfloop flow, removed 1 redundant places. [2025-04-13 19:58:54,062 INFO L231 Difference]: Finished difference. Result has 40 places, 43 transitions, 199 flow [2025-04-13 19:58:54,062 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=199, PETRI_PLACES=40, PETRI_TRANSITIONS=43} [2025-04-13 19:58:54,062 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 10 predicate places. [2025-04-13 19:58:54,062 INFO L485 AbstractCegarLoop]: Abstraction has has 40 places, 43 transitions, 199 flow [2025-04-13 19:58:54,062 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 0 states have call successors, (0), 0 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 19:58:54,062 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:58:54,064 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:58:54,064 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 19:58:54,064 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 19:58:54,065 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:58:54,065 INFO L85 PathProgramCache]: Analyzing trace with hash 1047907475, now seen corresponding path program 3 times [2025-04-13 19:58:54,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:58:54,065 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108873908] [2025-04-13 19:58:54,065 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 19:58:54,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:58:54,084 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 33 statements into 3 equivalence classes. [2025-04-13 19:58:54,103 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 20 of 33 statements. [2025-04-13 19:58:54,103 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 19:58:54,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:58:54,371 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-04-13 19:58:54,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:58:54,371 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108873908] [2025-04-13 19:58:54,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108873908] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:58:54,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:58:54,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 19:58:54,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068246083] [2025-04-13 19:58:54,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:58:54,372 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 19:58:54,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:58:54,372 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 19:58:54,372 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-13 19:58:54,372 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2025-04-13 19:58:54,373 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 43 transitions, 199 flow. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 0 states have call successors, (0), 0 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 19:58:54,373 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:58:54,373 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2025-04-13 19:58:54,373 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:58:54,628 INFO L116 PetriNetUnfolderBase]: 979/1440 cut-off events. [2025-04-13 19:58:54,628 INFO L117 PetriNetUnfolderBase]: For 693/693 co-relation queries the response was YES. [2025-04-13 19:58:54,631 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3773 conditions, 1440 events. 979/1440 cut-off events. For 693/693 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 5420 event pairs, 380 based on Foata normal form. 1/1439 useless extension candidates. Maximal degree in co-relation 3693. Up to 862 conditions per place. [2025-04-13 19:58:54,635 INFO L140 encePairwiseOnDemand]: 25/30 looper letters, 61 selfloop transitions, 7 changer transitions 1/69 dead transitions. [2025-04-13 19:58:54,635 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 69 transitions, 423 flow [2025-04-13 19:58:54,635 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 19:58:54,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-13 19:58:54,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 63 transitions. [2025-04-13 19:58:54,636 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.525 [2025-04-13 19:58:54,636 INFO L175 Difference]: Start difference. First operand has 40 places, 43 transitions, 199 flow. Second operand 4 states and 63 transitions. [2025-04-13 19:58:54,636 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 69 transitions, 423 flow [2025-04-13 19:58:54,639 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 69 transitions, 423 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-13 19:58:54,640 INFO L231 Difference]: Finished difference. Result has 45 places, 47 transitions, 248 flow [2025-04-13 19:58:54,640 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=199, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=248, PETRI_PLACES=45, PETRI_TRANSITIONS=47} [2025-04-13 19:58:54,641 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 15 predicate places. [2025-04-13 19:58:54,641 INFO L485 AbstractCegarLoop]: Abstraction has has 45 places, 47 transitions, 248 flow [2025-04-13 19:58:54,641 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 0 states have call successors, (0), 0 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 19:58:54,641 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:58:54,641 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:58:54,641 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 19:58:54,641 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 19:58:54,642 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:58:54,642 INFO L85 PathProgramCache]: Analyzing trace with hash -1723718537, now seen corresponding path program 1 times [2025-04-13 19:58:54,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:58:54,642 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979486187] [2025-04-13 19:58:54,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:58:54,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:58:54,655 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-04-13 19:58:54,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-04-13 19:58:54,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:58:54,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:58:54,802 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-04-13 19:58:54,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:58:54,803 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979486187] [2025-04-13 19:58:54,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979486187] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 19:58:54,803 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [349802867] [2025-04-13 19:58:54,803 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:58:54,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:58:54,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:58:54,806 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 19:58:54,807 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 19:58:54,889 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-04-13 19:58:54,928 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-04-13 19:58:54,928 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:58:54,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:58:54,930 INFO L256 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-13 19:58:54,931 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 19:58:54,994 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-04-13 19:58:54,994 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 19:58:55,059 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-04-13 19:58:55,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [349802867] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 19:58:55,059 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 19:58:55,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 17 [2025-04-13 19:58:55,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868083531] [2025-04-13 19:58:55,060 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 19:58:55,060 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-04-13 19:58:55,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:58:55,060 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-04-13 19:58:55,060 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=166, Unknown=0, NotChecked=0, Total=272 [2025-04-13 19:58:55,061 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2025-04-13 19:58:55,061 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 47 transitions, 248 flow. Second operand has 17 states, 17 states have (on average 5.470588235294118) internal successors, (93), 17 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 19:58:55,061 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:58:55,061 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2025-04-13 19:58:55,061 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:58:55,258 INFO L116 PetriNetUnfolderBase]: 979/1443 cut-off events. [2025-04-13 19:58:55,258 INFO L117 PetriNetUnfolderBase]: For 1580/1580 co-relation queries the response was YES. [2025-04-13 19:58:55,261 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4287 conditions, 1443 events. 979/1443 cut-off events. For 1580/1580 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 5378 event pairs, 672 based on Foata normal form. 1/1442 useless extension candidates. Maximal degree in co-relation 4192. Up to 1429 conditions per place. [2025-04-13 19:58:55,265 INFO L140 encePairwiseOnDemand]: 23/30 looper letters, 32 selfloop transitions, 18 changer transitions 0/50 dead transitions. [2025-04-13 19:58:55,266 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 50 transitions, 366 flow [2025-04-13 19:58:55,266 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 19:58:55,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-13 19:58:55,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 65 transitions. [2025-04-13 19:58:55,267 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.30952380952380953 [2025-04-13 19:58:55,267 INFO L175 Difference]: Start difference. First operand has 45 places, 47 transitions, 248 flow. Second operand 7 states and 65 transitions. [2025-04-13 19:58:55,267 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 50 transitions, 366 flow [2025-04-13 19:58:55,273 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 50 transitions, 364 flow, removed 1 selfloop flow, removed 0 redundant places. [2025-04-13 19:58:55,274 INFO L231 Difference]: Finished difference. Result has 52 places, 50 transitions, 314 flow [2025-04-13 19:58:55,274 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=246, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=314, PETRI_PLACES=52, PETRI_TRANSITIONS=50} [2025-04-13 19:58:55,274 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 22 predicate places. [2025-04-13 19:58:55,274 INFO L485 AbstractCegarLoop]: Abstraction has has 52 places, 50 transitions, 314 flow [2025-04-13 19:58:55,275 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 5.470588235294118) internal successors, (93), 17 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 19:58:55,275 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:58:55,275 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:58:55,282 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 19:58:55,475 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-04-13 19:58:55,475 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 19:58:55,476 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:58:55,476 INFO L85 PathProgramCache]: Analyzing trace with hash -1182286329, now seen corresponding path program 2 times [2025-04-13 19:58:55,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:58:55,476 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023310468] [2025-04-13 19:58:55,476 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 19:58:55,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:58:55,495 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-04-13 19:58:55,559 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-04-13 19:58:55,559 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 19:58:55,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:58:55,795 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-04-13 19:58:55,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:58:55,795 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023310468] [2025-04-13 19:58:55,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023310468] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 19:58:55,795 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [628972256] [2025-04-13 19:58:55,795 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 19:58:55,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:58:55,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:58:55,798 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 19:58:55,799 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 19:58:55,867 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-04-13 19:58:55,912 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-04-13 19:58:55,912 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 19:58:55,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:58:55,914 INFO L256 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-13 19:58:55,916 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 19:58:55,993 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-04-13 19:58:55,994 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 19:58:56,065 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-04-13 19:58:56,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [628972256] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 19:58:56,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 19:58:56,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4, 5] total 10 [2025-04-13 19:58:56,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362775659] [2025-04-13 19:58:56,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:58:56,066 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 19:58:56,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:58:56,068 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 19:58:56,068 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-04-13 19:58:56,069 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2025-04-13 19:58:56,069 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 50 transitions, 314 flow. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:58:56,069 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:58:56,069 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2025-04-13 19:58:56,070 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:58:56,296 INFO L116 PetriNetUnfolderBase]: 1039/1529 cut-off events. [2025-04-13 19:58:56,296 INFO L117 PetriNetUnfolderBase]: For 1377/1377 co-relation queries the response was YES. [2025-04-13 19:58:56,299 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4562 conditions, 1529 events. 1039/1529 cut-off events. For 1377/1377 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 6061 event pairs, 108 based on Foata normal form. 26/1555 useless extension candidates. Maximal degree in co-relation 4446. Up to 645 conditions per place. [2025-04-13 19:58:56,302 INFO L140 encePairwiseOnDemand]: 23/30 looper letters, 77 selfloop transitions, 9 changer transitions 0/86 dead transitions. [2025-04-13 19:58:56,302 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 86 transitions, 615 flow [2025-04-13 19:58:56,303 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 19:58:56,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 19:58:56,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 76 transitions. [2025-04-13 19:58:56,304 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5066666666666667 [2025-04-13 19:58:56,304 INFO L175 Difference]: Start difference. First operand has 52 places, 50 transitions, 314 flow. Second operand 5 states and 76 transitions. [2025-04-13 19:58:56,304 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 86 transitions, 615 flow [2025-04-13 19:58:56,306 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 86 transitions, 579 flow, removed 6 selfloop flow, removed 4 redundant places. [2025-04-13 19:58:56,307 INFO L231 Difference]: Finished difference. Result has 54 places, 52 transitions, 325 flow [2025-04-13 19:58:56,307 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=278, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=325, PETRI_PLACES=54, PETRI_TRANSITIONS=52} [2025-04-13 19:58:56,308 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 24 predicate places. [2025-04-13 19:58:56,308 INFO L485 AbstractCegarLoop]: Abstraction has has 54 places, 52 transitions, 325 flow [2025-04-13 19:58:56,308 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:58:56,308 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:58:56,308 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:58:56,314 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 19:58:56,512 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:58:56,512 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 19:58:56,513 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:58:56,513 INFO L85 PathProgramCache]: Analyzing trace with hash -1913776276, now seen corresponding path program 1 times [2025-04-13 19:58:56,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:58:56,513 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867768524] [2025-04-13 19:58:56,513 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:58:56,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:58:56,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-04-13 19:58:56,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-04-13 19:58:56,553 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:58:56,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:58:56,813 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-04-13 19:58:56,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:58:56,814 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867768524] [2025-04-13 19:58:56,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867768524] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 19:58:56,814 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1183392295] [2025-04-13 19:58:56,814 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:58:56,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:58:56,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:58:56,817 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 19:58:56,820 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 19:58:56,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-04-13 19:58:56,949 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-04-13 19:58:56,949 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:58:56,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:58:56,952 INFO L256 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-04-13 19:58:56,954 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 19:58:57,101 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-13 19:58:57,102 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 19:58:57,186 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-04-13 19:58:57,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1183392295] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 19:58:57,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 19:58:57,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 8] total 14 [2025-04-13 19:58:57,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259141993] [2025-04-13 19:58:57,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:58:57,187 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 19:58:57,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:58:57,187 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 19:58:57,187 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2025-04-13 19:58:57,187 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2025-04-13 19:58:57,188 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 52 transitions, 325 flow. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:58:57,188 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:58:57,188 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2025-04-13 19:58:57,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:58:57,503 INFO L116 PetriNetUnfolderBase]: 1595/2374 cut-off events. [2025-04-13 19:58:57,503 INFO L117 PetriNetUnfolderBase]: For 4312/4312 co-relation queries the response was YES. [2025-04-13 19:58:57,506 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7775 conditions, 2374 events. 1595/2374 cut-off events. For 4312/4312 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 10756 event pairs, 318 based on Foata normal form. 1/2375 useless extension candidates. Maximal degree in co-relation 7673. Up to 1194 conditions per place. [2025-04-13 19:58:57,512 INFO L140 encePairwiseOnDemand]: 19/30 looper letters, 92 selfloop transitions, 25 changer transitions 3/120 dead transitions. [2025-04-13 19:58:57,512 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 120 transitions, 930 flow [2025-04-13 19:58:57,513 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 19:58:57,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 19:58:57,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 97 transitions. [2025-04-13 19:58:57,513 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5388888888888889 [2025-04-13 19:58:57,513 INFO L175 Difference]: Start difference. First operand has 54 places, 52 transitions, 325 flow. Second operand 6 states and 97 transitions. [2025-04-13 19:58:57,513 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 120 transitions, 930 flow [2025-04-13 19:58:57,519 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 120 transitions, 890 flow, removed 8 selfloop flow, removed 2 redundant places. [2025-04-13 19:58:57,520 INFO L231 Difference]: Finished difference. Result has 62 places, 74 transitions, 553 flow [2025-04-13 19:58:57,520 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=310, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=553, PETRI_PLACES=62, PETRI_TRANSITIONS=74} [2025-04-13 19:58:57,520 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 32 predicate places. [2025-04-13 19:58:57,520 INFO L485 AbstractCegarLoop]: Abstraction has has 62 places, 74 transitions, 553 flow [2025-04-13 19:58:57,521 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:58:57,521 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:58:57,522 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:58:57,529 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 19:58:57,723 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:58:57,724 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 19:58:57,725 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:58:57,725 INFO L85 PathProgramCache]: Analyzing trace with hash -456019974, now seen corresponding path program 2 times [2025-04-13 19:58:57,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:58:57,725 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79192300] [2025-04-13 19:58:57,725 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 19:58:57,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:58:57,740 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-04-13 19:58:57,776 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-04-13 19:58:57,776 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 19:58:57,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:58:57,943 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-04-13 19:58:57,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:58:57,944 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79192300] [2025-04-13 19:58:57,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79192300] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 19:58:57,944 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1823325881] [2025-04-13 19:58:57,944 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 19:58:57,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:58:57,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:58:57,946 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 19:58:57,947 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 19:58:58,020 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-04-13 19:58:58,060 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-04-13 19:58:58,060 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 19:58:58,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:58:58,062 INFO L256 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-13 19:58:58,063 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 19:58:58,108 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-04-13 19:58:58,108 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 19:58:58,143 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-04-13 19:58:58,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1823325881] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 19:58:58,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 19:58:58,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4, 5] total 10 [2025-04-13 19:58:58,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098216723] [2025-04-13 19:58:58,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:58:58,144 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 19:58:58,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:58:58,145 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 19:58:58,145 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-04-13 19:58:58,145 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2025-04-13 19:58:58,145 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 74 transitions, 553 flow. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:58:58,145 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:58:58,145 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2025-04-13 19:58:58,145 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:58:58,449 INFO L116 PetriNetUnfolderBase]: 1595/2368 cut-off events. [2025-04-13 19:58:58,449 INFO L117 PetriNetUnfolderBase]: For 6366/6366 co-relation queries the response was YES. [2025-04-13 19:58:58,454 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9362 conditions, 2368 events. 1595/2368 cut-off events. For 6366/6366 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 10365 event pairs, 340 based on Foata normal form. 40/2408 useless extension candidates. Maximal degree in co-relation 9254. Up to 994 conditions per place. [2025-04-13 19:58:58,461 INFO L140 encePairwiseOnDemand]: 23/30 looper letters, 79 selfloop transitions, 20 changer transitions 4/103 dead transitions. [2025-04-13 19:58:58,462 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 103 transitions, 906 flow [2025-04-13 19:58:58,462 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 19:58:58,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 19:58:58,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 72 transitions. [2025-04-13 19:58:58,462 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.48 [2025-04-13 19:58:58,462 INFO L175 Difference]: Start difference. First operand has 62 places, 74 transitions, 553 flow. Second operand 5 states and 72 transitions. [2025-04-13 19:58:58,462 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 103 transitions, 906 flow [2025-04-13 19:58:58,474 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 103 transitions, 868 flow, removed 9 selfloop flow, removed 2 redundant places. [2025-04-13 19:58:58,477 INFO L231 Difference]: Finished difference. Result has 66 places, 72 transitions, 591 flow [2025-04-13 19:58:58,477 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=512, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=591, PETRI_PLACES=66, PETRI_TRANSITIONS=72} [2025-04-13 19:58:58,477 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 36 predicate places. [2025-04-13 19:58:58,477 INFO L485 AbstractCegarLoop]: Abstraction has has 66 places, 72 transitions, 591 flow [2025-04-13 19:58:58,478 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:58:58,478 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:58:58,478 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:58:58,485 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-04-13 19:58:58,678 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:58:58,679 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 19:58:58,679 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:58:58,679 INFO L85 PathProgramCache]: Analyzing trace with hash 294476042, now seen corresponding path program 3 times [2025-04-13 19:58:58,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:58:58,679 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955708613] [2025-04-13 19:58:58,679 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 19:58:58,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:58:58,696 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 37 statements into 4 equivalence classes. [2025-04-13 19:58:58,739 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 28 of 37 statements. [2025-04-13 19:58:58,740 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 19:58:58,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:58:58,921 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-04-13 19:58:58,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:58:58,921 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955708613] [2025-04-13 19:58:58,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955708613] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:58:58,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:58:58,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 19:58:58,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764744959] [2025-04-13 19:58:58,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:58:58,921 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 19:58:58,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:58:58,922 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 19:58:58,922 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 19:58:58,922 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2025-04-13 19:58:58,922 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 72 transitions, 591 flow. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:58:58,922 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:58:58,922 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2025-04-13 19:58:58,922 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:58:59,231 INFO L116 PetriNetUnfolderBase]: 1206/1784 cut-off events. [2025-04-13 19:58:59,231 INFO L117 PetriNetUnfolderBase]: For 6572/6572 co-relation queries the response was YES. [2025-04-13 19:58:59,234 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7355 conditions, 1784 events. 1206/1784 cut-off events. For 6572/6572 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 7467 event pairs, 269 based on Foata normal form. 16/1800 useless extension candidates. Maximal degree in co-relation 7244. Up to 963 conditions per place. [2025-04-13 19:58:59,241 INFO L140 encePairwiseOnDemand]: 25/30 looper letters, 99 selfloop transitions, 10 changer transitions 16/125 dead transitions. [2025-04-13 19:58:59,241 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 125 transitions, 1150 flow [2025-04-13 19:58:59,241 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 19:58:59,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 19:58:59,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 75 transitions. [2025-04-13 19:58:59,242 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5 [2025-04-13 19:58:59,242 INFO L175 Difference]: Start difference. First operand has 66 places, 72 transitions, 591 flow. Second operand 5 states and 75 transitions. [2025-04-13 19:58:59,242 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 125 transitions, 1150 flow [2025-04-13 19:58:59,252 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 125 transitions, 1100 flow, removed 10 selfloop flow, removed 2 redundant places. [2025-04-13 19:58:59,254 INFO L231 Difference]: Finished difference. Result has 71 places, 73 transitions, 598 flow [2025-04-13 19:58:59,254 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=553, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=598, PETRI_PLACES=71, PETRI_TRANSITIONS=73} [2025-04-13 19:58:59,255 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 41 predicate places. [2025-04-13 19:58:59,255 INFO L485 AbstractCegarLoop]: Abstraction has has 71 places, 73 transitions, 598 flow [2025-04-13 19:58:59,255 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:58:59,255 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:58:59,255 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:58:59,255 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-13 19:58:59,255 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 19:58:59,255 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:58:59,255 INFO L85 PathProgramCache]: Analyzing trace with hash -1858563500, now seen corresponding path program 4 times [2025-04-13 19:58:59,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:58:59,256 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589412980] [2025-04-13 19:58:59,256 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 19:58:59,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:58:59,268 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 37 statements into 2 equivalence classes. [2025-04-13 19:58:59,290 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-04-13 19:58:59,290 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 19:58:59,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:58:59,527 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-04-13 19:58:59,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:58:59,527 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589412980] [2025-04-13 19:58:59,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589412980] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 19:58:59,527 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [343913509] [2025-04-13 19:58:59,527 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 19:58:59,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:58:59,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:58:59,530 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 19:58:59,532 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 19:58:59,612 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 37 statements into 2 equivalence classes. [2025-04-13 19:58:59,655 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-04-13 19:58:59,655 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 19:58:59,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:58:59,657 INFO L256 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-13 19:58:59,658 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 19:58:59,726 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-04-13 19:58:59,726 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 19:58:59,790 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-04-13 19:58:59,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [343913509] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 19:58:59,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 19:58:59,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 11 [2025-04-13 19:58:59,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376817355] [2025-04-13 19:58:59,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:58:59,791 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 19:58:59,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:58:59,791 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 19:58:59,791 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-04-13 19:58:59,792 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2025-04-13 19:58:59,792 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 73 transitions, 598 flow. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:58:59,792 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:58:59,792 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2025-04-13 19:58:59,792 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:59:00,088 INFO L116 PetriNetUnfolderBase]: 1280/1888 cut-off events. [2025-04-13 19:59:00,089 INFO L117 PetriNetUnfolderBase]: For 6809/6809 co-relation queries the response was YES. [2025-04-13 19:59:00,093 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8145 conditions, 1888 events. 1280/1888 cut-off events. For 6809/6809 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 7762 event pairs, 346 based on Foata normal form. 28/1912 useless extension candidates. Maximal degree in co-relation 8031. Up to 991 conditions per place. [2025-04-13 19:59:00,102 INFO L140 encePairwiseOnDemand]: 25/30 looper letters, 103 selfloop transitions, 14 changer transitions 1/118 dead transitions. [2025-04-13 19:59:00,102 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 118 transitions, 1058 flow [2025-04-13 19:59:00,104 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 19:59:00,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 19:59:00,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 79 transitions. [2025-04-13 19:59:00,105 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5266666666666666 [2025-04-13 19:59:00,105 INFO L175 Difference]: Start difference. First operand has 71 places, 73 transitions, 598 flow. Second operand 5 states and 79 transitions. [2025-04-13 19:59:00,105 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 118 transitions, 1058 flow [2025-04-13 19:59:00,117 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 118 transitions, 1001 flow, removed 17 selfloop flow, removed 3 redundant places. [2025-04-13 19:59:00,118 INFO L231 Difference]: Finished difference. Result has 72 places, 74 transitions, 610 flow [2025-04-13 19:59:00,119 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=566, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=610, PETRI_PLACES=72, PETRI_TRANSITIONS=74} [2025-04-13 19:59:00,120 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 42 predicate places. [2025-04-13 19:59:00,120 INFO L485 AbstractCegarLoop]: Abstraction has has 72 places, 74 transitions, 610 flow [2025-04-13 19:59:00,120 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:59:00,120 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:59:00,120 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:59:00,126 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-04-13 19:59:00,320 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:59:00,320 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 19:59:00,321 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:59:00,321 INFO L85 PathProgramCache]: Analyzing trace with hash -223199005, now seen corresponding path program 3 times [2025-04-13 19:59:00,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:59:00,321 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992466992] [2025-04-13 19:59:00,321 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 19:59:00,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:59:00,333 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 37 statements into 4 equivalence classes. [2025-04-13 19:59:00,361 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 28 of 37 statements. [2025-04-13 19:59:00,361 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 19:59:00,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:59:00,475 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-04-13 19:59:00,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:59:00,475 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992466992] [2025-04-13 19:59:00,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992466992] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 19:59:00,475 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [298343231] [2025-04-13 19:59:00,475 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 19:59:00,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:59:00,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:59:00,477 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 19:59:00,479 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 19:59:00,557 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 37 statements into 4 equivalence classes. [2025-04-13 19:59:00,592 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 28 of 37 statements. [2025-04-13 19:59:00,592 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 19:59:00,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:59:00,594 INFO L256 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-13 19:59:00,595 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 19:59:00,657 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-04-13 19:59:00,657 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 19:59:00,725 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-04-13 19:59:00,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [298343231] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 19:59:00,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 19:59:00,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4, 5] total 11 [2025-04-13 19:59:00,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903230825] [2025-04-13 19:59:00,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:59:00,726 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 19:59:00,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:59:00,726 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 19:59:00,726 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-04-13 19:59:00,726 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2025-04-13 19:59:00,726 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 74 transitions, 610 flow. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:59:00,726 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:59:00,726 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2025-04-13 19:59:00,726 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:59:01,019 INFO L116 PetriNetUnfolderBase]: 1460/2162 cut-off events. [2025-04-13 19:59:01,019 INFO L117 PetriNetUnfolderBase]: For 6982/6982 co-relation queries the response was YES. [2025-04-13 19:59:01,023 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8999 conditions, 2162 events. 1460/2162 cut-off events. For 6982/6982 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 9350 event pairs, 170 based on Foata normal form. 30/2018 useless extension candidates. Maximal degree in co-relation 8886. Up to 1486 conditions per place. [2025-04-13 19:59:01,030 INFO L140 encePairwiseOnDemand]: 23/30 looper letters, 102 selfloop transitions, 20 changer transitions 1/123 dead transitions. [2025-04-13 19:59:01,030 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 123 transitions, 1120 flow [2025-04-13 19:59:01,030 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 19:59:01,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 19:59:01,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 74 transitions. [2025-04-13 19:59:01,031 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.49333333333333335 [2025-04-13 19:59:01,031 INFO L175 Difference]: Start difference. First operand has 72 places, 74 transitions, 610 flow. Second operand 5 states and 74 transitions. [2025-04-13 19:59:01,031 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 123 transitions, 1120 flow [2025-04-13 19:59:01,043 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 123 transitions, 1090 flow, removed 1 selfloop flow, removed 3 redundant places. [2025-04-13 19:59:01,045 INFO L231 Difference]: Finished difference. Result has 75 places, 79 transitions, 700 flow [2025-04-13 19:59:01,045 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=580, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=700, PETRI_PLACES=75, PETRI_TRANSITIONS=79} [2025-04-13 19:59:01,045 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 45 predicate places. [2025-04-13 19:59:01,046 INFO L485 AbstractCegarLoop]: Abstraction has has 75 places, 79 transitions, 700 flow [2025-04-13 19:59:01,046 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:59:01,046 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:59:01,046 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:59:01,053 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-04-13 19:59:01,246 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:59:01,247 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 19:59:01,247 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:59:01,247 INFO L85 PathProgramCache]: Analyzing trace with hash -1972067210, now seen corresponding path program 5 times [2025-04-13 19:59:01,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:59:01,247 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059030920] [2025-04-13 19:59:01,247 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 19:59:01,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:59:01,259 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 37 statements into 4 equivalence classes. [2025-04-13 19:59:01,278 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 37 of 37 statements. [2025-04-13 19:59:01,278 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 19:59:01,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:59:01,445 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-04-13 19:59:01,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:59:01,445 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059030920] [2025-04-13 19:59:01,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059030920] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:59:01,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:59:01,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 19:59:01,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732470218] [2025-04-13 19:59:01,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:59:01,445 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 19:59:01,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:59:01,446 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 19:59:01,446 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 19:59:01,446 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2025-04-13 19:59:01,446 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 79 transitions, 700 flow. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:59:01,446 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:59:01,446 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2025-04-13 19:59:01,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:59:01,824 INFO L116 PetriNetUnfolderBase]: 1400/2066 cut-off events. [2025-04-13 19:59:01,824 INFO L117 PetriNetUnfolderBase]: For 8233/8233 co-relation queries the response was YES. [2025-04-13 19:59:01,829 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9084 conditions, 2066 events. 1400/2066 cut-off events. For 8233/8233 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 8779 event pairs, 401 based on Foata normal form. 16/1916 useless extension candidates. Maximal degree in co-relation 8968. Up to 1265 conditions per place. [2025-04-13 19:59:01,836 INFO L140 encePairwiseOnDemand]: 25/30 looper letters, 99 selfloop transitions, 12 changer transitions 12/123 dead transitions. [2025-04-13 19:59:01,836 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 123 transitions, 1147 flow [2025-04-13 19:59:01,837 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 19:59:01,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 19:59:01,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 74 transitions. [2025-04-13 19:59:01,837 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.49333333333333335 [2025-04-13 19:59:01,837 INFO L175 Difference]: Start difference. First operand has 75 places, 79 transitions, 700 flow. Second operand 5 states and 74 transitions. [2025-04-13 19:59:01,837 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 123 transitions, 1147 flow [2025-04-13 19:59:01,852 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 123 transitions, 1139 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-04-13 19:59:01,854 INFO L231 Difference]: Finished difference. Result has 80 places, 79 transitions, 726 flow [2025-04-13 19:59:01,854 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=692, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=726, PETRI_PLACES=80, PETRI_TRANSITIONS=79} [2025-04-13 19:59:01,854 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 50 predicate places. [2025-04-13 19:59:01,854 INFO L485 AbstractCegarLoop]: Abstraction has has 80 places, 79 transitions, 726 flow [2025-04-13 19:59:01,854 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:59:01,854 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:59:01,855 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:59:01,855 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-04-13 19:59:01,855 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 19:59:01,855 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:59:01,855 INFO L85 PathProgramCache]: Analyzing trace with hash 1566368671, now seen corresponding path program 4 times [2025-04-13 19:59:01,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:59:01,855 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438986496] [2025-04-13 19:59:01,855 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 19:59:01,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:59:01,866 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 37 statements into 2 equivalence classes. [2025-04-13 19:59:01,876 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-04-13 19:59:01,876 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 19:59:01,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:59:02,037 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-04-13 19:59:02,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:59:02,037 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438986496] [2025-04-13 19:59:02,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438986496] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:59:02,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:59:02,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 19:59:02,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837862362] [2025-04-13 19:59:02,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:59:02,037 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 19:59:02,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:59:02,038 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 19:59:02,038 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 19:59:02,038 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2025-04-13 19:59:02,038 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 79 transitions, 726 flow. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:59:02,038 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:59:02,038 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2025-04-13 19:59:02,038 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:59:02,315 INFO L116 PetriNetUnfolderBase]: 1290/1888 cut-off events. [2025-04-13 19:59:02,315 INFO L117 PetriNetUnfolderBase]: For 7917/7917 co-relation queries the response was YES. [2025-04-13 19:59:02,320 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8731 conditions, 1888 events. 1290/1888 cut-off events. For 7917/7917 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 7759 event pairs, 356 based on Foata normal form. 14/1752 useless extension candidates. Maximal degree in co-relation 8613. Up to 1093 conditions per place. [2025-04-13 19:59:02,327 INFO L140 encePairwiseOnDemand]: 25/30 looper letters, 101 selfloop transitions, 16 changer transitions 9/126 dead transitions. [2025-04-13 19:59:02,327 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 126 transitions, 1180 flow [2025-04-13 19:59:02,327 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 19:59:02,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 19:59:02,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 82 transitions. [2025-04-13 19:59:02,328 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.45555555555555555 [2025-04-13 19:59:02,328 INFO L175 Difference]: Start difference. First operand has 80 places, 79 transitions, 726 flow. Second operand 6 states and 82 transitions. [2025-04-13 19:59:02,328 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 126 transitions, 1180 flow [2025-04-13 19:59:02,343 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 126 transitions, 1135 flow, removed 9 selfloop flow, removed 5 redundant places. [2025-04-13 19:59:02,345 INFO L231 Difference]: Finished difference. Result has 80 places, 79 transitions, 722 flow [2025-04-13 19:59:02,345 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=683, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=722, PETRI_PLACES=80, PETRI_TRANSITIONS=79} [2025-04-13 19:59:02,346 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 50 predicate places. [2025-04-13 19:59:02,346 INFO L485 AbstractCegarLoop]: Abstraction has has 80 places, 79 transitions, 722 flow [2025-04-13 19:59:02,346 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:59:02,346 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:59:02,346 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:59:02,346 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-04-13 19:59:02,346 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 19:59:02,347 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:59:02,347 INFO L85 PathProgramCache]: Analyzing trace with hash -1813502434, now seen corresponding path program 6 times [2025-04-13 19:59:02,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:59:02,347 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298397847] [2025-04-13 19:59:02,347 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 19:59:02,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:59:02,358 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 37 statements into 4 equivalence classes. [2025-04-13 19:59:02,386 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 31 of 37 statements. [2025-04-13 19:59:02,386 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 19:59:02,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:59:02,537 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-04-13 19:59:02,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:59:02,538 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298397847] [2025-04-13 19:59:02,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298397847] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:59:02,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:59:02,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 19:59:02,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556359354] [2025-04-13 19:59:02,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:59:02,538 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 19:59:02,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:59:02,538 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 19:59:02,538 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 19:59:02,538 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2025-04-13 19:59:02,539 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 79 transitions, 722 flow. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:59:02,539 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:59:02,539 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2025-04-13 19:59:02,539 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:59:02,848 INFO L116 PetriNetUnfolderBase]: 1238/1822 cut-off events. [2025-04-13 19:59:02,849 INFO L117 PetriNetUnfolderBase]: For 8619/8619 co-relation queries the response was YES. [2025-04-13 19:59:02,853 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8517 conditions, 1822 events. 1238/1822 cut-off events. For 8619/8619 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 7354 event pairs, 338 based on Foata normal form. 32/1708 useless extension candidates. Maximal degree in co-relation 8400. Up to 940 conditions per place. [2025-04-13 19:59:02,858 INFO L140 encePairwiseOnDemand]: 25/30 looper letters, 100 selfloop transitions, 22 changer transitions 13/135 dead transitions. [2025-04-13 19:59:02,858 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 135 transitions, 1255 flow [2025-04-13 19:59:02,858 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 19:59:02,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-13 19:59:02,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 97 transitions. [2025-04-13 19:59:02,859 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.46190476190476193 [2025-04-13 19:59:02,859 INFO L175 Difference]: Start difference. First operand has 80 places, 79 transitions, 722 flow. Second operand 7 states and 97 transitions. [2025-04-13 19:59:02,859 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 135 transitions, 1255 flow [2025-04-13 19:59:02,876 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 135 transitions, 1212 flow, removed 6 selfloop flow, removed 3 redundant places. [2025-04-13 19:59:02,877 INFO L231 Difference]: Finished difference. Result has 84 places, 80 transitions, 747 flow [2025-04-13 19:59:02,878 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=683, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=747, PETRI_PLACES=84, PETRI_TRANSITIONS=80} [2025-04-13 19:59:02,878 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 54 predicate places. [2025-04-13 19:59:02,878 INFO L485 AbstractCegarLoop]: Abstraction has has 84 places, 80 transitions, 747 flow [2025-04-13 19:59:02,879 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:59:02,879 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:59:02,879 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:59:02,879 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-04-13 19:59:02,879 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 19:59:02,879 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:59:02,879 INFO L85 PathProgramCache]: Analyzing trace with hash -182588907, now seen corresponding path program 5 times [2025-04-13 19:59:02,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:59:02,879 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225987481] [2025-04-13 19:59:02,879 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 19:59:02,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:59:02,892 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 37 statements into 4 equivalence classes. [2025-04-13 19:59:02,929 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 37 of 37 statements. [2025-04-13 19:59:02,929 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 19:59:02,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:59:03,064 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-04-13 19:59:03,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:59:03,064 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225987481] [2025-04-13 19:59:03,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225987481] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 19:59:03,064 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [218055016] [2025-04-13 19:59:03,064 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 19:59:03,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:59:03,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:59:03,067 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 19:59:03,069 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 19:59:03,171 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 37 statements into 4 equivalence classes. [2025-04-13 19:59:03,353 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 37 of 37 statements. [2025-04-13 19:59:03,353 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 19:59:03,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:59:03,355 INFO L256 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-13 19:59:03,357 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 19:59:03,411 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-04-13 19:59:03,412 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-13 19:59:03,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [218055016] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:59:03,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-13 19:59:03,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4] total 8 [2025-04-13 19:59:03,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389685920] [2025-04-13 19:59:03,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:59:03,412 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 19:59:03,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:59:03,412 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 19:59:03,413 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-04-13 19:59:03,413 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2025-04-13 19:59:03,413 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 80 transitions, 747 flow. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:59:03,413 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:59:03,413 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2025-04-13 19:59:03,413 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:59:03,687 INFO L116 PetriNetUnfolderBase]: 1159/1705 cut-off events. [2025-04-13 19:59:03,687 INFO L117 PetriNetUnfolderBase]: For 8752/8752 co-relation queries the response was YES. [2025-04-13 19:59:03,691 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8106 conditions, 1705 events. 1159/1705 cut-off events. For 8752/8752 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 6809 event pairs, 329 based on Foata normal form. 14/1581 useless extension candidates. Maximal degree in co-relation 7987. Up to 1067 conditions per place. [2025-04-13 19:59:03,696 INFO L140 encePairwiseOnDemand]: 25/30 looper letters, 84 selfloop transitions, 19 changer transitions 9/112 dead transitions. [2025-04-13 19:59:03,696 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 112 transitions, 1121 flow [2025-04-13 19:59:03,696 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 19:59:03,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 19:59:03,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 69 transitions. [2025-04-13 19:59:03,697 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.46 [2025-04-13 19:59:03,697 INFO L175 Difference]: Start difference. First operand has 84 places, 80 transitions, 747 flow. Second operand 5 states and 69 transitions. [2025-04-13 19:59:03,697 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 112 transitions, 1121 flow [2025-04-13 19:59:03,713 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 112 transitions, 1057 flow, removed 8 selfloop flow, removed 5 redundant places. [2025-04-13 19:59:03,714 INFO L231 Difference]: Finished difference. Result has 85 places, 81 transitions, 761 flow [2025-04-13 19:59:03,714 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=689, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=761, PETRI_PLACES=85, PETRI_TRANSITIONS=81} [2025-04-13 19:59:03,716 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 55 predicate places. [2025-04-13 19:59:03,716 INFO L485 AbstractCegarLoop]: Abstraction has has 85 places, 81 transitions, 761 flow [2025-04-13 19:59:03,716 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:59:03,716 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:59:03,716 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:59:03,726 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 19:59:03,917 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,SelfDestructingSolverStorable15 [2025-04-13 19:59:03,917 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 19:59:03,917 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:59:03,918 INFO L85 PathProgramCache]: Analyzing trace with hash 619047289, now seen corresponding path program 6 times [2025-04-13 19:59:03,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:59:03,918 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191484863] [2025-04-13 19:59:03,918 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 19:59:03,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:59:03,931 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 37 statements into 4 equivalence classes. [2025-04-13 19:59:03,971 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 31 of 37 statements. [2025-04-13 19:59:03,971 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 19:59:03,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:59:04,105 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-04-13 19:59:04,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:59:04,105 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191484863] [2025-04-13 19:59:04,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191484863] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 19:59:04,105 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1511865693] [2025-04-13 19:59:04,105 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 19:59:04,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:59:04,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:59:04,107 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 19:59:04,110 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 19:59:04,204 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 37 statements into 4 equivalence classes. [2025-04-13 19:59:04,242 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 31 of 37 statements. [2025-04-13 19:59:04,242 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 19:59:04,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:59:04,244 INFO L256 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-13 19:59:04,245 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 19:59:04,305 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-04-13 19:59:04,306 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 19:59:04,366 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-04-13 19:59:04,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1511865693] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 19:59:04,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 19:59:04,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4, 5] total 11 [2025-04-13 19:59:04,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820004053] [2025-04-13 19:59:04,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:59:04,366 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 19:59:04,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:59:04,366 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 19:59:04,366 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-04-13 19:59:04,367 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2025-04-13 19:59:04,367 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 81 transitions, 761 flow. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:59:04,367 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:59:04,367 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2025-04-13 19:59:04,367 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:59:04,641 INFO L116 PetriNetUnfolderBase]: 1109/1641 cut-off events. [2025-04-13 19:59:04,641 INFO L117 PetriNetUnfolderBase]: For 8653/8653 co-relation queries the response was YES. [2025-04-13 19:59:04,644 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7926 conditions, 1641 events. 1109/1641 cut-off events. For 8653/8653 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 6475 event pairs, 319 based on Foata normal form. 30/1537 useless extension candidates. Maximal degree in co-relation 7806. Up to 1067 conditions per place. [2025-04-13 19:59:04,648 INFO L140 encePairwiseOnDemand]: 25/30 looper letters, 90 selfloop transitions, 22 changer transitions 1/113 dead transitions. [2025-04-13 19:59:04,648 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 113 transitions, 1150 flow [2025-04-13 19:59:04,648 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 19:59:04,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 19:59:04,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 72 transitions. [2025-04-13 19:59:04,649 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.48 [2025-04-13 19:59:04,649 INFO L175 Difference]: Start difference. First operand has 85 places, 81 transitions, 761 flow. Second operand 5 states and 72 transitions. [2025-04-13 19:59:04,649 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 113 transitions, 1150 flow [2025-04-13 19:59:04,662 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 113 transitions, 1110 flow, removed 10 selfloop flow, removed 2 redundant places. [2025-04-13 19:59:04,663 INFO L231 Difference]: Finished difference. Result has 87 places, 83 transitions, 808 flow [2025-04-13 19:59:04,663 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=727, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=808, PETRI_PLACES=87, PETRI_TRANSITIONS=83} [2025-04-13 19:59:04,663 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 57 predicate places. [2025-04-13 19:59:04,664 INFO L485 AbstractCegarLoop]: Abstraction has has 87 places, 83 transitions, 808 flow [2025-04-13 19:59:04,664 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:59:04,664 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:59:04,664 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:59:04,670 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-04-13 19:59:04,869 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,SelfDestructingSolverStorable16 [2025-04-13 19:59:04,869 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 19:59:04,869 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:59:04,869 INFO L85 PathProgramCache]: Analyzing trace with hash -1027407168, now seen corresponding path program 7 times [2025-04-13 19:59:04,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:59:04,869 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546219230] [2025-04-13 19:59:04,869 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 19:59:04,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:59:04,883 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-04-13 19:59:04,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-04-13 19:59:04,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:59:04,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:59:05,021 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-04-13 19:59:05,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:59:05,021 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546219230] [2025-04-13 19:59:05,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546219230] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 19:59:05,021 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1679992151] [2025-04-13 19:59:05,022 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 19:59:05,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:59:05,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:59:05,023 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 19:59:05,025 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 19:59:05,116 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-04-13 19:59:05,151 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-04-13 19:59:05,152 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:59:05,152 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:59:05,155 INFO L256 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-04-13 19:59:05,156 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 19:59:05,257 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-13 19:59:05,257 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 19:59:05,318 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-04-13 19:59:05,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1679992151] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 19:59:05,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 19:59:05,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4, 8] total 12 [2025-04-13 19:59:05,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434868753] [2025-04-13 19:59:05,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:59:05,319 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 19:59:05,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:59:05,319 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 19:59:05,320 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2025-04-13 19:59:05,320 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2025-04-13 19:59:05,320 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 83 transitions, 808 flow. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:59:05,320 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:59:05,320 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2025-04-13 19:59:05,320 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:59:05,625 INFO L116 PetriNetUnfolderBase]: 1143/1688 cut-off events. [2025-04-13 19:59:05,626 INFO L117 PetriNetUnfolderBase]: For 8793/8793 co-relation queries the response was YES. [2025-04-13 19:59:05,629 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7908 conditions, 1688 events. 1143/1688 cut-off events. For 8793/8793 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 6907 event pairs, 154 based on Foata normal form. 1/1551 useless extension candidates. Maximal degree in co-relation 7788. Up to 833 conditions per place. [2025-04-13 19:59:05,632 INFO L140 encePairwiseOnDemand]: 19/30 looper letters, 113 selfloop transitions, 36 changer transitions 4/153 dead transitions. [2025-04-13 19:59:05,632 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 153 transitions, 1665 flow [2025-04-13 19:59:05,633 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 19:59:05,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 19:59:05,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 92 transitions. [2025-04-13 19:59:05,633 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5111111111111111 [2025-04-13 19:59:05,634 INFO L175 Difference]: Start difference. First operand has 87 places, 83 transitions, 808 flow. Second operand 6 states and 92 transitions. [2025-04-13 19:59:05,634 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 153 transitions, 1665 flow [2025-04-13 19:59:05,643 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 153 transitions, 1581 flow, removed 9 selfloop flow, removed 3 redundant places. [2025-04-13 19:59:05,647 INFO L231 Difference]: Finished difference. Result has 93 places, 101 transitions, 1022 flow [2025-04-13 19:59:05,647 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=752, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1022, PETRI_PLACES=93, PETRI_TRANSITIONS=101} [2025-04-13 19:59:05,647 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 63 predicate places. [2025-04-13 19:59:05,647 INFO L485 AbstractCegarLoop]: Abstraction has has 93 places, 101 transitions, 1022 flow [2025-04-13 19:59:05,647 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:59:05,647 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:59:05,647 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:59:05,654 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-04-13 19:59:05,847 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,SelfDestructingSolverStorable17 [2025-04-13 19:59:05,848 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 19:59:05,848 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:59:05,848 INFO L85 PathProgramCache]: Analyzing trace with hash 1041631467, now seen corresponding path program 7 times [2025-04-13 19:59:05,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:59:05,849 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472403928] [2025-04-13 19:59:05,849 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 19:59:05,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:59:05,859 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-04-13 19:59:05,866 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-04-13 19:59:05,866 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:59:05,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:59:06,023 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-04-13 19:59:06,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:59:06,023 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472403928] [2025-04-13 19:59:06,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472403928] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:59:06,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:59:06,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 19:59:06,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742429112] [2025-04-13 19:59:06,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:59:06,024 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 19:59:06,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:59:06,024 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 19:59:06,025 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 19:59:06,025 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2025-04-13 19:59:06,025 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 101 transitions, 1022 flow. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:59:06,025 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:59:06,025 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2025-04-13 19:59:06,025 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:59:06,315 INFO L116 PetriNetUnfolderBase]: 1089/1600 cut-off events. [2025-04-13 19:59:06,315 INFO L117 PetriNetUnfolderBase]: For 9487/9487 co-relation queries the response was YES. [2025-04-13 19:59:06,319 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8126 conditions, 1600 events. 1089/1600 cut-off events. For 9487/9487 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 6218 event pairs, 334 based on Foata normal form. 14/1484 useless extension candidates. Maximal degree in co-relation 8001. Up to 1114 conditions per place. [2025-04-13 19:59:06,322 INFO L140 encePairwiseOnDemand]: 25/30 looper letters, 89 selfloop transitions, 24 changer transitions 10/123 dead transitions. [2025-04-13 19:59:06,323 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 123 transitions, 1379 flow [2025-04-13 19:59:06,323 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 19:59:06,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 19:59:06,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 66 transitions. [2025-04-13 19:59:06,324 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.44 [2025-04-13 19:59:06,324 INFO L175 Difference]: Start difference. First operand has 93 places, 101 transitions, 1022 flow. Second operand 5 states and 66 transitions. [2025-04-13 19:59:06,324 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 123 transitions, 1379 flow [2025-04-13 19:59:06,337 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 123 transitions, 1351 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-04-13 19:59:06,338 INFO L231 Difference]: Finished difference. Result has 96 places, 100 transitions, 1033 flow [2025-04-13 19:59:06,339 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=999, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1033, PETRI_PLACES=96, PETRI_TRANSITIONS=100} [2025-04-13 19:59:06,339 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 66 predicate places. [2025-04-13 19:59:06,339 INFO L485 AbstractCegarLoop]: Abstraction has has 96 places, 100 transitions, 1033 flow [2025-04-13 19:59:06,339 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:59:06,339 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:59:06,339 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:59:06,339 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-04-13 19:59:06,339 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 19:59:06,340 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:59:06,340 INFO L85 PathProgramCache]: Analyzing trace with hash 1143986888, now seen corresponding path program 8 times [2025-04-13 19:59:06,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:59:06,340 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869168844] [2025-04-13 19:59:06,340 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 19:59:06,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:59:06,350 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-04-13 19:59:06,370 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-04-13 19:59:06,370 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 19:59:06,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:59:06,481 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-04-13 19:59:06,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:59:06,481 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869168844] [2025-04-13 19:59:06,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869168844] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 19:59:06,482 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [171101170] [2025-04-13 19:59:06,482 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 19:59:06,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:59:06,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:59:06,483 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 19:59:06,488 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 19:59:06,587 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-04-13 19:59:06,627 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-04-13 19:59:06,628 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 19:59:06,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:59:06,629 INFO L256 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-13 19:59:06,630 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 19:59:06,688 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-04-13 19:59:06,688 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 19:59:06,752 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-04-13 19:59:06,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [171101170] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 19:59:06,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 19:59:06,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4, 5] total 11 [2025-04-13 19:59:06,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552455539] [2025-04-13 19:59:06,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:59:06,752 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 19:59:06,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:59:06,753 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 19:59:06,753 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-04-13 19:59:06,753 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2025-04-13 19:59:06,753 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 100 transitions, 1033 flow. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:59:06,753 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:59:06,753 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2025-04-13 19:59:06,753 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:59:07,017 INFO L116 PetriNetUnfolderBase]: 1027/1489 cut-off events. [2025-04-13 19:59:07,018 INFO L117 PetriNetUnfolderBase]: For 8961/8961 co-relation queries the response was YES. [2025-04-13 19:59:07,021 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7620 conditions, 1489 events. 1027/1489 cut-off events. For 8961/8961 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 5512 event pairs, 151 based on Foata normal form. 28/1399 useless extension candidates. Maximal degree in co-relation 7495. Up to 1006 conditions per place. [2025-04-13 19:59:07,026 INFO L140 encePairwiseOnDemand]: 23/30 looper letters, 94 selfloop transitions, 24 changer transitions 0/118 dead transitions. [2025-04-13 19:59:07,026 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 118 transitions, 1326 flow [2025-04-13 19:59:07,026 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 19:59:07,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 19:59:07,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2025-04-13 19:59:07,027 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.44666666666666666 [2025-04-13 19:59:07,027 INFO L175 Difference]: Start difference. First operand has 96 places, 100 transitions, 1033 flow. Second operand 5 states and 67 transitions. [2025-04-13 19:59:07,027 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 118 transitions, 1326 flow [2025-04-13 19:59:07,039 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 118 transitions, 1199 flow, removed 6 selfloop flow, removed 11 redundant places. [2025-04-13 19:59:07,041 INFO L231 Difference]: Finished difference. Result has 86 places, 97 transitions, 950 flow [2025-04-13 19:59:07,041 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=870, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=950, PETRI_PLACES=86, PETRI_TRANSITIONS=97} [2025-04-13 19:59:07,041 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 56 predicate places. [2025-04-13 19:59:07,041 INFO L485 AbstractCegarLoop]: Abstraction has has 86 places, 97 transitions, 950 flow [2025-04-13 19:59:07,041 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:59:07,041 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:59:07,041 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:59:07,048 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-04-13 19:59:07,242 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:59:07,242 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 19:59:07,243 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:59:07,243 INFO L85 PathProgramCache]: Analyzing trace with hash 1633156060, now seen corresponding path program 1 times [2025-04-13 19:59:07,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:59:07,243 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961975409] [2025-04-13 19:59:07,243 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:59:07,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:59:07,255 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-04-13 19:59:07,276 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-04-13 19:59:07,276 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:59:07,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:59:07,428 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2025-04-13 19:59:07,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:59:07,428 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961975409] [2025-04-13 19:59:07,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961975409] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 19:59:07,428 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1115906930] [2025-04-13 19:59:07,428 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:59:07,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:59:07,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:59:07,430 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 19:59:07,431 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 19:59:07,531 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-04-13 19:59:07,566 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-04-13 19:59:07,567 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:59:07,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:59:07,568 INFO L256 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-04-13 19:59:07,570 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 19:59:07,742 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 19:59:07,743 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 52 [2025-04-13 19:59:07,786 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-13 19:59:07,786 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 19:59:33,611 INFO L325 Elim1Store]: treesize reduction 28, result has 94.9 percent of original size [2025-04-13 19:59:33,612 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 210 treesize of output 583 [2025-04-13 20:02:19,267 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-13 20:02:19,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1115906930] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:02:19,268 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:02:19,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 10, 10] total 20 [2025-04-13 20:02:19,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218058461] [2025-04-13 20:02:19,268 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:02:19,268 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-04-13 20:02:19,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:02:19,268 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-04-13 20:02:19,269 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=347, Unknown=6, NotChecked=0, Total=420 [2025-04-13 20:02:19,269 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2025-04-13 20:02:19,269 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 97 transitions, 950 flow. Second operand has 21 states, 21 states have (on average 5.666666666666667) internal successors, (119), 21 states have internal predecessors, (119), 0 states have call successors, (0), 0 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 20:02:19,269 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:02:19,269 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2025-04-13 20:02:19,269 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:02:21,297 INFO L116 PetriNetUnfolderBase]: 2214/3210 cut-off events. [2025-04-13 20:02:21,297 INFO L117 PetriNetUnfolderBase]: For 15763/15763 co-relation queries the response was YES. [2025-04-13 20:02:21,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15554 conditions, 3210 events. 2214/3210 cut-off events. For 15763/15763 co-relation queries the response was YES. Maximal size of possible extension queue 199. Compared 14795 event pairs, 203 based on Foata normal form. 6/2908 useless extension candidates. Maximal degree in co-relation 15432. Up to 1353 conditions per place. [2025-04-13 20:02:21,310 INFO L140 encePairwiseOnDemand]: 19/30 looper letters, 178 selfloop transitions, 53 changer transitions 111/342 dead transitions. [2025-04-13 20:02:21,310 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 342 transitions, 3991 flow [2025-04-13 20:02:21,311 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 20:02:21,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-04-13 20:02:21,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 192 transitions. [2025-04-13 20:02:21,312 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4 [2025-04-13 20:02:21,312 INFO L175 Difference]: Start difference. First operand has 86 places, 97 transitions, 950 flow. Second operand 16 states and 192 transitions. [2025-04-13 20:02:21,312 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 342 transitions, 3991 flow [2025-04-13 20:02:21,340 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 342 transitions, 3952 flow, removed 10 selfloop flow, removed 1 redundant places. [2025-04-13 20:02:21,342 INFO L231 Difference]: Finished difference. Result has 112 places, 141 transitions, 1732 flow [2025-04-13 20:02:21,343 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=940, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=1732, PETRI_PLACES=112, PETRI_TRANSITIONS=141} [2025-04-13 20:02:21,343 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 82 predicate places. [2025-04-13 20:02:21,343 INFO L485 AbstractCegarLoop]: Abstraction has has 112 places, 141 transitions, 1732 flow [2025-04-13 20:02:21,343 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 5.666666666666667) internal successors, (119), 21 states have internal predecessors, (119), 0 states have call successors, (0), 0 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 20:02:21,343 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:02:21,343 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:02:21,351 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 20:02:21,544 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2025-04-13 20:02:21,544 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:02:21,544 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:02:21,544 INFO L85 PathProgramCache]: Analyzing trace with hash -1616490603, now seen corresponding path program 2 times [2025-04-13 20:02:21,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:02:21,545 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890851264] [2025-04-13 20:02:21,545 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:02:21,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:02:21,558 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 39 statements into 2 equivalence classes. [2025-04-13 20:02:21,587 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 39 of 39 statements. [2025-04-13 20:02:21,588 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:02:21,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:02:21,770 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2025-04-13 20:02:21,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:02:21,771 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890851264] [2025-04-13 20:02:21,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890851264] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:02:21,771 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1308072633] [2025-04-13 20:02:21,771 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:02:21,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:02:21,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:02:21,775 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 20:02:21,783 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 20:02:21,916 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 39 statements into 2 equivalence classes. [2025-04-13 20:02:21,965 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 39 of 39 statements. [2025-04-13 20:02:21,965 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:02:21,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:02:21,973 INFO L256 TraceCheckSpWp]: Trace formula consists of 447 conjuncts, 54 conjuncts are in the unsatisfiable core [2025-04-13 20:02:21,975 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:02:22,472 INFO L325 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2025-04-13 20:02:22,473 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 38 treesize of output 30 [2025-04-13 20:02:22,529 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-13 20:02:22,529 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:02:23,696 INFO L325 Elim1Store]: treesize reduction 110, result has 84.0 percent of original size [2025-04-13 20:02:23,697 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 11 select indices, 11 select index equivalence classes, 0 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 55 case distinctions, treesize of input 153 treesize of output 618 [2025-04-13 20:03:50,208 WARN L249 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) stderr output: (error "out of memory") [2025-04-13 20:03:50,208 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 101 [2025-04-13 20:03:50,210 WARN L310 FreeRefinementEngine]: Global settings require throwing the following exception [2025-04-13 20:03:50,217 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-04-13 20:03:50,410 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-04-13 20:03:50,413 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:277) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.push(Scriptor.java:133) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.push(DiffWrapperScript.java:90) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.push(WrapperScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.push(HistoryRecordingScript.java:107) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:48) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.checkRedundancy(SimplifyDDA2.java:275) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convertForPreprocessedInputTerms(SimplifyDDA2.java:499) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:484) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:103) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:99) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.simplify(SimplifyDDA2.java:589) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:245) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplifyWithStatistics(SmtUtils.java:318) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify(QuantifierPusher.java:726) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:135) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:223) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:115) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:99) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:305) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:241) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:139) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:337) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:191) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:223) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:115) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:99) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:305) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:285) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:56) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:234) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:416) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:395) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:267) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:325) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:181) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:317) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:349) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:331) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:427) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:132) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 69 more [2025-04-13 20:03:50,422 INFO L158 Benchmark]: Toolchain (without parser) took 299970.00ms. Allocated memory was 155.2MB in the beginning and 906.0MB in the end (delta: 750.8MB). Free memory was 110.0MB in the beginning and 346.2MB in the end (delta: -236.2MB). Peak memory consumption was 576.7MB. Max. memory is 8.0GB. [2025-04-13 20:03:50,422 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 159.4MB. Free memory is still 85.2MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 20:03:50,423 INFO L158 Benchmark]: CACSL2BoogieTranslator took 260.62ms. Allocated memory is still 155.2MB. Free memory was 110.0MB in the beginning and 94.4MB in the end (delta: 15.6MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2025-04-13 20:03:50,423 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.05ms. Allocated memory is still 155.2MB. Free memory was 94.4MB in the beginning and 91.7MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 20:03:50,423 INFO L158 Benchmark]: Boogie Preprocessor took 57.24ms. Allocated memory is still 155.2MB. Free memory was 91.7MB in the beginning and 88.4MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 20:03:50,423 INFO L158 Benchmark]: RCFGBuilder took 793.04ms. Allocated memory is still 155.2MB. Free memory was 88.4MB in the beginning and 68.5MB in the end (delta: 19.9MB). Peak memory consumption was 70.4MB. Max. memory is 8.0GB. [2025-04-13 20:03:50,423 INFO L158 Benchmark]: TraceAbstraction took 298811.02ms. Allocated memory was 155.2MB in the beginning and 906.0MB in the end (delta: 750.8MB). Free memory was 68.5MB in the beginning and 346.2MB in the end (delta: -277.7MB). Peak memory consumption was 535.7MB. Max. memory is 8.0GB. [2025-04-13 20:03:50,425 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 159.4MB. Free memory is still 85.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 260.62ms. Allocated memory is still 155.2MB. Free memory was 110.0MB in the beginning and 94.4MB in the end (delta: 15.6MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 44.05ms. Allocated memory is still 155.2MB. Free memory was 94.4MB in the beginning and 91.7MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 57.24ms. Allocated memory is still 155.2MB. Free memory was 91.7MB in the beginning and 88.4MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 793.04ms. Allocated memory is still 155.2MB. Free memory was 88.4MB in the beginning and 68.5MB in the end (delta: 19.9MB). Peak memory consumption was 70.4MB. Max. memory is 8.0GB. * TraceAbstraction took 298811.02ms. Allocated memory was 155.2MB in the beginning and 906.0MB in the end (delta: 750.8MB). Free memory was 68.5MB in the beginning and 346.2MB in the end (delta: -277.7MB). Peak memory consumption was 535.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...