./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/mult-comm.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/weaver/mult-comm.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash de93f11842753a9f5cde98724d1851736862f745073786263bfd177abe6c2376 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 10:08:31,702 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 10:08:31,758 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-04 10:08:31,762 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 10:08:31,762 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 10:08:31,780 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 10:08:31,781 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 10:08:31,781 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 10:08:31,781 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 10:08:31,781 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 10:08:31,781 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 10:08:31,781 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 10:08:31,781 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 10:08:31,782 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 10:08:31,782 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 10:08:31,782 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 10:08:31,782 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 10:08:31,782 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 10:08:31,782 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 10:08:31,782 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 10:08:31,782 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 10:08:31,782 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 10:08:31,782 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-04 10:08:31,782 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 10:08:31,782 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 10:08:31,782 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 10:08:31,782 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 10:08:31,784 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 10:08:31,784 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 10:08:31,784 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 10:08:31,784 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 10:08:31,784 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 10:08:31,784 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 10:08:31,784 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:08:31,784 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 10:08:31,784 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 10:08:31,784 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 10:08:31,784 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 10:08:31,785 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 10:08:31,785 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 10:08:31,785 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 10:08:31,785 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 10:08:31,785 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> de93f11842753a9f5cde98724d1851736862f745073786263bfd177abe6c2376 [2025-03-04 10:08:31,999 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 10:08:32,004 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 10:08:32,005 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 10:08:32,006 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 10:08:32,006 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 10:08:32,007 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/mult-comm.wvr.c [2025-03-04 10:08:33,106 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7427714ce/3b57b9d57b6c4bfbb53748fd3065eee4/FLAG59412daf8 [2025-03-04 10:08:33,329 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 10:08:33,331 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/mult-comm.wvr.c [2025-03-04 10:08:33,339 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7427714ce/3b57b9d57b6c4bfbb53748fd3065eee4/FLAG59412daf8 [2025-03-04 10:08:33,675 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7427714ce/3b57b9d57b6c4bfbb53748fd3065eee4 [2025-03-04 10:08:33,677 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 10:08:33,678 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 10:08:33,679 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 10:08:33,679 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 10:08:33,682 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 10:08:33,683 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:08:33" (1/1) ... [2025-03-04 10:08:33,685 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b915e48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:08:33, skipping insertion in model container [2025-03-04 10:08:33,685 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:08:33" (1/1) ... [2025-03-04 10:08:33,694 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 10:08:33,810 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:08:33,818 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 10:08:33,831 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:08:33,842 INFO L204 MainTranslator]: Completed translation [2025-03-04 10:08:33,842 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:08:33 WrapperNode [2025-03-04 10:08:33,842 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 10:08:33,843 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 10:08:33,843 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 10:08:33,844 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 10:08:33,848 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:08:33" (1/1) ... [2025-03-04 10:08:33,853 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:08:33" (1/1) ... [2025-03-04 10:08:33,865 INFO L138 Inliner]: procedures = 20, calls = 10, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 43 [2025-03-04 10:08:33,867 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 10:08:33,867 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 10:08:33,867 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 10:08:33,868 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 10:08:33,872 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:08:33" (1/1) ... [2025-03-04 10:08:33,873 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:08:33" (1/1) ... [2025-03-04 10:08:33,873 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:08:33" (1/1) ... [2025-03-04 10:08:33,882 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-03-04 10:08:33,883 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:08:33" (1/1) ... [2025-03-04 10:08:33,883 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:08:33" (1/1) ... [2025-03-04 10:08:33,887 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:08:33" (1/1) ... [2025-03-04 10:08:33,891 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:08:33" (1/1) ... [2025-03-04 10:08:33,891 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:08:33" (1/1) ... [2025-03-04 10:08:33,892 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:08:33" (1/1) ... [2025-03-04 10:08:33,893 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 10:08:33,895 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 10:08:33,895 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 10:08:33,895 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 10:08:33,896 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:08:33" (1/1) ... [2025-03-04 10:08:33,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:08:33,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:08:33,919 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-03-04 10:08:33,921 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-03-04 10:08:33,935 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 10:08:33,935 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-04 10:08:33,935 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-04 10:08:33,935 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-04 10:08:33,935 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-04 10:08:33,935 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 10:08:33,936 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 10:08:33,936 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 10:08:33,936 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 10:08:33,992 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 10:08:33,993 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 10:08:34,119 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 10:08:34,120 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 10:08:34,229 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 10:08:34,230 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 10:08:34,230 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:08:34 BoogieIcfgContainer [2025-03-04 10:08:34,231 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 10:08:34,232 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 10:08:34,233 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 10:08:34,236 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 10:08:34,236 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 10:08:33" (1/3) ... [2025-03-04 10:08:34,238 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5dace7b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:08:34, skipping insertion in model container [2025-03-04 10:08:34,238 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:08:33" (2/3) ... [2025-03-04 10:08:34,238 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5dace7b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:08:34, skipping insertion in model container [2025-03-04 10:08:34,238 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:08:34" (3/3) ... [2025-03-04 10:08:34,239 INFO L128 eAbstractionObserver]: Analyzing ICFG mult-comm.wvr.c [2025-03-04 10:08:34,250 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 10:08:34,252 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG mult-comm.wvr.c that has 3 procedures, 19 locations, 1 initial locations, 2 loop locations, and 2 error locations. [2025-03-04 10:08:34,252 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 10:08:34,298 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-04 10:08:34,329 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 25 places, 20 transitions, 54 flow [2025-03-04 10:08:34,354 INFO L124 PetriNetUnfolderBase]: 2/18 cut-off events. [2025-03-04 10:08:34,355 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 10:08:34,361 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27 conditions, 18 events. 2/18 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 12 event pairs, 0 based on Foata normal form. 0/14 useless extension candidates. Maximal degree in co-relation 11. Up to 2 conditions per place. [2025-03-04 10:08:34,361 INFO L82 GeneralOperation]: Start removeDead. Operand has 25 places, 20 transitions, 54 flow [2025-03-04 10:08:34,363 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 22 places, 17 transitions, 46 flow [2025-03-04 10:08:34,373 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 10:08:34,383 INFO L333 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=None, 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;@7f15f462, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 10:08:34,383 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-03-04 10:08:34,391 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 10:08:34,392 INFO L124 PetriNetUnfolderBase]: 2/14 cut-off events. [2025-03-04 10:08:34,392 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 10:08:34,392 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:08:34,393 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:08:34,393 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 10:08:34,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:08:34,397 INFO L85 PathProgramCache]: Analyzing trace with hash -1754674639, now seen corresponding path program 1 times [2025-03-04 10:08:34,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:08:34,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563396146] [2025-03-04 10:08:34,402 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:08:34,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:08:34,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 10:08:34,481 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 10:08:34,482 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:08:34,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:08:34,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:08:34,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:08:34,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563396146] [2025-03-04 10:08:34,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563396146] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:08:34,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:08:34,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:08:34,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404015788] [2025-03-04 10:08:34,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:08:34,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:08:34,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:08:34,733 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:08:34,734 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:08:34,735 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 20 [2025-03-04 10:08:34,737 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 22 places, 17 transitions, 46 flow. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:08:34,737 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:08:34,739 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 20 [2025-03-04 10:08:34,739 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:08:34,808 INFO L124 PetriNetUnfolderBase]: 68/123 cut-off events. [2025-03-04 10:08:34,808 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2025-03-04 10:08:34,809 INFO L83 FinitePrefix]: Finished finitePrefix Result has 269 conditions, 123 events. 68/123 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 317 event pairs, 22 based on Foata normal form. 2/95 useless extension candidates. Maximal degree in co-relation 220. Up to 72 conditions per place. [2025-03-04 10:08:34,812 INFO L140 encePairwiseOnDemand]: 15/20 looper letters, 21 selfloop transitions, 3 changer transitions 1/26 dead transitions. [2025-03-04 10:08:34,812 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 22 places, 26 transitions, 123 flow [2025-03-04 10:08:34,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:08:34,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:08:34,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 39 transitions. [2025-03-04 10:08:34,822 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.65 [2025-03-04 10:08:34,823 INFO L175 Difference]: Start difference. First operand has 22 places, 17 transitions, 46 flow. Second operand 3 states and 39 transitions. [2025-03-04 10:08:34,823 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 22 places, 26 transitions, 123 flow [2025-03-04 10:08:34,828 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 18 places, 26 transitions, 109 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 10:08:34,830 INFO L231 Difference]: Finished difference. Result has 19 places, 17 transitions, 53 flow [2025-03-04 10:08:34,832 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=34, PETRI_DIFFERENCE_MINUEND_PLACES=16, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=15, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=53, PETRI_PLACES=19, PETRI_TRANSITIONS=17} [2025-03-04 10:08:34,836 INFO L279 CegarLoopForPetriNet]: 22 programPoint places, -3 predicate places. [2025-03-04 10:08:34,837 INFO L471 AbstractCegarLoop]: Abstraction has has 19 places, 17 transitions, 53 flow [2025-03-04 10:08:34,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:08:34,837 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:08:34,837 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:08:34,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 10:08:34,838 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 10:08:34,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:08:34,839 INFO L85 PathProgramCache]: Analyzing trace with hash 1263953491, now seen corresponding path program 1 times [2025-03-04 10:08:34,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:08:34,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964674815] [2025-03-04 10:08:34,839 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:08:34,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:08:34,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 10:08:34,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 10:08:34,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:08:34,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:08:35,088 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:08:35,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:08:35,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964674815] [2025-03-04 10:08:35,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964674815] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:08:35,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1822607930] [2025-03-04 10:08:35,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:08:35,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:08:35,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:08:35,094 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-03-04 10:08:35,095 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-03-04 10:08:35,127 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 10:08:35,141 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 10:08:35,141 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:08:35,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:08:35,143 INFO L256 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 10:08:35,145 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:08:35,247 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:08:35,247 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:08:35,468 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:08:35,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1822607930] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:08:35,469 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:08:35,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 4] total 8 [2025-03-04 10:08:35,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147066256] [2025-03-04 10:08:35,470 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:08:35,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 10:08:35,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:08:35,471 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 10:08:35,471 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-03-04 10:08:35,471 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 20 [2025-03-04 10:08:35,471 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 19 places, 17 transitions, 53 flow. Second operand has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 9 states have internal predecessors, (62), 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-03-04 10:08:35,471 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:08:35,471 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 20 [2025-03-04 10:08:35,471 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:08:35,623 INFO L124 PetriNetUnfolderBase]: 70/131 cut-off events. [2025-03-04 10:08:35,624 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2025-03-04 10:08:35,624 INFO L83 FinitePrefix]: Finished finitePrefix Result has 320 conditions, 131 events. 70/131 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 354 event pairs, 12 based on Foata normal form. 1/132 useless extension candidates. Maximal degree in co-relation 104. Up to 70 conditions per place. [2025-03-04 10:08:35,625 INFO L140 encePairwiseOnDemand]: 14/20 looper letters, 23 selfloop transitions, 5 changer transitions 12/41 dead transitions. [2025-03-04 10:08:35,625 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 41 transitions, 196 flow [2025-03-04 10:08:35,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:08:35,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 10:08:35,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 65 transitions. [2025-03-04 10:08:35,626 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5416666666666666 [2025-03-04 10:08:35,626 INFO L175 Difference]: Start difference. First operand has 19 places, 17 transitions, 53 flow. Second operand 6 states and 65 transitions. [2025-03-04 10:08:35,626 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 24 places, 41 transitions, 196 flow [2025-03-04 10:08:35,627 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 23 places, 41 transitions, 191 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 10:08:35,628 INFO L231 Difference]: Finished difference. Result has 26 places, 19 transitions, 78 flow [2025-03-04 10:08:35,628 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=18, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=78, PETRI_PLACES=26, PETRI_TRANSITIONS=19} [2025-03-04 10:08:35,628 INFO L279 CegarLoopForPetriNet]: 22 programPoint places, 4 predicate places. [2025-03-04 10:08:35,628 INFO L471 AbstractCegarLoop]: Abstraction has has 26 places, 19 transitions, 78 flow [2025-03-04 10:08:35,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 9 states have internal predecessors, (62), 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-03-04 10:08:35,629 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:08:35,629 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:08:35,635 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 10:08:35,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:08:35,829 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 10:08:35,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:08:35,834 INFO L85 PathProgramCache]: Analyzing trace with hash -733799783, now seen corresponding path program 2 times [2025-03-04 10:08:35,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:08:35,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305240754] [2025-03-04 10:08:35,834 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:08:35,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:08:35,845 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-03-04 10:08:35,859 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 10:08:35,860 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:08:35,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:08:36,093 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:08:36,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:08:36,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305240754] [2025-03-04 10:08:36,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305240754] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:08:36,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [353784851] [2025-03-04 10:08:36,093 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:08:36,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:08:36,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:08:36,096 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-03-04 10:08:36,098 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-03-04 10:08:36,124 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-03-04 10:08:36,135 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 10:08:36,135 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:08:36,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:08:36,136 INFO L256 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-04 10:08:36,137 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:08:36,225 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:08:36,225 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:08:36,341 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:08:36,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [353784851] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:08:36,342 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:08:36,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 5] total 13 [2025-03-04 10:08:36,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860438364] [2025-03-04 10:08:36,343 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:08:36,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 10:08:36,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:08:36,343 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 10:08:36,343 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2025-03-04 10:08:36,344 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 20 [2025-03-04 10:08:36,344 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 19 transitions, 78 flow. Second operand has 14 states, 14 states have (on average 6.357142857142857) internal successors, (89), 14 states have internal predecessors, (89), 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-03-04 10:08:36,344 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:08:36,344 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 20 [2025-03-04 10:08:36,344 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:08:36,528 INFO L124 PetriNetUnfolderBase]: 113/210 cut-off events. [2025-03-04 10:08:36,528 INFO L125 PetriNetUnfolderBase]: For 76/76 co-relation queries the response was YES. [2025-03-04 10:08:36,528 INFO L83 FinitePrefix]: Finished finitePrefix Result has 572 conditions, 210 events. 113/210 cut-off events. For 76/76 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 673 event pairs, 11 based on Foata normal form. 3/213 useless extension candidates. Maximal degree in co-relation 555. Up to 87 conditions per place. [2025-03-04 10:08:36,529 INFO L140 encePairwiseOnDemand]: 12/20 looper letters, 38 selfloop transitions, 20 changer transitions 9/68 dead transitions. [2025-03-04 10:08:36,529 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 68 transitions, 363 flow [2025-03-04 10:08:36,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 10:08:36,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-04 10:08:36,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 113 transitions. [2025-03-04 10:08:36,533 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5136363636363637 [2025-03-04 10:08:36,533 INFO L175 Difference]: Start difference. First operand has 26 places, 19 transitions, 78 flow. Second operand 11 states and 113 transitions. [2025-03-04 10:08:36,533 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 68 transitions, 363 flow [2025-03-04 10:08:36,534 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 68 transitions, 341 flow, removed 6 selfloop flow, removed 3 redundant places. [2025-03-04 10:08:36,535 INFO L231 Difference]: Finished difference. Result has 38 places, 34 transitions, 201 flow [2025-03-04 10:08:36,535 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=9, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=201, PETRI_PLACES=38, PETRI_TRANSITIONS=34} [2025-03-04 10:08:36,536 INFO L279 CegarLoopForPetriNet]: 22 programPoint places, 16 predicate places. [2025-03-04 10:08:36,536 INFO L471 AbstractCegarLoop]: Abstraction has has 38 places, 34 transitions, 201 flow [2025-03-04 10:08:36,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.357142857142857) internal successors, (89), 14 states have internal predecessors, (89), 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-03-04 10:08:36,536 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:08:36,536 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:08:36,542 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-03-04 10:08:36,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2025-03-04 10:08:36,740 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 10:08:36,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:08:36,741 INFO L85 PathProgramCache]: Analyzing trace with hash -1979809691, now seen corresponding path program 1 times [2025-03-04 10:08:36,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:08:36,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428229091] [2025-03-04 10:08:36,741 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:08:36,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:08:36,752 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 10:08:36,764 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 10:08:36,764 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:08:36,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:08:36,892 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:08:36,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:08:36,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428229091] [2025-03-04 10:08:36,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428229091] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:08:36,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1362479380] [2025-03-04 10:08:36,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:08:36,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:08:36,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:08:36,895 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-03-04 10:08:36,897 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-03-04 10:08:36,922 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 10:08:36,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 10:08:36,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:08:36,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:08:36,935 INFO L256 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 10:08:36,936 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:08:37,005 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:08:37,005 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:08:37,113 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:08:37,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1362479380] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:08:37,113 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:08:37,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 4] total 8 [2025-03-04 10:08:37,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684483838] [2025-03-04 10:08:37,114 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:08:37,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 10:08:37,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:08:37,115 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 10:08:37,116 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-03-04 10:08:37,116 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 20 [2025-03-04 10:08:37,116 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 34 transitions, 201 flow. Second operand has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 9 states have internal predecessors, (62), 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-03-04 10:08:37,116 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:08:37,116 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 20 [2025-03-04 10:08:37,116 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:08:37,201 INFO L124 PetriNetUnfolderBase]: 117/221 cut-off events. [2025-03-04 10:08:37,202 INFO L125 PetriNetUnfolderBase]: For 247/247 co-relation queries the response was YES. [2025-03-04 10:08:37,204 INFO L83 FinitePrefix]: Finished finitePrefix Result has 799 conditions, 221 events. 117/221 cut-off events. For 247/247 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 742 event pairs, 19 based on Foata normal form. 1/222 useless extension candidates. Maximal degree in co-relation 740. Up to 171 conditions per place. [2025-03-04 10:08:37,205 INFO L140 encePairwiseOnDemand]: 14/20 looper letters, 33 selfloop transitions, 6 changer transitions 12/52 dead transitions. [2025-03-04 10:08:37,205 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 52 transitions, 367 flow [2025-03-04 10:08:37,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:08:37,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 10:08:37,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 63 transitions. [2025-03-04 10:08:37,207 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.525 [2025-03-04 10:08:37,207 INFO L175 Difference]: Start difference. First operand has 38 places, 34 transitions, 201 flow. Second operand 6 states and 63 transitions. [2025-03-04 10:08:37,207 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 52 transitions, 367 flow [2025-03-04 10:08:37,209 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 52 transitions, 315 flow, removed 20 selfloop flow, removed 3 redundant places. [2025-03-04 10:08:37,212 INFO L231 Difference]: Finished difference. Result has 41 places, 33 transitions, 162 flow [2025-03-04 10:08:37,212 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=162, PETRI_PLACES=41, PETRI_TRANSITIONS=33} [2025-03-04 10:08:37,213 INFO L279 CegarLoopForPetriNet]: 22 programPoint places, 19 predicate places. [2025-03-04 10:08:37,213 INFO L471 AbstractCegarLoop]: Abstraction has has 41 places, 33 transitions, 162 flow [2025-03-04 10:08:37,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 9 states have internal predecessors, (62), 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-03-04 10:08:37,214 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:08:37,214 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:08:37,220 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 10:08:37,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:08:37,418 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 10:08:37,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:08:37,419 INFO L85 PathProgramCache]: Analyzing trace with hash -1206354967, now seen corresponding path program 3 times [2025-03-04 10:08:37,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:08:37,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33972333] [2025-03-04 10:08:37,420 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:08:37,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:08:37,425 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 14 statements into 2 equivalence classes. [2025-03-04 10:08:37,431 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 10:08:37,431 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 10:08:37,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:08:37,560 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:08:37,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:08:37,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33972333] [2025-03-04 10:08:37,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33972333] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:08:37,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1706207206] [2025-03-04 10:08:37,561 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:08:37,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:08:37,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:08:37,564 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-03-04 10:08:37,565 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-03-04 10:08:37,590 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 14 statements into 2 equivalence classes. [2025-03-04 10:08:37,600 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 10:08:37,601 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 10:08:37,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:08:37,602 INFO L256 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-04 10:08:37,602 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:08:37,684 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:08:37,684 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:08:37,836 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:08:37,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1706207206] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:08:37,837 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:08:37,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 5] total 12 [2025-03-04 10:08:37,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916568668] [2025-03-04 10:08:37,837 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:08:37,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 10:08:37,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:08:37,838 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 10:08:37,838 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2025-03-04 10:08:37,838 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 20 [2025-03-04 10:08:37,838 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 33 transitions, 162 flow. Second operand has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 states have internal predecessors, (82), 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-03-04 10:08:37,838 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:08:37,838 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 20 [2025-03-04 10:08:37,838 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:08:37,961 INFO L124 PetriNetUnfolderBase]: 120/220 cut-off events. [2025-03-04 10:08:37,961 INFO L125 PetriNetUnfolderBase]: For 223/223 co-relation queries the response was YES. [2025-03-04 10:08:37,962 INFO L83 FinitePrefix]: Finished finitePrefix Result has 707 conditions, 220 events. 120/220 cut-off events. For 223/223 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 717 event pairs, 18 based on Foata normal form. 2/218 useless extension candidates. Maximal degree in co-relation 688. Up to 161 conditions per place. [2025-03-04 10:08:37,962 INFO L140 encePairwiseOnDemand]: 13/20 looper letters, 38 selfloop transitions, 17 changer transitions 6/62 dead transitions. [2025-03-04 10:08:37,962 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 62 transitions, 395 flow [2025-03-04 10:08:37,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 10:08:37,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 10:08:37,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 87 transitions. [2025-03-04 10:08:37,963 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.48333333333333334 [2025-03-04 10:08:37,963 INFO L175 Difference]: Start difference. First operand has 41 places, 33 transitions, 162 flow. Second operand 9 states and 87 transitions. [2025-03-04 10:08:37,963 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 62 transitions, 395 flow [2025-03-04 10:08:37,965 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 62 transitions, 375 flow, removed 1 selfloop flow, removed 4 redundant places. [2025-03-04 10:08:37,965 INFO L231 Difference]: Finished difference. Result has 47 places, 43 transitions, 261 flow [2025-03-04 10:08:37,966 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=261, PETRI_PLACES=47, PETRI_TRANSITIONS=43} [2025-03-04 10:08:37,966 INFO L279 CegarLoopForPetriNet]: 22 programPoint places, 25 predicate places. [2025-03-04 10:08:37,966 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 43 transitions, 261 flow [2025-03-04 10:08:37,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 states have internal predecessors, (82), 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-03-04 10:08:37,966 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:08:37,966 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:08:37,972 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-04 10:08:38,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:08:38,167 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 10:08:38,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:08:38,167 INFO L85 PathProgramCache]: Analyzing trace with hash 1090735483, now seen corresponding path program 2 times [2025-03-04 10:08:38,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:08:38,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981746473] [2025-03-04 10:08:38,168 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:08:38,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:08:38,187 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-03-04 10:08:38,192 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 10:08:38,192 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:08:38,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:08:38,316 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:08:38,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:08:38,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981746473] [2025-03-04 10:08:38,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981746473] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:08:38,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [304485823] [2025-03-04 10:08:38,317 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:08:38,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:08:38,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:08:38,319 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-03-04 10:08:38,320 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-03-04 10:08:38,342 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-03-04 10:08:38,352 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 10:08:38,353 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:08:38,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:08:38,353 INFO L256 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 10:08:38,354 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:08:38,404 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:08:38,404 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:08:38,508 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:08:38,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [304485823] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:08:38,508 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:08:38,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 4] total 9 [2025-03-04 10:08:38,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866993589] [2025-03-04 10:08:38,508 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:08:38,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 10:08:38,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:08:38,509 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 10:08:38,509 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2025-03-04 10:08:38,509 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 20 [2025-03-04 10:08:38,509 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 43 transitions, 261 flow. Second operand has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:08:38,509 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:08:38,509 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 20 [2025-03-04 10:08:38,509 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:08:38,619 INFO L124 PetriNetUnfolderBase]: 148/270 cut-off events. [2025-03-04 10:08:38,619 INFO L125 PetriNetUnfolderBase]: For 483/483 co-relation queries the response was YES. [2025-03-04 10:08:38,620 INFO L83 FinitePrefix]: Finished finitePrefix Result has 977 conditions, 270 events. 148/270 cut-off events. For 483/483 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 950 event pairs, 24 based on Foata normal form. 2/268 useless extension candidates. Maximal degree in co-relation 924. Up to 211 conditions per place. [2025-03-04 10:08:38,620 INFO L140 encePairwiseOnDemand]: 14/20 looper letters, 48 selfloop transitions, 17 changer transitions 4/70 dead transitions. [2025-03-04 10:08:38,620 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 70 transitions, 525 flow [2025-03-04 10:08:38,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 10:08:38,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 10:08:38,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 80 transitions. [2025-03-04 10:08:38,622 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5 [2025-03-04 10:08:38,623 INFO L175 Difference]: Start difference. First operand has 47 places, 43 transitions, 261 flow. Second operand 8 states and 80 transitions. [2025-03-04 10:08:38,623 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 70 transitions, 525 flow [2025-03-04 10:08:38,625 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 70 transitions, 475 flow, removed 16 selfloop flow, removed 3 redundant places. [2025-03-04 10:08:38,625 INFO L231 Difference]: Finished difference. Result has 53 places, 51 transitions, 314 flow [2025-03-04 10:08:38,626 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=314, PETRI_PLACES=53, PETRI_TRANSITIONS=51} [2025-03-04 10:08:38,626 INFO L279 CegarLoopForPetriNet]: 22 programPoint places, 31 predicate places. [2025-03-04 10:08:38,626 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 51 transitions, 314 flow [2025-03-04 10:08:38,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:08:38,626 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:08:38,626 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:08:38,632 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-04 10:08:38,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:08:38,827 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 10:08:38,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:08:38,828 INFO L85 PathProgramCache]: Analyzing trace with hash -1969741565, now seen corresponding path program 3 times [2025-03-04 10:08:38,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:08:38,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865944148] [2025-03-04 10:08:38,828 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:08:38,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:08:38,831 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 14 statements into 2 equivalence classes. [2025-03-04 10:08:38,835 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 10:08:38,835 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 10:08:38,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:08:38,962 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:08:38,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:08:38,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865944148] [2025-03-04 10:08:38,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865944148] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:08:38,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1071738263] [2025-03-04 10:08:38,963 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:08:38,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:08:38,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:08:38,964 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-03-04 10:08:38,966 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-03-04 10:08:38,989 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 14 statements into 2 equivalence classes. [2025-03-04 10:08:38,998 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 10:08:38,998 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 10:08:38,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:08:38,999 INFO L256 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 10:08:38,999 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:08:39,041 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:08:39,041 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:08:39,098 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:08:39,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1071738263] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:08:39,098 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:08:39,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 4] total 10 [2025-03-04 10:08:39,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874815667] [2025-03-04 10:08:39,098 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:08:39,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 10:08:39,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:08:39,099 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 10:08:39,099 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2025-03-04 10:08:39,099 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 20 [2025-03-04 10:08:39,099 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 51 transitions, 314 flow. Second operand has 11 states, 11 states have (on average 6.636363636363637) internal successors, (73), 11 states have internal predecessors, (73), 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-03-04 10:08:39,099 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:08:39,099 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 20 [2025-03-04 10:08:39,099 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:08:39,232 INFO L124 PetriNetUnfolderBase]: 186/341 cut-off events. [2025-03-04 10:08:39,232 INFO L125 PetriNetUnfolderBase]: For 604/604 co-relation queries the response was YES. [2025-03-04 10:08:39,233 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1274 conditions, 341 events. 186/341 cut-off events. For 604/604 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1304 event pairs, 36 based on Foata normal form. 3/340 useless extension candidates. Maximal degree in co-relation 1215. Up to 240 conditions per place. [2025-03-04 10:08:39,234 INFO L140 encePairwiseOnDemand]: 14/20 looper letters, 55 selfloop transitions, 22 changer transitions 7/85 dead transitions. [2025-03-04 10:08:39,234 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 85 transitions, 653 flow [2025-03-04 10:08:39,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 10:08:39,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 10:08:39,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 97 transitions. [2025-03-04 10:08:39,235 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.485 [2025-03-04 10:08:39,235 INFO L175 Difference]: Start difference. First operand has 53 places, 51 transitions, 314 flow. Second operand 10 states and 97 transitions. [2025-03-04 10:08:39,235 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 85 transitions, 653 flow [2025-03-04 10:08:39,237 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 85 transitions, 601 flow, removed 17 selfloop flow, removed 3 redundant places. [2025-03-04 10:08:39,238 INFO L231 Difference]: Finished difference. Result has 62 places, 62 transitions, 404 flow [2025-03-04 10:08:39,238 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=266, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=404, PETRI_PLACES=62, PETRI_TRANSITIONS=62} [2025-03-04 10:08:39,239 INFO L279 CegarLoopForPetriNet]: 22 programPoint places, 40 predicate places. [2025-03-04 10:08:39,239 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 62 transitions, 404 flow [2025-03-04 10:08:39,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.636363636363637) internal successors, (73), 11 states have internal predecessors, (73), 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-03-04 10:08:39,239 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:08:39,239 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:08:39,246 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-04 10:08:39,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:08:39,440 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 10:08:39,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:08:39,440 INFO L85 PathProgramCache]: Analyzing trace with hash -1250735813, now seen corresponding path program 1 times [2025-03-04 10:08:39,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:08:39,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070483314] [2025-03-04 10:08:39,440 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:08:39,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:08:39,443 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 10:08:39,453 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 10:08:39,453 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:08:39,453 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:08:39,737 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:08:39,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:08:39,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070483314] [2025-03-04 10:08:39,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070483314] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:08:39,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1217599419] [2025-03-04 10:08:39,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:08:39,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:08:39,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:08:39,740 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-03-04 10:08:39,741 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-03-04 10:08:39,762 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 10:08:39,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 10:08:39,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:08:39,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:08:39,791 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-04 10:08:39,792 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:08:39,955 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:08:39,955 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:08:40,375 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:08:40,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1217599419] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:08:40,375 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:08:40,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 17 [2025-03-04 10:08:40,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275460357] [2025-03-04 10:08:40,375 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:08:40,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-04 10:08:40,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:08:40,376 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-04 10:08:40,377 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=240, Unknown=0, NotChecked=0, Total=306 [2025-03-04 10:08:40,377 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 20 [2025-03-04 10:08:40,377 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 62 transitions, 404 flow. Second operand has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 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-03-04 10:08:40,377 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:08:40,377 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 20 [2025-03-04 10:08:40,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:08:43,151 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.90s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-04 10:08:47,228 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-04 10:08:47,447 INFO L124 PetriNetUnfolderBase]: 256/488 cut-off events. [2025-03-04 10:08:47,447 INFO L125 PetriNetUnfolderBase]: For 962/962 co-relation queries the response was YES. [2025-03-04 10:08:47,448 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1827 conditions, 488 events. 256/488 cut-off events. For 962/962 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 2214 event pairs, 23 based on Foata normal form. 3/487 useless extension candidates. Maximal degree in co-relation 1724. Up to 237 conditions per place. [2025-03-04 10:08:47,450 INFO L140 encePairwiseOnDemand]: 12/20 looper letters, 83 selfloop transitions, 52 changer transitions 30/166 dead transitions. [2025-03-04 10:08:47,450 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 166 transitions, 1195 flow [2025-03-04 10:08:47,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-04 10:08:47,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2025-03-04 10:08:47,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 223 transitions. [2025-03-04 10:08:47,454 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.46458333333333335 [2025-03-04 10:08:47,455 INFO L175 Difference]: Start difference. First operand has 62 places, 62 transitions, 404 flow. Second operand 24 states and 223 transitions. [2025-03-04 10:08:47,455 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 166 transitions, 1195 flow [2025-03-04 10:08:47,460 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 166 transitions, 1129 flow, removed 27 selfloop flow, removed 3 redundant places. [2025-03-04 10:08:47,464 INFO L231 Difference]: Finished difference. Result has 92 places, 89 transitions, 658 flow [2025-03-04 10:08:47,465 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=338, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=658, PETRI_PLACES=92, PETRI_TRANSITIONS=89} [2025-03-04 10:08:47,465 INFO L279 CegarLoopForPetriNet]: 22 programPoint places, 70 predicate places. [2025-03-04 10:08:47,465 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 89 transitions, 658 flow [2025-03-04 10:08:47,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 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-03-04 10:08:47,466 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:08:47,467 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:08:47,474 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-04 10:08:47,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:08:47,667 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 10:08:47,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:08:47,668 INFO L85 PathProgramCache]: Analyzing trace with hash 1215552565, now seen corresponding path program 2 times [2025-03-04 10:08:47,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:08:47,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565390782] [2025-03-04 10:08:47,668 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:08:47,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:08:47,671 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-03-04 10:08:47,683 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 10:08:47,684 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:08:47,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:08:47,965 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:08:47,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:08:47,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565390782] [2025-03-04 10:08:47,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565390782] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:08:47,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [878356475] [2025-03-04 10:08:47,965 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:08:47,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:08:47,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:08:47,969 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-03-04 10:08:47,970 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-03-04 10:08:47,993 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-03-04 10:08:48,005 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 10:08:48,005 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:08:48,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:08:48,006 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-04 10:08:48,006 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:08:48,174 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:08:48,174 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:08:48,462 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:08:48,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [878356475] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:08:48,462 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:08:48,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 16 [2025-03-04 10:08:48,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953010140] [2025-03-04 10:08:48,463 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:08:48,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-04 10:08:48,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:08:48,463 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-04 10:08:48,463 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2025-03-04 10:08:48,463 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 20 [2025-03-04 10:08:48,464 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 89 transitions, 658 flow. Second operand has 17 states, 17 states have (on average 5.823529411764706) internal successors, (99), 17 states have internal predecessors, (99), 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-03-04 10:08:48,464 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:08:48,464 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 20 [2025-03-04 10:08:48,464 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:08:51,070 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.67s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-04 10:08:51,355 INFO L124 PetriNetUnfolderBase]: 290/562 cut-off events. [2025-03-04 10:08:51,355 INFO L125 PetriNetUnfolderBase]: For 2921/2921 co-relation queries the response was YES. [2025-03-04 10:08:51,357 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2664 conditions, 562 events. 290/562 cut-off events. For 2921/2921 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 2697 event pairs, 20 based on Foata normal form. 3/561 useless extension candidates. Maximal degree in co-relation 2540. Up to 246 conditions per place. [2025-03-04 10:08:51,360 INFO L140 encePairwiseOnDemand]: 12/20 looper letters, 89 selfloop transitions, 79 changer transitions 16/185 dead transitions. [2025-03-04 10:08:51,360 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 185 transitions, 1688 flow [2025-03-04 10:08:51,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-03-04 10:08:51,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2025-03-04 10:08:51,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 246 transitions. [2025-03-04 10:08:51,362 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45555555555555555 [2025-03-04 10:08:51,362 INFO L175 Difference]: Start difference. First operand has 92 places, 89 transitions, 658 flow. Second operand 27 states and 246 transitions. [2025-03-04 10:08:51,362 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 185 transitions, 1688 flow [2025-03-04 10:08:51,371 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 185 transitions, 1487 flow, removed 80 selfloop flow, removed 12 redundant places. [2025-03-04 10:08:51,374 INFO L231 Difference]: Finished difference. Result has 109 places, 119 transitions, 1131 flow [2025-03-04 10:08:51,374 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=519, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=1131, PETRI_PLACES=109, PETRI_TRANSITIONS=119} [2025-03-04 10:08:51,376 INFO L279 CegarLoopForPetriNet]: 22 programPoint places, 87 predicate places. [2025-03-04 10:08:51,376 INFO L471 AbstractCegarLoop]: Abstraction has has 109 places, 119 transitions, 1131 flow [2025-03-04 10:08:51,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 5.823529411764706) internal successors, (99), 17 states have internal predecessors, (99), 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-03-04 10:08:51,376 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:08:51,376 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:08:51,384 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-04 10:08:51,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2025-03-04 10:08:51,580 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 10:08:51,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:08:51,580 INFO L85 PathProgramCache]: Analyzing trace with hash 1166397415, now seen corresponding path program 3 times [2025-03-04 10:08:51,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:08:51,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603384525] [2025-03-04 10:08:51,581 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:08:51,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:08:51,583 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 15 statements into 2 equivalence classes. [2025-03-04 10:08:51,592 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 10:08:51,592 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 10:08:51,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:08:51,872 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:08:51,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:08:51,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603384525] [2025-03-04 10:08:51,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603384525] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:08:51,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1432979575] [2025-03-04 10:08:51,873 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:08:51,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:08:51,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:08:51,875 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-03-04 10:08:51,877 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-03-04 10:08:51,899 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 15 statements into 2 equivalence classes. [2025-03-04 10:08:51,946 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 10:08:51,946 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 10:08:51,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:08:51,947 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-04 10:08:51,948 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:08:52,087 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:08:52,087 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:08:52,334 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:08:52,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1432979575] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:08:52,335 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:08:52,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 16 [2025-03-04 10:08:52,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387530438] [2025-03-04 10:08:52,335 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:08:52,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-04 10:08:52,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:08:52,335 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-04 10:08:52,336 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2025-03-04 10:08:52,336 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 20 [2025-03-04 10:08:52,336 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 119 transitions, 1131 flow. Second operand has 17 states, 17 states have (on average 5.882352941176471) internal successors, (100), 17 states have internal predecessors, (100), 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-03-04 10:08:52,336 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:08:52,336 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 20 [2025-03-04 10:08:52,336 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:08:53,518 INFO L124 PetriNetUnfolderBase]: 289/559 cut-off events. [2025-03-04 10:08:53,518 INFO L125 PetriNetUnfolderBase]: For 3264/3264 co-relation queries the response was YES. [2025-03-04 10:08:53,520 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2896 conditions, 559 events. 289/559 cut-off events. For 3264/3264 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 2677 event pairs, 20 based on Foata normal form. 3/556 useless extension candidates. Maximal degree in co-relation 2746. Up to 252 conditions per place. [2025-03-04 10:08:53,522 INFO L140 encePairwiseOnDemand]: 12/20 looper letters, 85 selfloop transitions, 81 changer transitions 14/181 dead transitions. [2025-03-04 10:08:53,523 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 181 transitions, 1824 flow [2025-03-04 10:08:53,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-04 10:08:53,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2025-03-04 10:08:53,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 216 transitions. [2025-03-04 10:08:53,525 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.46956521739130436 [2025-03-04 10:08:53,525 INFO L175 Difference]: Start difference. First operand has 109 places, 119 transitions, 1131 flow. Second operand 23 states and 216 transitions. [2025-03-04 10:08:53,525 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 181 transitions, 1824 flow [2025-03-04 10:08:53,537 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 181 transitions, 1440 flow, removed 168 selfloop flow, removed 10 redundant places. [2025-03-04 10:08:53,539 INFO L231 Difference]: Finished difference. Result has 121 places, 124 transitions, 1071 flow [2025-03-04 10:08:53,539 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=811, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=75, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=1071, PETRI_PLACES=121, PETRI_TRANSITIONS=124} [2025-03-04 10:08:53,540 INFO L279 CegarLoopForPetriNet]: 22 programPoint places, 99 predicate places. [2025-03-04 10:08:53,540 INFO L471 AbstractCegarLoop]: Abstraction has has 121 places, 124 transitions, 1071 flow [2025-03-04 10:08:53,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 5.882352941176471) internal successors, (100), 17 states have internal predecessors, (100), 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-03-04 10:08:53,540 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:08:53,540 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:08:53,547 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-04 10:08:53,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-04 10:08:53,741 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 10:08:53,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:08:53,741 INFO L85 PathProgramCache]: Analyzing trace with hash 245412601, now seen corresponding path program 4 times [2025-03-04 10:08:53,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:08:53,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404804507] [2025-03-04 10:08:53,741 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 10:08:53,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:08:53,744 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 15 statements into 2 equivalence classes. [2025-03-04 10:08:53,756 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 10:08:53,756 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 10:08:53,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:08:53,995 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:08:53,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:08:53,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404804507] [2025-03-04 10:08:53,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404804507] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:08:53,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [11354175] [2025-03-04 10:08:53,996 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 10:08:53,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:08:53,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:08:53,998 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-03-04 10:08:53,999 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-03-04 10:08:54,024 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 15 statements into 2 equivalence classes. [2025-03-04 10:08:54,070 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 10:08:54,070 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 10:08:54,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:08:54,074 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-04 10:08:54,074 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:08:54,219 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:08:54,220 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:08:56,160 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:08:56,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [11354175] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:08:56,160 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:08:56,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 17 [2025-03-04 10:08:56,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722926262] [2025-03-04 10:08:56,161 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:08:56,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-04 10:08:56,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:08:56,161 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-04 10:08:56,162 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2025-03-04 10:08:56,162 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 20 [2025-03-04 10:08:56,162 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 124 transitions, 1071 flow. Second operand has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 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-03-04 10:08:56,162 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:08:56,162 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 20 [2025-03-04 10:08:56,162 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:08:56,742 INFO L124 PetriNetUnfolderBase]: 327/630 cut-off events. [2025-03-04 10:08:56,742 INFO L125 PetriNetUnfolderBase]: For 2059/2059 co-relation queries the response was YES. [2025-03-04 10:08:56,745 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3008 conditions, 630 events. 327/630 cut-off events. For 2059/2059 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 3101 event pairs, 37 based on Foata normal form. 3/619 useless extension candidates. Maximal degree in co-relation 2963. Up to 504 conditions per place. [2025-03-04 10:08:56,747 INFO L140 encePairwiseOnDemand]: 12/20 looper letters, 132 selfloop transitions, 37 changer transitions 14/184 dead transitions. [2025-03-04 10:08:56,747 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 184 transitions, 1803 flow [2025-03-04 10:08:56,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-04 10:08:56,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-03-04 10:08:56,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 147 transitions. [2025-03-04 10:08:56,749 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.459375 [2025-03-04 10:08:56,749 INFO L175 Difference]: Start difference. First operand has 121 places, 124 transitions, 1071 flow. Second operand 16 states and 147 transitions. [2025-03-04 10:08:56,749 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 184 transitions, 1803 flow [2025-03-04 10:08:56,756 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 184 transitions, 1626 flow, removed 42 selfloop flow, removed 17 redundant places. [2025-03-04 10:08:56,760 INFO L231 Difference]: Finished difference. Result has 127 places, 145 transitions, 1279 flow [2025-03-04 10:08:56,760 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=906, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=1279, PETRI_PLACES=127, PETRI_TRANSITIONS=145} [2025-03-04 10:08:56,761 INFO L279 CegarLoopForPetriNet]: 22 programPoint places, 105 predicate places. [2025-03-04 10:08:56,761 INFO L471 AbstractCegarLoop]: Abstraction has has 127 places, 145 transitions, 1279 flow [2025-03-04 10:08:56,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 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-03-04 10:08:56,762 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:08:56,762 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:08:56,767 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-04 10:08:56,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-04 10:08:56,962 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 10:08:56,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:08:56,963 INFO L85 PathProgramCache]: Analyzing trace with hash -1590009735, now seen corresponding path program 5 times [2025-03-04 10:08:56,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:08:56,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317188125] [2025-03-04 10:08:56,963 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 10:08:56,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:08:56,968 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-03-04 10:08:56,974 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 10:08:56,974 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:08:56,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:08:57,209 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:08:57,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:08:57,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317188125] [2025-03-04 10:08:57,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317188125] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:08:57,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1946197684] [2025-03-04 10:08:57,210 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 10:08:57,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:08:57,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:08:57,212 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-03-04 10:08:57,212 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-03-04 10:08:57,234 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-03-04 10:08:57,257 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 10:08:57,257 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:08:57,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:08:57,258 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-04 10:08:57,259 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:08:57,803 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:08:57,804 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:08:58,632 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:08:58,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1946197684] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:08:58,632 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:08:58,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 17 [2025-03-04 10:08:58,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67874911] [2025-03-04 10:08:58,632 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:08:58,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-04 10:08:58,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:08:58,633 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-04 10:08:58,633 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2025-03-04 10:08:58,633 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 20 [2025-03-04 10:08:58,633 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 145 transitions, 1279 flow. Second operand has 18 states, 18 states have (on average 5.777777777777778) internal successors, (104), 18 states have internal predecessors, (104), 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-03-04 10:08:58,633 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:08:58,633 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 20 [2025-03-04 10:08:58,633 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:09:01,223 INFO L124 PetriNetUnfolderBase]: 343/671 cut-off events. [2025-03-04 10:09:01,223 INFO L125 PetriNetUnfolderBase]: For 2323/2323 co-relation queries the response was YES. [2025-03-04 10:09:01,225 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3375 conditions, 671 events. 343/671 cut-off events. For 2323/2323 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 3414 event pairs, 40 based on Foata normal form. 2/663 useless extension candidates. Maximal degree in co-relation 3294. Up to 510 conditions per place. [2025-03-04 10:09:01,228 INFO L140 encePairwiseOnDemand]: 12/20 looper letters, 131 selfloop transitions, 51 changer transitions 11/194 dead transitions. [2025-03-04 10:09:01,229 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 194 transitions, 1978 flow [2025-03-04 10:09:01,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-04 10:09:01,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-03-04 10:09:01,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 160 transitions. [2025-03-04 10:09:01,230 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2025-03-04 10:09:01,230 INFO L175 Difference]: Start difference. First operand has 127 places, 145 transitions, 1279 flow. Second operand 18 states and 160 transitions. [2025-03-04 10:09:01,230 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 194 transitions, 1978 flow [2025-03-04 10:09:01,241 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 194 transitions, 1881 flow, removed 43 selfloop flow, removed 3 redundant places. [2025-03-04 10:09:01,244 INFO L231 Difference]: Finished difference. Result has 143 places, 156 transitions, 1494 flow [2025-03-04 10:09:01,244 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=1200, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=1494, PETRI_PLACES=143, PETRI_TRANSITIONS=156} [2025-03-04 10:09:01,245 INFO L279 CegarLoopForPetriNet]: 22 programPoint places, 121 predicate places. [2025-03-04 10:09:01,245 INFO L471 AbstractCegarLoop]: Abstraction has has 143 places, 156 transitions, 1494 flow [2025-03-04 10:09:01,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 5.777777777777778) internal successors, (104), 18 states have internal predecessors, (104), 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-03-04 10:09:01,245 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:09:01,245 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:09:01,252 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-04 10:09:01,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-04 10:09:01,446 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 10:09:01,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:09:01,447 INFO L85 PathProgramCache]: Analyzing trace with hash 1731566427, now seen corresponding path program 4 times [2025-03-04 10:09:01,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:09:01,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80553472] [2025-03-04 10:09:01,447 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 10:09:01,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:09:01,449 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 15 statements into 2 equivalence classes. [2025-03-04 10:09:01,458 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 10:09:01,458 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 10:09:01,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:09:01,563 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:09:01,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:09:01,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80553472] [2025-03-04 10:09:01,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80553472] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:09:01,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2065145832] [2025-03-04 10:09:01,564 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 10:09:01,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:09:01,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:09:01,566 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:09:01,568 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-04 10:09:01,593 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 15 statements into 2 equivalence classes. [2025-03-04 10:09:01,607 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 10:09:01,608 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 10:09:01,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:09:01,609 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-04 10:09:01,610 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:09:01,746 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:09:01,747 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:09:01,928 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:09:01,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2065145832] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:09:01,929 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:09:01,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 7] total 18 [2025-03-04 10:09:01,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544900781] [2025-03-04 10:09:01,929 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:09:01,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-04 10:09:01,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:09:01,930 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-04 10:09:01,930 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2025-03-04 10:09:01,930 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 20 [2025-03-04 10:09:01,930 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 156 transitions, 1494 flow. Second operand has 19 states, 19 states have (on average 5.947368421052632) internal successors, (113), 19 states have internal predecessors, (113), 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-03-04 10:09:01,931 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:09:01,931 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 20 [2025-03-04 10:09:01,931 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:09:02,307 INFO L124 PetriNetUnfolderBase]: 342/660 cut-off events. [2025-03-04 10:09:02,308 INFO L125 PetriNetUnfolderBase]: For 2670/2670 co-relation queries the response was YES. [2025-03-04 10:09:02,309 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3493 conditions, 660 events. 342/660 cut-off events. For 2670/2670 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 3297 event pairs, 38 based on Foata normal form. 3/655 useless extension candidates. Maximal degree in co-relation 3397. Up to 547 conditions per place. [2025-03-04 10:09:02,312 INFO L140 encePairwiseOnDemand]: 12/20 looper letters, 135 selfloop transitions, 41 changer transitions 13/190 dead transitions. [2025-03-04 10:09:02,312 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 190 transitions, 2044 flow [2025-03-04 10:09:02,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-04 10:09:02,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-03-04 10:09:02,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 134 transitions. [2025-03-04 10:09:02,313 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.41875 [2025-03-04 10:09:02,313 INFO L175 Difference]: Start difference. First operand has 143 places, 156 transitions, 1494 flow. Second operand 16 states and 134 transitions. [2025-03-04 10:09:02,313 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 190 transitions, 2044 flow [2025-03-04 10:09:02,326 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 190 transitions, 1896 flow, removed 49 selfloop flow, removed 9 redundant places. [2025-03-04 10:09:02,328 INFO L231 Difference]: Finished difference. Result has 154 places, 159 transitions, 1538 flow [2025-03-04 10:09:02,328 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=1338, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=1538, PETRI_PLACES=154, PETRI_TRANSITIONS=159} [2025-03-04 10:09:02,329 INFO L279 CegarLoopForPetriNet]: 22 programPoint places, 132 predicate places. [2025-03-04 10:09:02,329 INFO L471 AbstractCegarLoop]: Abstraction has has 154 places, 159 transitions, 1538 flow [2025-03-04 10:09:02,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 5.947368421052632) internal successors, (113), 19 states have internal predecessors, (113), 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-03-04 10:09:02,329 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:09:02,329 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:09:02,335 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-03-04 10:09:02,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-04 10:09:02,530 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 10:09:02,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:09:02,531 INFO L85 PathProgramCache]: Analyzing trace with hash 1831216881, now seen corresponding path program 6 times [2025-03-04 10:09:02,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:09:02,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153932772] [2025-03-04 10:09:02,531 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 10:09:02,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:09:02,534 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 15 statements into 2 equivalence classes. [2025-03-04 10:09:02,543 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 10:09:02,544 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-03-04 10:09:02,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:09:02,800 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:09:02,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:09:02,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153932772] [2025-03-04 10:09:02,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153932772] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:09:02,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1293053009] [2025-03-04 10:09:02,801 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 10:09:02,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:09:02,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:09:02,803 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:09:02,805 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-04 10:09:02,830 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 15 statements into 2 equivalence classes. [2025-03-04 10:09:02,843 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 10:09:02,843 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-03-04 10:09:02,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:09:02,844 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-04 10:09:02,845 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:09:02,946 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:09:02,946 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:09:03,514 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:09:03,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1293053009] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:09:03,514 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:09:03,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 17 [2025-03-04 10:09:03,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413833761] [2025-03-04 10:09:03,514 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:09:03,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-04 10:09:03,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:09:03,515 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-04 10:09:03,515 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2025-03-04 10:09:03,515 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 20 [2025-03-04 10:09:03,515 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 159 transitions, 1538 flow. Second operand has 18 states, 18 states have (on average 5.777777777777778) internal successors, (104), 18 states have internal predecessors, (104), 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-03-04 10:09:03,515 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:09:03,515 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 20 [2025-03-04 10:09:03,515 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:09:04,124 INFO L124 PetriNetUnfolderBase]: 388/742 cut-off events. [2025-03-04 10:09:04,125 INFO L125 PetriNetUnfolderBase]: For 3819/3819 co-relation queries the response was YES. [2025-03-04 10:09:04,127 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4221 conditions, 742 events. 388/742 cut-off events. For 3819/3819 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 3832 event pairs, 38 based on Foata normal form. 2/734 useless extension candidates. Maximal degree in co-relation 4115. Up to 587 conditions per place. [2025-03-04 10:09:04,130 INFO L140 encePairwiseOnDemand]: 12/20 looper letters, 166 selfloop transitions, 56 changer transitions 7/230 dead transitions. [2025-03-04 10:09:04,131 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 230 transitions, 2635 flow [2025-03-04 10:09:04,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-04 10:09:04,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-03-04 10:09:04,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 191 transitions. [2025-03-04 10:09:04,133 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4340909090909091 [2025-03-04 10:09:04,133 INFO L175 Difference]: Start difference. First operand has 154 places, 159 transitions, 1538 flow. Second operand 22 states and 191 transitions. [2025-03-04 10:09:04,133 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 230 transitions, 2635 flow [2025-03-04 10:09:04,147 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 230 transitions, 2505 flow, removed 22 selfloop flow, removed 13 redundant places. [2025-03-04 10:09:04,149 INFO L231 Difference]: Finished difference. Result has 167 places, 186 transitions, 2004 flow [2025-03-04 10:09:04,149 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=1422, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=2004, PETRI_PLACES=167, PETRI_TRANSITIONS=186} [2025-03-04 10:09:04,150 INFO L279 CegarLoopForPetriNet]: 22 programPoint places, 145 predicate places. [2025-03-04 10:09:04,151 INFO L471 AbstractCegarLoop]: Abstraction has has 167 places, 186 transitions, 2004 flow [2025-03-04 10:09:04,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 5.777777777777778) internal successors, (104), 18 states have internal predecessors, (104), 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-03-04 10:09:04,151 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:09:04,151 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:09:04,157 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-03-04 10:09:04,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-04 10:09:04,352 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 10:09:04,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:09:04,352 INFO L85 PathProgramCache]: Analyzing trace with hash 1782061731, now seen corresponding path program 7 times [2025-03-04 10:09:04,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:09:04,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389139306] [2025-03-04 10:09:04,353 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 10:09:04,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:09:04,356 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 10:09:04,362 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 10:09:04,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:09:04,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:09:04,615 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:09:04,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:09:04,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389139306] [2025-03-04 10:09:04,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389139306] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:09:04,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [576223483] [2025-03-04 10:09:04,615 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 10:09:04,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:09:04,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:09:04,618 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:09:04,621 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-04 10:09:04,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 10:09:04,660 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 10:09:04,660 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:09:04,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:09:04,661 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-04 10:09:04,662 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:09:04,774 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:09:04,775 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:09:05,432 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:09:05,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [576223483] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:09:05,432 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:09:05,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 17 [2025-03-04 10:09:05,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649229629] [2025-03-04 10:09:05,432 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:09:05,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-04 10:09:05,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:09:05,433 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-04 10:09:05,433 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=233, Unknown=0, NotChecked=0, Total=306 [2025-03-04 10:09:05,433 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 20 [2025-03-04 10:09:05,433 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 186 transitions, 2004 flow. Second operand has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 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-03-04 10:09:05,433 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:09:05,433 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 20 [2025-03-04 10:09:05,434 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:09:06,036 INFO L124 PetriNetUnfolderBase]: 384/726 cut-off events. [2025-03-04 10:09:06,036 INFO L125 PetriNetUnfolderBase]: For 4653/4653 co-relation queries the response was YES. [2025-03-04 10:09:06,039 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4302 conditions, 726 events. 384/726 cut-off events. For 4653/4653 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 3681 event pairs, 38 based on Foata normal form. 2/718 useless extension candidates. Maximal degree in co-relation 4215. Up to 587 conditions per place. [2025-03-04 10:09:06,042 INFO L140 encePairwiseOnDemand]: 12/20 looper letters, 157 selfloop transitions, 56 changer transitions 8/222 dead transitions. [2025-03-04 10:09:06,042 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 222 transitions, 2615 flow [2025-03-04 10:09:06,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-04 10:09:06,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-03-04 10:09:06,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 173 transitions. [2025-03-04 10:09:06,043 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4119047619047619 [2025-03-04 10:09:06,043 INFO L175 Difference]: Start difference. First operand has 167 places, 186 transitions, 2004 flow. Second operand 21 states and 173 transitions. [2025-03-04 10:09:06,043 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 222 transitions, 2615 flow [2025-03-04 10:09:06,060 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 222 transitions, 2369 flow, removed 107 selfloop flow, removed 8 redundant places. [2025-03-04 10:09:06,063 INFO L231 Difference]: Finished difference. Result has 182 places, 188 transitions, 1965 flow [2025-03-04 10:09:06,063 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=1770, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=1965, PETRI_PLACES=182, PETRI_TRANSITIONS=188} [2025-03-04 10:09:06,064 INFO L279 CegarLoopForPetriNet]: 22 programPoint places, 160 predicate places. [2025-03-04 10:09:06,064 INFO L471 AbstractCegarLoop]: Abstraction has has 182 places, 188 transitions, 1965 flow [2025-03-04 10:09:06,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 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-03-04 10:09:06,064 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:09:06,064 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:09:06,071 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-03-04 10:09:06,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:09:06,265 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 10:09:06,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:09:06,265 INFO L85 PathProgramCache]: Analyzing trace with hash -1639164885, now seen corresponding path program 8 times [2025-03-04 10:09:06,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:09:06,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580364035] [2025-03-04 10:09:06,265 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:09:06,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:09:06,269 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-03-04 10:09:06,276 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 10:09:06,276 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:09:06,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:09:06,519 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:09:06,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:09:06,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580364035] [2025-03-04 10:09:06,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580364035] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:09:06,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1775305024] [2025-03-04 10:09:06,519 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:09:06,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:09:06,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:09:06,521 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:09:06,523 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-04 10:09:06,545 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-03-04 10:09:06,591 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 10:09:06,592 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:09:06,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:09:06,592 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-04 10:09:06,593 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:09:06,734 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:09:06,734 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:09:07,741 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:09:07,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1775305024] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:09:07,741 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:09:07,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 16 [2025-03-04 10:09:07,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461527350] [2025-03-04 10:09:07,741 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:09:07,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-04 10:09:07,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:09:07,742 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-04 10:09:07,742 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2025-03-04 10:09:07,742 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 20 [2025-03-04 10:09:07,742 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 188 transitions, 1965 flow. Second operand has 17 states, 17 states have (on average 5.882352941176471) internal successors, (100), 17 states have internal predecessors, (100), 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-03-04 10:09:07,742 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:09:07,742 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 20 [2025-03-04 10:09:07,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:09:08,520 INFO L124 PetriNetUnfolderBase]: 384/723 cut-off events. [2025-03-04 10:09:08,520 INFO L125 PetriNetUnfolderBase]: For 4443/4443 co-relation queries the response was YES. [2025-03-04 10:09:08,523 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4240 conditions, 723 events. 384/723 cut-off events. For 4443/4443 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 3641 event pairs, 36 based on Foata normal form. 2/715 useless extension candidates. Maximal degree in co-relation 4158. Up to 556 conditions per place. [2025-03-04 10:09:08,526 INFO L140 encePairwiseOnDemand]: 12/20 looper letters, 150 selfloop transitions, 62 changer transitions 8/221 dead transitions. [2025-03-04 10:09:08,527 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 221 transitions, 2575 flow [2025-03-04 10:09:08,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-04 10:09:08,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-03-04 10:09:08,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 144 transitions. [2025-03-04 10:09:08,528 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45 [2025-03-04 10:09:08,528 INFO L175 Difference]: Start difference. First operand has 182 places, 188 transitions, 1965 flow. Second operand 16 states and 144 transitions. [2025-03-04 10:09:08,528 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 221 transitions, 2575 flow [2025-03-04 10:09:08,547 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 221 transitions, 2436 flow, removed 24 selfloop flow, removed 18 redundant places. [2025-03-04 10:09:08,550 INFO L231 Difference]: Finished difference. Result has 179 places, 190 transitions, 2037 flow [2025-03-04 10:09:08,550 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=1825, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=187, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=2037, PETRI_PLACES=179, PETRI_TRANSITIONS=190} [2025-03-04 10:09:08,551 INFO L279 CegarLoopForPetriNet]: 22 programPoint places, 157 predicate places. [2025-03-04 10:09:08,551 INFO L471 AbstractCegarLoop]: Abstraction has has 179 places, 190 transitions, 2037 flow [2025-03-04 10:09:08,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 5.882352941176471) internal successors, (100), 17 states have internal predecessors, (100), 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-03-04 10:09:08,551 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:09:08,551 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:09:08,558 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2025-03-04 10:09:08,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-04 10:09:08,752 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 10:09:08,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:09:08,752 INFO L85 PathProgramCache]: Analyzing trace with hash 112873175, now seen corresponding path program 9 times [2025-03-04 10:09:08,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:09:08,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132472272] [2025-03-04 10:09:08,752 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:09:08,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:09:08,755 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 15 statements into 2 equivalence classes. [2025-03-04 10:09:08,760 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 10:09:08,760 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 10:09:08,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:09:08,941 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:09:08,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:09:08,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132472272] [2025-03-04 10:09:08,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132472272] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:09:08,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1694604845] [2025-03-04 10:09:08,941 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:09:08,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:09:08,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:09:08,943 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:09:08,944 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-04 10:09:08,963 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 15 statements into 2 equivalence classes. [2025-03-04 10:09:08,974 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 10:09:08,974 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 10:09:08,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:09:08,975 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-04 10:09:08,975 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:09:09,052 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:09:09,053 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:09:09,618 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:09:09,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1694604845] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:09:09,618 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:09:09,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 17 [2025-03-04 10:09:09,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062374237] [2025-03-04 10:09:09,618 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:09:09,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-04 10:09:09,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:09:09,619 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-04 10:09:09,619 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=234, Unknown=0, NotChecked=0, Total=306 [2025-03-04 10:09:09,619 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 20 [2025-03-04 10:09:09,619 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 190 transitions, 2037 flow. Second operand has 18 states, 18 states have (on average 5.777777777777778) internal successors, (104), 18 states have internal predecessors, (104), 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-03-04 10:09:09,619 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:09:09,619 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 20 [2025-03-04 10:09:09,619 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:09:10,020 INFO L124 PetriNetUnfolderBase]: 385/737 cut-off events. [2025-03-04 10:09:10,020 INFO L125 PetriNetUnfolderBase]: For 4382/4382 co-relation queries the response was YES. [2025-03-04 10:09:10,022 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4359 conditions, 737 events. 385/737 cut-off events. For 4382/4382 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 3778 event pairs, 38 based on Foata normal form. 3/730 useless extension candidates. Maximal degree in co-relation 4245. Up to 635 conditions per place. [2025-03-04 10:09:10,025 INFO L140 encePairwiseOnDemand]: 12/20 looper letters, 173 selfloop transitions, 43 changer transitions 7/224 dead transitions. [2025-03-04 10:09:10,025 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 224 transitions, 2696 flow [2025-03-04 10:09:10,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-04 10:09:10,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-03-04 10:09:10,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 149 transitions. [2025-03-04 10:09:10,026 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.41388888888888886 [2025-03-04 10:09:10,026 INFO L175 Difference]: Start difference. First operand has 179 places, 190 transitions, 2037 flow. Second operand 18 states and 149 transitions. [2025-03-04 10:09:10,026 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 224 transitions, 2696 flow [2025-03-04 10:09:10,042 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 224 transitions, 2613 flow, removed 24 selfloop flow, removed 10 redundant places. [2025-03-04 10:09:10,045 INFO L231 Difference]: Finished difference. Result has 191 places, 195 transitions, 2169 flow [2025-03-04 10:09:10,045 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=1956, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=190, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=2169, PETRI_PLACES=191, PETRI_TRANSITIONS=195} [2025-03-04 10:09:10,045 INFO L279 CegarLoopForPetriNet]: 22 programPoint places, 169 predicate places. [2025-03-04 10:09:10,045 INFO L471 AbstractCegarLoop]: Abstraction has has 191 places, 195 transitions, 2169 flow [2025-03-04 10:09:10,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 5.777777777777778) internal successors, (104), 18 states have internal predecessors, (104), 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-03-04 10:09:10,046 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:09:10,046 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:09:10,051 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2025-03-04 10:09:10,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-04 10:09:10,246 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 10:09:10,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:09:10,247 INFO L85 PathProgramCache]: Analyzing trace with hash -1107565417, now seen corresponding path program 10 times [2025-03-04 10:09:10,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:09:10,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645751678] [2025-03-04 10:09:10,247 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 10:09:10,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:09:10,250 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 15 statements into 2 equivalence classes. [2025-03-04 10:09:10,256 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 10:09:10,257 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 10:09:10,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:09:10,471 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:09:10,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:09:10,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645751678] [2025-03-04 10:09:10,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645751678] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:09:10,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [199914504] [2025-03-04 10:09:10,472 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 10:09:10,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:09:10,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:09:10,474 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:09:10,476 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-03-04 10:09:10,496 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 15 statements into 2 equivalence classes. [2025-03-04 10:09:10,527 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 10:09:10,527 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 10:09:10,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:09:10,528 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-04 10:09:10,528 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:09:10,640 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:09:10,640 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:09:11,116 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:09:11,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [199914504] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:09:11,116 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:09:11,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 17 [2025-03-04 10:09:11,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012206512] [2025-03-04 10:09:11,117 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:09:11,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-04 10:09:11,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:09:11,117 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-04 10:09:11,117 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2025-03-04 10:09:11,117 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 20 [2025-03-04 10:09:11,118 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 195 transitions, 2169 flow. Second operand has 18 states, 18 states have (on average 5.777777777777778) internal successors, (104), 18 states have internal predecessors, (104), 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-03-04 10:09:11,118 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:09:11,118 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 20 [2025-03-04 10:09:11,118 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:09:11,831 INFO L124 PetriNetUnfolderBase]: 427/817 cut-off events. [2025-03-04 10:09:11,831 INFO L125 PetriNetUnfolderBase]: For 6185/6185 co-relation queries the response was YES. [2025-03-04 10:09:11,833 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5118 conditions, 817 events. 427/817 cut-off events. For 6185/6185 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 4295 event pairs, 40 based on Foata normal form. 2/809 useless extension candidates. Maximal degree in co-relation 5045. Up to 649 conditions per place. [2025-03-04 10:09:11,836 INFO L140 encePairwiseOnDemand]: 11/20 looper letters, 190 selfloop transitions, 60 changer transitions 8/259 dead transitions. [2025-03-04 10:09:11,836 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 259 transitions, 3281 flow [2025-03-04 10:09:11,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-04 10:09:11,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2025-03-04 10:09:11,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 205 transitions. [2025-03-04 10:09:11,837 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4270833333333333 [2025-03-04 10:09:11,837 INFO L175 Difference]: Start difference. First operand has 191 places, 195 transitions, 2169 flow. Second operand 24 states and 205 transitions. [2025-03-04 10:09:11,837 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 213 places, 259 transitions, 3281 flow [2025-03-04 10:09:11,856 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 201 places, 259 transitions, 3173 flow, removed 29 selfloop flow, removed 12 redundant places. [2025-03-04 10:09:11,859 INFO L231 Difference]: Finished difference. Result has 210 places, 215 transitions, 2641 flow [2025-03-04 10:09:11,860 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=2070, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=195, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=2641, PETRI_PLACES=210, PETRI_TRANSITIONS=215} [2025-03-04 10:09:11,860 INFO L279 CegarLoopForPetriNet]: 22 programPoint places, 188 predicate places. [2025-03-04 10:09:11,860 INFO L471 AbstractCegarLoop]: Abstraction has has 210 places, 215 transitions, 2641 flow [2025-03-04 10:09:11,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 5.777777777777778) internal successors, (104), 18 states have internal predecessors, (104), 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-03-04 10:09:11,860 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:09:11,860 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:09:11,865 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2025-03-04 10:09:12,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-04 10:09:12,061 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 10:09:12,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:09:12,061 INFO L85 PathProgramCache]: Analyzing trace with hash -794466733, now seen corresponding path program 11 times [2025-03-04 10:09:12,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:09:12,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127961939] [2025-03-04 10:09:12,061 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 10:09:12,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:09:12,063 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-03-04 10:09:12,068 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 10:09:12,068 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:09:12,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:09:12,259 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:09:12,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:09:12,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127961939] [2025-03-04 10:09:12,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127961939] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:09:12,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [259493013] [2025-03-04 10:09:12,259 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 10:09:12,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:09:12,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:09:12,261 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:09:12,263 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-03-04 10:09:12,283 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-03-04 10:09:12,296 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 10:09:12,296 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:09:12,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:09:12,297 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-04 10:09:12,298 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:09:12,566 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:09:12,567 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:09:12,871 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:09:12,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [259493013] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:09:12,871 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:09:12,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 18 [2025-03-04 10:09:12,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160988219] [2025-03-04 10:09:12,871 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:09:12,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-04 10:09:12,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:09:12,872 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-04 10:09:12,872 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=270, Unknown=0, NotChecked=0, Total=342 [2025-03-04 10:09:12,872 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 20 [2025-03-04 10:09:12,872 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 215 transitions, 2641 flow. Second operand has 19 states, 19 states have (on average 5.7368421052631575) internal successors, (109), 19 states have internal predecessors, (109), 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-03-04 10:09:12,872 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:09:12,872 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 20 [2025-03-04 10:09:12,872 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:09:19,268 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-04 10:09:23,414 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-04 10:09:23,748 INFO L124 PetriNetUnfolderBase]: 473/914 cut-off events. [2025-03-04 10:09:23,748 INFO L125 PetriNetUnfolderBase]: For 10208/10208 co-relation queries the response was YES. [2025-03-04 10:09:23,752 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6037 conditions, 914 events. 473/914 cut-off events. For 10208/10208 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 5015 event pairs, 35 based on Foata normal form. 3/907 useless extension candidates. Maximal degree in co-relation 5909. Up to 683 conditions per place. [2025-03-04 10:09:23,755 INFO L140 encePairwiseOnDemand]: 12/20 looper letters, 195 selfloop transitions, 74 changer transitions 27/297 dead transitions. [2025-03-04 10:09:23,756 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 232 places, 297 transitions, 3949 flow [2025-03-04 10:09:23,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-04 10:09:23,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2025-03-04 10:09:23,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 207 transitions. [2025-03-04 10:09:23,757 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.43125 [2025-03-04 10:09:23,757 INFO L175 Difference]: Start difference. First operand has 210 places, 215 transitions, 2641 flow. Second operand 24 states and 207 transitions. [2025-03-04 10:09:23,757 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 232 places, 297 transitions, 3949 flow [2025-03-04 10:09:23,788 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 212 places, 297 transitions, 3553 flow, removed 161 selfloop flow, removed 20 redundant places. [2025-03-04 10:09:23,791 INFO L231 Difference]: Finished difference. Result has 222 places, 240 transitions, 2806 flow [2025-03-04 10:09:23,791 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=2249, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=215, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=2806, PETRI_PLACES=222, PETRI_TRANSITIONS=240} [2025-03-04 10:09:23,791 INFO L279 CegarLoopForPetriNet]: 22 programPoint places, 200 predicate places. [2025-03-04 10:09:23,791 INFO L471 AbstractCegarLoop]: Abstraction has has 222 places, 240 transitions, 2806 flow [2025-03-04 10:09:23,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 5.7368421052631575) internal successors, (109), 19 states have internal predecessors, (109), 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-03-04 10:09:23,792 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:09:23,792 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:09:23,797 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2025-03-04 10:09:23,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:09:23,992 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 10:09:23,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:09:23,993 INFO L85 PathProgramCache]: Analyzing trace with hash 1748462503, now seen corresponding path program 12 times [2025-03-04 10:09:23,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:09:23,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113343090] [2025-03-04 10:09:23,993 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 10:09:23,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:09:23,995 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 15 statements into 2 equivalence classes. [2025-03-04 10:09:23,999 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 10:09:23,999 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-03-04 10:09:23,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:09:24,276 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:09:24,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:09:24,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113343090] [2025-03-04 10:09:24,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113343090] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:09:24,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [580493238] [2025-03-04 10:09:24,276 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 10:09:24,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:09:24,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:09:24,278 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:09:24,280 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-03-04 10:09:24,302 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 15 statements into 2 equivalence classes. [2025-03-04 10:09:24,351 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 10:09:24,351 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-03-04 10:09:24,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:09:24,352 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-04 10:09:24,353 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:09:24,474 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:09:24,474 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:09:24,732 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:09:24,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [580493238] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:09:24,732 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:09:24,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 18 [2025-03-04 10:09:24,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780751405] [2025-03-04 10:09:24,733 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:09:24,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-04 10:09:24,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:09:24,733 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-04 10:09:24,733 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2025-03-04 10:09:24,733 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 20 [2025-03-04 10:09:24,733 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 240 transitions, 2806 flow. Second operand has 19 states, 19 states have (on average 5.7894736842105265) internal successors, (110), 19 states have internal predecessors, (110), 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-03-04 10:09:24,734 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:09:24,734 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 20 [2025-03-04 10:09:24,734 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:09:25,716 INFO L124 PetriNetUnfolderBase]: 504/974 cut-off events. [2025-03-04 10:09:25,716 INFO L125 PetriNetUnfolderBase]: For 13043/13043 co-relation queries the response was YES. [2025-03-04 10:09:25,720 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6754 conditions, 974 events. 504/974 cut-off events. For 13043/13043 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 5444 event pairs, 36 based on Foata normal form. 3/963 useless extension candidates. Maximal degree in co-relation 6624. Up to 681 conditions per place. [2025-03-04 10:09:25,726 INFO L140 encePairwiseOnDemand]: 12/20 looper letters, 196 selfloop transitions, 105 changer transitions 13/315 dead transitions. [2025-03-04 10:09:25,726 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 244 places, 315 transitions, 4370 flow [2025-03-04 10:09:25,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-03-04 10:09:25,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2025-03-04 10:09:25,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 234 transitions. [2025-03-04 10:09:25,728 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.43333333333333335 [2025-03-04 10:09:25,728 INFO L175 Difference]: Start difference. First operand has 222 places, 240 transitions, 2806 flow. Second operand 27 states and 234 transitions. [2025-03-04 10:09:25,728 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 244 places, 315 transitions, 4370 flow [2025-03-04 10:09:25,774 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 233 places, 315 transitions, 4023 flow, removed 152 selfloop flow, removed 11 redundant places. [2025-03-04 10:09:25,778 INFO L231 Difference]: Finished difference. Result has 239 places, 263 transitions, 3371 flow [2025-03-04 10:09:25,779 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=2503, PETRI_DIFFERENCE_MINUEND_PLACES=207, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=240, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=86, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=151, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=3371, PETRI_PLACES=239, PETRI_TRANSITIONS=263} [2025-03-04 10:09:25,779 INFO L279 CegarLoopForPetriNet]: 22 programPoint places, 217 predicate places. [2025-03-04 10:09:25,780 INFO L471 AbstractCegarLoop]: Abstraction has has 239 places, 263 transitions, 3371 flow [2025-03-04 10:09:25,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 5.7894736842105265) internal successors, (110), 19 states have internal predecessors, (110), 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-03-04 10:09:25,780 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:09:25,780 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:09:25,786 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2025-03-04 10:09:25,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:09:25,981 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 10:09:25,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:09:25,981 INFO L85 PathProgramCache]: Analyzing trace with hash 617034399, now seen corresponding path program 13 times [2025-03-04 10:09:25,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:09:25,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3659287] [2025-03-04 10:09:25,981 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 10:09:25,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:09:25,983 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 10:09:25,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 10:09:25,987 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:09:25,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:09:26,182 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:09:26,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:09:26,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3659287] [2025-03-04 10:09:26,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3659287] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:09:26,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1448780968] [2025-03-04 10:09:26,182 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 10:09:26,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:09:26,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:09:26,184 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:09:26,185 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-03-04 10:09:26,208 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 10:09:26,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 10:09:26,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:09:26,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:09:26,255 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-04 10:09:26,255 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:09:26,367 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:09:26,367 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:09:27,216 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:09:27,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1448780968] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:09:27,216 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:09:27,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 17 [2025-03-04 10:09:27,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289821919] [2025-03-04 10:09:27,216 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:09:27,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-04 10:09:27,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:09:27,217 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-04 10:09:27,217 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2025-03-04 10:09:27,217 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 20 [2025-03-04 10:09:27,217 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 239 places, 263 transitions, 3371 flow. Second operand has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 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-03-04 10:09:27,217 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:09:27,217 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 20 [2025-03-04 10:09:27,217 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:09:27,813 INFO L124 PetriNetUnfolderBase]: 510/989 cut-off events. [2025-03-04 10:09:27,813 INFO L125 PetriNetUnfolderBase]: For 13458/13458 co-relation queries the response was YES. [2025-03-04 10:09:27,819 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6969 conditions, 989 events. 510/989 cut-off events. For 13458/13458 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 5535 event pairs, 41 based on Foata normal form. 3/976 useless extension candidates. Maximal degree in co-relation 6837. Up to 866 conditions per place. [2025-03-04 10:09:27,823 INFO L140 encePairwiseOnDemand]: 11/20 looper letters, 243 selfloop transitions, 46 changer transitions 7/297 dead transitions. [2025-03-04 10:09:27,824 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 297 transitions, 4162 flow [2025-03-04 10:09:27,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-04 10:09:27,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-03-04 10:09:27,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 154 transitions. [2025-03-04 10:09:27,826 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42777777777777776 [2025-03-04 10:09:27,826 INFO L175 Difference]: Start difference. First operand has 239 places, 263 transitions, 3371 flow. Second operand 18 states and 154 transitions. [2025-03-04 10:09:27,827 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 253 places, 297 transitions, 4162 flow [2025-03-04 10:09:27,892 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 243 places, 297 transitions, 3638 flow, removed 226 selfloop flow, removed 10 redundant places. [2025-03-04 10:09:27,895 INFO L231 Difference]: Finished difference. Result has 247 places, 266 transitions, 3016 flow [2025-03-04 10:09:27,896 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=2847, PETRI_DIFFERENCE_MINUEND_PLACES=226, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=263, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=218, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=3016, PETRI_PLACES=247, PETRI_TRANSITIONS=266} [2025-03-04 10:09:27,896 INFO L279 CegarLoopForPetriNet]: 22 programPoint places, 225 predicate places. [2025-03-04 10:09:27,896 INFO L471 AbstractCegarLoop]: Abstraction has has 247 places, 266 transitions, 3016 flow [2025-03-04 10:09:27,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 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-03-04 10:09:27,896 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:09:27,896 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:09:27,904 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2025-03-04 10:09:28,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2025-03-04 10:09:28,097 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 10:09:28,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:09:28,097 INFO L85 PathProgramCache]: Analyzing trace with hash -1052154157, now seen corresponding path program 14 times [2025-03-04 10:09:28,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:09:28,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247993895] [2025-03-04 10:09:28,098 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:09:28,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:09:28,099 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-03-04 10:09:28,103 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 10:09:28,104 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:09:28,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:09:28,324 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:09:28,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:09:28,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247993895] [2025-03-04 10:09:28,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247993895] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:09:28,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2051728382] [2025-03-04 10:09:28,324 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:09:28,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:09:28,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:09:28,333 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:09:28,334 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2025-03-04 10:09:28,357 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-03-04 10:09:28,369 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 10:09:28,370 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:09:28,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:09:28,371 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-04 10:09:28,372 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:09:28,504 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:09:28,505 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:09:29,055 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:09:29,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2051728382] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:09:29,055 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:09:29,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 16 [2025-03-04 10:09:29,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928899408] [2025-03-04 10:09:29,055 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:09:29,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-04 10:09:29,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:09:29,056 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-04 10:09:29,056 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2025-03-04 10:09:29,056 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 20 [2025-03-04 10:09:29,056 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 247 places, 266 transitions, 3016 flow. Second operand has 17 states, 17 states have (on average 5.823529411764706) internal successors, (99), 17 states have internal predecessors, (99), 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-03-04 10:09:29,056 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:09:29,056 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 20 [2025-03-04 10:09:29,056 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:09:29,990 INFO L124 PetriNetUnfolderBase]: 504/967 cut-off events. [2025-03-04 10:09:29,990 INFO L125 PetriNetUnfolderBase]: For 9233/9233 co-relation queries the response was YES. [2025-03-04 10:09:29,994 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6251 conditions, 967 events. 504/967 cut-off events. For 9233/9233 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 5365 event pairs, 36 based on Foata normal form. 2/951 useless extension candidates. Maximal degree in co-relation 6128. Up to 811 conditions per place. [2025-03-04 10:09:29,997 INFO L140 encePairwiseOnDemand]: 11/20 looper letters, 231 selfloop transitions, 60 changer transitions 8/300 dead transitions. [2025-03-04 10:09:29,997 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 300 transitions, 3771 flow [2025-03-04 10:09:29,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-04 10:09:29,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2025-03-04 10:09:29,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 171 transitions. [2025-03-04 10:09:29,998 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4275 [2025-03-04 10:09:29,998 INFO L175 Difference]: Start difference. First operand has 247 places, 266 transitions, 3016 flow. Second operand 20 states and 171 transitions. [2025-03-04 10:09:29,998 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 265 places, 300 transitions, 3771 flow [2025-03-04 10:09:30,040 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 249 places, 300 transitions, 3643 flow, removed 23 selfloop flow, removed 16 redundant places. [2025-03-04 10:09:30,044 INFO L231 Difference]: Finished difference. Result has 252 places, 267 transitions, 3093 flow [2025-03-04 10:09:30,044 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=2884, PETRI_DIFFERENCE_MINUEND_PLACES=230, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=265, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=206, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=3093, PETRI_PLACES=252, PETRI_TRANSITIONS=267} [2025-03-04 10:09:30,044 INFO L279 CegarLoopForPetriNet]: 22 programPoint places, 230 predicate places. [2025-03-04 10:09:30,044 INFO L471 AbstractCegarLoop]: Abstraction has has 252 places, 267 transitions, 3093 flow [2025-03-04 10:09:30,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 5.823529411764706) internal successors, (99), 17 states have internal predecessors, (99), 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-03-04 10:09:30,044 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:09:30,044 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:09:30,050 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2025-03-04 10:09:30,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-03-04 10:09:30,245 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 10:09:30,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:09:30,245 INFO L85 PathProgramCache]: Analyzing trace with hash 650728753, now seen corresponding path program 15 times [2025-03-04 10:09:30,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:09:30,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195663649] [2025-03-04 10:09:30,245 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:09:30,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:09:30,247 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 15 statements into 2 equivalence classes. [2025-03-04 10:09:30,252 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 10:09:30,252 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 10:09:30,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:09:30,446 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:09:30,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:09:30,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195663649] [2025-03-04 10:09:30,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195663649] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:09:30,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1789097368] [2025-03-04 10:09:30,447 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:09:30,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:09:30,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:09:30,449 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:09:30,449 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2025-03-04 10:09:30,470 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 15 statements into 2 equivalence classes. [2025-03-04 10:09:30,482 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 10:09:30,482 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 10:09:30,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:09:30,483 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-04 10:09:30,483 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:09:30,563 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:09:30,563 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:09:32,622 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:09:32,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1789097368] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:09:32,623 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:09:32,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 17 [2025-03-04 10:09:32,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65905788] [2025-03-04 10:09:32,623 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:09:32,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-04 10:09:32,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:09:32,623 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-04 10:09:32,623 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=233, Unknown=0, NotChecked=0, Total=306 [2025-03-04 10:09:32,624 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 20 [2025-03-04 10:09:32,624 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 252 places, 267 transitions, 3093 flow. Second operand has 18 states, 18 states have (on average 5.777777777777778) internal successors, (104), 18 states have internal predecessors, (104), 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-03-04 10:09:32,624 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:09:32,624 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 20 [2025-03-04 10:09:32,624 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:09:33,048 INFO L124 PetriNetUnfolderBase]: 516/987 cut-off events. [2025-03-04 10:09:33,048 INFO L125 PetriNetUnfolderBase]: For 11174/11174 co-relation queries the response was YES. [2025-03-04 10:09:33,052 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6669 conditions, 987 events. 516/987 cut-off events. For 11174/11174 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 5472 event pairs, 45 based on Foata normal form. 2/975 useless extension candidates. Maximal degree in co-relation 6551. Up to 885 conditions per place. [2025-03-04 10:09:33,055 INFO L140 encePairwiseOnDemand]: 12/20 looper letters, 247 selfloop transitions, 45 changer transitions 6/299 dead transitions. [2025-03-04 10:09:33,055 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 299 transitions, 4076 flow [2025-03-04 10:09:33,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-04 10:09:33,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-03-04 10:09:33,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 133 transitions. [2025-03-04 10:09:33,056 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.415625 [2025-03-04 10:09:33,056 INFO L175 Difference]: Start difference. First operand has 252 places, 267 transitions, 3093 flow. Second operand 16 states and 133 transitions. [2025-03-04 10:09:33,056 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 265 places, 299 transitions, 4076 flow [2025-03-04 10:09:33,104 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 249 places, 299 transitions, 3909 flow, removed 35 selfloop flow, removed 16 redundant places. [2025-03-04 10:09:33,107 INFO L231 Difference]: Finished difference. Result has 252 places, 275 transitions, 3307 flow [2025-03-04 10:09:33,108 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=2928, PETRI_DIFFERENCE_MINUEND_PLACES=234, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=267, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=226, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=3307, PETRI_PLACES=252, PETRI_TRANSITIONS=275} [2025-03-04 10:09:33,108 INFO L279 CegarLoopForPetriNet]: 22 programPoint places, 230 predicate places. [2025-03-04 10:09:33,108 INFO L471 AbstractCegarLoop]: Abstraction has has 252 places, 275 transitions, 3307 flow [2025-03-04 10:09:33,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 5.777777777777778) internal successors, (104), 18 states have internal predecessors, (104), 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-03-04 10:09:33,108 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:09:33,108 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:09:33,116 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2025-03-04 10:09:33,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:09:33,309 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 10:09:33,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:09:33,309 INFO L85 PathProgramCache]: Analyzing trace with hash 1797617653, now seen corresponding path program 16 times [2025-03-04 10:09:33,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:09:33,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133410993] [2025-03-04 10:09:33,309 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 10:09:33,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:09:33,311 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 15 statements into 2 equivalence classes. [2025-03-04 10:09:33,315 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 10:09:33,315 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 10:09:33,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:09:33,548 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:09:33,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:09:33,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133410993] [2025-03-04 10:09:33,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133410993] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:09:33,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [220164074] [2025-03-04 10:09:33,549 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 10:09:33,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:09:33,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:09:33,551 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:09:33,552 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2025-03-04 10:09:33,574 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 15 statements into 2 equivalence classes. [2025-03-04 10:09:33,631 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 10:09:33,631 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 10:09:33,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:09:33,632 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-04 10:09:33,633 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:09:33,741 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:09:33,741 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:09:33,999 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:09:34,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [220164074] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:09:34,000 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:09:34,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 18 [2025-03-04 10:09:34,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602115780] [2025-03-04 10:09:34,000 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:09:34,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-04 10:09:34,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:09:34,001 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-04 10:09:34,001 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2025-03-04 10:09:34,001 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 20 [2025-03-04 10:09:34,001 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 252 places, 275 transitions, 3307 flow. Second operand has 19 states, 19 states have (on average 5.7368421052631575) internal successors, (109), 19 states have internal predecessors, (109), 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-03-04 10:09:34,002 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:09:34,002 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 20 [2025-03-04 10:09:34,002 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:09:34,870 INFO L124 PetriNetUnfolderBase]: 517/992 cut-off events. [2025-03-04 10:09:34,870 INFO L125 PetriNetUnfolderBase]: For 10338/10338 co-relation queries the response was YES. [2025-03-04 10:09:34,875 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6571 conditions, 992 events. 517/992 cut-off events. For 10338/10338 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 5537 event pairs, 38 based on Foata normal form. 3/981 useless extension candidates. Maximal degree in co-relation 6453. Up to 708 conditions per place. [2025-03-04 10:09:34,877 INFO L140 encePairwiseOnDemand]: 12/20 looper letters, 209 selfloop transitions, 107 changer transitions 12/329 dead transitions. [2025-03-04 10:09:34,878 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 276 places, 329 transitions, 4293 flow [2025-03-04 10:09:34,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-03-04 10:09:34,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2025-03-04 10:09:34,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 229 transitions. [2025-03-04 10:09:34,879 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4403846153846154 [2025-03-04 10:09:34,879 INFO L175 Difference]: Start difference. First operand has 252 places, 275 transitions, 3307 flow. Second operand 26 states and 229 transitions. [2025-03-04 10:09:34,879 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 276 places, 329 transitions, 4293 flow [2025-03-04 10:09:34,926 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 263 places, 329 transitions, 4065 flow, removed 84 selfloop flow, removed 13 redundant places. [2025-03-04 10:09:34,930 INFO L231 Difference]: Finished difference. Result has 265 places, 279 transitions, 3467 flow [2025-03-04 10:09:34,930 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=3063, PETRI_DIFFERENCE_MINUEND_PLACES=238, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=273, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=101, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=172, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=3467, PETRI_PLACES=265, PETRI_TRANSITIONS=279} [2025-03-04 10:09:34,930 INFO L279 CegarLoopForPetriNet]: 22 programPoint places, 243 predicate places. [2025-03-04 10:09:34,930 INFO L471 AbstractCegarLoop]: Abstraction has has 265 places, 279 transitions, 3467 flow [2025-03-04 10:09:34,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 5.7368421052631575) internal successors, (109), 19 states have internal predecessors, (109), 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-03-04 10:09:34,930 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:09:34,930 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:09:34,938 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2025-03-04 10:09:35,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:09:35,131 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 10:09:35,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:09:35,132 INFO L85 PathProgramCache]: Analyzing trace with hash -1975049987, now seen corresponding path program 17 times [2025-03-04 10:09:35,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:09:35,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246777519] [2025-03-04 10:09:35,132 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 10:09:35,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:09:35,134 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-03-04 10:09:35,138 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 10:09:35,138 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:09:35,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:09:35,445 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:09:35,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:09:35,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246777519] [2025-03-04 10:09:35,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246777519] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:09:35,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1929336609] [2025-03-04 10:09:35,445 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 10:09:35,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:09:35,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:09:35,447 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:09:35,448 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2025-03-04 10:09:35,469 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-03-04 10:09:35,485 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 10:09:35,486 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:09:35,486 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:09:35,486 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-04 10:09:35,487 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:09:35,724 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:09:35,724 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:09:36,355 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:09:36,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1929336609] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:09:36,355 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:09:36,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 17 [2025-03-04 10:09:36,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154033071] [2025-03-04 10:09:36,355 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:09:36,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-04 10:09:36,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:09:36,356 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-04 10:09:36,356 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=230, Unknown=0, NotChecked=0, Total=306 [2025-03-04 10:09:36,356 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 20 [2025-03-04 10:09:36,356 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 265 places, 279 transitions, 3467 flow. Second operand has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 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-03-04 10:09:36,356 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:09:36,356 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 20 [2025-03-04 10:09:36,356 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:09:38,053 INFO L124 PetriNetUnfolderBase]: 540/1033 cut-off events. [2025-03-04 10:09:38,054 INFO L125 PetriNetUnfolderBase]: For 13859/13859 co-relation queries the response was YES. [2025-03-04 10:09:38,058 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7309 conditions, 1033 events. 540/1033 cut-off events. For 13859/13859 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 5790 event pairs, 42 based on Foata normal form. 2/1021 useless extension candidates. Maximal degree in co-relation 7215. Up to 869 conditions per place. [2025-03-04 10:09:38,068 INFO L140 encePairwiseOnDemand]: 12/20 looper letters, 246 selfloop transitions, 64 changer transitions 8/319 dead transitions. [2025-03-04 10:09:38,069 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 319 transitions, 4631 flow [2025-03-04 10:09:38,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-04 10:09:38,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-03-04 10:09:38,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 150 transitions. [2025-03-04 10:09:38,070 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2025-03-04 10:09:38,070 INFO L175 Difference]: Start difference. First operand has 265 places, 279 transitions, 3467 flow. Second operand 18 states and 150 transitions. [2025-03-04 10:09:38,070 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 279 places, 319 transitions, 4631 flow [2025-03-04 10:09:38,141 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 259 places, 319 transitions, 4256 flow, removed 125 selfloop flow, removed 20 redundant places. [2025-03-04 10:09:38,145 INFO L231 Difference]: Finished difference. Result has 264 places, 289 transitions, 3587 flow [2025-03-04 10:09:38,145 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=3124, PETRI_DIFFERENCE_MINUEND_PLACES=242, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=279, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=220, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=3587, PETRI_PLACES=264, PETRI_TRANSITIONS=289} [2025-03-04 10:09:38,146 INFO L279 CegarLoopForPetriNet]: 22 programPoint places, 242 predicate places. [2025-03-04 10:09:38,146 INFO L471 AbstractCegarLoop]: Abstraction has has 264 places, 289 transitions, 3587 flow [2025-03-04 10:09:38,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 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-03-04 10:09:38,146 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:09:38,147 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:09:38,154 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2025-03-04 10:09:38,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2025-03-04 10:09:38,347 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 10:09:38,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:09:38,348 INFO L85 PathProgramCache]: Analyzing trace with hash -1925894837, now seen corresponding path program 18 times [2025-03-04 10:09:38,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:09:38,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136008559] [2025-03-04 10:09:38,348 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 10:09:38,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:09:38,350 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 15 statements into 2 equivalence classes. [2025-03-04 10:09:38,354 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 10:09:38,355 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-03-04 10:09:38,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:09:38,597 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:09:38,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:09:38,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136008559] [2025-03-04 10:09:38,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136008559] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:09:38,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [706273684] [2025-03-04 10:09:38,598 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 10:09:38,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:09:38,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:09:38,600 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:09:38,602 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2025-03-04 10:09:38,623 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 15 statements into 2 equivalence classes. [2025-03-04 10:09:38,636 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 10:09:38,636 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-03-04 10:09:38,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:09:38,639 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-04 10:09:38,640 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:09:38,752 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:09:38,752 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:09:39,255 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:09:39,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [706273684] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:09:39,255 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:09:39,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 17 [2025-03-04 10:09:39,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052763925] [2025-03-04 10:09:39,256 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:09:39,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-04 10:09:39,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:09:39,256 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-04 10:09:39,256 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2025-03-04 10:09:39,257 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 20 [2025-03-04 10:09:39,257 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 264 places, 289 transitions, 3587 flow. Second operand has 18 states, 18 states have (on average 5.777777777777778) internal successors, (104), 18 states have internal predecessors, (104), 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-03-04 10:09:39,257 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:09:39,257 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 20 [2025-03-04 10:09:39,257 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:09:39,843 INFO L124 PetriNetUnfolderBase]: 537/1032 cut-off events. [2025-03-04 10:09:39,843 INFO L125 PetriNetUnfolderBase]: For 11074/11074 co-relation queries the response was YES. [2025-03-04 10:09:39,848 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7146 conditions, 1032 events. 537/1032 cut-off events. For 11074/11074 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 5811 event pairs, 42 based on Foata normal form. 2/1018 useless extension candidates. Maximal degree in co-relation 7022. Up to 871 conditions per place. [2025-03-04 10:09:39,851 INFO L140 encePairwiseOnDemand]: 12/20 looper letters, 249 selfloop transitions, 65 changer transitions 7/322 dead transitions. [2025-03-04 10:09:39,852 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 280 places, 322 transitions, 4531 flow [2025-03-04 10:09:39,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-04 10:09:39,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-03-04 10:09:39,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 161 transitions. [2025-03-04 10:09:39,853 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4236842105263158 [2025-03-04 10:09:39,853 INFO L175 Difference]: Start difference. First operand has 264 places, 289 transitions, 3587 flow. Second operand 19 states and 161 transitions. [2025-03-04 10:09:39,853 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 280 places, 322 transitions, 4531 flow [2025-03-04 10:09:39,903 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 269 places, 322 transitions, 4255 flow, removed 110 selfloop flow, removed 11 redundant places. [2025-03-04 10:09:39,907 INFO L231 Difference]: Finished difference. Result has 272 places, 292 transitions, 3626 flow [2025-03-04 10:09:39,908 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=3363, PETRI_DIFFERENCE_MINUEND_PLACES=251, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=289, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=227, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=3626, PETRI_PLACES=272, PETRI_TRANSITIONS=292} [2025-03-04 10:09:39,908 INFO L279 CegarLoopForPetriNet]: 22 programPoint places, 250 predicate places. [2025-03-04 10:09:39,908 INFO L471 AbstractCegarLoop]: Abstraction has has 272 places, 292 transitions, 3626 flow [2025-03-04 10:09:39,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 5.777777777777778) internal successors, (104), 18 states have internal predecessors, (104), 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-03-04 10:09:39,909 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:09:39,909 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:09:39,915 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2025-03-04 10:09:40,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-03-04 10:09:40,113 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 10:09:40,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:09:40,113 INFO L85 PathProgramCache]: Analyzing trace with hash -285854487, now seen corresponding path program 19 times [2025-03-04 10:09:40,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:09:40,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105373105] [2025-03-04 10:09:40,114 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 10:09:40,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:09:40,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 10:09:40,121 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 10:09:40,121 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:09:40,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:09:40,397 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:09:40,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:09:40,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105373105] [2025-03-04 10:09:40,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105373105] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:09:40,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2083192958] [2025-03-04 10:09:40,397 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 10:09:40,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:09:40,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:09:40,399 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:09:40,400 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2025-03-04 10:09:40,421 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 10:09:40,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 10:09:40,449 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:09:40,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:09:40,449 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-04 10:09:40,450 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:09:40,652 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:09:40,652 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:09:45,061 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:09:45,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2083192958] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:09:45,062 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:09:45,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 20 [2025-03-04 10:09:45,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684650313] [2025-03-04 10:09:45,062 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:09:45,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-04 10:09:45,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:09:45,062 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-04 10:09:45,062 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=336, Unknown=1, NotChecked=0, Total=420 [2025-03-04 10:09:45,062 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 20 [2025-03-04 10:09:45,063 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 272 places, 292 transitions, 3626 flow. Second operand has 21 states, 21 states have (on average 5.714285714285714) internal successors, (120), 21 states have internal predecessors, (120), 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-03-04 10:09:45,063 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:09:45,063 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 20 [2025-03-04 10:09:45,063 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:09:49,377 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-04 10:09:53,949 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-04 10:09:58,253 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-04 10:10:02,404 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-04 10:10:06,437 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-04 10:10:06,636 INFO L124 PetriNetUnfolderBase]: 643/1223 cut-off events. [2025-03-04 10:10:06,636 INFO L125 PetriNetUnfolderBase]: For 20568/20568 co-relation queries the response was YES. [2025-03-04 10:10:06,641 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9121 conditions, 1223 events. 643/1223 cut-off events. For 20568/20568 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 7066 event pairs, 26 based on Foata normal form. 4/1209 useless extension candidates. Maximal degree in co-relation 9023. Up to 819 conditions per place. [2025-03-04 10:10:06,643 INFO L140 encePairwiseOnDemand]: 12/20 looper letters, 269 selfloop transitions, 113 changer transitions 22/405 dead transitions. [2025-03-04 10:10:06,643 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 303 places, 405 transitions, 5761 flow [2025-03-04 10:10:06,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-03-04 10:10:06,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2025-03-04 10:10:06,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 295 transitions. [2025-03-04 10:10:06,648 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.44696969696969696 [2025-03-04 10:10:06,648 INFO L175 Difference]: Start difference. First operand has 272 places, 292 transitions, 3626 flow. Second operand 33 states and 295 transitions. [2025-03-04 10:10:06,648 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 303 places, 405 transitions, 5761 flow [2025-03-04 10:10:06,711 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 288 places, 405 transitions, 5492 flow, removed 99 selfloop flow, removed 15 redundant places. [2025-03-04 10:10:06,715 INFO L231 Difference]: Finished difference. Result has 299 places, 328 transitions, 4475 flow [2025-03-04 10:10:06,715 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=3369, PETRI_DIFFERENCE_MINUEND_PLACES=256, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=292, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=87, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=200, PETRI_DIFFERENCE_SUBTRAHEND_STATES=33, PETRI_FLOW=4475, PETRI_PLACES=299, PETRI_TRANSITIONS=328} [2025-03-04 10:10:06,715 INFO L279 CegarLoopForPetriNet]: 22 programPoint places, 277 predicate places. [2025-03-04 10:10:06,716 INFO L471 AbstractCegarLoop]: Abstraction has has 299 places, 328 transitions, 4475 flow [2025-03-04 10:10:06,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 5.714285714285714) internal successors, (120), 21 states have internal predecessors, (120), 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-03-04 10:10:06,716 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:10:06,716 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:10:06,722 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2025-03-04 10:10:06,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-03-04 10:10:06,916 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 10:10:06,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:10:06,917 INFO L85 PathProgramCache]: Analyzing trace with hash -880172257, now seen corresponding path program 5 times [2025-03-04 10:10:06,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:10:06,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998826428] [2025-03-04 10:10:06,917 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 10:10:06,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:10:06,919 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-03-04 10:10:06,925 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 10:10:06,925 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:10:06,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:10:07,028 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:10:07,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:10:07,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998826428] [2025-03-04 10:10:07,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998826428] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:10:07,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [564091438] [2025-03-04 10:10:07,029 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 10:10:07,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:10:07,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:10:07,031 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:10:07,033 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2025-03-04 10:10:07,059 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-03-04 10:10:07,080 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 10:10:07,080 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:10:07,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:10:07,081 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-04 10:10:07,082 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:10:07,236 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:10:07,236 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:10:07,435 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:10:07,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [564091438] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:10:07,435 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:10:07,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 8] total 21 [2025-03-04 10:10:07,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770459703] [2025-03-04 10:10:07,436 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:10:07,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-04 10:10:07,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:10:07,436 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-04 10:10:07,436 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=346, Unknown=0, NotChecked=0, Total=462 [2025-03-04 10:10:07,436 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 20 [2025-03-04 10:10:07,436 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 299 places, 328 transitions, 4475 flow. Second operand has 22 states, 22 states have (on average 5.818181818181818) internal successors, (128), 22 states have internal predecessors, (128), 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-03-04 10:10:07,436 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:10:07,436 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 20 [2025-03-04 10:10:07,437 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:10:08,278 INFO L124 PetriNetUnfolderBase]: 725/1354 cut-off events. [2025-03-04 10:10:08,278 INFO L125 PetriNetUnfolderBase]: For 25599/25599 co-relation queries the response was YES. [2025-03-04 10:10:08,284 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10673 conditions, 1354 events. 725/1354 cut-off events. For 25599/25599 co-relation queries the response was YES. Maximal size of possible extension queue 165. Compared 7886 event pairs, 9 based on Foata normal form. 3/1339 useless extension candidates. Maximal degree in co-relation 10565. Up to 500 conditions per place. [2025-03-04 10:10:08,288 INFO L140 encePairwiseOnDemand]: 12/20 looper letters, 185 selfloop transitions, 243 changer transitions 12/441 dead transitions. [2025-03-04 10:10:08,288 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 323 places, 441 transitions, 6736 flow [2025-03-04 10:10:08,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-03-04 10:10:08,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2025-03-04 10:10:08,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 255 transitions. [2025-03-04 10:10:08,289 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4396551724137931 [2025-03-04 10:10:08,289 INFO L175 Difference]: Start difference. First operand has 299 places, 328 transitions, 4475 flow. Second operand 29 states and 255 transitions. [2025-03-04 10:10:08,289 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 323 places, 441 transitions, 6736 flow [2025-03-04 10:10:08,396 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 310 places, 441 transitions, 6008 flow, removed 339 selfloop flow, removed 13 redundant places. [2025-03-04 10:10:08,401 INFO L231 Difference]: Finished difference. Result has 315 places, 370 transitions, 5502 flow [2025-03-04 10:10:08,402 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=3849, PETRI_DIFFERENCE_MINUEND_PLACES=282, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=328, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=203, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=29, PETRI_FLOW=5502, PETRI_PLACES=315, PETRI_TRANSITIONS=370} [2025-03-04 10:10:08,402 INFO L279 CegarLoopForPetriNet]: 22 programPoint places, 293 predicate places. [2025-03-04 10:10:08,402 INFO L471 AbstractCegarLoop]: Abstraction has has 315 places, 370 transitions, 5502 flow [2025-03-04 10:10:08,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 5.818181818181818) internal successors, (128), 22 states have internal predecessors, (128), 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-03-04 10:10:08,402 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:10:08,402 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:10:08,411 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2025-03-04 10:10:08,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-03-04 10:10:08,603 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 10:10:08,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:10:08,603 INFO L85 PathProgramCache]: Analyzing trace with hash -1967390851, now seen corresponding path program 6 times [2025-03-04 10:10:08,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:10:08,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872050488] [2025-03-04 10:10:08,603 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 10:10:08,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:10:08,605 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 16 statements into 2 equivalence classes. [2025-03-04 10:10:08,610 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 10:10:08,610 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-03-04 10:10:08,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:10:08,711 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:10:08,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:10:08,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872050488] [2025-03-04 10:10:08,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872050488] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:10:08,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1136336742] [2025-03-04 10:10:08,711 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 10:10:08,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:10:08,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:10:08,714 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:10:08,716 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2025-03-04 10:10:08,738 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 16 statements into 2 equivalence classes. [2025-03-04 10:10:08,753 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 10:10:08,753 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-03-04 10:10:08,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:10:08,754 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-04 10:10:08,755 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:10:08,833 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:10:08,833 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:10:08,937 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:10:08,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1136336742] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:10:08,938 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:10:08,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 14 [2025-03-04 10:10:08,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267873454] [2025-03-04 10:10:08,938 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:10:08,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-04 10:10:08,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:10:08,938 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-04 10:10:08,938 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2025-03-04 10:10:08,938 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 20 [2025-03-04 10:10:08,938 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 315 places, 370 transitions, 5502 flow. Second operand has 15 states, 15 states have (on average 6.4) internal successors, (96), 15 states have internal predecessors, (96), 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-03-04 10:10:08,938 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:10:08,938 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 20 [2025-03-04 10:10:08,939 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand