/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/popl20-bad-threaded-sum-2.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-14 01:01:02,963 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-14 01:01:03,017 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 01:01:03,023 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-14 01:01:03,023 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-14 01:01:03,041 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-14 01:01:03,042 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-14 01:01:03,042 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-14 01:01:03,042 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-14 01:01:03,043 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-14 01:01:03,043 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-14 01:01:03,043 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-14 01:01:03,043 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-14 01:01:03,044 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-14 01:01:03,044 INFO L153 SettingsManager]: * Use SBE=true [2025-04-14 01:01:03,044 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-14 01:01:03,044 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-14 01:01:03,044 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-14 01:01:03,044 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-14 01:01:03,044 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-14 01:01:03,044 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-14 01:01:03,044 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-14 01:01:03,044 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-14 01:01:03,044 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-14 01:01:03,044 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-14 01:01:03,044 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-14 01:01:03,044 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-14 01:01:03,044 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-14 01:01:03,044 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-14 01:01:03,045 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 01:01:03,045 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 01:01:03,045 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 01:01:03,045 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 01:01:03,045 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-14 01:01:03,045 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 01:01:03,045 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 01:01:03,045 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 01:01:03,045 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 01:01:03,045 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-14 01:01:03,045 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-14 01:01:03,045 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-14 01:01:03,045 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-14 01:01:03,045 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-14 01:01:03,045 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-14 01:01:03,045 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-14 01:01:03,046 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-14 01:01:03,046 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-14 01:01:03,046 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 01:01:03,266 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-14 01:01:03,273 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-14 01:01:03,275 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-14 01:01:03,275 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-14 01:01:03,277 INFO L274 PluginConnector]: CDTParser initialized [2025-04-14 01:01:03,278 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-bad-threaded-sum-2.wvr.c [2025-04-14 01:01:04,642 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b0d1a69a/d9827095d2ab4aa3a243d6d2d6a76fb2/FLAGe9cd18540 [2025-04-14 01:01:04,818 INFO L389 CDTParser]: Found 1 translation units. [2025-04-14 01:01:04,818 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-threaded-sum-2.wvr.c [2025-04-14 01:01:04,826 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b0d1a69a/d9827095d2ab4aa3a243d6d2d6a76fb2/FLAGe9cd18540 [2025-04-14 01:01:05,642 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b0d1a69a/d9827095d2ab4aa3a243d6d2d6a76fb2 [2025-04-14 01:01:05,644 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-14 01:01:05,645 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-14 01:01:05,645 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-14 01:01:05,646 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-14 01:01:05,648 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-14 01:01:05,649 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 01:01:05" (1/1) ... [2025-04-14 01:01:05,649 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41484e5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:01:05, skipping insertion in model container [2025-04-14 01:01:05,649 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 01:01:05" (1/1) ... [2025-04-14 01:01:05,662 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-14 01:01:05,835 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/popl20-bad-threaded-sum-2.wvr.c[2502,2515] [2025-04-14 01:01:05,843 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 01:01:05,850 INFO L200 MainTranslator]: Completed pre-run [2025-04-14 01:01:05,872 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/popl20-bad-threaded-sum-2.wvr.c[2502,2515] [2025-04-14 01:01:05,874 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 01:01:05,888 INFO L204 MainTranslator]: Completed translation [2025-04-14 01:01:05,889 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:01:05 WrapperNode [2025-04-14 01:01:05,889 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-14 01:01:05,890 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-14 01:01:05,890 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-14 01:01:05,890 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-14 01:01:05,895 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:01:05" (1/1) ... [2025-04-14 01:01:05,900 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:01:05" (1/1) ... [2025-04-14 01:01:05,917 INFO L138 Inliner]: procedures = 20, calls = 24, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 48 [2025-04-14 01:01:05,917 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-14 01:01:05,918 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-14 01:01:05,918 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-14 01:01:05,918 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-14 01:01:05,925 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:01:05" (1/1) ... [2025-04-14 01:01:05,925 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:01:05" (1/1) ... [2025-04-14 01:01:05,930 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:01:05" (1/1) ... [2025-04-14 01:01:05,943 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-04-14 01:01:05,944 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:01:05" (1/1) ... [2025-04-14 01:01:05,944 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:01:05" (1/1) ... [2025-04-14 01:01:05,948 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:01:05" (1/1) ... [2025-04-14 01:01:05,949 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:01:05" (1/1) ... [2025-04-14 01:01:05,949 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:01:05" (1/1) ... [2025-04-14 01:01:05,950 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:01:05" (1/1) ... [2025-04-14 01:01:05,956 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-14 01:01:05,956 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-14 01:01:05,956 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-14 01:01:05,956 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-14 01:01:05,961 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:01:05" (1/1) ... [2025-04-14 01:01:05,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 01:01:05,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:01:05,987 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 01:01:05,989 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 01:01:06,009 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-14 01:01:06,010 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-14 01:01:06,010 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-14 01:01:06,010 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-14 01:01:06,010 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-14 01:01:06,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-14 01:01:06,010 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-14 01:01:06,010 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-14 01:01:06,010 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-14 01:01:06,010 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-14 01:01:06,011 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 01:01:06,075 INFO L256 CfgBuilder]: Building ICFG [2025-04-14 01:01:06,076 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-14 01:01:06,191 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-14 01:01:06,192 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-14 01:01:06,192 INFO L318 CfgBuilder]: Performing block encoding [2025-04-14 01:01:06,344 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-14 01:01:06,345 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 01:01:06 BoogieIcfgContainer [2025-04-14 01:01:06,345 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-14 01:01:06,346 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-14 01:01:06,346 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-14 01:01:06,350 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-14 01:01:06,350 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 01:01:05" (1/3) ... [2025-04-14 01:01:06,351 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@595b8ba8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 01:01:06, skipping insertion in model container [2025-04-14 01:01:06,352 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:01:05" (2/3) ... [2025-04-14 01:01:06,352 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@595b8ba8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 01:01:06, skipping insertion in model container [2025-04-14 01:01:06,352 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 01:01:06" (3/3) ... [2025-04-14 01:01:06,353 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-bad-threaded-sum-2.wvr.c [2025-04-14 01:01:06,362 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-14 01:01:06,363 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-bad-threaded-sum-2.wvr.c that has 3 procedures, 23 locations, 22 edges, 1 initial locations, 2 loop locations, and 1 error locations. [2025-04-14 01:01:06,363 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-14 01:01:06,404 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-14 01:01:06,431 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 24 transitions, 62 flow [2025-04-14 01:01:06,449 INFO L116 PetriNetUnfolderBase]: 2/22 cut-off events. [2025-04-14 01:01:06,454 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-14 01:01:06,456 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31 conditions, 22 events. 2/22 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 28 event pairs, 0 based on Foata normal form. 0/19 useless extension candidates. Maximal degree in co-relation 18. Up to 2 conditions per place. [2025-04-14 01:01:06,456 INFO L82 GeneralOperation]: Start removeDead. Operand has 29 places, 24 transitions, 62 flow [2025-04-14 01:01:06,459 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 26 places, 21 transitions, 54 flow [2025-04-14 01:01:06,466 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-14 01:01:06,479 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;@62bfe9da, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 01:01:06,480 INFO L341 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-04-14 01:01:06,489 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-14 01:01:06,490 INFO L116 PetriNetUnfolderBase]: 2/20 cut-off events. [2025-04-14 01:01:06,490 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-14 01:01:06,490 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:01:06,490 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:01:06,491 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 01:01:06,495 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:01:06,496 INFO L85 PathProgramCache]: Analyzing trace with hash 1976822884, now seen corresponding path program 1 times [2025-04-14 01:01:06,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:01:06,503 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602308416] [2025-04-14 01:01:06,503 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:01:06,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:01:06,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-14 01:01:06,598 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-14 01:01:06,598 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:01:06,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:01:06,918 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 01:01:06,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:01:06,919 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602308416] [2025-04-14 01:01:06,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602308416] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:01:06,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:01:06,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 01:01:06,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177455681] [2025-04-14 01:01:06,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:01:06,925 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 01:01:06,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:01:06,943 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 01:01:06,944 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-14 01:01:06,953 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 24 [2025-04-14 01:01:06,954 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 21 transitions, 54 flow. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:01:06,955 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:01:06,955 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 24 [2025-04-14 01:01:06,955 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:01:07,097 INFO L116 PetriNetUnfolderBase]: 120/233 cut-off events. [2025-04-14 01:01:07,097 INFO L117 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2025-04-14 01:01:07,098 INFO L83 FinitePrefix]: Finished finitePrefix Result has 465 conditions, 233 events. 120/233 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 865 event pairs, 9 based on Foata normal form. 16/247 useless extension candidates. Maximal degree in co-relation 425. Up to 134 conditions per place. [2025-04-14 01:01:07,101 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 35 selfloop transitions, 6 changer transitions 0/45 dead transitions. [2025-04-14 01:01:07,101 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 45 transitions, 193 flow [2025-04-14 01:01:07,102 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 01:01:07,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 01:01:07,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 73 transitions. [2025-04-14 01:01:07,110 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6083333333333333 [2025-04-14 01:01:07,110 INFO L175 Difference]: Start difference. First operand has 26 places, 21 transitions, 54 flow. Second operand 5 states and 73 transitions. [2025-04-14 01:01:07,111 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 45 transitions, 193 flow [2025-04-14 01:01:07,114 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 45 transitions, 179 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-04-14 01:01:07,116 INFO L231 Difference]: Finished difference. Result has 29 places, 26 transitions, 91 flow [2025-04-14 01:01:07,117 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=91, PETRI_PLACES=29, PETRI_TRANSITIONS=26} [2025-04-14 01:01:07,120 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 3 predicate places. [2025-04-14 01:01:07,120 INFO L485 AbstractCegarLoop]: Abstraction has has 29 places, 26 transitions, 91 flow [2025-04-14 01:01:07,120 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:01:07,120 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:01:07,120 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 01:01:07,120 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-14 01:01:07,121 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 01:01:07,121 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:01:07,121 INFO L85 PathProgramCache]: Analyzing trace with hash 755428764, now seen corresponding path program 1 times [2025-04-14 01:01:07,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:01:07,121 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474477775] [2025-04-14 01:01:07,121 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:01:07,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:01:07,128 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-14 01:01:07,141 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-14 01:01:07,142 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:01:07,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:01:07,304 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:01:07,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:01:07,304 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474477775] [2025-04-14 01:01:07,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474477775] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:01:07,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:01:07,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 01:01:07,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493166913] [2025-04-14 01:01:07,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:01:07,306 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 01:01:07,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:01:07,306 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 01:01:07,306 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-14 01:01:07,311 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 24 [2025-04-14 01:01:07,311 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 26 transitions, 91 flow. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 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 01:01:07,311 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:01:07,311 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 24 [2025-04-14 01:01:07,312 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:01:07,427 INFO L116 PetriNetUnfolderBase]: 146/289 cut-off events. [2025-04-14 01:01:07,428 INFO L117 PetriNetUnfolderBase]: For 194/194 co-relation queries the response was YES. [2025-04-14 01:01:07,428 INFO L83 FinitePrefix]: Finished finitePrefix Result has 747 conditions, 289 events. 146/289 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1186 event pairs, 15 based on Foata normal form. 13/300 useless extension candidates. Maximal degree in co-relation 251. Up to 144 conditions per place. [2025-04-14 01:01:07,432 INFO L140 encePairwiseOnDemand]: 20/24 looper letters, 36 selfloop transitions, 3 changer transitions 0/43 dead transitions. [2025-04-14 01:01:07,432 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 43 transitions, 241 flow [2025-04-14 01:01:07,433 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 01:01:07,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-14 01:01:07,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 56 transitions. [2025-04-14 01:01:07,433 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334 [2025-04-14 01:01:07,434 INFO L175 Difference]: Start difference. First operand has 29 places, 26 transitions, 91 flow. Second operand 4 states and 56 transitions. [2025-04-14 01:01:07,434 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 43 transitions, 241 flow [2025-04-14 01:01:07,435 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 43 transitions, 236 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-14 01:01:07,437 INFO L231 Difference]: Finished difference. Result has 32 places, 27 transitions, 102 flow [2025-04-14 01:01:07,437 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=102, PETRI_PLACES=32, PETRI_TRANSITIONS=27} [2025-04-14 01:01:07,438 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 6 predicate places. [2025-04-14 01:01:07,438 INFO L485 AbstractCegarLoop]: Abstraction has has 32 places, 27 transitions, 102 flow [2025-04-14 01:01:07,438 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 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 01:01:07,438 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:01:07,438 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 01:01:07,438 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-14 01:01:07,438 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 01:01:07,439 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:01:07,439 INFO L85 PathProgramCache]: Analyzing trace with hash 1075085281, now seen corresponding path program 1 times [2025-04-14 01:01:07,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:01:07,439 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937475899] [2025-04-14 01:01:07,439 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:01:07,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:01:07,448 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-14 01:01:07,478 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-14 01:01:07,479 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:01:07,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:01:07,592 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 01:01:07,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:01:07,593 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937475899] [2025-04-14 01:01:07,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937475899] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:01:07,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:01:07,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 01:01:07,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563365101] [2025-04-14 01:01:07,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:01:07,594 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 01:01:07,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:01:07,594 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 01:01:07,594 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-14 01:01:07,598 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 24 [2025-04-14 01:01:07,598 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 27 transitions, 102 flow. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:01:07,598 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:01:07,598 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 24 [2025-04-14 01:01:07,598 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:01:07,699 INFO L116 PetriNetUnfolderBase]: 156/300 cut-off events. [2025-04-14 01:01:07,699 INFO L117 PetriNetUnfolderBase]: For 233/233 co-relation queries the response was YES. [2025-04-14 01:01:07,700 INFO L83 FinitePrefix]: Finished finitePrefix Result has 822 conditions, 300 events. 156/300 cut-off events. For 233/233 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1207 event pairs, 23 based on Foata normal form. 16/314 useless extension candidates. Maximal degree in co-relation 364. Up to 109 conditions per place. [2025-04-14 01:01:07,702 INFO L140 encePairwiseOnDemand]: 19/24 looper letters, 34 selfloop transitions, 7 changer transitions 0/45 dead transitions. [2025-04-14 01:01:07,702 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 45 transitions, 251 flow [2025-04-14 01:01:07,702 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 01:01:07,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 01:01:07,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 68 transitions. [2025-04-14 01:01:07,703 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5666666666666667 [2025-04-14 01:01:07,703 INFO L175 Difference]: Start difference. First operand has 32 places, 27 transitions, 102 flow. Second operand 5 states and 68 transitions. [2025-04-14 01:01:07,703 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 45 transitions, 251 flow [2025-04-14 01:01:07,704 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 45 transitions, 245 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-14 01:01:07,705 INFO L231 Difference]: Finished difference. Result has 37 places, 31 transitions, 148 flow [2025-04-14 01:01:07,705 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=148, PETRI_PLACES=37, PETRI_TRANSITIONS=31} [2025-04-14 01:01:07,705 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 11 predicate places. [2025-04-14 01:01:07,705 INFO L485 AbstractCegarLoop]: Abstraction has has 37 places, 31 transitions, 148 flow [2025-04-14 01:01:07,706 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:01:07,706 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:01:07,706 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 01:01:07,706 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-14 01:01:07,706 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 01:01:07,706 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:01:07,706 INFO L85 PathProgramCache]: Analyzing trace with hash 853783335, now seen corresponding path program 2 times [2025-04-14 01:01:07,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:01:07,706 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824405701] [2025-04-14 01:01:07,707 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:01:07,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:01:07,712 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 1 equivalence classes. [2025-04-14 01:01:07,734 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-14 01:01:07,734 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 01:01:07,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:01:08,322 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 01:01:08,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:01:08,322 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824405701] [2025-04-14 01:01:08,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824405701] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:01:08,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:01:08,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-14 01:01:08,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123974314] [2025-04-14 01:01:08,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:01:08,324 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-14 01:01:08,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:01:08,324 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-14 01:01:08,324 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-04-14 01:01:08,341 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 24 [2025-04-14 01:01:08,342 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 31 transitions, 148 flow. Second operand has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 9 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:01:08,342 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:01:08,342 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 24 [2025-04-14 01:01:08,342 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:01:08,593 INFO L116 PetriNetUnfolderBase]: 241/456 cut-off events. [2025-04-14 01:01:08,594 INFO L117 PetriNetUnfolderBase]: For 544/544 co-relation queries the response was YES. [2025-04-14 01:01:08,595 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1389 conditions, 456 events. 241/456 cut-off events. For 544/544 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 1939 event pairs, 14 based on Foata normal form. 1/455 useless extension candidates. Maximal degree in co-relation 557. Up to 262 conditions per place. [2025-04-14 01:01:08,597 INFO L140 encePairwiseOnDemand]: 17/24 looper letters, 41 selfloop transitions, 14 changer transitions 9/68 dead transitions. [2025-04-14 01:01:08,597 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 68 transitions, 418 flow [2025-04-14 01:01:08,597 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-14 01:01:08,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-14 01:01:08,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 121 transitions. [2025-04-14 01:01:08,598 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5041666666666667 [2025-04-14 01:01:08,598 INFO L175 Difference]: Start difference. First operand has 37 places, 31 transitions, 148 flow. Second operand 10 states and 121 transitions. [2025-04-14 01:01:08,598 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 68 transitions, 418 flow [2025-04-14 01:01:08,600 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 68 transitions, 414 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-14 01:01:08,601 INFO L231 Difference]: Finished difference. Result has 50 places, 38 transitions, 239 flow [2025-04-14 01:01:08,601 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=239, PETRI_PLACES=50, PETRI_TRANSITIONS=38} [2025-04-14 01:01:08,601 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 24 predicate places. [2025-04-14 01:01:08,601 INFO L485 AbstractCegarLoop]: Abstraction has has 50 places, 38 transitions, 239 flow [2025-04-14 01:01:08,602 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 9 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:01:08,602 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:01:08,602 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 01:01:08,602 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-14 01:01:08,602 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 01:01:08,602 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:01:08,602 INFO L85 PathProgramCache]: Analyzing trace with hash -2103015019, now seen corresponding path program 1 times [2025-04-14 01:01:08,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:01:08,602 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721668817] [2025-04-14 01:01:08,602 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:01:08,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:01:08,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-14 01:01:08,612 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-14 01:01:08,613 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:01:08,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:01:08,765 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:01:08,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:01:08,766 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721668817] [2025-04-14 01:01:08,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721668817] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:01:08,766 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [331571255] [2025-04-14 01:01:08,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:01:08,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:01:08,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:01:08,768 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 01:01:08,770 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 01:01:08,799 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-14 01:01:08,811 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-14 01:01:08,811 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:01:08,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:01:08,813 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-14 01:01:08,815 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:01:08,952 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:01:08,952 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:01:09,071 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:01:09,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [331571255] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:01:09,071 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:01:09,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 6] total 12 [2025-04-14 01:01:09,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433833337] [2025-04-14 01:01:09,071 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:01:09,071 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-14 01:01:09,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:01:09,072 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-14 01:01:09,072 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2025-04-14 01:01:09,089 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 24 [2025-04-14 01:01:09,089 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 38 transitions, 239 flow. Second operand has 12 states, 12 states have (on average 7.916666666666667) internal successors, (95), 12 states have internal predecessors, (95), 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 01:01:09,089 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:01:09,089 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 24 [2025-04-14 01:01:09,090 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:01:09,781 INFO L116 PetriNetUnfolderBase]: 1054/1777 cut-off events. [2025-04-14 01:01:09,782 INFO L117 PetriNetUnfolderBase]: For 3274/3274 co-relation queries the response was YES. [2025-04-14 01:01:09,786 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5810 conditions, 1777 events. 1054/1777 cut-off events. For 3274/3274 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 8600 event pairs, 47 based on Foata normal form. 22/1798 useless extension candidates. Maximal degree in co-relation 5786. Up to 380 conditions per place. [2025-04-14 01:01:09,793 INFO L140 encePairwiseOnDemand]: 13/24 looper letters, 149 selfloop transitions, 89 changer transitions 0/240 dead transitions. [2025-04-14 01:01:09,794 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 240 transitions, 1697 flow [2025-04-14 01:01:09,794 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-04-14 01:01:09,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2025-04-14 01:01:09,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 320 transitions. [2025-04-14 01:01:09,797 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2025-04-14 01:01:09,797 INFO L175 Difference]: Start difference. First operand has 50 places, 38 transitions, 239 flow. Second operand 30 states and 320 transitions. [2025-04-14 01:01:09,797 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 240 transitions, 1697 flow [2025-04-14 01:01:09,808 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 240 transitions, 1641 flow, removed 21 selfloop flow, removed 4 redundant places. [2025-04-14 01:01:09,811 INFO L231 Difference]: Finished difference. Result has 92 places, 125 transitions, 1086 flow [2025-04-14 01:01:09,811 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=209, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=1086, PETRI_PLACES=92, PETRI_TRANSITIONS=125} [2025-04-14 01:01:09,811 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 66 predicate places. [2025-04-14 01:01:09,811 INFO L485 AbstractCegarLoop]: Abstraction has has 92 places, 125 transitions, 1086 flow [2025-04-14 01:01:09,811 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.916666666666667) internal successors, (95), 12 states have internal predecessors, (95), 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 01:01:09,811 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:01:09,811 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 01:01:09,819 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-04-14 01:01:10,012 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:01:10,012 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 01:01:10,013 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:01:10,013 INFO L85 PathProgramCache]: Analyzing trace with hash 1343191359, now seen corresponding path program 2 times [2025-04-14 01:01:10,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:01:10,013 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026649062] [2025-04-14 01:01:10,013 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:01:10,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:01:10,017 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-04-14 01:01:10,030 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-14 01:01:10,030 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:01:10,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:01:10,394 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 01:01:10,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:01:10,394 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026649062] [2025-04-14 01:01:10,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026649062] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:01:10,394 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2125970122] [2025-04-14 01:01:10,394 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:01:10,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:01:10,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:01:10,397 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:01:10,398 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-14 01:01:10,427 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-04-14 01:01:10,471 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-14 01:01:10,471 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:01:10,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:01:10,472 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-04-14 01:01:10,473 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:01:10,966 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 01:01:10,966 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:01:11,766 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 01:01:11,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2125970122] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:01:11,767 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:01:11,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 19 [2025-04-14 01:01:11,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280886356] [2025-04-14 01:01:11,767 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:01:11,767 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-04-14 01:01:11,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:01:11,768 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-04-14 01:01:11,768 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=327, Unknown=0, NotChecked=0, Total=420 [2025-04-14 01:01:11,779 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2025-04-14 01:01:11,779 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 125 transitions, 1086 flow. Second operand has 21 states, 21 states have (on average 7.428571428571429) internal successors, (156), 21 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:01:11,779 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:01:11,779 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2025-04-14 01:01:11,779 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:01:15,435 INFO L116 PetriNetUnfolderBase]: 1884/3446 cut-off events. [2025-04-14 01:01:15,435 INFO L117 PetriNetUnfolderBase]: For 24342/24342 co-relation queries the response was YES. [2025-04-14 01:01:15,446 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17056 conditions, 3446 events. 1884/3446 cut-off events. For 24342/24342 co-relation queries the response was YES. Maximal size of possible extension queue 212. Compared 21775 event pairs, 27 based on Foata normal form. 13/3457 useless extension candidates. Maximal degree in co-relation 13229. Up to 943 conditions per place. [2025-04-14 01:01:15,462 INFO L140 encePairwiseOnDemand]: 15/24 looper letters, 262 selfloop transitions, 175 changer transitions 83/523 dead transitions. [2025-04-14 01:01:15,462 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 523 transitions, 5401 flow [2025-04-14 01:01:15,463 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2025-04-14 01:01:15,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2025-04-14 01:01:15,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 485 transitions. [2025-04-14 01:01:15,465 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4699612403100775 [2025-04-14 01:01:15,465 INFO L175 Difference]: Start difference. First operand has 92 places, 125 transitions, 1086 flow. Second operand 43 states and 485 transitions. [2025-04-14 01:01:15,465 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 523 transitions, 5401 flow [2025-04-14 01:01:15,517 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 523 transitions, 4735 flow, removed 325 selfloop flow, removed 4 redundant places. [2025-04-14 01:01:15,522 INFO L231 Difference]: Finished difference. Result has 150 places, 272 transitions, 2707 flow [2025-04-14 01:01:15,522 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=894, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=43, PETRI_FLOW=2707, PETRI_PLACES=150, PETRI_TRANSITIONS=272} [2025-04-14 01:01:15,523 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 124 predicate places. [2025-04-14 01:01:15,523 INFO L485 AbstractCegarLoop]: Abstraction has has 150 places, 272 transitions, 2707 flow [2025-04-14 01:01:15,523 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 7.428571428571429) internal successors, (156), 21 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:01:15,523 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:01:15,523 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:01:15,531 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-04-14 01:01:15,724 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-04-14 01:01:15,724 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 01:01:15,725 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:01:15,725 INFO L85 PathProgramCache]: Analyzing trace with hash -565843046, now seen corresponding path program 3 times [2025-04-14 01:01:15,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:01:15,725 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841136747] [2025-04-14 01:01:15,725 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 01:01:15,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:01:15,731 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 1 equivalence classes. [2025-04-14 01:01:15,744 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-14 01:01:15,747 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-14 01:01:15,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:01:15,911 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 01:01:15,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:01:15,911 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841136747] [2025-04-14 01:01:15,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841136747] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:01:15,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:01:15,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-14 01:01:15,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024597015] [2025-04-14 01:01:15,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:01:15,912 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-14 01:01:15,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:01:15,912 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-14 01:01:15,912 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-14 01:01:15,916 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2025-04-14 01:01:15,917 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 272 transitions, 2707 flow. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 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 01:01:15,917 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:01:15,917 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2025-04-14 01:01:15,917 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:01:16,528 INFO L116 PetriNetUnfolderBase]: 2190/3844 cut-off events. [2025-04-14 01:01:16,529 INFO L117 PetriNetUnfolderBase]: For 26082/26304 co-relation queries the response was YES. [2025-04-14 01:01:16,545 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19060 conditions, 3844 events. 2190/3844 cut-off events. For 26082/26304 co-relation queries the response was YES. Maximal size of possible extension queue 233. Compared 23942 event pairs, 48 based on Foata normal form. 98/3921 useless extension candidates. Maximal degree in co-relation 18958. Up to 1048 conditions per place. [2025-04-14 01:01:16,564 INFO L140 encePairwiseOnDemand]: 16/24 looper letters, 416 selfloop transitions, 147 changer transitions 0/586 dead transitions. [2025-04-14 01:01:16,565 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 586 transitions, 6812 flow [2025-04-14 01:01:16,565 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-14 01:01:16,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-14 01:01:16,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 102 transitions. [2025-04-14 01:01:16,566 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4722222222222222 [2025-04-14 01:01:16,566 INFO L175 Difference]: Start difference. First operand has 150 places, 272 transitions, 2707 flow. Second operand 9 states and 102 transitions. [2025-04-14 01:01:16,566 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 586 transitions, 6812 flow [2025-04-14 01:01:16,644 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 586 transitions, 6435 flow, removed 154 selfloop flow, removed 16 redundant places. [2025-04-14 01:01:16,649 INFO L231 Difference]: Finished difference. Result has 133 places, 366 transitions, 4075 flow [2025-04-14 01:01:16,650 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=2406, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=268, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=68, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=176, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4075, PETRI_PLACES=133, PETRI_TRANSITIONS=366} [2025-04-14 01:01:16,650 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 107 predicate places. [2025-04-14 01:01:16,650 INFO L485 AbstractCegarLoop]: Abstraction has has 133 places, 366 transitions, 4075 flow [2025-04-14 01:01:16,650 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 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 01:01:16,650 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:01:16,651 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:01:16,651 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-14 01:01:16,651 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 01:01:16,651 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:01:16,651 INFO L85 PathProgramCache]: Analyzing trace with hash 1580598739, now seen corresponding path program 3 times [2025-04-14 01:01:16,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:01:16,651 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754869467] [2025-04-14 01:01:16,651 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 01:01:16,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:01:16,654 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 24 statements into 2 equivalence classes. [2025-04-14 01:01:16,668 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-04-14 01:01:16,669 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-14 01:01:16,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:01:17,222 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:01:17,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:01:17,222 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754869467] [2025-04-14 01:01:17,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754869467] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:01:17,222 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [298291616] [2025-04-14 01:01:17,222 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 01:01:17,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:01:17,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:01:17,224 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:01:17,226 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-14 01:01:17,250 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 24 statements into 2 equivalence classes. [2025-04-14 01:01:17,275 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-04-14 01:01:17,276 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-14 01:01:17,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:01:17,277 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-04-14 01:01:17,278 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:01:17,692 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:01:17,692 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:01:18,464 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:01:18,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [298291616] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:01:18,465 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:01:18,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 22 [2025-04-14 01:01:18,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213118414] [2025-04-14 01:01:18,465 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:01:18,465 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-04-14 01:01:18,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:01:18,466 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-04-14 01:01:18,466 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=432, Unknown=0, NotChecked=0, Total=552 [2025-04-14 01:01:18,482 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 24 [2025-04-14 01:01:18,482 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 366 transitions, 4075 flow. Second operand has 24 states, 24 states have (on average 6.541666666666667) internal successors, (157), 24 states have internal predecessors, (157), 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 01:01:18,482 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:01:18,482 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 24 [2025-04-14 01:01:18,482 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:01:25,163 WARN L286 SmtUtils]: Spent 5.74s on a formula simplification. DAG size of input: 57 DAG size of output: 54 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-14 01:01:36,921 INFO L116 PetriNetUnfolderBase]: 5103/8665 cut-off events. [2025-04-14 01:01:36,922 INFO L117 PetriNetUnfolderBase]: For 73180/73180 co-relation queries the response was YES. [2025-04-14 01:01:36,947 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48650 conditions, 8665 events. 5103/8665 cut-off events. For 73180/73180 co-relation queries the response was YES. Maximal size of possible extension queue 391. Compared 57686 event pairs, 124 based on Foata normal form. 13/8677 useless extension candidates. Maximal degree in co-relation 47272. Up to 2674 conditions per place. [2025-04-14 01:01:36,982 INFO L140 encePairwiseOnDemand]: 13/24 looper letters, 601 selfloop transitions, 490 changer transitions 89/1182 dead transitions. [2025-04-14 01:01:36,982 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 1182 transitions, 14505 flow [2025-04-14 01:01:36,983 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2025-04-14 01:01:36,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2025-04-14 01:01:36,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 618 transitions. [2025-04-14 01:01:36,987 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.42213114754098363 [2025-04-14 01:01:36,987 INFO L175 Difference]: Start difference. First operand has 133 places, 366 transitions, 4075 flow. Second operand 61 states and 618 transitions. [2025-04-14 01:01:36,988 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 1182 transitions, 14505 flow [2025-04-14 01:01:37,206 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 1182 transitions, 14425 flow, removed 37 selfloop flow, removed 2 redundant places. [2025-04-14 01:01:37,217 INFO L231 Difference]: Finished difference. Result has 232 places, 764 transitions, 10159 flow [2025-04-14 01:01:37,217 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=4057, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=366, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=144, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=61, PETRI_FLOW=10159, PETRI_PLACES=232, PETRI_TRANSITIONS=764} [2025-04-14 01:01:37,218 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 206 predicate places. [2025-04-14 01:01:37,218 INFO L485 AbstractCegarLoop]: Abstraction has has 232 places, 764 transitions, 10159 flow [2025-04-14 01:01:37,218 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 6.541666666666667) internal successors, (157), 24 states have internal predecessors, (157), 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 01:01:37,218 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:01:37,218 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:01:37,225 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-04-14 01:01:37,418 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:01:37,419 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 01:01:37,419 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:01:37,420 INFO L85 PathProgramCache]: Analyzing trace with hash -569482273, now seen corresponding path program 4 times [2025-04-14 01:01:37,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:01:37,420 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969117731] [2025-04-14 01:01:37,420 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 01:01:37,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:01:37,423 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 24 statements into 2 equivalence classes. [2025-04-14 01:01:37,442 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-04-14 01:01:37,442 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 01:01:37,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:01:38,362 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:01:38,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:01:38,362 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969117731] [2025-04-14 01:01:38,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969117731] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:01:38,363 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [161239112] [2025-04-14 01:01:38,363 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 01:01:38,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:01:38,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:01:38,365 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:01:38,366 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-04-14 01:01:38,394 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 24 statements into 2 equivalence classes. [2025-04-14 01:01:38,418 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-04-14 01:01:38,419 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 01:01:38,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:01:38,419 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-04-14 01:01:38,421 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:01:43,245 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:01:43,245 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:01:44,283 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:01:44,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [161239112] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:01:44,283 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:01:44,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 22 [2025-04-14 01:01:44,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472498491] [2025-04-14 01:01:44,283 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:01:44,284 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-04-14 01:01:44,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:01:44,284 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-04-14 01:01:44,284 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=446, Unknown=1, NotChecked=0, Total=552 [2025-04-14 01:01:48,302 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 01:01:48,303 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 24 [2025-04-14 01:01:48,303 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 232 places, 764 transitions, 10159 flow. Second operand has 24 states, 24 states have (on average 6.625) internal successors, (159), 24 states have internal predecessors, (159), 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 01:01:48,303 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:01:48,303 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 24 [2025-04-14 01:01:48,303 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:02:01,849 WARN L286 SmtUtils]: Spent 12.06s on a formula simplification. DAG size of input: 74 DAG size of output: 36 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-14 01:02:22,125 WARN L286 SmtUtils]: Spent 20.10s on a formula simplification. DAG size of input: 80 DAG size of output: 43 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-14 01:02:34,282 INFO L116 PetriNetUnfolderBase]: 6235/10619 cut-off events. [2025-04-14 01:02:34,282 INFO L117 PetriNetUnfolderBase]: For 156015/156015 co-relation queries the response was YES. [2025-04-14 01:02:34,401 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71131 conditions, 10619 events. 6235/10619 cut-off events. For 156015/156015 co-relation queries the response was YES. Maximal size of possible extension queue 478. Compared 73132 event pairs, 55 based on Foata normal form. 17/10635 useless extension candidates. Maximal degree in co-relation 70947. Up to 4387 conditions per place. [2025-04-14 01:02:34,453 INFO L140 encePairwiseOnDemand]: 11/24 looper letters, 721 selfloop transitions, 633 changer transitions 99/1455 dead transitions. [2025-04-14 01:02:34,455 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 292 places, 1455 transitions, 21672 flow [2025-04-14 01:02:34,458 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2025-04-14 01:02:34,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2025-04-14 01:02:34,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 653 transitions. [2025-04-14 01:02:34,461 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.37789351851851855 [2025-04-14 01:02:34,461 INFO L175 Difference]: Start difference. First operand has 232 places, 764 transitions, 10159 flow. Second operand 72 states and 653 transitions. [2025-04-14 01:02:34,461 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 292 places, 1455 transitions, 21672 flow [2025-04-14 01:02:35,547 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 278 places, 1455 transitions, 21026 flow, removed 303 selfloop flow, removed 14 redundant places. [2025-04-14 01:02:35,564 INFO L231 Difference]: Finished difference. Result has 310 places, 1103 transitions, 16608 flow [2025-04-14 01:02:35,565 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=9726, PETRI_DIFFERENCE_MINUEND_PLACES=207, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=764, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=338, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=332, PETRI_DIFFERENCE_SUBTRAHEND_STATES=72, PETRI_FLOW=16608, PETRI_PLACES=310, PETRI_TRANSITIONS=1103} [2025-04-14 01:02:35,565 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 284 predicate places. [2025-04-14 01:02:35,566 INFO L485 AbstractCegarLoop]: Abstraction has has 310 places, 1103 transitions, 16608 flow [2025-04-14 01:02:35,566 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 6.625) internal successors, (159), 24 states have internal predecessors, (159), 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 01:02:35,566 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:02:35,566 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:02:35,573 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-04-14 01:02:35,769 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:02:35,769 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 01:02:35,770 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:02:35,770 INFO L85 PathProgramCache]: Analyzing trace with hash 1817439513, now seen corresponding path program 4 times [2025-04-14 01:02:35,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:02:35,770 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854639921] [2025-04-14 01:02:35,770 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 01:02:35,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:02:35,774 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 26 statements into 2 equivalence classes. [2025-04-14 01:02:35,782 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-14 01:02:35,782 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 01:02:35,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:02:36,152 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-14 01:02:36,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:02:36,152 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854639921] [2025-04-14 01:02:36,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854639921] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:02:36,152 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [759248312] [2025-04-14 01:02:36,152 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 01:02:36,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:02:36,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:02:36,154 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:02:36,156 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-04-14 01:02:36,183 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 26 statements into 2 equivalence classes. [2025-04-14 01:02:36,202 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-14 01:02:36,202 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 01:02:36,202 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:02:36,203 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-04-14 01:02:36,204 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:02:36,723 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:02:36,723 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:02:37,265 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:02:37,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [759248312] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:02:37,266 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:02:37,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 10] total 27 [2025-04-14 01:02:37,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760628924] [2025-04-14 01:02:37,266 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:02:37,266 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-04-14 01:02:37,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:02:37,267 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-04-14 01:02:37,267 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=646, Unknown=0, NotChecked=0, Total=812 [2025-04-14 01:02:37,277 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 24 [2025-04-14 01:02:37,277 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 310 places, 1103 transitions, 16608 flow. Second operand has 29 states, 29 states have (on average 6.275862068965517) internal successors, (182), 29 states have internal predecessors, (182), 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 01:02:37,278 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:02:37,278 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 24 [2025-04-14 01:02:37,278 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:02:52,168 INFO L116 PetriNetUnfolderBase]: 9313/15736 cut-off events. [2025-04-14 01:02:52,169 INFO L117 PetriNetUnfolderBase]: For 277910/277910 co-relation queries the response was YES. [2025-04-14 01:02:52,300 INFO L83 FinitePrefix]: Finished finitePrefix Result has 118996 conditions, 15736 events. 9313/15736 cut-off events. For 277910/277910 co-relation queries the response was YES. Maximal size of possible extension queue 682. Compared 112427 event pairs, 144 based on Foata normal form. 14/15749 useless extension candidates. Maximal degree in co-relation 118774. Up to 3324 conditions per place. [2025-04-14 01:02:52,374 INFO L140 encePairwiseOnDemand]: 11/24 looper letters, 790 selfloop transitions, 1506 changer transitions 73/2371 dead transitions. [2025-04-14 01:02:52,374 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 412 places, 2371 transitions, 41196 flow [2025-04-14 01:02:52,375 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2025-04-14 01:02:52,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2025-04-14 01:02:52,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 1034 transitions. [2025-04-14 01:02:52,380 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3651129943502825 [2025-04-14 01:02:52,381 INFO L175 Difference]: Start difference. First operand has 310 places, 1103 transitions, 16608 flow. Second operand 118 states and 1034 transitions. [2025-04-14 01:02:52,381 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 412 places, 2371 transitions, 41196 flow [2025-04-14 01:02:54,959 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 388 places, 2371 transitions, 39006 flow, removed 1039 selfloop flow, removed 24 redundant places. [2025-04-14 01:02:54,992 INFO L231 Difference]: Finished difference. Result has 450 places, 1861 transitions, 33336 flow [2025-04-14 01:02:54,993 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=15766, PETRI_DIFFERENCE_MINUEND_PLACES=271, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=827, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=190, PETRI_DIFFERENCE_SUBTRAHEND_STATES=118, PETRI_FLOW=33336, PETRI_PLACES=450, PETRI_TRANSITIONS=1861} [2025-04-14 01:02:54,994 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 424 predicate places. [2025-04-14 01:02:54,994 INFO L485 AbstractCegarLoop]: Abstraction has has 450 places, 1861 transitions, 33336 flow [2025-04-14 01:02:54,994 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 6.275862068965517) internal successors, (182), 29 states have internal predecessors, (182), 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 01:02:54,994 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:02:54,994 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:02:55,000 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-04-14 01:02:55,198 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-04-14 01:02:55,198 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 01:02:55,199 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:02:55,199 INFO L85 PathProgramCache]: Analyzing trace with hash 99671845, now seen corresponding path program 5 times [2025-04-14 01:02:55,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:02:55,199 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880993208] [2025-04-14 01:02:55,199 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 01:02:55,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:02:55,206 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 27 statements into 3 equivalence classes. [2025-04-14 01:02:55,228 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 27 of 27 statements. [2025-04-14 01:02:55,228 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-14 01:02:55,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:02:55,874 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:02:55,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:02:55,875 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880993208] [2025-04-14 01:02:55,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880993208] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:02:55,875 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1683056115] [2025-04-14 01:02:55,875 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 01:02:55,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:02:55,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:02:55,877 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:02:55,878 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-04-14 01:02:55,903 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 27 statements into 3 equivalence classes. [2025-04-14 01:02:55,946 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 27 of 27 statements. [2025-04-14 01:02:55,946 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-14 01:02:55,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:02:55,947 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-04-14 01:02:55,949 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:03:13,466 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:03:13,466 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:03:14,629 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:03:14,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1683056115] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:03:14,629 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:03:14,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 25 [2025-04-14 01:03:14,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491403313] [2025-04-14 01:03:14,629 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:03:14,630 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-04-14 01:03:14,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:03:14,630 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-04-14 01:03:14,630 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=549, Unknown=4, NotChecked=0, Total=702 [2025-04-14 01:03:14,633 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2025-04-14 01:03:14,633 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 450 places, 1861 transitions, 33336 flow. Second operand has 27 states, 27 states have (on average 7.555555555555555) internal successors, (204), 27 states have internal predecessors, (204), 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 01:03:14,633 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:03:14,633 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2025-04-14 01:03:14,633 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:03:28,068 WARN L286 SmtUtils]: Spent 8.10s on a formula simplification. DAG size of input: 56 DAG size of output: 39 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-14 01:03:40,354 WARN L286 SmtUtils]: Spent 12.07s on a formula simplification. DAG size of input: 57 DAG size of output: 40 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-14 01:04:02,364 INFO L116 PetriNetUnfolderBase]: 10181/18182 cut-off events. [2025-04-14 01:04:02,365 INFO L117 PetriNetUnfolderBase]: For 558826/558883 co-relation queries the response was YES. [2025-04-14 01:04:02,617 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167212 conditions, 18182 events. 10181/18182 cut-off events. For 558826/558883 co-relation queries the response was YES. Maximal size of possible extension queue 835. Compared 143846 event pairs, 31 based on Foata normal form. 70/18242 useless extension candidates. Maximal degree in co-relation 166947. Up to 7101 conditions per place. [2025-04-14 01:04:02,869 INFO L140 encePairwiseOnDemand]: 15/24 looper letters, 1698 selfloop transitions, 1142 changer transitions 162/3017 dead transitions. [2025-04-14 01:04:02,870 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 520 places, 3017 transitions, 59846 flow [2025-04-14 01:04:02,870 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2025-04-14 01:04:02,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2025-04-14 01:04:02,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 837 transitions. [2025-04-14 01:04:02,872 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.44711538461538464 [2025-04-14 01:04:02,872 INFO L175 Difference]: Start difference. First operand has 450 places, 1861 transitions, 33336 flow. Second operand 78 states and 837 transitions. [2025-04-14 01:04:02,872 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 520 places, 3017 transitions, 59846 flow [2025-04-14 01:04:10,400 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 497 places, 3017 transitions, 56518 flow, removed 1584 selfloop flow, removed 23 redundant places. [2025-04-14 01:04:10,441 INFO L231 Difference]: Finished difference. Result has 534 places, 2349 transitions, 44404 flow [2025-04-14 01:04:10,443 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=31159, PETRI_DIFFERENCE_MINUEND_PLACES=420, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1861, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=727, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=993, PETRI_DIFFERENCE_SUBTRAHEND_STATES=78, PETRI_FLOW=44404, PETRI_PLACES=534, PETRI_TRANSITIONS=2349} [2025-04-14 01:04:10,444 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 508 predicate places. [2025-04-14 01:04:10,444 INFO L485 AbstractCegarLoop]: Abstraction has has 534 places, 2349 transitions, 44404 flow [2025-04-14 01:04:10,444 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 7.555555555555555) internal successors, (204), 27 states have internal predecessors, (204), 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 01:04:10,444 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:04:10,444 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:04:10,450 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-04-14 01:04:10,645 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:04:10,645 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 01:04:10,646 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:04:10,646 INFO L85 PathProgramCache]: Analyzing trace with hash 1532170555, now seen corresponding path program 6 times [2025-04-14 01:04:10,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:04:10,646 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650422708] [2025-04-14 01:04:10,646 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 01:04:10,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:04:10,651 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 27 statements into 2 equivalence classes. [2025-04-14 01:04:10,665 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-04-14 01:04:10,665 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-14 01:04:10,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:04:11,628 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:04:11,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:04:11,631 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650422708] [2025-04-14 01:04:11,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650422708] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:04:11,631 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1176546435] [2025-04-14 01:04:11,631 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 01:04:11,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:04:11,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:04:11,639 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:04:11,641 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-04-14 01:04:11,685 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 27 statements into 2 equivalence classes. [2025-04-14 01:04:11,754 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-04-14 01:04:11,755 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-14 01:04:11,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:04:11,757 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-04-14 01:04:11,759 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:04:12,546 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:04:12,546 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:04:13,786 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:04:13,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1176546435] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:04:13,786 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:04:13,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11] total 31 [2025-04-14 01:04:13,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880853084] [2025-04-14 01:04:13,786 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:04:13,787 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-04-14 01:04:13,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:04:13,787 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-04-14 01:04:13,788 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=247, Invalid=809, Unknown=0, NotChecked=0, Total=1056 [2025-04-14 01:04:13,824 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 24 [2025-04-14 01:04:13,825 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 534 places, 2349 transitions, 44404 flow. Second operand has 33 states, 33 states have (on average 6.181818181818182) internal successors, (204), 33 states have internal predecessors, (204), 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 01:04:13,825 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:04:13,825 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 24 [2025-04-14 01:04:13,825 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:04:36,960 INFO L116 PetriNetUnfolderBase]: 14083/23872 cut-off events. [2025-04-14 01:04:36,961 INFO L117 PetriNetUnfolderBase]: For 707244/707244 co-relation queries the response was YES. [2025-04-14 01:04:37,231 INFO L83 FinitePrefix]: Finished finitePrefix Result has 222905 conditions, 23872 events. 14083/23872 cut-off events. For 707244/707244 co-relation queries the response was YES. Maximal size of possible extension queue 999. Compared 182332 event pairs, 107 based on Foata normal form. 27/23898 useless extension candidates. Maximal degree in co-relation 222468. Up to 8538 conditions per place. [2025-04-14 01:04:37,340 INFO L140 encePairwiseOnDemand]: 13/24 looper letters, 1701 selfloop transitions, 1670 changer transitions 260/3633 dead transitions. [2025-04-14 01:04:37,341 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 620 places, 3633 transitions, 75222 flow [2025-04-14 01:04:37,341 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2025-04-14 01:04:37,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2025-04-14 01:04:37,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 1045 transitions. [2025-04-14 01:04:37,344 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.38876488095238093 [2025-04-14 01:04:37,344 INFO L175 Difference]: Start difference. First operand has 534 places, 2349 transitions, 44404 flow. Second operand 112 states and 1045 transitions. [2025-04-14 01:04:37,344 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 620 places, 3633 transitions, 75222 flow [2025-04-14 01:04:47,899 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 598 places, 3633 transitions, 73105 flow, removed 1015 selfloop flow, removed 22 redundant places. [2025-04-14 01:04:47,957 INFO L231 Difference]: Finished difference. Result has 649 places, 2862 transitions, 59461 flow [2025-04-14 01:04:47,959 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=42946, PETRI_DIFFERENCE_MINUEND_PLACES=487, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2349, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1166, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1045, PETRI_DIFFERENCE_SUBTRAHEND_STATES=112, PETRI_FLOW=59461, PETRI_PLACES=649, PETRI_TRANSITIONS=2862} [2025-04-14 01:04:47,960 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 623 predicate places. [2025-04-14 01:04:47,960 INFO L485 AbstractCegarLoop]: Abstraction has has 649 places, 2862 transitions, 59461 flow [2025-04-14 01:04:47,960 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 6.181818181818182) internal successors, (204), 33 states have internal predecessors, (204), 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 01:04:47,960 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:04:47,960 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:04:47,966 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-04-14 01:04:48,160 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:04:48,161 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 01:04:48,161 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:04:48,161 INFO L85 PathProgramCache]: Analyzing trace with hash 1745876013, now seen corresponding path program 7 times [2025-04-14 01:04:48,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:04:48,162 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842556864] [2025-04-14 01:04:48,162 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 01:04:48,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:04:48,165 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-14 01:04:48,176 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-14 01:04:48,176 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:04:48,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:04:48,961 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:04:48,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:04:48,961 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842556864] [2025-04-14 01:04:48,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842556864] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:04:48,961 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1503121330] [2025-04-14 01:04:48,961 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 01:04:48,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:04:48,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:04:48,964 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:04:48,965 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-04-14 01:04:48,993 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-14 01:04:49,015 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-14 01:04:49,015 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:04:49,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:04:49,017 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-04-14 01:04:49,019 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:04:50,286 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:04:50,286 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:04:53,744 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:04:53,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1503121330] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:04:53,744 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:04:53,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 33 [2025-04-14 01:04:53,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598815349] [2025-04-14 01:04:53,745 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:04:53,745 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-04-14 01:04:53,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:04:53,745 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-04-14 01:04:53,746 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=988, Unknown=0, NotChecked=0, Total=1190 [2025-04-14 01:04:53,764 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 24 [2025-04-14 01:04:53,764 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 649 places, 2862 transitions, 59461 flow. Second operand has 35 states, 35 states have (on average 6.057142857142857) internal successors, (212), 35 states have internal predecessors, (212), 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 01:04:53,764 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:04:53,764 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 24 [2025-04-14 01:04:53,764 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:05:11,594 WARN L286 SmtUtils]: Spent 11.90s on a formula simplification that was a NOOP. DAG size: 76 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-14 01:05:15,949 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 01:05:37,107 WARN L286 SmtUtils]: Spent 9.79s on a formula simplification. DAG size of input: 60 DAG size of output: 57 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-14 01:05:46,362 WARN L286 SmtUtils]: Spent 7.07s on a formula simplification that was a NOOP. DAG size: 52 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-14 01:06:20,141 WARN L286 SmtUtils]: Spent 6.50s on a formula simplification. DAG size of input: 85 DAG size of output: 62 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-14 01:06:42,605 WARN L286 SmtUtils]: Spent 16.49s on a formula simplification. DAG size of input: 85 DAG size of output: 43 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-14 01:06:59,443 WARN L286 SmtUtils]: Spent 13.74s on a formula simplification. DAG size of input: 86 DAG size of output: 80 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-14 01:07:22,822 WARN L286 SmtUtils]: Spent 20.08s on a formula simplification that was a NOOP. DAG size: 81 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-14 01:07:27,555 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 01:07:31,582 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_~S~0 c_~T~0))) (let ((.cse1 (mod .cse2 4294967296))) (let ((.cse13 (+ c_~t~0 1)) (.cse5 (mod (+ c_~m~0 2) 4294967296)) (.cse6 (* c_~T~0 4294967295)) (.cse7 (* c_~S~0 4294967295)) (.cse4 (= .cse1 0)) (.cse3 (* c_~s~0 4294967295)) (.cse8 (< 0 (mod (+ c_~t~0 4294967295) 4294967296))) (.cse10 (mod c_~t~0 4294967296)) (.cse0 (mod c_~m~0 4294967296))) (and (or (= .cse0 .cse1) (and (<= (div c_thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 c_thread1Thread1of1ForFork1_~cond~0))) (<= (+ (div c_~s~0 4294967296) (div c_~t~0 4294967296)) (div .cse2 4294967296)) (<= 1 (mod c_~S~0 4294967296)) (or (not (= (mod (+ 2 .cse3) 4294967296) 0)) (and (or .cse4 (not (= .cse5 0))) (<= 4294967295 (+ (mod (+ .cse6 c_~m~0 .cse7 1) 4294967296) .cse1)) (<= .cse1 (+ (mod (+ c_~m~0 1) 4294967296) 1))) .cse8) (let ((.cse12 (+ c_~S~0 1))) (let ((.cse11 (mod .cse12 4294967296))) (or (let ((.cse9 (mod (+ c_~S~0 4294967295) 4294967296))) (and (or (and (<= 1 .cse9) (= c_~m~0 3) (= c_~S~0 (+ c_~s~0 2))) (and (= c_~m~0 2) (= (+ c_~s~0 1) c_~S~0) (<= .cse9 0))) (or (< 0 .cse10) (< 0 .cse9)) (<= 1 .cse11))) (and (<= 1 .cse10) (= c_~s~0 .cse12) (= c_~m~0 0) (<= .cse11 0))))) (= c_~T~0 .cse13) (<= 1 (mod .cse13 4294967296)) (or (and (<= .cse1 (+ .cse5 1)) (<= 4294967295 (+ .cse1 (mod (+ .cse6 c_~m~0 2 .cse7) 4294967296))) (or .cse4 (not (= (mod (+ c_~m~0 3) 4294967296) 0)))) (not (= (mod (+ 3 .cse3) 4294967296) 0)) .cse8) (or (and (<= (+ c_~S~0 c_~T~0 .cse10) (+ c_~s~0 c_~t~0 c_~m~0)) (<= (div c_~m~0 4294967296) 0)) (< .cse1 (+ .cse0 1))) (or (< .cse0 (+ .cse1 1)) (< (+ .cse1 4294967295) (+ .cse0 (mod c_~s~0 4294967296)))))))) is different from false [2025-04-14 01:07:55,786 WARN L286 SmtUtils]: Spent 10.91s on a formula simplification that was a NOOP. DAG size: 62 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-14 01:08:08,575 WARN L286 SmtUtils]: Spent 9.22s on a formula simplification. DAG size of input: 62 DAG size of output: 35 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-14 01:08:28,959 WARN L286 SmtUtils]: Spent 16.50s on a formula simplification. DAG size of input: 70 DAG size of output: 32 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-14 01:08:41,046 WARN L286 SmtUtils]: Spent 8.84s on a formula simplification that was a NOOP. DAG size: 73 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-14 01:09:05,419 WARN L286 SmtUtils]: Spent 16.85s on a formula simplification. DAG size of input: 61 DAG size of output: 31 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-14 01:09:29,301 WARN L286 SmtUtils]: Spent 22.60s on a formula simplification. DAG size of input: 67 DAG size of output: 41 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-14 01:09:42,205 WARN L286 SmtUtils]: Spent 8.63s on a formula simplification. DAG size of input: 62 DAG size of output: 35 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-14 01:09:58,945 WARN L286 SmtUtils]: Spent 8.09s on a formula simplification. DAG size of input: 40 DAG size of output: 22 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-14 01:10:02,134 INFO L116 PetriNetUnfolderBase]: 16142/27316 cut-off events. [2025-04-14 01:10:02,134 INFO L117 PetriNetUnfolderBase]: For 813848/813848 co-relation queries the response was YES. [2025-04-14 01:10:02,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 272223 conditions, 27316 events. 16142/27316 cut-off events. For 813848/813848 co-relation queries the response was YES. Maximal size of possible extension queue 1163. Compared 212444 event pairs, 187 based on Foata normal form. 24/27339 useless extension candidates. Maximal degree in co-relation 271694. Up to 12044 conditions per place. [2025-04-14 01:10:03,105 INFO L140 encePairwiseOnDemand]: 10/24 looper letters, 2317 selfloop transitions, 1748 changer transitions 117/4184 dead transitions. [2025-04-14 01:10:03,106 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 741 places, 4184 transitions, 94200 flow [2025-04-14 01:10:03,106 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2025-04-14 01:10:03,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2025-04-14 01:10:03,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 1069 transitions. [2025-04-14 01:10:03,108 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3742997198879552 [2025-04-14 01:10:03,108 INFO L175 Difference]: Start difference. First operand has 649 places, 2862 transitions, 59461 flow. Second operand 119 states and 1069 transitions. [2025-04-14 01:10:03,108 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 741 places, 4184 transitions, 94200 flow [2025-04-14 01:10:22,388 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 707 places, 4184 transitions, 90376 flow, removed 1814 selfloop flow, removed 34 redundant places. [2025-04-14 01:10:22,471 INFO L231 Difference]: Finished difference. Result has 761 places, 3470 transitions, 77603 flow [2025-04-14 01:10:22,474 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=57174, PETRI_DIFFERENCE_MINUEND_PLACES=589, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2862, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1212, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1497, PETRI_DIFFERENCE_SUBTRAHEND_STATES=119, PETRI_FLOW=77603, PETRI_PLACES=761, PETRI_TRANSITIONS=3470} [2025-04-14 01:10:22,475 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 735 predicate places. [2025-04-14 01:10:22,475 INFO L485 AbstractCegarLoop]: Abstraction has has 761 places, 3470 transitions, 77603 flow [2025-04-14 01:10:22,476 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 6.057142857142857) internal successors, (212), 35 states have internal predecessors, (212), 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 01:10:22,476 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:10:22,476 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:10:22,485 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-04-14 01:10:22,680 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-04-14 01:10:22,681 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 01:10:22,682 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:10:22,682 INFO L85 PathProgramCache]: Analyzing trace with hash -79114059, now seen corresponding path program 8 times [2025-04-14 01:10:22,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:10:22,682 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035094319] [2025-04-14 01:10:22,682 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:10:22,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:10:22,686 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-04-14 01:10:22,709 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-04-14 01:10:22,709 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:10:22,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:10:24,169 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:10:24,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:10:24,169 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035094319] [2025-04-14 01:10:24,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035094319] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:10:24,169 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [442403604] [2025-04-14 01:10:24,169 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:10:24,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:10:24,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:10:24,171 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:10:24,173 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-04-14 01:10:24,198 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-04-14 01:10:24,226 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-04-14 01:10:24,227 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:10:24,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:10:24,231 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-04-14 01:10:24,232 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:10:25,755 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:10:25,755 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:10:27,094 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:10:27,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [442403604] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:10:27,094 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:10:27,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11] total 32 [2025-04-14 01:10:27,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422500384] [2025-04-14 01:10:27,094 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:10:27,094 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-04-14 01:10:27,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:10:27,095 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-04-14 01:10:27,095 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=224, Invalid=898, Unknown=0, NotChecked=0, Total=1122 [2025-04-14 01:10:27,100 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2025-04-14 01:10:27,101 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 761 places, 3470 transitions, 77603 flow. Second operand has 34 states, 34 states have (on average 7.117647058823529) internal successors, (242), 34 states have internal predecessors, (242), 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 01:10:27,101 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:10:27,101 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2025-04-14 01:10:27,101 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:10:37,798 WARN L286 SmtUtils]: Spent 9.97s on a formula simplification. DAG size of input: 61 DAG size of output: 57 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-14 01:10:54,827 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 01:11:05,010 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 01:11:09,028 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 01:11:13,045 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 01:11:17,394 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 01:11:23,295 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 01:11:28,487 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 01:11:48,480 INFO L116 PetriNetUnfolderBase]: 14192/25162 cut-off events. [2025-04-14 01:11:48,481 INFO L117 PetriNetUnfolderBase]: For 773938/774032 co-relation queries the response was YES. [2025-04-14 01:11:49,073 INFO L83 FinitePrefix]: Finished finitePrefix Result has 271542 conditions, 25162 events. 14192/25162 cut-off events. For 773938/774032 co-relation queries the response was YES. Maximal size of possible extension queue 1176. Compared 206410 event pairs, 57 based on Foata normal form. 33/25193 useless extension candidates. Maximal degree in co-relation 271033. Up to 10296 conditions per place. [2025-04-14 01:11:49,201 INFO L140 encePairwiseOnDemand]: 15/24 looper letters, 2287 selfloop transitions, 1872 changer transitions 37/4221 dead transitions. [2025-04-14 01:11:49,201 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 806 places, 4221 transitions, 100377 flow [2025-04-14 01:11:49,202 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2025-04-14 01:11:49,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2025-04-14 01:11:49,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 657 transitions. [2025-04-14 01:11:49,203 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4487704918032787 [2025-04-14 01:11:49,203 INFO L175 Difference]: Start difference. First operand has 761 places, 3470 transitions, 77603 flow. Second operand 61 states and 657 transitions. [2025-04-14 01:11:49,203 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 806 places, 4221 transitions, 100377 flow [2025-04-14 01:12:10,881 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 785 places, 4221 transitions, 97803 flow, removed 1253 selfloop flow, removed 21 redundant places. [2025-04-14 01:12:10,965 INFO L231 Difference]: Finished difference. Result has 799 places, 3675 transitions, 86196 flow [2025-04-14 01:12:10,968 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=75289, PETRI_DIFFERENCE_MINUEND_PLACES=725, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=3470, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1691, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1700, PETRI_DIFFERENCE_SUBTRAHEND_STATES=61, PETRI_FLOW=86196, PETRI_PLACES=799, PETRI_TRANSITIONS=3675} [2025-04-14 01:12:10,969 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 773 predicate places. [2025-04-14 01:12:10,969 INFO L485 AbstractCegarLoop]: Abstraction has has 799 places, 3675 transitions, 86196 flow [2025-04-14 01:12:10,969 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 7.117647058823529) internal successors, (242), 34 states have internal predecessors, (242), 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 01:12:10,970 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:12:10,970 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:12:10,976 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-04-14 01:12:11,170 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-04-14 01:12:11,170 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 01:12:11,171 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:12:11,171 INFO L85 PathProgramCache]: Analyzing trace with hash -899800778, now seen corresponding path program 9 times [2025-04-14 01:12:11,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:12:11,172 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910289933] [2025-04-14 01:12:11,172 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 01:12:11,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:12:11,176 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 3 equivalence classes. [2025-04-14 01:12:11,196 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 28 of 28 statements. [2025-04-14 01:12:11,197 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-14 01:12:11,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:12:11,775 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:12:11,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:12:11,776 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910289933] [2025-04-14 01:12:11,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910289933] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:12:11,776 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [771740383] [2025-04-14 01:12:11,776 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 01:12:11,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:12:11,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:12:11,778 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:12:11,779 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-04-14 01:12:11,807 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 3 equivalence classes. [2025-04-14 01:12:11,831 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 28 of 28 statements. [2025-04-14 01:12:11,831 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-14 01:12:11,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:12:11,832 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-04-14 01:12:11,834 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:12:12,990 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:12:12,990 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:12:13,992 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:12:13,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [771740383] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:12:13,992 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:12:13,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 28 [2025-04-14 01:12:13,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103167102] [2025-04-14 01:12:13,993 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:12:13,993 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-04-14 01:12:13,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:12:13,993 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-04-14 01:12:13,994 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=706, Unknown=0, NotChecked=0, Total=870 [2025-04-14 01:12:13,995 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2025-04-14 01:12:13,996 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 799 places, 3675 transitions, 86196 flow. Second operand has 30 states, 30 states have (on average 7.3) internal successors, (219), 30 states have internal predecessors, (219), 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 01:12:13,996 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:12:13,996 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2025-04-14 01:12:13,996 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:12:29,849 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 01:12:57,759 INFO L116 PetriNetUnfolderBase]: 16300/28927 cut-off events. [2025-04-14 01:12:57,759 INFO L117 PetriNetUnfolderBase]: For 975749/975873 co-relation queries the response was YES. [2025-04-14 01:12:58,341 INFO L83 FinitePrefix]: Finished finitePrefix Result has 323835 conditions, 28927 events. 16300/28927 cut-off events. For 975749/975873 co-relation queries the response was YES. Maximal size of possible extension queue 1353. Compared 243935 event pairs, 61 based on Foata normal form. 58/28975 useless extension candidates. Maximal degree in co-relation 323406. Up to 12392 conditions per place. [2025-04-14 01:12:58,486 INFO L140 encePairwiseOnDemand]: 15/24 looper letters, 2448 selfloop transitions, 2129 changer transitions 121/4723 dead transitions. [2025-04-14 01:12:58,486 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 861 places, 4723 transitions, 118989 flow [2025-04-14 01:12:58,487 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2025-04-14 01:12:58,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2025-04-14 01:12:58,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 743 transitions. [2025-04-14 01:12:58,488 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.44867149758454106 [2025-04-14 01:12:58,488 INFO L175 Difference]: Start difference. First operand has 799 places, 3675 transitions, 86196 flow. Second operand 69 states and 743 transitions. [2025-04-14 01:12:58,488 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 861 places, 4723 transitions, 118989 flow [2025-04-14 01:13:25,893 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 839 places, 4723 transitions, 118338 flow, removed 246 selfloop flow, removed 22 redundant places. [2025-04-14 01:13:25,975 INFO L231 Difference]: Finished difference. Result has 872 places, 4145 transitions, 105832 flow [2025-04-14 01:13:25,978 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=85598, PETRI_DIFFERENCE_MINUEND_PLACES=771, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=3675, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1720, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1799, PETRI_DIFFERENCE_SUBTRAHEND_STATES=69, PETRI_FLOW=105832, PETRI_PLACES=872, PETRI_TRANSITIONS=4145} [2025-04-14 01:13:25,978 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 846 predicate places. [2025-04-14 01:13:25,979 INFO L485 AbstractCegarLoop]: Abstraction has has 872 places, 4145 transitions, 105832 flow [2025-04-14 01:13:25,979 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 7.3) internal successors, (219), 30 states have internal predecessors, (219), 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 01:13:25,979 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:13:25,979 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:13:25,985 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-04-14 01:13:26,179 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-04-14 01:13:26,180 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 01:13:26,180 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:13:26,180 INFO L85 PathProgramCache]: Analyzing trace with hash 16745884, now seen corresponding path program 10 times [2025-04-14 01:13:26,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:13:26,181 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795414657] [2025-04-14 01:13:26,181 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 01:13:26,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:13:26,184 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-04-14 01:13:26,191 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-14 01:13:26,191 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 01:13:26,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:13:26,452 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:13:26,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:13:26,453 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795414657] [2025-04-14 01:13:26,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795414657] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:13:26,453 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [676411415] [2025-04-14 01:13:26,453 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 01:13:26,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:13:26,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:13:26,455 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:13:26,461 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-04-14 01:13:26,484 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-04-14 01:13:26,496 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-14 01:13:26,496 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 01:13:26,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:13:26,497 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-04-14 01:13:26,498 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:13:26,800 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:13:26,800 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:13:27,063 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:13:27,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [676411415] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:13:27,063 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:13:27,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 10] total 23 [2025-04-14 01:13:27,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732357791] [2025-04-14 01:13:27,063 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:13:27,063 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-04-14 01:13:27,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:13:27,064 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-04-14 01:13:27,064 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=460, Unknown=0, NotChecked=0, Total=552 [2025-04-14 01:13:27,077 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 24 [2025-04-14 01:13:27,077 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 872 places, 4145 transitions, 105832 flow. Second operand has 24 states, 24 states have (on average 6.25) internal successors, (150), 24 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:13:27,077 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:13:27,077 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 24 [2025-04-14 01:13:27,077 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:13:38,630 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 01:13:44,188 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 01:13:48,196 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 01:13:53,418 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 01:14:03,377 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 01:14:34,040 INFO L116 PetriNetUnfolderBase]: 24144/40797 cut-off events. [2025-04-14 01:14:34,041 INFO L117 PetriNetUnfolderBase]: For 1623729/1623729 co-relation queries the response was YES. [2025-04-14 01:14:36,080 INFO L83 FinitePrefix]: Finished finitePrefix Result has 484119 conditions, 40797 events. 24144/40797 cut-off events. For 1623729/1623729 co-relation queries the response was YES. Maximal size of possible extension queue 1644. Compared 332769 event pairs, 87 based on Foata normal form. 93/40889 useless extension candidates. Maximal degree in co-relation 483328. Up to 18538 conditions per place. [2025-04-14 01:14:36,359 INFO L140 encePairwiseOnDemand]: 13/24 looper letters, 3312 selfloop transitions, 2830 changer transitions 0/6144 dead transitions. [2025-04-14 01:14:36,359 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 928 places, 6144 transitions, 166216 flow [2025-04-14 01:14:36,360 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2025-04-14 01:14:36,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2025-04-14 01:14:36,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 750 transitions. [2025-04-14 01:14:36,366 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4222972972972973 [2025-04-14 01:14:36,366 INFO L175 Difference]: Start difference. First operand has 872 places, 4145 transitions, 105832 flow. Second operand 74 states and 750 transitions. [2025-04-14 01:14:36,366 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 928 places, 6144 transitions, 166216 flow Received shutdown request... [2025-04-14 01:14:51,353 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2025-04-14 01:14:51,360 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-04-14 01:14:51,384 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-04-14 01:14:51,384 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-04-14 01:14:51,558 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-04-14 01:14:51,559 WARN L610 AbstractCegarLoop]: Verification canceled: while executing RemoveRedundantFlow. [2025-04-14 01:14:51,562 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2025-04-14 01:14:51,562 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2025-04-14 01:14:51,563 INFO L422 BasicCegarLoop]: Path program histogram: [10, 4, 1, 1] [2025-04-14 01:14:51,579 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-14 01:14:51,579 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-14 01:14:51,587 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.04 01:14:51 BasicIcfg [2025-04-14 01:14:51,587 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-14 01:14:51,588 INFO L158 Benchmark]: Toolchain (without parser) took 825943.26ms. Allocated memory was 142.6MB in the beginning and 3.1GB in the end (delta: 2.9GB). Free memory was 100.7MB in the beginning and 460.2MB in the end (delta: -359.5MB). Peak memory consumption was 2.9GB. Max. memory is 8.0GB. [2025-04-14 01:14:51,588 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 159.4MB. Free memory is still 87.3MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 01:14:51,588 INFO L158 Benchmark]: CACSL2BoogieTranslator took 243.64ms. Allocated memory is still 142.6MB. Free memory was 99.9MB in the beginning and 85.8MB in the end (delta: 14.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-14 01:14:51,588 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.66ms. Allocated memory is still 142.6MB. Free memory was 85.8MB in the beginning and 84.0MB in the end (delta: 1.8MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-14 01:14:51,588 INFO L158 Benchmark]: Boogie Preprocessor took 38.10ms. Allocated memory is still 142.6MB. Free memory was 84.0MB in the beginning and 82.4MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 01:14:51,588 INFO L158 Benchmark]: IcfgBuilder took 388.41ms. Allocated memory is still 142.6MB. Free memory was 82.4MB in the beginning and 56.3MB in the end (delta: 26.1MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2025-04-14 01:14:51,589 INFO L158 Benchmark]: TraceAbstraction took 825241.36ms. Allocated memory was 142.6MB in the beginning and 3.1GB in the end (delta: 2.9GB). Free memory was 55.5MB in the beginning and 460.2MB in the end (delta: -404.7MB). Peak memory consumption was 2.8GB. Max. memory is 8.0GB. [2025-04-14 01:14:51,590 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.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 243.64ms. Allocated memory is still 142.6MB. Free memory was 99.9MB in the beginning and 85.8MB in the end (delta: 14.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 27.66ms. Allocated memory is still 142.6MB. Free memory was 85.8MB in the beginning and 84.0MB in the end (delta: 1.8MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 38.10ms. Allocated memory is still 142.6MB. Free memory was 84.0MB in the beginning and 82.4MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 8.0GB. * IcfgBuilder took 388.41ms. Allocated memory is still 142.6MB. Free memory was 82.4MB in the beginning and 56.3MB in the end (delta: 26.1MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * TraceAbstraction took 825241.36ms. Allocated memory was 142.6MB in the beginning and 3.1GB in the end (delta: 2.9GB). Free memory was 55.5MB in the beginning and 460.2MB in the end (delta: -404.7MB). Peak memory consumption was 2.8GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 95]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while executing RemoveRedundantFlow. - TimeoutResultAtElement [Line: 90]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while executing RemoveRedundantFlow. - TimeoutResultAtElement [Line: 89]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while executing RemoveRedundantFlow. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 38 locations, 41 edges, 3 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 825.1s, OverallIterations: 16, TraceHistogramMax: 3, PathProgramHistogramMax: 10, EmptinessCheckTime: 0.0s, AutomataDifference: 772.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 15 mSolverCounterUnknown, 4435 SdHoareTripleChecker+Valid, 107.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4416 mSDsluCounter, 883 SdHoareTripleChecker+Invalid, 105.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 62 IncrementalHoareTripleChecker+Unchecked, 839 mSDsCounter, 786 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 18456 IncrementalHoareTripleChecker+Invalid, 19319 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 786 mSolverCounterUnsat, 44 mSDtfsCounter, 18456 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1358 GetRequests, 392 SyntacticMatches, 14 SemanticMatches, 952 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 29793 ImplicationChecksByTransitivity, 455.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=105832occurred in iteration=15, InterpolantAutomatonStates: 796, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 49.1s InterpolantComputationTime, 649 NumberOfCodeBlocks, 649 NumberOfCodeBlocksAsserted, 49 NumberOfCheckSat, 891 ConstructedInterpolants, 0 QuantifiedInterpolants, 23457 SizeOfPredicates, 84 NumberOfNonLiveVariables, 1183 ConjunctsInSsa, 228 ConjunctsInUnsatCore, 38 InterpolantComputations, 5 PerfectInterpolantSequences, 12/154 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown