/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline_IcfgBuilder.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis PETRI_NET --preprocessor.replace.while.statements.and.if-then-else.statements false -i ../../../trunk/examples/svcomp/weaver/chl-word-subst.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-14 00:43:53,052 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-14 00:43:53,110 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2025-04-14 00:43:53,115 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-14 00:43:53,115 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-14 00:43:53,135 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-14 00:43:53,135 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-14 00:43:53,136 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-14 00:43:53,136 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-14 00:43:53,136 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-14 00:43:53,137 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-14 00:43:53,137 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-14 00:43:53,137 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-14 00:43:53,137 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-14 00:43:53,137 INFO L153 SettingsManager]: * Use SBE=true [2025-04-14 00:43:53,138 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-14 00:43:53,138 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-14 00:43:53,138 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-14 00:43:53,138 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-14 00:43:53,138 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-14 00:43:53,138 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-14 00:43:53,138 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-14 00:43:53,138 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-14 00:43:53,138 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-14 00:43:53,138 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-14 00:43:53,138 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-14 00:43:53,138 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-14 00:43:53,138 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-14 00:43:53,138 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-14 00:43:53,138 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 00:43:53,139 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 00:43:53,139 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 00:43:53,139 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 00:43:53,139 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-14 00:43:53,139 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 00:43:53,139 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 00:43:53,139 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 00:43:53,139 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 00:43:53,139 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-14 00:43:53,139 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-14 00:43:53,139 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-14 00:43:53,139 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-14 00:43:53,139 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-14 00:43:53,139 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-14 00:43:53,139 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-14 00:43:53,139 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-14 00:43:53,140 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-14 00:43:53,140 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Automaton type used in concurrency analysis -> PETRI_NET Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Replace while statements and if-then-else statements -> false [2025-04-14 00:43:53,342 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-14 00:43:53,349 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-14 00:43:53,350 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-14 00:43:53,352 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-14 00:43:53,354 INFO L274 PluginConnector]: CDTParser initialized [2025-04-14 00:43:53,355 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/chl-word-subst.wvr.c [2025-04-14 00:43:54,572 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fbabd9204/6453de733d80471daf2280a585e5bb63/FLAG12db3d7e0 [2025-04-14 00:43:54,770 INFO L389 CDTParser]: Found 1 translation units. [2025-04-14 00:43:54,771 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-word-subst.wvr.c [2025-04-14 00:43:54,779 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fbabd9204/6453de733d80471daf2280a585e5bb63/FLAG12db3d7e0 [2025-04-14 00:43:55,623 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fbabd9204/6453de733d80471daf2280a585e5bb63 [2025-04-14 00:43:55,625 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-14 00:43:55,626 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-14 00:43:55,627 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-14 00:43:55,627 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-14 00:43:55,630 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-14 00:43:55,631 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 12:43:55" (1/1) ... [2025-04-14 00:43:55,632 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@184bbd18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:43:55, skipping insertion in model container [2025-04-14 00:43:55,632 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 12:43:55" (1/1) ... [2025-04-14 00:43:55,647 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-14 00:43:55,845 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-word-subst.wvr.c[3384,3397] [2025-04-14 00:43:55,857 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 00:43:55,867 INFO L200 MainTranslator]: Completed pre-run [2025-04-14 00:43:55,909 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-word-subst.wvr.c[3384,3397] [2025-04-14 00:43:55,912 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 00:43:55,924 INFO L204 MainTranslator]: Completed translation [2025-04-14 00:43:55,924 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:43:55 WrapperNode [2025-04-14 00:43:55,924 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-14 00:43:55,925 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-14 00:43:55,925 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-14 00:43:55,925 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-14 00:43:55,934 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:43:55" (1/1) ... [2025-04-14 00:43:55,946 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:43:55" (1/1) ... [2025-04-14 00:43:55,972 INFO L138 Inliner]: procedures = 24, calls = 30, calls flagged for inlining = 9, calls inlined = 13, statements flattened = 160 [2025-04-14 00:43:55,972 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-14 00:43:55,973 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-14 00:43:55,973 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-14 00:43:55,973 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-14 00:43:55,982 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:43:55" (1/1) ... [2025-04-14 00:43:55,982 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:43:55" (1/1) ... [2025-04-14 00:43:55,987 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:43:55" (1/1) ... [2025-04-14 00:43:56,009 INFO L175 MemorySlicer]: Split 17 memory accesses to 2 slices as follows [2, 15]. 88 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 3 writes are split as follows [0, 3]. [2025-04-14 00:43:56,009 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:43:55" (1/1) ... [2025-04-14 00:43:56,010 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:43:55" (1/1) ... [2025-04-14 00:43:56,016 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:43:55" (1/1) ... [2025-04-14 00:43:56,017 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:43:55" (1/1) ... [2025-04-14 00:43:56,018 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:43:55" (1/1) ... [2025-04-14 00:43:56,018 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:43:55" (1/1) ... [2025-04-14 00:43:56,021 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-14 00:43:56,022 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-14 00:43:56,022 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-14 00:43:56,022 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-14 00:43:56,023 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:43:55" (1/1) ... [2025-04-14 00:43:56,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 00:43:56,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:43:56,048 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-14 00:43:56,051 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-14 00:43:56,069 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-14 00:43:56,069 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-14 00:43:56,069 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-14 00:43:56,069 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-14 00:43:56,069 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-14 00:43:56,069 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-14 00:43:56,069 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-14 00:43:56,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-14 00:43:56,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-14 00:43:56,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-14 00:43:56,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-14 00:43:56,070 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-14 00:43:56,070 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-14 00:43:56,070 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-14 00:43:56,070 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-14 00:43:56,070 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-14 00:43:56,071 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-14 00:43:56,164 INFO L256 CfgBuilder]: Building ICFG [2025-04-14 00:43:56,165 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-14 00:43:56,528 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-14 00:43:56,532 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-14 00:43:56,532 INFO L318 CfgBuilder]: Performing block encoding [2025-04-14 00:43:56,900 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-14 00:43:56,901 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 12:43:56 BoogieIcfgContainer [2025-04-14 00:43:56,902 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-14 00:43:56,904 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-14 00:43:56,904 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-14 00:43:56,908 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-14 00:43:56,908 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 12:43:55" (1/3) ... [2025-04-14 00:43:56,908 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10b302fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 12:43:56, skipping insertion in model container [2025-04-14 00:43:56,908 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:43:55" (2/3) ... [2025-04-14 00:43:56,909 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10b302fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 12:43:56, skipping insertion in model container [2025-04-14 00:43:56,909 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 12:43:56" (3/3) ... [2025-04-14 00:43:56,910 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-word-subst.wvr.c [2025-04-14 00:43:56,922 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-14 00:43:56,924 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-word-subst.wvr.c that has 4 procedures, 25 locations, 30 edges, 1 initial locations, 6 loop locations, and 1 error locations. [2025-04-14 00:43:56,924 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-14 00:43:56,994 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-14 00:43:57,021 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 33 transitions, 87 flow [2025-04-14 00:43:57,049 INFO L116 PetriNetUnfolderBase]: 9/30 cut-off events. [2025-04-14 00:43:57,052 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-14 00:43:57,054 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43 conditions, 30 events. 9/30 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 23 event pairs, 0 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 23. Up to 2 conditions per place. [2025-04-14 00:43:57,054 INFO L82 GeneralOperation]: Start removeDead. Operand has 34 places, 33 transitions, 87 flow [2025-04-14 00:43:57,056 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 30 places, 29 transitions, 76 flow [2025-04-14 00:43:57,060 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-14 00:43:57,071 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;@13ec7d1b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 00:43:57,071 INFO L341 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-04-14 00:43:57,078 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-14 00:43:57,078 INFO L116 PetriNetUnfolderBase]: 9/28 cut-off events. [2025-04-14 00:43:57,078 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-14 00:43:57,079 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:43:57,079 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:43:57,079 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 00:43:57,087 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:43:57,087 INFO L85 PathProgramCache]: Analyzing trace with hash 70364551, now seen corresponding path program 1 times [2025-04-14 00:43:57,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:43:57,095 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924534897] [2025-04-14 00:43:57,096 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:43:57,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:43:57,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-14 00:43:57,237 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-14 00:43:57,238 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:43:57,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:43:57,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:43:57,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:43:57,505 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924534897] [2025-04-14 00:43:57,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924534897] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:43:57,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:43:57,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-14 00:43:57,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966027413] [2025-04-14 00:43:57,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:43:57,513 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 00:43:57,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:43:57,534 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 00:43:57,535 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 00:43:57,536 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2025-04-14 00:43:57,538 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 29 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:43:57,538 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:43:57,538 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2025-04-14 00:43:57,539 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:43:57,747 INFO L116 PetriNetUnfolderBase]: 352/487 cut-off events. [2025-04-14 00:43:57,748 INFO L117 PetriNetUnfolderBase]: For 49/49 co-relation queries the response was YES. [2025-04-14 00:43:57,749 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1039 conditions, 487 events. 352/487 cut-off events. For 49/49 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1294 event pairs, 124 based on Foata normal form. 1/293 useless extension candidates. Maximal degree in co-relation 824. Up to 348 conditions per place. [2025-04-14 00:43:57,755 INFO L140 encePairwiseOnDemand]: 31/33 looper letters, 28 selfloop transitions, 0 changer transitions 17/45 dead transitions. [2025-04-14 00:43:57,760 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 45 transitions, 213 flow [2025-04-14 00:43:57,761 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 00:43:57,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-14 00:43:57,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2025-04-14 00:43:57,770 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5555555555555556 [2025-04-14 00:43:57,772 INFO L175 Difference]: Start difference. First operand has 30 places, 29 transitions, 76 flow. Second operand 3 states and 55 transitions. [2025-04-14 00:43:57,772 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 45 transitions, 213 flow [2025-04-14 00:43:57,776 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 45 transitions, 191 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-04-14 00:43:57,779 INFO L231 Difference]: Finished difference. Result has 27 places, 28 transitions, 64 flow [2025-04-14 00:43:57,780 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=64, PETRI_PLACES=27, PETRI_TRANSITIONS=28} [2025-04-14 00:43:57,784 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, -3 predicate places. [2025-04-14 00:43:57,784 INFO L485 AbstractCegarLoop]: Abstraction has has 27 places, 28 transitions, 64 flow [2025-04-14 00:43:57,785 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:43:57,785 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:43:57,785 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:43:57,785 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-14 00:43:57,785 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 00:43:57,785 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:43:57,785 INFO L85 PathProgramCache]: Analyzing trace with hash -402042969, now seen corresponding path program 1 times [2025-04-14 00:43:57,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:43:57,786 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981148973] [2025-04-14 00:43:57,786 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:43:57,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:43:57,807 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-14 00:43:57,876 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-14 00:43:57,876 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:43:57,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:43:58,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:43:58,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:43:58,325 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981148973] [2025-04-14 00:43:58,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981148973] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:43:58,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:43:58,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 00:43:58,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469878435] [2025-04-14 00:43:58,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:43:58,326 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 00:43:58,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:43:58,327 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 00:43:58,327 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-14 00:43:58,327 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2025-04-14 00:43:58,327 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 28 transitions, 64 flow. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:43:58,327 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:43:58,327 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2025-04-14 00:43:58,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:43:58,562 INFO L116 PetriNetUnfolderBase]: 287/414 cut-off events. [2025-04-14 00:43:58,562 INFO L117 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-04-14 00:43:58,563 INFO L83 FinitePrefix]: Finished finitePrefix Result has 849 conditions, 414 events. 287/414 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1229 event pairs, 20 based on Foata normal form. 1/266 useless extension candidates. Maximal degree in co-relation 845. Up to 247 conditions per place. [2025-04-14 00:43:58,567 INFO L140 encePairwiseOnDemand]: 29/33 looper letters, 51 selfloop transitions, 2 changer transitions 7/60 dead transitions. [2025-04-14 00:43:58,567 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 60 transitions, 259 flow [2025-04-14 00:43:58,568 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 00:43:58,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 00:43:58,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 76 transitions. [2025-04-14 00:43:58,569 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.46060606060606063 [2025-04-14 00:43:58,569 INFO L175 Difference]: Start difference. First operand has 27 places, 28 transitions, 64 flow. Second operand 5 states and 76 transitions. [2025-04-14 00:43:58,569 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 60 transitions, 259 flow [2025-04-14 00:43:58,569 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 60 transitions, 255 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-04-14 00:43:58,571 INFO L231 Difference]: Finished difference. Result has 32 places, 29 transitions, 77 flow [2025-04-14 00:43:58,571 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=77, PETRI_PLACES=32, PETRI_TRANSITIONS=29} [2025-04-14 00:43:58,571 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 2 predicate places. [2025-04-14 00:43:58,571 INFO L485 AbstractCegarLoop]: Abstraction has has 32 places, 29 transitions, 77 flow [2025-04-14 00:43:58,571 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:43:58,573 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:43:58,573 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:43:58,573 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-14 00:43:58,573 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 00:43:58,576 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:43:58,576 INFO L85 PathProgramCache]: Analyzing trace with hash -172659005, now seen corresponding path program 2 times [2025-04-14 00:43:58,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:43:58,576 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158639107] [2025-04-14 00:43:58,577 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:43:58,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:43:58,603 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 1 equivalence classes. [2025-04-14 00:43:58,655 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-14 00:43:58,655 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 00:43:58,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:43:59,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:43:59,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:43:59,339 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158639107] [2025-04-14 00:43:59,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158639107] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:43:59,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:43:59,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 00:43:59,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453674817] [2025-04-14 00:43:59,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:43:59,339 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 00:43:59,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:43:59,340 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 00:43:59,340 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-14 00:43:59,340 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2025-04-14 00:43:59,341 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 29 transitions, 77 flow. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:43:59,341 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:43:59,341 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2025-04-14 00:43:59,341 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:43:59,565 INFO L116 PetriNetUnfolderBase]: 331/500 cut-off events. [2025-04-14 00:43:59,566 INFO L117 PetriNetUnfolderBase]: For 177/177 co-relation queries the response was YES. [2025-04-14 00:43:59,567 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1141 conditions, 500 events. 331/500 cut-off events. For 177/177 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1556 event pairs, 124 based on Foata normal form. 1/389 useless extension candidates. Maximal degree in co-relation 1134. Up to 321 conditions per place. [2025-04-14 00:43:59,572 INFO L140 encePairwiseOnDemand]: 29/33 looper letters, 47 selfloop transitions, 3 changer transitions 7/57 dead transitions. [2025-04-14 00:43:59,572 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 57 transitions, 269 flow [2025-04-14 00:43:59,572 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 00:43:59,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 00:43:59,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 72 transitions. [2025-04-14 00:43:59,573 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.43636363636363634 [2025-04-14 00:43:59,573 INFO L175 Difference]: Start difference. First operand has 32 places, 29 transitions, 77 flow. Second operand 5 states and 72 transitions. [2025-04-14 00:43:59,573 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 57 transitions, 269 flow [2025-04-14 00:43:59,573 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 57 transitions, 260 flow, removed 3 selfloop flow, removed 2 redundant places. [2025-04-14 00:43:59,574 INFO L231 Difference]: Finished difference. Result has 36 places, 30 transitions, 94 flow [2025-04-14 00:43:59,574 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=94, PETRI_PLACES=36, PETRI_TRANSITIONS=30} [2025-04-14 00:43:59,575 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 6 predicate places. [2025-04-14 00:43:59,575 INFO L485 AbstractCegarLoop]: Abstraction has has 36 places, 30 transitions, 94 flow [2025-04-14 00:43:59,575 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:43:59,575 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:43:59,575 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:43:59,576 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-14 00:43:59,576 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 00:43:59,577 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:43:59,578 INFO L85 PathProgramCache]: Analyzing trace with hash -1170583851, now seen corresponding path program 3 times [2025-04-14 00:43:59,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:43:59,578 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904411511] [2025-04-14 00:43:59,578 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 00:43:59,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:43:59,588 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 18 statements into 1 equivalence classes. [2025-04-14 00:43:59,619 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-14 00:43:59,619 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-14 00:43:59,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:43:59,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:43:59,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:43:59,874 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904411511] [2025-04-14 00:43:59,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904411511] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:43:59,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:43:59,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 00:43:59,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770307353] [2025-04-14 00:43:59,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:43:59,874 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 00:43:59,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:43:59,875 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 00:43:59,875 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-14 00:43:59,875 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2025-04-14 00:43:59,875 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 30 transitions, 94 flow. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:43:59,875 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:43:59,875 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2025-04-14 00:43:59,875 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:44:00,067 INFO L116 PetriNetUnfolderBase]: 355/542 cut-off events. [2025-04-14 00:44:00,067 INFO L117 PetriNetUnfolderBase]: For 415/415 co-relation queries the response was YES. [2025-04-14 00:44:00,068 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1340 conditions, 542 events. 355/542 cut-off events. For 415/415 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 1911 event pairs, 39 based on Foata normal form. 1/420 useless extension candidates. Maximal degree in co-relation 1331. Up to 362 conditions per place. [2025-04-14 00:44:00,070 INFO L140 encePairwiseOnDemand]: 29/33 looper letters, 49 selfloop transitions, 3 changer transitions 8/60 dead transitions. [2025-04-14 00:44:00,070 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 60 transitions, 301 flow [2025-04-14 00:44:00,070 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 00:44:00,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 00:44:00,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 74 transitions. [2025-04-14 00:44:00,071 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4484848484848485 [2025-04-14 00:44:00,071 INFO L175 Difference]: Start difference. First operand has 36 places, 30 transitions, 94 flow. Second operand 5 states and 74 transitions. [2025-04-14 00:44:00,071 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 60 transitions, 301 flow [2025-04-14 00:44:00,073 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 60 transitions, 290 flow, removed 4 selfloop flow, removed 2 redundant places. [2025-04-14 00:44:00,075 INFO L231 Difference]: Finished difference. Result has 40 places, 31 transitions, 109 flow [2025-04-14 00:44:00,075 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=109, PETRI_PLACES=40, PETRI_TRANSITIONS=31} [2025-04-14 00:44:00,075 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 10 predicate places. [2025-04-14 00:44:00,075 INFO L485 AbstractCegarLoop]: Abstraction has has 40 places, 31 transitions, 109 flow [2025-04-14 00:44:00,075 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:44:00,075 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:44:00,075 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:44:00,076 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-14 00:44:00,076 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 00:44:00,076 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:44:00,076 INFO L85 PathProgramCache]: Analyzing trace with hash -4287757, now seen corresponding path program 4 times [2025-04-14 00:44:00,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:44:00,076 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046933870] [2025-04-14 00:44:00,076 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 00:44:00,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:44:00,087 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 18 statements into 2 equivalence classes. [2025-04-14 00:44:00,093 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 14 of 18 statements. [2025-04-14 00:44:00,093 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-14 00:44:00,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:44:00,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:44:00,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:44:00,274 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046933870] [2025-04-14 00:44:00,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046933870] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:44:00,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:44:00,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 00:44:00,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688243427] [2025-04-14 00:44:00,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:44:00,274 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 00:44:00,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:44:00,274 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 00:44:00,274 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-14 00:44:00,275 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2025-04-14 00:44:00,275 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 31 transitions, 109 flow. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:44:00,275 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:44:00,275 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2025-04-14 00:44:00,275 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:44:00,483 INFO L116 PetriNetUnfolderBase]: 389/608 cut-off events. [2025-04-14 00:44:00,483 INFO L117 PetriNetUnfolderBase]: For 827/827 co-relation queries the response was YES. [2025-04-14 00:44:00,484 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1584 conditions, 608 events. 389/608 cut-off events. For 827/827 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2068 event pairs, 188 based on Foata normal form. 1/471 useless extension candidates. Maximal degree in co-relation 1573. Up to 449 conditions per place. [2025-04-14 00:44:00,487 INFO L140 encePairwiseOnDemand]: 29/33 looper letters, 46 selfloop transitions, 4 changer transitions 8/58 dead transitions. [2025-04-14 00:44:00,487 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 58 transitions, 318 flow [2025-04-14 00:44:00,489 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 00:44:00,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 00:44:00,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2025-04-14 00:44:00,490 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.42424242424242425 [2025-04-14 00:44:00,490 INFO L175 Difference]: Start difference. First operand has 40 places, 31 transitions, 109 flow. Second operand 5 states and 70 transitions. [2025-04-14 00:44:00,490 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 58 transitions, 318 flow [2025-04-14 00:44:00,492 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 58 transitions, 302 flow, removed 6 selfloop flow, removed 3 redundant places. [2025-04-14 00:44:00,493 INFO L231 Difference]: Finished difference. Result has 43 places, 32 transitions, 134 flow [2025-04-14 00:44:00,493 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=103, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=134, PETRI_PLACES=43, PETRI_TRANSITIONS=32} [2025-04-14 00:44:00,495 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 13 predicate places. [2025-04-14 00:44:00,495 INFO L485 AbstractCegarLoop]: Abstraction has has 43 places, 32 transitions, 134 flow [2025-04-14 00:44:00,495 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:44:00,495 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:44:00,495 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:44:00,496 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-14 00:44:00,496 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 00:44:00,496 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:44:00,496 INFO L85 PathProgramCache]: Analyzing trace with hash -1310561785, now seen corresponding path program 5 times [2025-04-14 00:44:00,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:44:00,496 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075800001] [2025-04-14 00:44:00,496 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 00:44:00,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:44:00,504 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 18 statements into 1 equivalence classes. [2025-04-14 00:44:00,520 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-14 00:44:00,521 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 00:44:00,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:44:00,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:44:00,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:44:00,858 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075800001] [2025-04-14 00:44:00,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075800001] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:44:00,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:44:00,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-14 00:44:00,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197131832] [2025-04-14 00:44:00,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:44:00,859 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-14 00:44:00,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:44:00,859 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-14 00:44:00,859 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-14 00:44:00,859 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2025-04-14 00:44:00,859 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 32 transitions, 134 flow. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:44:00,859 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:44:00,859 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2025-04-14 00:44:00,859 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:44:01,098 INFO L116 PetriNetUnfolderBase]: 387/599 cut-off events. [2025-04-14 00:44:01,098 INFO L117 PetriNetUnfolderBase]: For 1024/1024 co-relation queries the response was YES. [2025-04-14 00:44:01,099 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1621 conditions, 599 events. 387/599 cut-off events. For 1024/1024 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2039 event pairs, 173 based on Foata normal form. 1/461 useless extension candidates. Maximal degree in co-relation 1609. Up to 415 conditions per place. [2025-04-14 00:44:01,101 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 51 selfloop transitions, 11 changer transitions 7/69 dead transitions. [2025-04-14 00:44:01,101 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 69 transitions, 367 flow [2025-04-14 00:44:01,102 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 00:44:01,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-14 00:44:01,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 85 transitions. [2025-04-14 00:44:01,104 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4292929292929293 [2025-04-14 00:44:01,104 INFO L175 Difference]: Start difference. First operand has 43 places, 32 transitions, 134 flow. Second operand 6 states and 85 transitions. [2025-04-14 00:44:01,104 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 69 transitions, 367 flow [2025-04-14 00:44:01,106 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 69 transitions, 351 flow, removed 6 selfloop flow, removed 3 redundant places. [2025-04-14 00:44:01,109 INFO L231 Difference]: Finished difference. Result has 48 places, 38 transitions, 188 flow [2025-04-14 00:44:01,109 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=188, PETRI_PLACES=48, PETRI_TRANSITIONS=38} [2025-04-14 00:44:01,110 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 18 predicate places. [2025-04-14 00:44:01,111 INFO L485 AbstractCegarLoop]: Abstraction has has 48 places, 38 transitions, 188 flow [2025-04-14 00:44:01,111 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:44:01,111 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:44:01,111 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:44:01,111 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-14 00:44:01,111 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 00:44:01,111 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:44:01,111 INFO L85 PathProgramCache]: Analyzing trace with hash 740262829, now seen corresponding path program 6 times [2025-04-14 00:44:01,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:44:01,112 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103601962] [2025-04-14 00:44:01,112 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 00:44:01,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:44:01,120 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 18 statements into 1 equivalence classes. [2025-04-14 00:44:01,154 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-14 00:44:01,154 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-14 00:44:01,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:44:01,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:44:01,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:44:01,391 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103601962] [2025-04-14 00:44:01,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103601962] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:44:01,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:44:01,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 00:44:01,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214940786] [2025-04-14 00:44:01,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:44:01,392 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 00:44:01,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:44:01,392 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 00:44:01,392 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-14 00:44:01,392 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2025-04-14 00:44:01,393 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 38 transitions, 188 flow. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:44:01,393 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:44:01,393 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2025-04-14 00:44:01,393 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:44:01,598 INFO L116 PetriNetUnfolderBase]: 379/583 cut-off events. [2025-04-14 00:44:01,598 INFO L117 PetriNetUnfolderBase]: For 1020/1020 co-relation queries the response was YES. [2025-04-14 00:44:01,599 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1626 conditions, 583 events. 379/583 cut-off events. For 1020/1020 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 1877 event pairs, 188 based on Foata normal form. 1/451 useless extension candidates. Maximal degree in co-relation 1613. Up to 455 conditions per place. [2025-04-14 00:44:01,604 INFO L140 encePairwiseOnDemand]: 29/33 looper letters, 55 selfloop transitions, 3 changer transitions 7/65 dead transitions. [2025-04-14 00:44:01,604 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 65 transitions, 391 flow [2025-04-14 00:44:01,604 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 00:44:01,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 00:44:01,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 72 transitions. [2025-04-14 00:44:01,605 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.43636363636363634 [2025-04-14 00:44:01,605 INFO L175 Difference]: Start difference. First operand has 48 places, 38 transitions, 188 flow. Second operand 5 states and 72 transitions. [2025-04-14 00:44:01,605 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 65 transitions, 391 flow [2025-04-14 00:44:01,607 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 65 transitions, 383 flow, removed 3 selfloop flow, removed 2 redundant places. [2025-04-14 00:44:01,607 INFO L231 Difference]: Finished difference. Result has 50 places, 38 transitions, 189 flow [2025-04-14 00:44:01,609 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=189, PETRI_PLACES=50, PETRI_TRANSITIONS=38} [2025-04-14 00:44:01,610 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 20 predicate places. [2025-04-14 00:44:01,610 INFO L485 AbstractCegarLoop]: Abstraction has has 50 places, 38 transitions, 189 flow [2025-04-14 00:44:01,610 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:44:01,610 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:44:01,610 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:44:01,610 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-14 00:44:01,611 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 00:44:01,611 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:44:01,611 INFO L85 PathProgramCache]: Analyzing trace with hash 1168949073, now seen corresponding path program 1 times [2025-04-14 00:44:01,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:44:01,611 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690789934] [2025-04-14 00:44:01,611 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:44:01,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:44:01,617 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-14 00:44:01,623 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-14 00:44:01,623 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:44:01,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:44:01,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:44:01,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:44:01,674 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690789934] [2025-04-14 00:44:01,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690789934] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:44:01,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:44:01,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 00:44:01,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594268517] [2025-04-14 00:44:01,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:44:01,674 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 00:44:01,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:44:01,675 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 00:44:01,675 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-14 00:44:01,675 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2025-04-14 00:44:01,675 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 38 transitions, 189 flow. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:44:01,675 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:44:01,675 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2025-04-14 00:44:01,675 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:44:01,854 INFO L116 PetriNetUnfolderBase]: 441/683 cut-off events. [2025-04-14 00:44:01,855 INFO L117 PetriNetUnfolderBase]: For 1283/1283 co-relation queries the response was YES. [2025-04-14 00:44:01,856 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1853 conditions, 683 events. 441/683 cut-off events. For 1283/1283 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2499 event pairs, 31 based on Foata normal form. 11/528 useless extension candidates. Maximal degree in co-relation 1839. Up to 403 conditions per place. [2025-04-14 00:44:01,858 INFO L140 encePairwiseOnDemand]: 29/33 looper letters, 58 selfloop transitions, 6 changer transitions 0/64 dead transitions. [2025-04-14 00:44:01,858 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 64 transitions, 413 flow [2025-04-14 00:44:01,858 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 00:44:01,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-14 00:44:01,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 67 transitions. [2025-04-14 00:44:01,859 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5075757575757576 [2025-04-14 00:44:01,859 INFO L175 Difference]: Start difference. First operand has 50 places, 38 transitions, 189 flow. Second operand 4 states and 67 transitions. [2025-04-14 00:44:01,859 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 64 transitions, 413 flow [2025-04-14 00:44:01,860 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 64 transitions, 404 flow, removed 3 selfloop flow, removed 3 redundant places. [2025-04-14 00:44:01,861 INFO L231 Difference]: Finished difference. Result has 51 places, 43 transitions, 241 flow [2025-04-14 00:44:01,861 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=241, PETRI_PLACES=51, PETRI_TRANSITIONS=43} [2025-04-14 00:44:01,862 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 21 predicate places. [2025-04-14 00:44:01,862 INFO L485 AbstractCegarLoop]: Abstraction has has 51 places, 43 transitions, 241 flow [2025-04-14 00:44:01,862 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:44:01,862 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:44:01,862 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:44:01,862 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-14 00:44:01,862 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 00:44:01,862 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:44:01,862 INFO L85 PathProgramCache]: Analyzing trace with hash 915543115, now seen corresponding path program 2 times [2025-04-14 00:44:01,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:44:01,862 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125170875] [2025-04-14 00:44:01,863 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:44:01,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:44:01,871 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 1 equivalence classes. [2025-04-14 00:44:01,876 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-14 00:44:01,877 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 00:44:01,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:44:01,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:44:01,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:44:01,915 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125170875] [2025-04-14 00:44:01,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125170875] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:44:01,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:44:01,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 00:44:01,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379357245] [2025-04-14 00:44:01,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:44:01,916 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 00:44:01,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:44:01,916 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 00:44:01,916 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-14 00:44:01,916 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2025-04-14 00:44:01,916 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 43 transitions, 241 flow. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:44:01,916 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:44:01,916 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2025-04-14 00:44:01,916 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:44:02,040 INFO L116 PetriNetUnfolderBase]: 416/645 cut-off events. [2025-04-14 00:44:02,040 INFO L117 PetriNetUnfolderBase]: For 1360/1360 co-relation queries the response was YES. [2025-04-14 00:44:02,041 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1919 conditions, 645 events. 416/645 cut-off events. For 1360/1360 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 2267 event pairs, 38 based on Foata normal form. 11/499 useless extension candidates. Maximal degree in co-relation 1905. Up to 369 conditions per place. [2025-04-14 00:44:02,044 INFO L140 encePairwiseOnDemand]: 29/33 looper letters, 61 selfloop transitions, 8 changer transitions 0/69 dead transitions. [2025-04-14 00:44:02,045 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 69 transitions, 500 flow [2025-04-14 00:44:02,045 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 00:44:02,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-14 00:44:02,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 66 transitions. [2025-04-14 00:44:02,046 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5 [2025-04-14 00:44:02,046 INFO L175 Difference]: Start difference. First operand has 51 places, 43 transitions, 241 flow. Second operand 4 states and 66 transitions. [2025-04-14 00:44:02,046 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 69 transitions, 500 flow [2025-04-14 00:44:02,048 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 69 transitions, 500 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-14 00:44:02,049 INFO L231 Difference]: Finished difference. Result has 57 places, 48 transitions, 326 flow [2025-04-14 00:44:02,049 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=241, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=326, PETRI_PLACES=57, PETRI_TRANSITIONS=48} [2025-04-14 00:44:02,049 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 27 predicate places. [2025-04-14 00:44:02,049 INFO L485 AbstractCegarLoop]: Abstraction has has 57 places, 48 transitions, 326 flow [2025-04-14 00:44:02,050 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:44:02,050 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:44:02,050 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:44:02,050 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-14 00:44:02,050 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 00:44:02,050 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:44:02,050 INFO L85 PathProgramCache]: Analyzing trace with hash -1929639561, now seen corresponding path program 3 times [2025-04-14 00:44:02,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:44:02,050 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600250553] [2025-04-14 00:44:02,050 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 00:44:02,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:44:02,060 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 19 statements into 1 equivalence classes. [2025-04-14 00:44:02,064 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-14 00:44:02,064 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-14 00:44:02,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:44:02,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:44:02,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:44:02,117 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600250553] [2025-04-14 00:44:02,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600250553] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:44:02,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:44:02,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 00:44:02,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257285889] [2025-04-14 00:44:02,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:44:02,117 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 00:44:02,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:44:02,117 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 00:44:02,117 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-14 00:44:02,117 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2025-04-14 00:44:02,118 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 48 transitions, 326 flow. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:44:02,118 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:44:02,118 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2025-04-14 00:44:02,118 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:44:02,255 INFO L116 PetriNetUnfolderBase]: 397/613 cut-off events. [2025-04-14 00:44:02,255 INFO L117 PetriNetUnfolderBase]: For 1733/1733 co-relation queries the response was YES. [2025-04-14 00:44:02,256 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2022 conditions, 613 events. 397/613 cut-off events. For 1733/1733 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2125 event pairs, 67 based on Foata normal form. 5/470 useless extension candidates. Maximal degree in co-relation 2005. Up to 399 conditions per place. [2025-04-14 00:44:02,258 INFO L140 encePairwiseOnDemand]: 28/33 looper letters, 60 selfloop transitions, 11 changer transitions 1/72 dead transitions. [2025-04-14 00:44:02,258 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 72 transitions, 551 flow [2025-04-14 00:44:02,259 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 00:44:02,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 00:44:02,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 74 transitions. [2025-04-14 00:44:02,259 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4484848484848485 [2025-04-14 00:44:02,259 INFO L175 Difference]: Start difference. First operand has 57 places, 48 transitions, 326 flow. Second operand 5 states and 74 transitions. [2025-04-14 00:44:02,259 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 72 transitions, 551 flow [2025-04-14 00:44:02,262 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 72 transitions, 549 flow, removed 1 selfloop flow, removed 0 redundant places. [2025-04-14 00:44:02,263 INFO L231 Difference]: Finished difference. Result has 62 places, 49 transitions, 359 flow [2025-04-14 00:44:02,263 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=324, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=359, PETRI_PLACES=62, PETRI_TRANSITIONS=49} [2025-04-14 00:44:02,264 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 32 predicate places. [2025-04-14 00:44:02,264 INFO L485 AbstractCegarLoop]: Abstraction has has 62 places, 49 transitions, 359 flow [2025-04-14 00:44:02,264 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:44:02,264 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:44:02,264 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:44:02,264 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-14 00:44:02,264 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 00:44:02,264 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:44:02,264 INFO L85 PathProgramCache]: Analyzing trace with hash -1497639403, now seen corresponding path program 1 times [2025-04-14 00:44:02,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:44:02,264 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030630482] [2025-04-14 00:44:02,265 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:44:02,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:44:02,274 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-14 00:44:02,280 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-14 00:44:02,281 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:44:02,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:44:02,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:44:02,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:44:02,329 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030630482] [2025-04-14 00:44:02,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030630482] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:44:02,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:44:02,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 00:44:02,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229772788] [2025-04-14 00:44:02,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:44:02,329 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 00:44:02,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:44:02,329 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 00:44:02,329 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-14 00:44:02,330 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2025-04-14 00:44:02,330 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 49 transitions, 359 flow. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:44:02,330 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:44:02,330 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2025-04-14 00:44:02,330 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:44:02,458 INFO L116 PetriNetUnfolderBase]: 446/695 cut-off events. [2025-04-14 00:44:02,458 INFO L117 PetriNetUnfolderBase]: For 2397/2397 co-relation queries the response was YES. [2025-04-14 00:44:02,460 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2238 conditions, 695 events. 446/695 cut-off events. For 2397/2397 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2569 event pairs, 49 based on Foata normal form. 10/530 useless extension candidates. Maximal degree in co-relation 2219. Up to 461 conditions per place. [2025-04-14 00:44:02,462 INFO L140 encePairwiseOnDemand]: 29/33 looper letters, 61 selfloop transitions, 10 changer transitions 0/71 dead transitions. [2025-04-14 00:44:02,462 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 71 transitions, 577 flow [2025-04-14 00:44:02,462 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 00:44:02,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-14 00:44:02,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 66 transitions. [2025-04-14 00:44:02,463 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5 [2025-04-14 00:44:02,463 INFO L175 Difference]: Start difference. First operand has 62 places, 49 transitions, 359 flow. Second operand 4 states and 66 transitions. [2025-04-14 00:44:02,463 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 71 transitions, 577 flow [2025-04-14 00:44:02,466 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 71 transitions, 542 flow, removed 5 selfloop flow, removed 4 redundant places. [2025-04-14 00:44:02,467 INFO L231 Difference]: Finished difference. Result has 62 places, 52 transitions, 386 flow [2025-04-14 00:44:02,467 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=326, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=386, PETRI_PLACES=62, PETRI_TRANSITIONS=52} [2025-04-14 00:44:02,468 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 32 predicate places. [2025-04-14 00:44:02,468 INFO L485 AbstractCegarLoop]: Abstraction has has 62 places, 52 transitions, 386 flow [2025-04-14 00:44:02,468 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:44:02,468 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:44:02,468 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:44:02,468 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-14 00:44:02,468 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 00:44:02,469 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:44:02,469 INFO L85 PathProgramCache]: Analyzing trace with hash 391637373, now seen corresponding path program 2 times [2025-04-14 00:44:02,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:44:02,469 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236765659] [2025-04-14 00:44:02,469 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:44:02,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:44:02,475 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 1 equivalence classes. [2025-04-14 00:44:02,481 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-14 00:44:02,481 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 00:44:02,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:44:02,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:44:02,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:44:02,526 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236765659] [2025-04-14 00:44:02,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236765659] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:44:02,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:44:02,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 00:44:02,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528446151] [2025-04-14 00:44:02,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:44:02,526 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 00:44:02,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:44:02,527 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 00:44:02,527 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-14 00:44:02,527 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2025-04-14 00:44:02,527 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 52 transitions, 386 flow. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:44:02,527 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:44:02,527 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2025-04-14 00:44:02,527 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:44:02,706 INFO L116 PetriNetUnfolderBase]: 424/659 cut-off events. [2025-04-14 00:44:02,706 INFO L117 PetriNetUnfolderBase]: For 1802/1802 co-relation queries the response was YES. [2025-04-14 00:44:02,711 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2236 conditions, 659 events. 424/659 cut-off events. For 1802/1802 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 2358 event pairs, 74 based on Foata normal form. 6/500 useless extension candidates. Maximal degree in co-relation 2219. Up to 461 conditions per place. [2025-04-14 00:44:02,715 INFO L140 encePairwiseOnDemand]: 28/33 looper letters, 63 selfloop transitions, 11 changer transitions 2/76 dead transitions. [2025-04-14 00:44:02,715 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 76 transitions, 620 flow [2025-04-14 00:44:02,716 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 00:44:02,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 00:44:02,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 74 transitions. [2025-04-14 00:44:02,717 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4484848484848485 [2025-04-14 00:44:02,717 INFO L175 Difference]: Start difference. First operand has 62 places, 52 transitions, 386 flow. Second operand 5 states and 74 transitions. [2025-04-14 00:44:02,717 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 76 transitions, 620 flow [2025-04-14 00:44:02,721 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 76 transitions, 602 flow, removed 5 selfloop flow, removed 1 redundant places. [2025-04-14 00:44:02,722 INFO L231 Difference]: Finished difference. Result has 66 places, 54 transitions, 419 flow [2025-04-14 00:44:02,722 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=372, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=419, PETRI_PLACES=66, PETRI_TRANSITIONS=54} [2025-04-14 00:44:02,722 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 36 predicate places. [2025-04-14 00:44:02,722 INFO L485 AbstractCegarLoop]: Abstraction has has 66 places, 54 transitions, 419 flow [2025-04-14 00:44:02,722 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:44:02,724 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:44:02,724 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:44:02,724 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-14 00:44:02,724 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 00:44:02,724 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:44:02,724 INFO L85 PathProgramCache]: Analyzing trace with hash -1060475621, now seen corresponding path program 3 times [2025-04-14 00:44:02,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:44:02,724 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416470505] [2025-04-14 00:44:02,724 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 00:44:02,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:44:02,733 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 19 statements into 1 equivalence classes. [2025-04-14 00:44:02,742 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-14 00:44:02,742 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-14 00:44:02,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:44:02,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:44:02,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:44:02,787 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416470505] [2025-04-14 00:44:02,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416470505] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:44:02,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:44:02,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 00:44:02,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976310465] [2025-04-14 00:44:02,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:44:02,787 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 00:44:02,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:44:02,788 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 00:44:02,788 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-14 00:44:02,788 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2025-04-14 00:44:02,788 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 54 transitions, 419 flow. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:44:02,788 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:44:02,788 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2025-04-14 00:44:02,788 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:44:02,922 INFO L116 PetriNetUnfolderBase]: 383/591 cut-off events. [2025-04-14 00:44:02,922 INFO L117 PetriNetUnfolderBase]: For 2198/2198 co-relation queries the response was YES. [2025-04-14 00:44:02,924 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2061 conditions, 591 events. 383/591 cut-off events. For 2198/2198 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1962 event pairs, 120 based on Foata normal form. 11/456 useless extension candidates. Maximal degree in co-relation 2043. Up to 399 conditions per place. [2025-04-14 00:44:02,926 INFO L140 encePairwiseOnDemand]: 28/33 looper letters, 70 selfloop transitions, 7 changer transitions 4/81 dead transitions. [2025-04-14 00:44:02,926 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 81 transitions, 643 flow [2025-04-14 00:44:02,926 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 00:44:02,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 00:44:02,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 76 transitions. [2025-04-14 00:44:02,927 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.46060606060606063 [2025-04-14 00:44:02,927 INFO L175 Difference]: Start difference. First operand has 66 places, 54 transitions, 419 flow. Second operand 5 states and 76 transitions. [2025-04-14 00:44:02,927 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 81 transitions, 643 flow [2025-04-14 00:44:02,931 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 81 transitions, 629 flow, removed 3 selfloop flow, removed 1 redundant places. [2025-04-14 00:44:02,932 INFO L231 Difference]: Finished difference. Result has 70 places, 52 transitions, 388 flow [2025-04-14 00:44:02,932 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=405, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=388, PETRI_PLACES=70, PETRI_TRANSITIONS=52} [2025-04-14 00:44:02,933 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 40 predicate places. [2025-04-14 00:44:02,933 INFO L485 AbstractCegarLoop]: Abstraction has has 70 places, 52 transitions, 388 flow [2025-04-14 00:44:02,934 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:44:02,934 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:44:02,934 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:44:02,934 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-04-14 00:44:02,934 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 00:44:02,935 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:44:02,935 INFO L85 PathProgramCache]: Analyzing trace with hash -753920491, now seen corresponding path program 4 times [2025-04-14 00:44:02,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:44:02,935 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142230759] [2025-04-14 00:44:02,935 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 00:44:02,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:44:02,940 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 19 statements into 2 equivalence classes. [2025-04-14 00:44:02,947 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 14 of 19 statements. [2025-04-14 00:44:02,947 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-14 00:44:02,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:44:02,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:44:02,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:44:02,961 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142230759] [2025-04-14 00:44:02,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142230759] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:44:02,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:44:02,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 00:44:02,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268014496] [2025-04-14 00:44:02,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:44:02,962 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 00:44:02,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:44:02,963 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 00:44:02,963 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-14 00:44:02,963 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2025-04-14 00:44:02,963 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 52 transitions, 388 flow. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:44:02,963 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:44:02,963 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2025-04-14 00:44:02,963 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:44:03,092 INFO L116 PetriNetUnfolderBase]: 343/522 cut-off events. [2025-04-14 00:44:03,093 INFO L117 PetriNetUnfolderBase]: For 2029/2029 co-relation queries the response was YES. [2025-04-14 00:44:03,094 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1800 conditions, 522 events. 343/522 cut-off events. For 2029/2029 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1625 event pairs, 27 based on Foata normal form. 10/402 useless extension candidates. Maximal degree in co-relation 1781. Up to 302 conditions per place. [2025-04-14 00:44:03,095 INFO L140 encePairwiseOnDemand]: 29/33 looper letters, 58 selfloop transitions, 14 changer transitions 2/74 dead transitions. [2025-04-14 00:44:03,096 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 74 transitions, 587 flow [2025-04-14 00:44:03,096 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 00:44:03,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 00:44:03,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 75 transitions. [2025-04-14 00:44:03,096 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.45454545454545453 [2025-04-14 00:44:03,096 INFO L175 Difference]: Start difference. First operand has 70 places, 52 transitions, 388 flow. Second operand 5 states and 75 transitions. [2025-04-14 00:44:03,096 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 74 transitions, 587 flow [2025-04-14 00:44:03,099 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 74 transitions, 561 flow, removed 6 selfloop flow, removed 5 redundant places. [2025-04-14 00:44:03,100 INFO L231 Difference]: Finished difference. Result has 69 places, 51 transitions, 372 flow [2025-04-14 00:44:03,100 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=362, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=372, PETRI_PLACES=69, PETRI_TRANSITIONS=51} [2025-04-14 00:44:03,100 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 39 predicate places. [2025-04-14 00:44:03,100 INFO L485 AbstractCegarLoop]: Abstraction has has 69 places, 51 transitions, 372 flow [2025-04-14 00:44:03,100 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:44:03,100 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:44:03,100 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:44:03,100 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-04-14 00:44:03,101 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 00:44:03,101 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:44:03,101 INFO L85 PathProgramCache]: Analyzing trace with hash -1198885887, now seen corresponding path program 4 times [2025-04-14 00:44:03,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:44:03,101 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756528036] [2025-04-14 00:44:03,101 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 00:44:03,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:44:03,107 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 19 statements into 2 equivalence classes. [2025-04-14 00:44:03,108 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 14 of 19 statements. [2025-04-14 00:44:03,108 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-14 00:44:03,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:44:03,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:44:03,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:44:03,122 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756528036] [2025-04-14 00:44:03,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756528036] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:44:03,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:44:03,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 00:44:03,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432297692] [2025-04-14 00:44:03,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:44:03,122 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 00:44:03,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:44:03,123 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 00:44:03,123 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-14 00:44:03,123 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2025-04-14 00:44:03,123 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 51 transitions, 372 flow. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:44:03,123 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:44:03,123 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2025-04-14 00:44:03,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:44:03,228 INFO L116 PetriNetUnfolderBase]: 330/503 cut-off events. [2025-04-14 00:44:03,228 INFO L117 PetriNetUnfolderBase]: For 1324/1324 co-relation queries the response was YES. [2025-04-14 00:44:03,229 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1708 conditions, 503 events. 330/503 cut-off events. For 1324/1324 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1564 event pairs, 77 based on Foata normal form. 4/379 useless extension candidates. Maximal degree in co-relation 1691. Up to 324 conditions per place. [2025-04-14 00:44:03,231 INFO L140 encePairwiseOnDemand]: 30/33 looper letters, 55 selfloop transitions, 6 changer transitions 4/65 dead transitions. [2025-04-14 00:44:03,231 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 65 transitions, 534 flow [2025-04-14 00:44:03,231 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 00:44:03,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-14 00:44:03,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 58 transitions. [2025-04-14 00:44:03,231 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4393939393939394 [2025-04-14 00:44:03,231 INFO L175 Difference]: Start difference. First operand has 69 places, 51 transitions, 372 flow. Second operand 4 states and 58 transitions. [2025-04-14 00:44:03,231 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 65 transitions, 534 flow [2025-04-14 00:44:03,234 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 65 transitions, 499 flow, removed 7 selfloop flow, removed 4 redundant places. [2025-04-14 00:44:03,234 INFO L231 Difference]: Finished difference. Result has 68 places, 50 transitions, 341 flow [2025-04-14 00:44:03,234 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=337, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=341, PETRI_PLACES=68, PETRI_TRANSITIONS=50} [2025-04-14 00:44:03,235 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 38 predicate places. [2025-04-14 00:44:03,235 INFO L485 AbstractCegarLoop]: Abstraction has has 68 places, 50 transitions, 341 flow [2025-04-14 00:44:03,235 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:44:03,235 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:44:03,235 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:44:03,235 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-04-14 00:44:03,235 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 00:44:03,235 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:44:03,235 INFO L85 PathProgramCache]: Analyzing trace with hash -1729221349, now seen corresponding path program 5 times [2025-04-14 00:44:03,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:44:03,235 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618309687] [2025-04-14 00:44:03,236 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 00:44:03,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:44:03,242 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 19 statements into 1 equivalence classes. [2025-04-14 00:44:03,247 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-14 00:44:03,247 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 00:44:03,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:44:03,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:44:03,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:44:03,281 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618309687] [2025-04-14 00:44:03,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618309687] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:44:03,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:44:03,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 00:44:03,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354911473] [2025-04-14 00:44:03,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:44:03,281 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 00:44:03,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:44:03,282 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 00:44:03,282 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-14 00:44:03,282 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2025-04-14 00:44:03,282 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 50 transitions, 341 flow. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:44:03,282 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:44:03,282 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2025-04-14 00:44:03,282 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:44:03,391 INFO L116 PetriNetUnfolderBase]: 326/499 cut-off events. [2025-04-14 00:44:03,391 INFO L117 PetriNetUnfolderBase]: For 980/980 co-relation queries the response was YES. [2025-04-14 00:44:03,392 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1666 conditions, 499 events. 326/499 cut-off events. For 980/980 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1532 event pairs, 132 based on Foata normal form. 4/375 useless extension candidates. Maximal degree in co-relation 1650. Up to 441 conditions per place. [2025-04-14 00:44:03,393 INFO L140 encePairwiseOnDemand]: 30/33 looper letters, 56 selfloop transitions, 1 changer transitions 7/64 dead transitions. [2025-04-14 00:44:03,393 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 64 transitions, 501 flow [2025-04-14 00:44:03,394 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 00:44:03,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-14 00:44:03,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 57 transitions. [2025-04-14 00:44:03,394 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4318181818181818 [2025-04-14 00:44:03,394 INFO L175 Difference]: Start difference. First operand has 68 places, 50 transitions, 341 flow. Second operand 4 states and 57 transitions. [2025-04-14 00:44:03,394 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 64 transitions, 501 flow [2025-04-14 00:44:03,396 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 64 transitions, 487 flow, removed 1 selfloop flow, removed 3 redundant places. [2025-04-14 00:44:03,396 INFO L231 Difference]: Finished difference. Result has 68 places, 48 transitions, 311 flow [2025-04-14 00:44:03,397 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=327, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=311, PETRI_PLACES=68, PETRI_TRANSITIONS=48} [2025-04-14 00:44:03,397 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 38 predicate places. [2025-04-14 00:44:03,397 INFO L485 AbstractCegarLoop]: Abstraction has has 68 places, 48 transitions, 311 flow [2025-04-14 00:44:03,397 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:44:03,397 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:44:03,397 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:44:03,397 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-04-14 00:44:03,397 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 00:44:03,398 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:44:03,398 INFO L85 PathProgramCache]: Analyzing trace with hash 1023861099, now seen corresponding path program 5 times [2025-04-14 00:44:03,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:44:03,399 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531604752] [2025-04-14 00:44:03,399 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 00:44:03,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:44:03,405 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 19 statements into 1 equivalence classes. [2025-04-14 00:44:03,409 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-14 00:44:03,410 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 00:44:03,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:44:03,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:44:03,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:44:03,443 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531604752] [2025-04-14 00:44:03,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531604752] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:44:03,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:44:03,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 00:44:03,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244975563] [2025-04-14 00:44:03,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:44:03,444 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 00:44:03,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:44:03,444 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 00:44:03,444 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-14 00:44:03,444 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2025-04-14 00:44:03,444 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 48 transitions, 311 flow. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:44:03,445 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:44:03,445 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2025-04-14 00:44:03,445 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:44:03,542 INFO L116 PetriNetUnfolderBase]: 301/453 cut-off events. [2025-04-14 00:44:03,542 INFO L117 PetriNetUnfolderBase]: For 620/620 co-relation queries the response was YES. [2025-04-14 00:44:03,544 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1508 conditions, 453 events. 301/453 cut-off events. For 620/620 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1303 event pairs, 134 based on Foata normal form. 4/340 useless extension candidates. Maximal degree in co-relation 1493. Up to 443 conditions per place. [2025-04-14 00:44:03,546 INFO L140 encePairwiseOnDemand]: 30/33 looper letters, 45 selfloop transitions, 0 changer transitions 6/51 dead transitions. [2025-04-14 00:44:03,546 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 51 transitions, 404 flow [2025-04-14 00:44:03,547 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 00:44:03,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-14 00:44:03,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 46 transitions. [2025-04-14 00:44:03,547 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3484848484848485 [2025-04-14 00:44:03,547 INFO L175 Difference]: Start difference. First operand has 68 places, 48 transitions, 311 flow. Second operand 4 states and 46 transitions. [2025-04-14 00:44:03,547 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 51 transitions, 404 flow [2025-04-14 00:44:03,549 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 51 transitions, 399 flow, removed 1 selfloop flow, removed 3 redundant places. [2025-04-14 00:44:03,549 INFO L231 Difference]: Finished difference. Result has 65 places, 45 transitions, 272 flow [2025-04-14 00:44:03,549 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=289, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=272, PETRI_PLACES=65, PETRI_TRANSITIONS=45} [2025-04-14 00:44:03,550 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 35 predicate places. [2025-04-14 00:44:03,550 INFO L485 AbstractCegarLoop]: Abstraction has has 65 places, 45 transitions, 272 flow [2025-04-14 00:44:03,550 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:44:03,550 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:44:03,550 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:44:03,550 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-04-14 00:44:03,550 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 00:44:03,551 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:44:03,551 INFO L85 PathProgramCache]: Analyzing trace with hash -712509827, now seen corresponding path program 6 times [2025-04-14 00:44:03,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:44:03,551 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149910434] [2025-04-14 00:44:03,551 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 00:44:03,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:44:03,557 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 19 statements into 1 equivalence classes. [2025-04-14 00:44:03,566 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-14 00:44:03,566 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-14 00:44:03,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:44:03,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:44:03,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:44:03,638 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149910434] [2025-04-14 00:44:03,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149910434] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:44:03,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:44:03,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 00:44:03,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615451234] [2025-04-14 00:44:03,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:44:03,639 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 00:44:03,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:44:03,639 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 00:44:03,639 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-14 00:44:03,639 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2025-04-14 00:44:03,639 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 45 transitions, 272 flow. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:44:03,639 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:44:03,639 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2025-04-14 00:44:03,639 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:44:03,775 INFO L116 PetriNetUnfolderBase]: 276/408 cut-off events. [2025-04-14 00:44:03,775 INFO L117 PetriNetUnfolderBase]: For 486/486 co-relation queries the response was YES. [2025-04-14 00:44:03,776 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1358 conditions, 408 events. 276/408 cut-off events. For 486/486 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1143 event pairs, 40 based on Foata normal form. 4/307 useless extension candidates. Maximal degree in co-relation 1345. Up to 350 conditions per place. [2025-04-14 00:44:03,778 INFO L140 encePairwiseOnDemand]: 29/33 looper letters, 45 selfloop transitions, 4 changer transitions 4/53 dead transitions. [2025-04-14 00:44:03,778 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 53 transitions, 383 flow [2025-04-14 00:44:03,778 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 00:44:03,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-14 00:44:03,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 52 transitions. [2025-04-14 00:44:03,779 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3939393939393939 [2025-04-14 00:44:03,779 INFO L175 Difference]: Start difference. First operand has 65 places, 45 transitions, 272 flow. Second operand 4 states and 52 transitions. [2025-04-14 00:44:03,779 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 53 transitions, 383 flow [2025-04-14 00:44:03,780 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 53 transitions, 381 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-04-14 00:44:03,781 INFO L231 Difference]: Finished difference. Result has 59 places, 43 transitions, 251 flow [2025-04-14 00:44:03,781 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=255, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=251, PETRI_PLACES=59, PETRI_TRANSITIONS=43} [2025-04-14 00:44:03,782 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 29 predicate places. [2025-04-14 00:44:03,782 INFO L485 AbstractCegarLoop]: Abstraction has has 59 places, 43 transitions, 251 flow [2025-04-14 00:44:03,782 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:44:03,782 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:44:03,782 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:44:03,782 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-04-14 00:44:03,782 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 00:44:03,783 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:44:03,783 INFO L85 PathProgramCache]: Analyzing trace with hash 1073178357, now seen corresponding path program 1 times [2025-04-14 00:44:03,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:44:03,783 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426447896] [2025-04-14 00:44:03,784 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:44:03,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:44:03,792 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-14 00:44:03,807 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-14 00:44:03,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:44:03,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:44:04,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:44:04,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:44:04,180 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426447896] [2025-04-14 00:44:04,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426447896] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:44:04,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:44:04,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-14 00:44:04,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901558320] [2025-04-14 00:44:04,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:44:04,180 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-14 00:44:04,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:44:04,181 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-14 00:44:04,181 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-04-14 00:44:04,181 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2025-04-14 00:44:04,181 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 43 transitions, 251 flow. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:44:04,181 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:44:04,181 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2025-04-14 00:44:04,181 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:44:04,456 INFO L116 PetriNetUnfolderBase]: 472/723 cut-off events. [2025-04-14 00:44:04,456 INFO L117 PetriNetUnfolderBase]: For 995/995 co-relation queries the response was YES. [2025-04-14 00:44:04,457 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2480 conditions, 723 events. 472/723 cut-off events. For 995/995 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2561 event pairs, 90 based on Foata normal form. 1/582 useless extension candidates. Maximal degree in co-relation 2467. Up to 204 conditions per place. [2025-04-14 00:44:04,459 INFO L140 encePairwiseOnDemand]: 19/33 looper letters, 57 selfloop transitions, 8 changer transitions 56/121 dead transitions. [2025-04-14 00:44:04,459 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 121 transitions, 939 flow [2025-04-14 00:44:04,459 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-14 00:44:04,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-14 00:44:04,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 118 transitions. [2025-04-14 00:44:04,460 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3575757575757576 [2025-04-14 00:44:04,460 INFO L175 Difference]: Start difference. First operand has 59 places, 43 transitions, 251 flow. Second operand 10 states and 118 transitions. [2025-04-14 00:44:04,460 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 121 transitions, 939 flow [2025-04-14 00:44:04,461 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 121 transitions, 887 flow, removed 4 selfloop flow, removed 5 redundant places. [2025-04-14 00:44:04,462 INFO L231 Difference]: Finished difference. Result has 65 places, 48 transitions, 331 flow [2025-04-14 00:44:04,462 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=227, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=331, PETRI_PLACES=65, PETRI_TRANSITIONS=48} [2025-04-14 00:44:04,463 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 35 predicate places. [2025-04-14 00:44:04,463 INFO L485 AbstractCegarLoop]: Abstraction has has 65 places, 48 transitions, 331 flow [2025-04-14 00:44:04,463 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:44:04,463 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:44:04,463 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] [2025-04-14 00:44:04,463 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-04-14 00:44:04,463 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 00:44:04,463 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:44:04,463 INFO L85 PathProgramCache]: Analyzing trace with hash 1969321121, now seen corresponding path program 1 times [2025-04-14 00:44:04,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:44:04,464 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452889859] [2025-04-14 00:44:04,464 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:44:04,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:44:04,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-14 00:44:04,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-14 00:44:04,475 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:44:04,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:44:04,619 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:44:04,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:44:04,620 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452889859] [2025-04-14 00:44:04,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452889859] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:44:04,620 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2068595454] [2025-04-14 00:44:04,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:44:04,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:44:04,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:44:04,623 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 00:44:04,623 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-04-14 00:44:04,690 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-14 00:44:04,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-14 00:44:04,717 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:44:04,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:44:04,728 INFO L256 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-04-14 00:44:04,732 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:44:05,354 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:44:05,354 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:44:09,517 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 00:44:09,518 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 13 select indices, 13 select index equivalence classes, 0 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 78 case distinctions, treesize of input 395 treesize of output 1342 [2025-04-14 00:49:34,851 WARN L249 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) stderr output: (error "out of memory") [2025-04-14 00:49:34,852 WARN L310 FreeRefinementEngine]: Global settings require throwing the following exception [2025-04-14 00:49:34,859 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 101 [2025-04-14 00:49:34,862 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-14 00:49:35,053 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:49:35,054 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.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) ... 78 more [2025-04-14 00:49:35,059 INFO L158 Benchmark]: Toolchain (without parser) took 339433.30ms. Allocated memory was 142.6MB in the beginning and 679.5MB in the end (delta: 536.9MB). Free memory was 101.3MB in the beginning and 377.7MB in the end (delta: -276.4MB). Peak memory consumption was 413.1MB. Max. memory is 8.0GB. [2025-04-14 00:49:35,059 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 159.4MB. Free memory is still 87.7MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 00:49:35,059 INFO L158 Benchmark]: CACSL2BoogieTranslator took 297.98ms. Allocated memory is still 142.6MB. Free memory was 101.3MB in the beginning and 85.4MB in the end (delta: 15.9MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-14 00:49:35,060 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.42ms. Allocated memory is still 142.6MB. Free memory was 85.4MB in the beginning and 83.3MB in the end (delta: 2.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-14 00:49:35,060 INFO L158 Benchmark]: Boogie Preprocessor took 48.60ms. Allocated memory is still 142.6MB. Free memory was 83.3MB in the beginning and 81.2MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 00:49:35,060 INFO L158 Benchmark]: IcfgBuilder took 879.85ms. Allocated memory is still 142.6MB. Free memory was 81.2MB in the beginning and 54.7MB in the end (delta: 26.5MB). Peak memory consumption was 65.5MB. Max. memory is 8.0GB. [2025-04-14 00:49:35,060 INFO L158 Benchmark]: TraceAbstraction took 338154.52ms. Allocated memory was 142.6MB in the beginning and 679.5MB in the end (delta: 536.9MB). Free memory was 53.9MB in the beginning and 377.7MB in the end (delta: -323.8MB). Peak memory consumption was 368.6MB. Max. memory is 8.0GB. [2025-04-14 00:49:35,061 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 159.4MB. Free memory is still 87.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 297.98ms. Allocated memory is still 142.6MB. Free memory was 101.3MB in the beginning and 85.4MB in the end (delta: 15.9MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 47.42ms. Allocated memory is still 142.6MB. Free memory was 85.4MB in the beginning and 83.3MB in the end (delta: 2.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 48.60ms. Allocated memory is still 142.6MB. Free memory was 83.3MB in the beginning and 81.2MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 8.0GB. * IcfgBuilder took 879.85ms. Allocated memory is still 142.6MB. Free memory was 81.2MB in the beginning and 54.7MB in the end (delta: 26.5MB). Peak memory consumption was 65.5MB. Max. memory is 8.0GB. * TraceAbstraction took 338154.52ms. Allocated memory was 142.6MB in the beginning and 679.5MB in the end (delta: 536.9MB). Free memory was 53.9MB in the beginning and 377.7MB in the end (delta: -323.8MB). Peak memory consumption was 368.6MB. 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...