./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/test-easy11.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e2fb8bed 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/test-easy11.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 dd59a2dab1e1a10d8308eb629ebc6f779430a45291e09beb1ad6d6fe62d16e94 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 01:30:10,529 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 01:30:10,585 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-09 01:30:10,590 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 01:30:10,590 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 01:30:10,613 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 01:30:10,614 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 01:30:10,614 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 01:30:10,615 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 01:30:10,615 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 01:30:10,615 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 01:30:10,615 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 01:30:10,615 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 01:30:10,615 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 01:30:10,615 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 01:30:10,616 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 01:30:10,616 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 01:30:10,616 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 01:30:10,616 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 01:30:10,616 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 01:30:10,616 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-09 01:30:10,616 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-09 01:30:10,616 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-09 01:30:10,616 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 01:30:10,616 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-09 01:30:10,616 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 01:30:10,616 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 01:30:10,616 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 01:30:10,616 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 01:30:10,616 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 01:30:10,616 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 01:30:10,616 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 01:30:10,616 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 01:30:10,616 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:30:10,617 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 01:30:10,617 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 01:30:10,617 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 01:30:10,617 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 01:30:10,617 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 01:30:10,617 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 01:30:10,617 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 01:30:10,617 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 01:30:10,617 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 -> dd59a2dab1e1a10d8308eb629ebc6f779430a45291e09beb1ad6d6fe62d16e94 [2025-03-09 01:30:10,885 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 01:30:10,894 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 01:30:10,896 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 01:30:10,898 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 01:30:10,898 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 01:30:10,899 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/test-easy11.wvr.c [2025-03-09 01:30:12,030 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6509864c3/255890d35d8e41608a268db67ee81241/FLAG2b17c7d57 [2025-03-09 01:30:12,243 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 01:30:12,243 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/test-easy11.wvr.c [2025-03-09 01:30:12,251 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6509864c3/255890d35d8e41608a268db67ee81241/FLAG2b17c7d57 [2025-03-09 01:30:12,604 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6509864c3/255890d35d8e41608a268db67ee81241 [2025-03-09 01:30:12,607 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 01:30:12,608 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 01:30:12,609 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 01:30:12,610 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 01:30:12,613 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 01:30:12,613 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:30:12" (1/1) ... [2025-03-09 01:30:12,615 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d795288 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:30:12, skipping insertion in model container [2025-03-09 01:30:12,616 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:30:12" (1/1) ... [2025-03-09 01:30:12,628 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 01:30:12,736 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:30:12,742 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 01:30:12,756 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:30:12,769 INFO L204 MainTranslator]: Completed translation [2025-03-09 01:30:12,770 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:30:12 WrapperNode [2025-03-09 01:30:12,772 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 01:30:12,773 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 01:30:12,773 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 01:30:12,773 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 01:30:12,777 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:30:12" (1/1) ... [2025-03-09 01:30:12,782 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:30:12" (1/1) ... [2025-03-09 01:30:12,792 INFO L138 Inliner]: procedures = 18, calls = 11, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 43 [2025-03-09 01:30:12,792 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 01:30:12,792 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 01:30:12,793 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 01:30:12,793 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 01:30:12,797 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:30:12" (1/1) ... [2025-03-09 01:30:12,797 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:30:12" (1/1) ... [2025-03-09 01:30:12,798 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:30:12" (1/1) ... [2025-03-09 01:30:12,806 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-09 01:30:12,806 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:30:12" (1/1) ... [2025-03-09 01:30:12,806 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:30:12" (1/1) ... [2025-03-09 01:30:12,809 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:30:12" (1/1) ... [2025-03-09 01:30:12,810 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:30:12" (1/1) ... [2025-03-09 01:30:12,810 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:30:12" (1/1) ... [2025-03-09 01:30:12,811 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:30:12" (1/1) ... [2025-03-09 01:30:12,812 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 01:30:12,813 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 01:30:12,813 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 01:30:12,813 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 01:30:12,814 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:30:12" (1/1) ... [2025-03-09 01:30:12,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:30:12,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:30:12,838 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-09 01:30:12,842 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-09 01:30:12,857 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 01:30:12,857 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-09 01:30:12,857 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-09 01:30:12,857 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-09 01:30:12,857 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-09 01:30:12,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 01:30:12,857 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 01:30:12,857 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 01:30:12,858 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-09 01:30:12,912 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 01:30:12,913 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 01:30:13,018 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-09 01:30:13,018 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 01:30:13,108 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 01:30:13,108 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 01:30:13,108 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:30:13 BoogieIcfgContainer [2025-03-09 01:30:13,108 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 01:30:13,111 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 01:30:13,111 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 01:30:13,114 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 01:30:13,115 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 01:30:12" (1/3) ... [2025-03-09 01:30:13,115 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71d37867 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:30:13, skipping insertion in model container [2025-03-09 01:30:13,116 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:30:12" (2/3) ... [2025-03-09 01:30:13,117 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71d37867 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:30:13, skipping insertion in model container [2025-03-09 01:30:13,117 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:30:13" (3/3) ... [2025-03-09 01:30:13,118 INFO L128 eAbstractionObserver]: Analyzing ICFG test-easy11.wvr.c [2025-03-09 01:30:13,128 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 01:30:13,130 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG test-easy11.wvr.c that has 3 procedures, 23 locations, 1 initial locations, 2 loop locations, and 2 error locations. [2025-03-09 01:30:13,131 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-09 01:30:13,169 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-09 01:30:13,197 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 24 transitions, 62 flow [2025-03-09 01:30:13,224 INFO L124 PetriNetUnfolderBase]: 2/22 cut-off events. [2025-03-09 01:30:13,225 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-09 01:30:13,231 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31 conditions, 22 events. 2/22 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 17 event pairs, 0 based on Foata normal form. 0/18 useless extension candidates. Maximal degree in co-relation 15. Up to 2 conditions per place. [2025-03-09 01:30:13,231 INFO L82 GeneralOperation]: Start removeDead. Operand has 29 places, 24 transitions, 62 flow [2025-03-09 01:30:13,233 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 26 places, 21 transitions, 54 flow [2025-03-09 01:30:13,241 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 01:30:13,251 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;@2a6c8d6e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 01:30:13,251 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-03-09 01:30:13,259 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-09 01:30:13,260 INFO L124 PetriNetUnfolderBase]: 2/18 cut-off events. [2025-03-09 01:30:13,260 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-09 01:30:13,260 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:30:13,261 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:30:13,261 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-09 01:30:13,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:30:13,265 INFO L85 PathProgramCache]: Analyzing trace with hash 1137624603, now seen corresponding path program 1 times [2025-03-09 01:30:13,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:30:13,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984906499] [2025-03-09 01:30:13,271 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:30:13,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:30:13,327 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-09 01:30:13,352 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-09 01:30:13,353 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:30:13,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:13,662 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-09 01:30:13,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:30:13,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984906499] [2025-03-09 01:30:13,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984906499] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:30:13,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:30:13,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-09 01:30:13,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329214438] [2025-03-09 01:30:13,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:30:13,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-09 01:30:13,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:30:13,686 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-09 01:30:13,686 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-09 01:30:13,703 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 24 [2025-03-09 01:30:13,707 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 21 transitions, 54 flow. Second operand has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 0 states have call successors, (0), 0 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-09 01:30:13,707 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:30:13,709 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 24 [2025-03-09 01:30:13,709 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:30:13,982 INFO L124 PetriNetUnfolderBase]: 111/201 cut-off events. [2025-03-09 01:30:13,982 INFO L125 PetriNetUnfolderBase]: For 27/27 co-relation queries the response was YES. [2025-03-09 01:30:13,983 INFO L83 FinitePrefix]: Finished finitePrefix Result has 428 conditions, 201 events. 111/201 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 602 event pairs, 2 based on Foata normal form. 2/175 useless extension candidates. Maximal degree in co-relation 364. Up to 57 conditions per place. [2025-03-09 01:30:13,985 INFO L140 encePairwiseOnDemand]: 14/24 looper letters, 40 selfloop transitions, 10 changer transitions 10/61 dead transitions. [2025-03-09 01:30:13,985 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 61 transitions, 278 flow [2025-03-09 01:30:13,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-09 01:30:13,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-09 01:30:13,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 98 transitions. [2025-03-09 01:30:13,999 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4537037037037037 [2025-03-09 01:30:14,000 INFO L175 Difference]: Start difference. First operand has 26 places, 21 transitions, 54 flow. Second operand 9 states and 98 transitions. [2025-03-09 01:30:14,001 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 61 transitions, 278 flow [2025-03-09 01:30:14,004 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 61 transitions, 254 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-09 01:30:14,008 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 107 flow [2025-03-09 01:30:14,010 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=42, PETRI_DIFFERENCE_MINUEND_PLACES=20, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=107, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2025-03-09 01:30:14,015 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 8 predicate places. [2025-03-09 01:30:14,016 INFO L471 AbstractCegarLoop]: Abstraction has has 34 places, 27 transitions, 107 flow [2025-03-09 01:30:14,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 0 states have call successors, (0), 0 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-09 01:30:14,016 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:30:14,016 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:30:14,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 01:30:14,017 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-09 01:30:14,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:30:14,018 INFO L85 PathProgramCache]: Analyzing trace with hash 520011329, now seen corresponding path program 2 times [2025-03-09 01:30:14,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:30:14,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527380419] [2025-03-09 01:30:14,019 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:30:14,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:30:14,028 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 1 equivalence classes. [2025-03-09 01:30:14,041 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-09 01:30:14,041 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 01:30:14,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:14,237 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-09 01:30:14,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:30:14,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527380419] [2025-03-09 01:30:14,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527380419] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:30:14,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:30:14,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-09 01:30:14,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938016126] [2025-03-09 01:30:14,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:30:14,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-09 01:30:14,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:30:14,239 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-09 01:30:14,239 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-09 01:30:14,253 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 24 [2025-03-09 01:30:14,253 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 27 transitions, 107 flow. Second operand has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 0 states have call successors, (0), 0 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-09 01:30:14,254 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:30:14,254 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 24 [2025-03-09 01:30:14,254 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:30:14,457 INFO L124 PetriNetUnfolderBase]: 114/208 cut-off events. [2025-03-09 01:30:14,457 INFO L125 PetriNetUnfolderBase]: For 89/89 co-relation queries the response was YES. [2025-03-09 01:30:14,458 INFO L83 FinitePrefix]: Finished finitePrefix Result has 588 conditions, 208 events. 114/208 cut-off events. For 89/89 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 600 event pairs, 14 based on Foata normal form. 1/198 useless extension candidates. Maximal degree in co-relation 575. Up to 115 conditions per place. [2025-03-09 01:30:14,460 INFO L140 encePairwiseOnDemand]: 15/24 looper letters, 34 selfloop transitions, 14 changer transitions 10/59 dead transitions. [2025-03-09 01:30:14,460 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 59 transitions, 336 flow [2025-03-09 01:30:14,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-09 01:30:14,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-09 01:30:14,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 92 transitions. [2025-03-09 01:30:14,461 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42592592592592593 [2025-03-09 01:30:14,461 INFO L175 Difference]: Start difference. First operand has 34 places, 27 transitions, 107 flow. Second operand 9 states and 92 transitions. [2025-03-09 01:30:14,461 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 59 transitions, 336 flow [2025-03-09 01:30:14,462 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 59 transitions, 324 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-03-09 01:30:14,463 INFO L231 Difference]: Finished difference. Result has 43 places, 35 transitions, 190 flow [2025-03-09 01:30:14,463 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=190, PETRI_PLACES=43, PETRI_TRANSITIONS=35} [2025-03-09 01:30:14,464 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 17 predicate places. [2025-03-09 01:30:14,464 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 35 transitions, 190 flow [2025-03-09 01:30:14,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 0 states have call successors, (0), 0 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-09 01:30:14,464 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:30:14,464 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:30:14,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-09 01:30:14,465 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-09 01:30:14,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:30:14,465 INFO L85 PathProgramCache]: Analyzing trace with hash 874477943, now seen corresponding path program 3 times [2025-03-09 01:30:14,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:30:14,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374946815] [2025-03-09 01:30:14,465 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 01:30:14,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:30:14,475 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 17 statements into 1 equivalence classes. [2025-03-09 01:30:14,483 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-09 01:30:14,483 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-09 01:30:14,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:14,614 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-09 01:30:14,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:30:14,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374946815] [2025-03-09 01:30:14,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374946815] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:30:14,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:30:14,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-09 01:30:14,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953960966] [2025-03-09 01:30:14,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:30:14,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-09 01:30:14,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:30:14,616 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-09 01:30:14,616 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-09 01:30:14,625 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 24 [2025-03-09 01:30:14,626 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 35 transitions, 190 flow. Second operand has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 0 states have call successors, (0), 0 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-09 01:30:14,626 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:30:14,626 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 24 [2025-03-09 01:30:14,626 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:30:14,805 INFO L124 PetriNetUnfolderBase]: 119/216 cut-off events. [2025-03-09 01:30:14,806 INFO L125 PetriNetUnfolderBase]: For 194/194 co-relation queries the response was YES. [2025-03-09 01:30:14,806 INFO L83 FinitePrefix]: Finished finitePrefix Result has 705 conditions, 216 events. 119/216 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 667 event pairs, 10 based on Foata normal form. 1/217 useless extension candidates. Maximal degree in co-relation 688. Up to 119 conditions per place. [2025-03-09 01:30:14,807 INFO L140 encePairwiseOnDemand]: 15/24 looper letters, 39 selfloop transitions, 18 changer transitions 9/67 dead transitions. [2025-03-09 01:30:14,807 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 67 transitions, 450 flow [2025-03-09 01:30:14,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-09 01:30:14,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-09 01:30:14,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 95 transitions. [2025-03-09 01:30:14,810 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4398148148148148 [2025-03-09 01:30:14,810 INFO L175 Difference]: Start difference. First operand has 43 places, 35 transitions, 190 flow. Second operand 9 states and 95 transitions. [2025-03-09 01:30:14,810 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 67 transitions, 450 flow [2025-03-09 01:30:14,812 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 67 transitions, 418 flow, removed 6 selfloop flow, removed 4 redundant places. [2025-03-09 01:30:14,815 INFO L231 Difference]: Finished difference. Result has 49 places, 40 transitions, 257 flow [2025-03-09 01:30:14,815 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=167, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=257, PETRI_PLACES=49, PETRI_TRANSITIONS=40} [2025-03-09 01:30:14,836 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 23 predicate places. [2025-03-09 01:30:14,836 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 40 transitions, 257 flow [2025-03-09 01:30:14,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 0 states have call successors, (0), 0 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-09 01:30:14,836 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:30:14,836 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:30:14,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-09 01:30:14,837 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-09 01:30:14,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:30:14,837 INFO L85 PathProgramCache]: Analyzing trace with hash 1452306903, now seen corresponding path program 4 times [2025-03-09 01:30:14,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:30:14,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285452897] [2025-03-09 01:30:14,837 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 01:30:14,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:30:14,845 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 17 statements into 2 equivalence classes. [2025-03-09 01:30:14,853 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-03-09 01:30:14,853 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 01:30:14,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:15,019 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-09 01:30:15,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:30:15,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285452897] [2025-03-09 01:30:15,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285452897] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:30:15,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:30:15,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-09 01:30:15,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630882553] [2025-03-09 01:30:15,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:30:15,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-09 01:30:15,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:30:15,022 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-09 01:30:15,022 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-09 01:30:15,028 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 24 [2025-03-09 01:30:15,029 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 40 transitions, 257 flow. Second operand has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 0 states have call successors, (0), 0 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-09 01:30:15,029 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:30:15,029 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 24 [2025-03-09 01:30:15,029 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:30:15,214 INFO L124 PetriNetUnfolderBase]: 194/329 cut-off events. [2025-03-09 01:30:15,214 INFO L125 PetriNetUnfolderBase]: For 595/595 co-relation queries the response was YES. [2025-03-09 01:30:15,215 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1221 conditions, 329 events. 194/329 cut-off events. For 595/595 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1076 event pairs, 32 based on Foata normal form. 1/330 useless extension candidates. Maximal degree in co-relation 1203. Up to 140 conditions per place. [2025-03-09 01:30:15,219 INFO L140 encePairwiseOnDemand]: 14/24 looper letters, 44 selfloop transitions, 35 changer transitions 10/90 dead transitions. [2025-03-09 01:30:15,220 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 90 transitions, 737 flow [2025-03-09 01:30:15,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 01:30:15,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-09 01:30:15,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 98 transitions. [2025-03-09 01:30:15,221 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5104166666666666 [2025-03-09 01:30:15,221 INFO L175 Difference]: Start difference. First operand has 49 places, 40 transitions, 257 flow. Second operand 8 states and 98 transitions. [2025-03-09 01:30:15,221 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 90 transitions, 737 flow [2025-03-09 01:30:15,223 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 90 transitions, 661 flow, removed 6 selfloop flow, removed 6 redundant places. [2025-03-09 01:30:15,225 INFO L231 Difference]: Finished difference. Result has 53 places, 61 transitions, 490 flow [2025-03-09 01:30:15,225 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=217, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=490, PETRI_PLACES=53, PETRI_TRANSITIONS=61} [2025-03-09 01:30:15,226 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 27 predicate places. [2025-03-09 01:30:15,226 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 61 transitions, 490 flow [2025-03-09 01:30:15,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 0 states have call successors, (0), 0 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-09 01:30:15,226 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:30:15,226 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:30:15,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-09 01:30:15,226 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-09 01:30:15,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:30:15,227 INFO L85 PathProgramCache]: Analyzing trace with hash 1305121395, now seen corresponding path program 5 times [2025-03-09 01:30:15,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:30:15,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399107998] [2025-03-09 01:30:15,227 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-09 01:30:15,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:30:15,231 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 17 statements into 1 equivalence classes. [2025-03-09 01:30:15,234 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-09 01:30:15,234 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 01:30:15,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:15,321 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-09 01:30:15,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:30:15,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399107998] [2025-03-09 01:30:15,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399107998] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:30:15,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:30:15,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-09 01:30:15,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559402167] [2025-03-09 01:30:15,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:30:15,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-09 01:30:15,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:30:15,322 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-09 01:30:15,323 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-09 01:30:15,329 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 24 [2025-03-09 01:30:15,329 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 61 transitions, 490 flow. Second operand has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 0 states have call successors, (0), 0 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-09 01:30:15,330 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:30:15,330 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 24 [2025-03-09 01:30:15,330 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:30:15,522 INFO L124 PetriNetUnfolderBase]: 205/353 cut-off events. [2025-03-09 01:30:15,522 INFO L125 PetriNetUnfolderBase]: For 984/984 co-relation queries the response was YES. [2025-03-09 01:30:15,524 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1488 conditions, 353 events. 205/353 cut-off events. For 984/984 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1272 event pairs, 14 based on Foata normal form. 1/354 useless extension candidates. Maximal degree in co-relation 1467. Up to 184 conditions per place. [2025-03-09 01:30:15,525 INFO L140 encePairwiseOnDemand]: 15/24 looper letters, 53 selfloop transitions, 31 changer transitions 10/95 dead transitions. [2025-03-09 01:30:15,525 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 95 transitions, 853 flow [2025-03-09 01:30:15,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-09 01:30:15,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-09 01:30:15,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 99 transitions. [2025-03-09 01:30:15,527 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4583333333333333 [2025-03-09 01:30:15,527 INFO L175 Difference]: Start difference. First operand has 53 places, 61 transitions, 490 flow. Second operand 9 states and 99 transitions. [2025-03-09 01:30:15,527 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 95 transitions, 853 flow [2025-03-09 01:30:15,548 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 95 transitions, 820 flow, removed 7 selfloop flow, removed 2 redundant places. [2025-03-09 01:30:15,549 INFO L231 Difference]: Finished difference. Result has 61 places, 63 transitions, 550 flow [2025-03-09 01:30:15,549 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=457, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=550, PETRI_PLACES=61, PETRI_TRANSITIONS=63} [2025-03-09 01:30:15,549 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 35 predicate places. [2025-03-09 01:30:15,549 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 63 transitions, 550 flow [2025-03-09 01:30:15,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 0 states have call successors, (0), 0 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-09 01:30:15,549 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:30:15,550 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:30:15,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-09 01:30:15,550 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-09 01:30:15,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:30:15,550 INFO L85 PathProgramCache]: Analyzing trace with hash 412071105, now seen corresponding path program 6 times [2025-03-09 01:30:15,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:30:15,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107448830] [2025-03-09 01:30:15,550 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-09 01:30:15,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:30:15,556 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 17 statements into 1 equivalence classes. [2025-03-09 01:30:15,560 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-09 01:30:15,560 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-09 01:30:15,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:15,661 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-09 01:30:15,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:30:15,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107448830] [2025-03-09 01:30:15,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107448830] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:30:15,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:30:15,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-09 01:30:15,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718994328] [2025-03-09 01:30:15,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:30:15,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-09 01:30:15,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:30:15,662 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-09 01:30:15,662 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-09 01:30:15,671 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 24 [2025-03-09 01:30:15,672 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 63 transitions, 550 flow. Second operand has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 0 states have call successors, (0), 0 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-09 01:30:15,672 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:30:15,672 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 24 [2025-03-09 01:30:15,672 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:30:15,831 INFO L124 PetriNetUnfolderBase]: 222/379 cut-off events. [2025-03-09 01:30:15,831 INFO L125 PetriNetUnfolderBase]: For 1388/1388 co-relation queries the response was YES. [2025-03-09 01:30:15,832 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1745 conditions, 379 events. 222/379 cut-off events. For 1388/1388 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1368 event pairs, 17 based on Foata normal form. 1/380 useless extension candidates. Maximal degree in co-relation 1722. Up to 208 conditions per place. [2025-03-09 01:30:15,834 INFO L140 encePairwiseOnDemand]: 14/24 looper letters, 50 selfloop transitions, 38 changer transitions 9/98 dead transitions. [2025-03-09 01:30:15,834 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 98 transitions, 990 flow [2025-03-09 01:30:15,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-09 01:30:15,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-09 01:30:15,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 95 transitions. [2025-03-09 01:30:15,835 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4398148148148148 [2025-03-09 01:30:15,835 INFO L175 Difference]: Start difference. First operand has 61 places, 63 transitions, 550 flow. Second operand 9 states and 95 transitions. [2025-03-09 01:30:15,835 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 98 transitions, 990 flow [2025-03-09 01:30:15,838 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 98 transitions, 900 flow, removed 8 selfloop flow, removed 7 redundant places. [2025-03-09 01:30:15,839 INFO L231 Difference]: Finished difference. Result has 65 places, 74 transitions, 719 flow [2025-03-09 01:30:15,840 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=476, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=719, PETRI_PLACES=65, PETRI_TRANSITIONS=74} [2025-03-09 01:30:15,840 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 39 predicate places. [2025-03-09 01:30:15,840 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 74 transitions, 719 flow [2025-03-09 01:30:15,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 0 states have call successors, (0), 0 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-09 01:30:15,840 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:30:15,840 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:30:15,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-09 01:30:15,841 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-09 01:30:15,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:30:15,841 INFO L85 PathProgramCache]: Analyzing trace with hash -1160485311, now seen corresponding path program 7 times [2025-03-09 01:30:15,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:30:15,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011551652] [2025-03-09 01:30:15,841 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-09 01:30:15,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:30:15,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-09 01:30:15,846 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-09 01:30:15,846 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:30:15,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:15,939 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-09 01:30:15,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:30:15,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011551652] [2025-03-09 01:30:15,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011551652] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:30:15,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:30:15,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-09 01:30:15,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993563102] [2025-03-09 01:30:15,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:30:15,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-09 01:30:15,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:30:15,940 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-09 01:30:15,941 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-09 01:30:15,951 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 24 [2025-03-09 01:30:15,952 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 74 transitions, 719 flow. Second operand has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 0 states have call successors, (0), 0 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-09 01:30:15,952 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:30:15,952 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 24 [2025-03-09 01:30:15,952 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:30:16,132 INFO L124 PetriNetUnfolderBase]: 216/369 cut-off events. [2025-03-09 01:30:16,133 INFO L125 PetriNetUnfolderBase]: For 1638/1638 co-relation queries the response was YES. [2025-03-09 01:30:16,133 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1805 conditions, 369 events. 216/369 cut-off events. For 1638/1638 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1331 event pairs, 18 based on Foata normal form. 1/370 useless extension candidates. Maximal degree in co-relation 1779. Up to 196 conditions per place. [2025-03-09 01:30:16,135 INFO L140 encePairwiseOnDemand]: 15/24 looper letters, 56 selfloop transitions, 34 changer transitions 12/103 dead transitions. [2025-03-09 01:30:16,135 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 103 transitions, 1102 flow [2025-03-09 01:30:16,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-09 01:30:16,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-09 01:30:16,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 95 transitions. [2025-03-09 01:30:16,141 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4398148148148148 [2025-03-09 01:30:16,141 INFO L175 Difference]: Start difference. First operand has 65 places, 74 transitions, 719 flow. Second operand 9 states and 95 transitions. [2025-03-09 01:30:16,142 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 103 transitions, 1102 flow [2025-03-09 01:30:16,146 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 103 transitions, 1038 flow, removed 16 selfloop flow, removed 4 redundant places. [2025-03-09 01:30:16,165 INFO L231 Difference]: Finished difference. Result has 68 places, 71 transitions, 700 flow [2025-03-09 01:30:16,166 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=661, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=700, PETRI_PLACES=68, PETRI_TRANSITIONS=71} [2025-03-09 01:30:16,166 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 42 predicate places. [2025-03-09 01:30:16,166 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 71 transitions, 700 flow [2025-03-09 01:30:16,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 0 states have call successors, (0), 0 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-09 01:30:16,166 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:30:16,167 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:30:16,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-09 01:30:16,167 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-09 01:30:16,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:30:16,167 INFO L85 PathProgramCache]: Analyzing trace with hash 1377944359, now seen corresponding path program 8 times [2025-03-09 01:30:16,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:30:16,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979744126] [2025-03-09 01:30:16,168 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:30:16,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:30:16,171 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 1 equivalence classes. [2025-03-09 01:30:16,173 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-09 01:30:16,173 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 01:30:16,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:16,258 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-09 01:30:16,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:30:16,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979744126] [2025-03-09 01:30:16,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979744126] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:30:16,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:30:16,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-09 01:30:16,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104867810] [2025-03-09 01:30:16,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:30:16,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-09 01:30:16,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:30:16,259 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-09 01:30:16,259 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-09 01:30:16,266 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 24 [2025-03-09 01:30:16,266 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 71 transitions, 700 flow. Second operand has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 0 states have call successors, (0), 0 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-09 01:30:16,266 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:30:16,267 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 24 [2025-03-09 01:30:16,268 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:30:16,461 INFO L124 PetriNetUnfolderBase]: 228/389 cut-off events. [2025-03-09 01:30:16,461 INFO L125 PetriNetUnfolderBase]: For 1811/1811 co-relation queries the response was YES. [2025-03-09 01:30:16,462 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1884 conditions, 389 events. 228/389 cut-off events. For 1811/1811 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1414 event pairs, 18 based on Foata normal form. 1/390 useless extension candidates. Maximal degree in co-relation 1859. Up to 200 conditions per place. [2025-03-09 01:30:16,463 INFO L140 encePairwiseOnDemand]: 14/24 looper letters, 52 selfloop transitions, 39 changer transitions 10/102 dead transitions. [2025-03-09 01:30:16,464 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 102 transitions, 1087 flow [2025-03-09 01:30:16,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-09 01:30:16,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-09 01:30:16,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 100 transitions. [2025-03-09 01:30:16,468 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.46296296296296297 [2025-03-09 01:30:16,468 INFO L175 Difference]: Start difference. First operand has 68 places, 71 transitions, 700 flow. Second operand 9 states and 100 transitions. [2025-03-09 01:30:16,468 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 102 transitions, 1087 flow [2025-03-09 01:30:16,473 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 102 transitions, 1007 flow, removed 5 selfloop flow, removed 6 redundant places. [2025-03-09 01:30:16,475 INFO L231 Difference]: Finished difference. Result has 70 places, 75 transitions, 772 flow [2025-03-09 01:30:16,476 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=626, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=772, PETRI_PLACES=70, PETRI_TRANSITIONS=75} [2025-03-09 01:30:16,476 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 44 predicate places. [2025-03-09 01:30:16,477 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 75 transitions, 772 flow [2025-03-09 01:30:16,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 0 states have call successors, (0), 0 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-09 01:30:16,477 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:30:16,477 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:30:16,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-09 01:30:16,478 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-09 01:30:16,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:30:16,478 INFO L85 PathProgramCache]: Analyzing trace with hash -417460065, now seen corresponding path program 9 times [2025-03-09 01:30:16,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:30:16,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223764978] [2025-03-09 01:30:16,478 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 01:30:16,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:30:16,482 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 17 statements into 1 equivalence classes. [2025-03-09 01:30:16,484 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-09 01:30:16,485 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-09 01:30:16,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:16,571 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-09 01:30:16,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:30:16,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223764978] [2025-03-09 01:30:16,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223764978] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:30:16,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:30:16,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-09 01:30:16,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589826484] [2025-03-09 01:30:16,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:30:16,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-09 01:30:16,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:30:16,572 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-09 01:30:16,572 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-09 01:30:16,583 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 24 [2025-03-09 01:30:16,583 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 75 transitions, 772 flow. Second operand has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 0 states have call successors, (0), 0 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-09 01:30:16,583 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:30:16,583 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 24 [2025-03-09 01:30:16,583 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:30:16,777 INFO L124 PetriNetUnfolderBase]: 234/402 cut-off events. [2025-03-09 01:30:16,777 INFO L125 PetriNetUnfolderBase]: For 2141/2141 co-relation queries the response was YES. [2025-03-09 01:30:16,778 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1995 conditions, 402 events. 234/402 cut-off events. For 2141/2141 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1488 event pairs, 23 based on Foata normal form. 1/403 useless extension candidates. Maximal degree in co-relation 1967. Up to 220 conditions per place. [2025-03-09 01:30:16,780 INFO L140 encePairwiseOnDemand]: 14/24 looper letters, 53 selfloop transitions, 38 changer transitions 9/101 dead transitions. [2025-03-09 01:30:16,780 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 101 transitions, 1111 flow [2025-03-09 01:30:16,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-09 01:30:16,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-09 01:30:16,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 97 transitions. [2025-03-09 01:30:16,781 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.44907407407407407 [2025-03-09 01:30:16,781 INFO L175 Difference]: Start difference. First operand has 70 places, 75 transitions, 772 flow. Second operand 9 states and 97 transitions. [2025-03-09 01:30:16,781 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 101 transitions, 1111 flow [2025-03-09 01:30:16,785 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 101 transitions, 1033 flow, removed 11 selfloop flow, removed 5 redundant places. [2025-03-09 01:30:16,786 INFO L231 Difference]: Finished difference. Result has 74 places, 77 transitions, 804 flow [2025-03-09 01:30:16,787 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=694, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=804, PETRI_PLACES=74, PETRI_TRANSITIONS=77} [2025-03-09 01:30:16,787 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 48 predicate places. [2025-03-09 01:30:16,787 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 77 transitions, 804 flow [2025-03-09 01:30:16,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 0 states have call successors, (0), 0 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-09 01:30:16,787 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:30:16,787 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:30:16,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-09 01:30:16,788 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-09 01:30:16,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:30:16,788 INFO L85 PathProgramCache]: Analyzing trace with hash 1027697865, now seen corresponding path program 10 times [2025-03-09 01:30:16,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:30:16,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739325987] [2025-03-09 01:30:16,788 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 01:30:16,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:30:16,791 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 17 statements into 2 equivalence classes. [2025-03-09 01:30:16,795 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-03-09 01:30:16,795 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 01:30:16,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:16,916 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-09 01:30:16,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:30:16,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739325987] [2025-03-09 01:30:16,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739325987] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:30:16,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:30:16,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-09 01:30:16,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256229096] [2025-03-09 01:30:16,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:30:16,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-09 01:30:16,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:30:16,917 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-09 01:30:16,917 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-09 01:30:16,921 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 24 [2025-03-09 01:30:16,921 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 77 transitions, 804 flow. Second operand has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 0 states have call successors, (0), 0 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-09 01:30:16,921 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:30:16,921 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 24 [2025-03-09 01:30:16,921 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:30:17,128 INFO L124 PetriNetUnfolderBase]: 314/532 cut-off events. [2025-03-09 01:30:17,128 INFO L125 PetriNetUnfolderBase]: For 3098/3098 co-relation queries the response was YES. [2025-03-09 01:30:17,129 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2806 conditions, 532 events. 314/532 cut-off events. For 3098/3098 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 2135 event pairs, 44 based on Foata normal form. 1/533 useless extension candidates. Maximal degree in co-relation 2777. Up to 259 conditions per place. [2025-03-09 01:30:17,132 INFO L140 encePairwiseOnDemand]: 14/24 looper letters, 65 selfloop transitions, 54 changer transitions 9/129 dead transitions. [2025-03-09 01:30:17,132 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 129 transitions, 1577 flow [2025-03-09 01:30:17,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 01:30:17,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-09 01:30:17,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 99 transitions. [2025-03-09 01:30:17,133 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.515625 [2025-03-09 01:30:17,133 INFO L175 Difference]: Start difference. First operand has 74 places, 77 transitions, 804 flow. Second operand 8 states and 99 transitions. [2025-03-09 01:30:17,133 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 129 transitions, 1577 flow [2025-03-09 01:30:17,139 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 129 transitions, 1427 flow, removed 19 selfloop flow, removed 7 redundant places. [2025-03-09 01:30:17,141 INFO L231 Difference]: Finished difference. Result has 77 places, 99 transitions, 1152 flow [2025-03-09 01:30:17,141 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=712, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1152, PETRI_PLACES=77, PETRI_TRANSITIONS=99} [2025-03-09 01:30:17,141 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 51 predicate places. [2025-03-09 01:30:17,141 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 99 transitions, 1152 flow [2025-03-09 01:30:17,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 0 states have call successors, (0), 0 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-09 01:30:17,142 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:30:17,142 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:30:17,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-09 01:30:17,142 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-09 01:30:17,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:30:17,142 INFO L85 PathProgramCache]: Analyzing trace with hash -49507127, now seen corresponding path program 11 times [2025-03-09 01:30:17,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:30:17,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529554422] [2025-03-09 01:30:17,142 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-09 01:30:17,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:30:17,146 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 17 statements into 1 equivalence classes. [2025-03-09 01:30:17,148 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-09 01:30:17,148 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 01:30:17,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:17,244 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-09 01:30:17,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:30:17,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529554422] [2025-03-09 01:30:17,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529554422] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:30:17,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:30:17,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-09 01:30:17,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287848887] [2025-03-09 01:30:17,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:30:17,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-09 01:30:17,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:30:17,245 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-09 01:30:17,245 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-09 01:30:17,255 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 24 [2025-03-09 01:30:17,255 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 99 transitions, 1152 flow. Second operand has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 0 states have call successors, (0), 0 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-09 01:30:17,255 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:30:17,255 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 24 [2025-03-09 01:30:17,256 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:30:17,450 INFO L124 PetriNetUnfolderBase]: 305/518 cut-off events. [2025-03-09 01:30:17,450 INFO L125 PetriNetUnfolderBase]: For 3048/3048 co-relation queries the response was YES. [2025-03-09 01:30:17,451 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2816 conditions, 518 events. 305/518 cut-off events. For 3048/3048 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 2060 event pairs, 27 based on Foata normal form. 1/519 useless extension candidates. Maximal degree in co-relation 2784. Up to 278 conditions per place. [2025-03-09 01:30:17,454 INFO L140 encePairwiseOnDemand]: 14/24 looper letters, 56 selfloop transitions, 53 changer transitions 11/121 dead transitions. [2025-03-09 01:30:17,454 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 121 transitions, 1519 flow [2025-03-09 01:30:17,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-09 01:30:17,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-09 01:30:17,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 95 transitions. [2025-03-09 01:30:17,455 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4398148148148148 [2025-03-09 01:30:17,455 INFO L175 Difference]: Start difference. First operand has 77 places, 99 transitions, 1152 flow. Second operand 9 states and 95 transitions. [2025-03-09 01:30:17,455 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 121 transitions, 1519 flow [2025-03-09 01:30:17,462 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 121 transitions, 1468 flow, removed 9 selfloop flow, removed 2 redundant places. [2025-03-09 01:30:17,464 INFO L231 Difference]: Finished difference. Result has 84 places, 96 transitions, 1191 flow [2025-03-09 01:30:17,465 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=1101, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1191, PETRI_PLACES=84, PETRI_TRANSITIONS=96} [2025-03-09 01:30:17,465 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 58 predicate places. [2025-03-09 01:30:17,465 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 96 transitions, 1191 flow [2025-03-09 01:30:17,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 0 states have call successors, (0), 0 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-09 01:30:17,465 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:30:17,465 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:30:17,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-09 01:30:17,466 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-09 01:30:17,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:30:17,466 INFO L85 PathProgramCache]: Analyzing trace with hash 1532703861, now seen corresponding path program 12 times [2025-03-09 01:30:17,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:30:17,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842730141] [2025-03-09 01:30:17,466 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-09 01:30:17,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:30:17,470 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 17 statements into 1 equivalence classes. [2025-03-09 01:30:17,472 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-09 01:30:17,472 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-09 01:30:17,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:17,553 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-09 01:30:17,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:30:17,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842730141] [2025-03-09 01:30:17,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842730141] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:30:17,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:30:17,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-09 01:30:17,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455465557] [2025-03-09 01:30:17,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:30:17,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-09 01:30:17,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:30:17,554 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-09 01:30:17,554 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-09 01:30:17,563 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 24 [2025-03-09 01:30:17,564 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 96 transitions, 1191 flow. Second operand has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 0 states have call successors, (0), 0 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-09 01:30:17,564 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:30:17,564 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 24 [2025-03-09 01:30:17,564 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:30:17,754 INFO L124 PetriNetUnfolderBase]: 327/554 cut-off events. [2025-03-09 01:30:17,754 INFO L125 PetriNetUnfolderBase]: For 4030/4030 co-relation queries the response was YES. [2025-03-09 01:30:17,756 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3083 conditions, 554 events. 327/554 cut-off events. For 4030/4030 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 2211 event pairs, 37 based on Foata normal form. 1/555 useless extension candidates. Maximal degree in co-relation 3050. Up to 288 conditions per place. [2025-03-09 01:30:17,759 INFO L140 encePairwiseOnDemand]: 14/24 looper letters, 62 selfloop transitions, 57 changer transitions 12/132 dead transitions. [2025-03-09 01:30:17,759 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 132 transitions, 1792 flow [2025-03-09 01:30:17,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-09 01:30:17,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-09 01:30:17,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 95 transitions. [2025-03-09 01:30:17,760 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4398148148148148 [2025-03-09 01:30:17,760 INFO L175 Difference]: Start difference. First operand has 84 places, 96 transitions, 1191 flow. Second operand 9 states and 95 transitions. [2025-03-09 01:30:17,760 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 132 transitions, 1792 flow [2025-03-09 01:30:17,767 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 132 transitions, 1654 flow, removed 9 selfloop flow, removed 6 redundant places. [2025-03-09 01:30:17,769 INFO L231 Difference]: Finished difference. Result has 89 places, 107 transitions, 1420 flow [2025-03-09 01:30:17,771 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=1069, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1420, PETRI_PLACES=89, PETRI_TRANSITIONS=107} [2025-03-09 01:30:17,771 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 63 predicate places. [2025-03-09 01:30:17,771 INFO L471 AbstractCegarLoop]: Abstraction has has 89 places, 107 transitions, 1420 flow [2025-03-09 01:30:17,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 0 states have call successors, (0), 0 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-09 01:30:17,771 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:30:17,771 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:30:17,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-09 01:30:17,772 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-09 01:30:17,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:30:17,772 INFO L85 PathProgramCache]: Analyzing trace with hash 2067933663, now seen corresponding path program 13 times [2025-03-09 01:30:17,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:30:17,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145671876] [2025-03-09 01:30:17,772 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-09 01:30:17,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:30:17,775 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-09 01:30:17,777 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-09 01:30:17,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:30:17,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:17,850 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-09 01:30:17,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:30:17,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145671876] [2025-03-09 01:30:17,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145671876] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:30:17,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:30:17,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-09 01:30:17,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594036742] [2025-03-09 01:30:17,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:30:17,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-09 01:30:17,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:30:17,852 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-09 01:30:17,852 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-09 01:30:17,859 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 24 [2025-03-09 01:30:17,859 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 107 transitions, 1420 flow. Second operand has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 0 states have call successors, (0), 0 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-09 01:30:17,859 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:30:17,859 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 24 [2025-03-09 01:30:17,859 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:30:18,059 INFO L124 PetriNetUnfolderBase]: 323/550 cut-off events. [2025-03-09 01:30:18,060 INFO L125 PetriNetUnfolderBase]: For 4620/4620 co-relation queries the response was YES. [2025-03-09 01:30:18,061 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3219 conditions, 550 events. 323/550 cut-off events. For 4620/4620 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 2194 event pairs, 40 based on Foata normal form. 1/551 useless extension candidates. Maximal degree in co-relation 3182. Up to 284 conditions per place. [2025-03-09 01:30:18,064 INFO L140 encePairwiseOnDemand]: 14/24 looper letters, 61 selfloop transitions, 58 changer transitions 12/132 dead transitions. [2025-03-09 01:30:18,064 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 132 transitions, 1877 flow [2025-03-09 01:30:18,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-09 01:30:18,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-09 01:30:18,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 94 transitions. [2025-03-09 01:30:18,065 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4351851851851852 [2025-03-09 01:30:18,065 INFO L175 Difference]: Start difference. First operand has 89 places, 107 transitions, 1420 flow. Second operand 9 states and 94 transitions. [2025-03-09 01:30:18,065 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 132 transitions, 1877 flow [2025-03-09 01:30:18,072 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 132 transitions, 1767 flow, removed 33 selfloop flow, removed 4 redundant places. [2025-03-09 01:30:18,074 INFO L231 Difference]: Finished difference. Result has 95 places, 108 transitions, 1493 flow [2025-03-09 01:30:18,074 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=1330, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1493, PETRI_PLACES=95, PETRI_TRANSITIONS=108} [2025-03-09 01:30:18,075 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 69 predicate places. [2025-03-09 01:30:18,075 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 108 transitions, 1493 flow [2025-03-09 01:30:18,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 0 states have call successors, (0), 0 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-09 01:30:18,075 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:30:18,076 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:30:18,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-09 01:30:18,076 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-09 01:30:18,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:30:18,076 INFO L85 PathProgramCache]: Analyzing trace with hash -1876787139, now seen corresponding path program 14 times [2025-03-09 01:30:18,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:30:18,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606832056] [2025-03-09 01:30:18,077 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:30:18,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:30:18,080 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 1 equivalence classes. [2025-03-09 01:30:18,084 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-09 01:30:18,084 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 01:30:18,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:18,155 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-09 01:30:18,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:30:18,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606832056] [2025-03-09 01:30:18,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606832056] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:30:18,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:30:18,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-09 01:30:18,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639682566] [2025-03-09 01:30:18,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:30:18,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-09 01:30:18,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:30:18,156 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-09 01:30:18,156 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-09 01:30:18,165 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 24 [2025-03-09 01:30:18,165 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 108 transitions, 1493 flow. Second operand has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 0 states have call successors, (0), 0 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-09 01:30:18,165 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:30:18,165 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 24 [2025-03-09 01:30:18,165 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:30:18,351 INFO L124 PetriNetUnfolderBase]: 339/576 cut-off events. [2025-03-09 01:30:18,351 INFO L125 PetriNetUnfolderBase]: For 5149/5149 co-relation queries the response was YES. [2025-03-09 01:30:18,352 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3411 conditions, 576 events. 339/576 cut-off events. For 5149/5149 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 2323 event pairs, 39 based on Foata normal form. 1/577 useless extension candidates. Maximal degree in co-relation 3372. Up to 290 conditions per place. [2025-03-09 01:30:18,356 INFO L140 encePairwiseOnDemand]: 14/24 looper letters, 64 selfloop transitions, 58 changer transitions 11/134 dead transitions. [2025-03-09 01:30:18,356 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 134 transitions, 1934 flow [2025-03-09 01:30:18,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-09 01:30:18,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-09 01:30:18,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 96 transitions. [2025-03-09 01:30:18,358 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2025-03-09 01:30:18,358 INFO L175 Difference]: Start difference. First operand has 95 places, 108 transitions, 1493 flow. Second operand 9 states and 96 transitions. [2025-03-09 01:30:18,358 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 134 transitions, 1934 flow [2025-03-09 01:30:18,367 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 134 transitions, 1825 flow, removed 13 selfloop flow, removed 5 redundant places. [2025-03-09 01:30:18,369 INFO L231 Difference]: Finished difference. Result has 99 places, 109 transitions, 1535 flow [2025-03-09 01:30:18,370 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=1388, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1535, PETRI_PLACES=99, PETRI_TRANSITIONS=109} [2025-03-09 01:30:18,370 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 73 predicate places. [2025-03-09 01:30:18,370 INFO L471 AbstractCegarLoop]: Abstraction has has 99 places, 109 transitions, 1535 flow [2025-03-09 01:30:18,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 0 states have call successors, (0), 0 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-09 01:30:18,371 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:30:18,371 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:30:18,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-09 01:30:18,371 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-09 01:30:18,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:30:18,373 INFO L85 PathProgramCache]: Analyzing trace with hash -389916799, now seen corresponding path program 15 times [2025-03-09 01:30:18,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:30:18,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152791576] [2025-03-09 01:30:18,373 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 01:30:18,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:30:18,376 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 17 statements into 1 equivalence classes. [2025-03-09 01:30:18,380 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-09 01:30:18,380 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-09 01:30:18,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:18,453 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-09 01:30:18,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:30:18,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152791576] [2025-03-09 01:30:18,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152791576] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:30:18,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:30:18,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-09 01:30:18,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489326424] [2025-03-09 01:30:18,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:30:18,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-09 01:30:18,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:30:18,453 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-09 01:30:18,453 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-09 01:30:18,463 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 24 [2025-03-09 01:30:18,463 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 109 transitions, 1535 flow. Second operand has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 0 states have call successors, (0), 0 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-09 01:30:18,464 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:30:18,464 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 24 [2025-03-09 01:30:18,464 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:30:18,637 INFO L124 PetriNetUnfolderBase]: 335/574 cut-off events. [2025-03-09 01:30:18,637 INFO L125 PetriNetUnfolderBase]: For 5320/5320 co-relation queries the response was YES. [2025-03-09 01:30:18,639 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3457 conditions, 574 events. 335/574 cut-off events. For 5320/5320 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 2365 event pairs, 42 based on Foata normal form. 1/575 useless extension candidates. Maximal degree in co-relation 3417. Up to 306 conditions per place. [2025-03-09 01:30:18,641 INFO L140 encePairwiseOnDemand]: 15/24 looper letters, 74 selfloop transitions, 52 changer transitions 9/136 dead transitions. [2025-03-09 01:30:18,641 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 136 transitions, 2028 flow [2025-03-09 01:30:18,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-09 01:30:18,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-09 01:30:18,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 93 transitions. [2025-03-09 01:30:18,642 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4305555555555556 [2025-03-09 01:30:18,642 INFO L175 Difference]: Start difference. First operand has 99 places, 109 transitions, 1535 flow. Second operand 9 states and 93 transitions. [2025-03-09 01:30:18,642 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 136 transitions, 2028 flow [2025-03-09 01:30:18,652 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 136 transitions, 1932 flow, removed 12 selfloop flow, removed 6 redundant places. [2025-03-09 01:30:18,654 INFO L231 Difference]: Finished difference. Result has 102 places, 111 transitions, 1584 flow [2025-03-09 01:30:18,654 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=1439, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1584, PETRI_PLACES=102, PETRI_TRANSITIONS=111} [2025-03-09 01:30:18,655 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 76 predicate places. [2025-03-09 01:30:18,655 INFO L471 AbstractCegarLoop]: Abstraction has has 102 places, 111 transitions, 1584 flow [2025-03-09 01:30:18,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 0 states have call successors, (0), 0 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-09 01:30:18,655 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:30:18,655 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:30:18,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-09 01:30:18,655 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-09 01:30:18,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:30:18,656 INFO L85 PathProgramCache]: Analyzing trace with hash 2020064163, now seen corresponding path program 16 times [2025-03-09 01:30:18,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:30:18,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200173513] [2025-03-09 01:30:18,656 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 01:30:18,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:30:18,661 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 17 statements into 2 equivalence classes. [2025-03-09 01:30:18,663 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-03-09 01:30:18,663 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 01:30:18,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:18,758 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-09 01:30:18,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:30:18,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200173513] [2025-03-09 01:30:18,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200173513] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:30:18,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:30:18,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-09 01:30:18,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639117678] [2025-03-09 01:30:18,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:30:18,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-09 01:30:18,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:30:18,759 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-09 01:30:18,759 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-09 01:30:18,768 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 24 [2025-03-09 01:30:18,768 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 111 transitions, 1584 flow. Second operand has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 0 states have call successors, (0), 0 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-09 01:30:18,768 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:30:18,768 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 24 [2025-03-09 01:30:18,768 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:30:18,947 INFO L124 PetriNetUnfolderBase]: 359/618 cut-off events. [2025-03-09 01:30:18,947 INFO L125 PetriNetUnfolderBase]: For 6065/6065 co-relation queries the response was YES. [2025-03-09 01:30:18,949 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3688 conditions, 618 events. 359/618 cut-off events. For 6065/6065 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 2637 event pairs, 62 based on Foata normal form. 1/619 useless extension candidates. Maximal degree in co-relation 3647. Up to 262 conditions per place. [2025-03-09 01:30:18,952 INFO L140 encePairwiseOnDemand]: 14/24 looper letters, 75 selfloop transitions, 57 changer transitions 11/144 dead transitions. [2025-03-09 01:30:18,952 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 144 transitions, 2175 flow [2025-03-09 01:30:18,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-09 01:30:18,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-09 01:30:18,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 97 transitions. [2025-03-09 01:30:18,952 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.44907407407407407 [2025-03-09 01:30:18,953 INFO L175 Difference]: Start difference. First operand has 102 places, 111 transitions, 1584 flow. Second operand 9 states and 97 transitions. [2025-03-09 01:30:18,953 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 144 transitions, 2175 flow [2025-03-09 01:30:18,963 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 144 transitions, 2057 flow, removed 23 selfloop flow, removed 6 redundant places. [2025-03-09 01:30:18,965 INFO L231 Difference]: Finished difference. Result has 107 places, 115 transitions, 1708 flow [2025-03-09 01:30:18,965 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=1489, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1708, PETRI_PLACES=107, PETRI_TRANSITIONS=115} [2025-03-09 01:30:18,966 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 81 predicate places. [2025-03-09 01:30:18,966 INFO L471 AbstractCegarLoop]: Abstraction has has 107 places, 115 transitions, 1708 flow [2025-03-09 01:30:18,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 0 states have call successors, (0), 0 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-09 01:30:18,966 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:30:18,966 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:30:18,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-09 01:30:18,967 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-09 01:30:18,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:30:18,967 INFO L85 PathProgramCache]: Analyzing trace with hash 677021398, now seen corresponding path program 1 times [2025-03-09 01:30:18,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:30:18,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188683199] [2025-03-09 01:30:18,967 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:30:18,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:30:18,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-09 01:30:18,973 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 01:30:18,973 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:30:18,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:18,995 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-09 01:30:18,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:30:18,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188683199] [2025-03-09 01:30:18,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188683199] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:30:18,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [642006014] [2025-03-09 01:30:18,996 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:30:18,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:30:18,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:30:18,999 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-09 01:30:19,001 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-09 01:30:19,030 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-09 01:30:19,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 01:30:19,039 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:30:19,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:19,041 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 01:30:19,043 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:30:19,071 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-09 01:30:19,071 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:30:19,114 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:30:19,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [642006014] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-09 01:30:19,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-09 01:30:19,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 6 [2025-03-09 01:30:19,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227909541] [2025-03-09 01:30:19,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:30:19,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:30:19,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:30:19,115 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:30:19,115 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-09 01:30:19,119 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 24 [2025-03-09 01:30:19,119 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 115 transitions, 1708 flow. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 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-09 01:30:19,119 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:30:19,119 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 24 [2025-03-09 01:30:19,120 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:30:19,231 INFO L124 PetriNetUnfolderBase]: 387/673 cut-off events. [2025-03-09 01:30:19,231 INFO L125 PetriNetUnfolderBase]: For 6973/6973 co-relation queries the response was YES. [2025-03-09 01:30:19,233 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4027 conditions, 673 events. 387/673 cut-off events. For 6973/6973 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 2964 event pairs, 40 based on Foata normal form. 13/686 useless extension candidates. Maximal degree in co-relation 3979. Up to 327 conditions per place. [2025-03-09 01:30:19,237 INFO L140 encePairwiseOnDemand]: 19/24 looper letters, 109 selfloop transitions, 32 changer transitions 2/144 dead transitions. [2025-03-09 01:30:19,237 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 144 transitions, 2228 flow [2025-03-09 01:30:19,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:30:19,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:30:19,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 69 transitions. [2025-03-09 01:30:19,238 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.575 [2025-03-09 01:30:19,238 INFO L175 Difference]: Start difference. First operand has 107 places, 115 transitions, 1708 flow. Second operand 5 states and 69 transitions. [2025-03-09 01:30:19,238 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 144 transitions, 2228 flow [2025-03-09 01:30:19,250 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 144 transitions, 2094 flow, removed 32 selfloop flow, removed 5 redundant places. [2025-03-09 01:30:19,252 INFO L231 Difference]: Finished difference. Result has 107 places, 113 transitions, 1659 flow [2025-03-09 01:30:19,252 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=1490, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1659, PETRI_PLACES=107, PETRI_TRANSITIONS=113} [2025-03-09 01:30:19,253 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 81 predicate places. [2025-03-09 01:30:19,253 INFO L471 AbstractCegarLoop]: Abstraction has has 107 places, 113 transitions, 1659 flow [2025-03-09 01:30:19,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 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-09 01:30:19,253 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:30:19,253 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:30:19,259 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-09 01:30:19,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-09 01:30:19,454 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-09 01:30:19,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:30:19,454 INFO L85 PathProgramCache]: Analyzing trace with hash -368133069, now seen corresponding path program 1 times [2025-03-09 01:30:19,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:30:19,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994249068] [2025-03-09 01:30:19,454 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:30:19,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:30:19,457 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-09 01:30:19,458 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 01:30:19,458 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:30:19,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:19,477 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:30:19,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:30:19,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994249068] [2025-03-09 01:30:19,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994249068] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:30:19,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:30:19,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 01:30:19,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590695647] [2025-03-09 01:30:19,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:30:19,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:30:19,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:30:19,479 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:30:19,479 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:30:19,482 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 24 [2025-03-09 01:30:19,482 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 113 transitions, 1659 flow. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 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-09 01:30:19,483 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:30:19,483 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 24 [2025-03-09 01:30:19,483 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:30:19,599 INFO L124 PetriNetUnfolderBase]: 373/655 cut-off events. [2025-03-09 01:30:19,599 INFO L125 PetriNetUnfolderBase]: For 8075/8075 co-relation queries the response was YES. [2025-03-09 01:30:19,601 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4006 conditions, 655 events. 373/655 cut-off events. For 8075/8075 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 2880 event pairs, 46 based on Foata normal form. 12/667 useless extension candidates. Maximal degree in co-relation 3659. Up to 178 conditions per place. [2025-03-09 01:30:19,604 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 95 selfloop transitions, 40 changer transitions 6/142 dead transitions. [2025-03-09 01:30:19,604 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 142 transitions, 2184 flow [2025-03-09 01:30:19,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 01:30:19,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-09 01:30:19,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 84 transitions. [2025-03-09 01:30:19,605 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5 [2025-03-09 01:30:19,605 INFO L175 Difference]: Start difference. First operand has 107 places, 113 transitions, 1659 flow. Second operand 7 states and 84 transitions. [2025-03-09 01:30:19,605 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 142 transitions, 2184 flow [2025-03-09 01:30:19,617 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 142 transitions, 2159 flow, removed 6 selfloop flow, removed 2 redundant places. [2025-03-09 01:30:19,619 INFO L231 Difference]: Finished difference. Result has 111 places, 113 transitions, 1784 flow [2025-03-09 01:30:19,619 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=1606, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1784, PETRI_PLACES=111, PETRI_TRANSITIONS=113} [2025-03-09 01:30:19,620 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 85 predicate places. [2025-03-09 01:30:19,620 INFO L471 AbstractCegarLoop]: Abstraction has has 111 places, 113 transitions, 1784 flow [2025-03-09 01:30:19,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 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-09 01:30:19,620 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:30:19,620 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:30:19,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-09 01:30:19,621 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-09 01:30:19,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:30:19,621 INFO L85 PathProgramCache]: Analyzing trace with hash 526345399, now seen corresponding path program 2 times [2025-03-09 01:30:19,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:30:19,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914934895] [2025-03-09 01:30:19,622 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:30:19,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:30:19,625 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-03-09 01:30:19,627 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 01:30:19,628 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:30:19,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:19,648 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-09 01:30:19,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:30:19,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914934895] [2025-03-09 01:30:19,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914934895] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:30:19,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1277313608] [2025-03-09 01:30:19,649 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:30:19,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:30:19,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:30:19,652 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-09 01:30:19,653 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-09 01:30:19,676 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-03-09 01:30:19,685 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 01:30:19,685 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:30:19,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:19,686 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 01:30:19,687 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:30:19,693 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-09 01:30:19,694 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:30:19,715 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:30:19,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1277313608] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-09 01:30:19,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-09 01:30:19,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 7 [2025-03-09 01:30:19,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688606371] [2025-03-09 01:30:19,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:30:19,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:30:19,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:30:19,716 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:30:19,716 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-09 01:30:19,719 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 24 [2025-03-09 01:30:19,719 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 113 transitions, 1784 flow. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 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-09 01:30:19,719 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:30:19,719 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 24 [2025-03-09 01:30:19,719 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:30:19,843 INFO L124 PetriNetUnfolderBase]: 470/833 cut-off events. [2025-03-09 01:30:19,843 INFO L125 PetriNetUnfolderBase]: For 11685/11685 co-relation queries the response was YES. [2025-03-09 01:30:19,846 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5282 conditions, 833 events. 470/833 cut-off events. For 11685/11685 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 3904 event pairs, 84 based on Foata normal form. 8/841 useless extension candidates. Maximal degree in co-relation 4672. Up to 338 conditions per place. [2025-03-09 01:30:19,849 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 129 selfloop transitions, 40 changer transitions 0/170 dead transitions. [2025-03-09 01:30:19,850 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 170 transitions, 2706 flow [2025-03-09 01:30:19,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 01:30:19,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-09 01:30:19,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 92 transitions. [2025-03-09 01:30:19,850 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6388888888888888 [2025-03-09 01:30:19,850 INFO L175 Difference]: Start difference. First operand has 111 places, 113 transitions, 1784 flow. Second operand 6 states and 92 transitions. [2025-03-09 01:30:19,851 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 170 transitions, 2706 flow [2025-03-09 01:30:19,867 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 170 transitions, 2516 flow, removed 42 selfloop flow, removed 4 redundant places. [2025-03-09 01:30:19,869 INFO L231 Difference]: Finished difference. Result has 115 places, 121 transitions, 1931 flow [2025-03-09 01:30:19,869 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=1639, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1931, PETRI_PLACES=115, PETRI_TRANSITIONS=121} [2025-03-09 01:30:19,870 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 89 predicate places. [2025-03-09 01:30:19,870 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 121 transitions, 1931 flow [2025-03-09 01:30:19,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 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-09 01:30:19,870 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:30:19,870 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:30:19,876 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-09 01:30:20,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:30:20,074 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-09 01:30:20,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:30:20,074 INFO L85 PathProgramCache]: Analyzing trace with hash -1175714346, now seen corresponding path program 2 times [2025-03-09 01:30:20,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:30:20,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592359944] [2025-03-09 01:30:20,074 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:30:20,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:30:20,077 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-03-09 01:30:20,078 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 01:30:20,078 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:30:20,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:20,102 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-09 01:30:20,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:30:20,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592359944] [2025-03-09 01:30:20,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592359944] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:30:20,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1426456234] [2025-03-09 01:30:20,103 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:30:20,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:30:20,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:30:20,105 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-09 01:30:20,106 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-09 01:30:20,129 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-03-09 01:30:20,137 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 01:30:20,138 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:30:20,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:20,138 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 01:30:20,139 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:30:20,145 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-09 01:30:20,145 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:30:20,174 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:30:20,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1426456234] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-09 01:30:20,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-09 01:30:20,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 7 [2025-03-09 01:30:20,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645024701] [2025-03-09 01:30:20,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:30:20,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:30:20,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:30:20,175 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:30:20,175 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-09 01:30:20,183 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 24 [2025-03-09 01:30:20,183 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 121 transitions, 1931 flow. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 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-09 01:30:20,184 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:30:20,184 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 24 [2025-03-09 01:30:20,184 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:30:20,327 INFO L124 PetriNetUnfolderBase]: 584/1057 cut-off events. [2025-03-09 01:30:20,327 INFO L125 PetriNetUnfolderBase]: For 13297/13297 co-relation queries the response was YES. [2025-03-09 01:30:20,330 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6431 conditions, 1057 events. 584/1057 cut-off events. For 13297/13297 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 5372 event pairs, 40 based on Foata normal form. 9/1066 useless extension candidates. Maximal degree in co-relation 6285. Up to 516 conditions per place. [2025-03-09 01:30:20,338 INFO L140 encePairwiseOnDemand]: 17/24 looper letters, 128 selfloop transitions, 43 changer transitions 0/172 dead transitions. [2025-03-09 01:30:20,338 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 172 transitions, 2860 flow [2025-03-09 01:30:20,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:30:20,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:30:20,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 73 transitions. [2025-03-09 01:30:20,339 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6083333333333333 [2025-03-09 01:30:20,339 INFO L175 Difference]: Start difference. First operand has 115 places, 121 transitions, 1931 flow. Second operand 5 states and 73 transitions. [2025-03-09 01:30:20,339 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 172 transitions, 2860 flow [2025-03-09 01:30:20,359 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 172 transitions, 2769 flow, removed 17 selfloop flow, removed 2 redundant places. [2025-03-09 01:30:20,361 INFO L231 Difference]: Finished difference. Result has 120 places, 130 transitions, 2175 flow [2025-03-09 01:30:20,361 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=1852, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2175, PETRI_PLACES=120, PETRI_TRANSITIONS=130} [2025-03-09 01:30:20,361 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 94 predicate places. [2025-03-09 01:30:20,361 INFO L471 AbstractCegarLoop]: Abstraction has has 120 places, 130 transitions, 2175 flow [2025-03-09 01:30:20,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 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-09 01:30:20,362 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:30:20,362 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:30:20,368 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-09 01:30:20,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:30:20,566 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-09 01:30:20,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:30:20,567 INFO L85 PathProgramCache]: Analyzing trace with hash -1291425950, now seen corresponding path program 3 times [2025-03-09 01:30:20,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:30:20,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373960225] [2025-03-09 01:30:20,567 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 01:30:20,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:30:20,571 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 18 statements into 2 equivalence classes. [2025-03-09 01:30:20,573 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 01:30:20,574 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-09 01:30:20,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:20,596 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:30:20,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:30:20,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373960225] [2025-03-09 01:30:20,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373960225] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:30:20,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:30:20,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 01:30:20,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086874717] [2025-03-09 01:30:20,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:30:20,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:30:20,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:30:20,598 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:30:20,598 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:30:20,600 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 24 [2025-03-09 01:30:20,600 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 130 transitions, 2175 flow. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 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-09 01:30:20,600 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:30:20,600 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 24 [2025-03-09 01:30:20,600 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:30:20,751 INFO L124 PetriNetUnfolderBase]: 536/971 cut-off events. [2025-03-09 01:30:20,751 INFO L125 PetriNetUnfolderBase]: For 13734/13734 co-relation queries the response was YES. [2025-03-09 01:30:20,755 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6206 conditions, 971 events. 536/971 cut-off events. For 13734/13734 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 4817 event pairs, 50 based on Foata normal form. 6/977 useless extension candidates. Maximal degree in co-relation 6037. Up to 357 conditions per place. [2025-03-09 01:30:20,759 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 126 selfloop transitions, 34 changer transitions 2/163 dead transitions. [2025-03-09 01:30:20,759 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 163 transitions, 2894 flow [2025-03-09 01:30:20,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 01:30:20,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-09 01:30:20,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 74 transitions. [2025-03-09 01:30:20,760 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5138888888888888 [2025-03-09 01:30:20,760 INFO L175 Difference]: Start difference. First operand has 120 places, 130 transitions, 2175 flow. Second operand 6 states and 74 transitions. [2025-03-09 01:30:20,760 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 163 transitions, 2894 flow [2025-03-09 01:30:20,784 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 163 transitions, 2840 flow, removed 21 selfloop flow, removed 3 redundant places. [2025-03-09 01:30:20,786 INFO L231 Difference]: Finished difference. Result has 123 places, 126 transitions, 2143 flow [2025-03-09 01:30:20,787 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=2077, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2143, PETRI_PLACES=123, PETRI_TRANSITIONS=126} [2025-03-09 01:30:20,787 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 97 predicate places. [2025-03-09 01:30:20,788 INFO L471 AbstractCegarLoop]: Abstraction has has 123 places, 126 transitions, 2143 flow [2025-03-09 01:30:20,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 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-09 01:30:20,788 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:30:20,789 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:30:20,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-09 01:30:20,789 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-09 01:30:20,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:30:20,789 INFO L85 PathProgramCache]: Analyzing trace with hash -1983802277, now seen corresponding path program 3 times [2025-03-09 01:30:20,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:30:20,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900014798] [2025-03-09 01:30:20,789 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 01:30:20,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:30:20,792 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 18 statements into 2 equivalence classes. [2025-03-09 01:30:20,795 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 01:30:20,796 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-09 01:30:20,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:20,813 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:30:20,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:30:20,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900014798] [2025-03-09 01:30:20,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900014798] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:30:20,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:30:20,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 01:30:20,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31596144] [2025-03-09 01:30:20,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:30:20,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:30:20,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:30:20,814 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:30:20,815 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:30:20,818 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 24 [2025-03-09 01:30:20,818 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 126 transitions, 2143 flow. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 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-09 01:30:20,818 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:30:20,818 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 24 [2025-03-09 01:30:20,818 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:30:20,963 INFO L124 PetriNetUnfolderBase]: 494/892 cut-off events. [2025-03-09 01:30:20,963 INFO L125 PetriNetUnfolderBase]: For 12901/12901 co-relation queries the response was YES. [2025-03-09 01:30:20,966 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5822 conditions, 892 events. 494/892 cut-off events. For 12901/12901 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 4277 event pairs, 69 based on Foata normal form. 7/899 useless extension candidates. Maximal degree in co-relation 4819. Up to 235 conditions per place. [2025-03-09 01:30:20,969 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 125 selfloop transitions, 36 changer transitions 5/167 dead transitions. [2025-03-09 01:30:20,969 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 167 transitions, 2792 flow [2025-03-09 01:30:20,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 01:30:20,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-09 01:30:20,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 101 transitions. [2025-03-09 01:30:20,970 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5260416666666666 [2025-03-09 01:30:20,970 INFO L175 Difference]: Start difference. First operand has 123 places, 126 transitions, 2143 flow. Second operand 8 states and 101 transitions. [2025-03-09 01:30:20,970 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 167 transitions, 2792 flow [2025-03-09 01:30:21,012 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 167 transitions, 2732 flow, removed 20 selfloop flow, removed 3 redundant places. [2025-03-09 01:30:21,014 INFO L231 Difference]: Finished difference. Result has 125 places, 120 transitions, 2051 flow [2025-03-09 01:30:21,014 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=2019, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2051, PETRI_PLACES=125, PETRI_TRANSITIONS=120} [2025-03-09 01:30:21,014 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 99 predicate places. [2025-03-09 01:30:21,014 INFO L471 AbstractCegarLoop]: Abstraction has has 125 places, 120 transitions, 2051 flow [2025-03-09 01:30:21,015 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 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-09 01:30:21,015 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:30:21,015 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:30:21,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-09 01:30:21,015 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-09 01:30:21,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:30:21,015 INFO L85 PathProgramCache]: Analyzing trace with hash -1275567693, now seen corresponding path program 4 times [2025-03-09 01:30:21,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:30:21,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594833942] [2025-03-09 01:30:21,015 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 01:30:21,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:30:21,018 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 18 statements into 2 equivalence classes. [2025-03-09 01:30:21,019 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 01:30:21,019 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 01:30:21,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:21,037 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-09 01:30:21,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:30:21,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594833942] [2025-03-09 01:30:21,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594833942] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:30:21,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [84491985] [2025-03-09 01:30:21,038 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 01:30:21,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:30:21,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:30:21,040 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-09 01:30:21,042 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-09 01:30:21,063 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 18 statements into 2 equivalence classes. [2025-03-09 01:30:21,071 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 01:30:21,071 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 01:30:21,071 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:21,073 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 01:30:21,073 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:30:21,082 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-09 01:30:21,082 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:30:21,104 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:30:21,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [84491985] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-09 01:30:21,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-09 01:30:21,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 8 [2025-03-09 01:30:21,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536736883] [2025-03-09 01:30:21,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:30:21,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:30:21,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:30:21,105 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:30:21,105 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-09 01:30:21,107 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 24 [2025-03-09 01:30:21,107 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 120 transitions, 2051 flow. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 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-09 01:30:21,107 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:30:21,107 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 24 [2025-03-09 01:30:21,108 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:30:21,236 INFO L124 PetriNetUnfolderBase]: 468/849 cut-off events. [2025-03-09 01:30:21,236 INFO L125 PetriNetUnfolderBase]: For 12050/12050 co-relation queries the response was YES. [2025-03-09 01:30:21,238 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5522 conditions, 849 events. 468/849 cut-off events. For 12050/12050 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 4043 event pairs, 50 based on Foata normal form. 8/857 useless extension candidates. Maximal degree in co-relation 4834. Up to 336 conditions per place. [2025-03-09 01:30:21,241 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 116 selfloop transitions, 35 changer transitions 1/153 dead transitions. [2025-03-09 01:30:21,241 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 153 transitions, 2667 flow [2025-03-09 01:30:21,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:30:21,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:30:21,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2025-03-09 01:30:21,242 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334 [2025-03-09 01:30:21,242 INFO L175 Difference]: Start difference. First operand has 125 places, 120 transitions, 2051 flow. Second operand 5 states and 70 transitions. [2025-03-09 01:30:21,242 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 153 transitions, 2667 flow [2025-03-09 01:30:21,262 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 153 transitions, 2586 flow, removed 24 selfloop flow, removed 4 redundant places. [2025-03-09 01:30:21,264 INFO L231 Difference]: Finished difference. Result has 124 places, 120 transitions, 2051 flow [2025-03-09 01:30:21,265 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=1957, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2051, PETRI_PLACES=124, PETRI_TRANSITIONS=120} [2025-03-09 01:30:21,265 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 98 predicate places. [2025-03-09 01:30:21,265 INFO L471 AbstractCegarLoop]: Abstraction has has 124 places, 120 transitions, 2051 flow [2025-03-09 01:30:21,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 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-09 01:30:21,265 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:30:21,265 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:30:21,271 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-09 01:30:21,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:30:21,466 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-09 01:30:21,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:30:21,466 INFO L85 PathProgramCache]: Analyzing trace with hash -761840658, now seen corresponding path program 4 times [2025-03-09 01:30:21,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:30:21,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696864317] [2025-03-09 01:30:21,466 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 01:30:21,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:30:21,469 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 18 statements into 2 equivalence classes. [2025-03-09 01:30:21,470 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 01:30:21,470 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 01:30:21,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:21,491 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-09 01:30:21,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:30:21,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696864317] [2025-03-09 01:30:21,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696864317] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:30:21,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1696611344] [2025-03-09 01:30:21,492 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 01:30:21,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:30:21,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:30:21,494 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-09 01:30:21,495 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-09 01:30:21,517 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 18 statements into 2 equivalence classes. [2025-03-09 01:30:21,525 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 01:30:21,525 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 01:30:21,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:21,526 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 01:30:21,527 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:30:21,538 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-09 01:30:21,538 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:30:21,560 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:30:21,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1696611344] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-09 01:30:21,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-09 01:30:21,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 8 [2025-03-09 01:30:21,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229102052] [2025-03-09 01:30:21,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:30:21,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:30:21,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:30:21,562 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:30:21,562 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-09 01:30:21,564 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 24 [2025-03-09 01:30:21,564 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 120 transitions, 2051 flow. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 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-09 01:30:21,564 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:30:21,564 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 24 [2025-03-09 01:30:21,564 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:30:21,692 INFO L124 PetriNetUnfolderBase]: 457/843 cut-off events. [2025-03-09 01:30:21,692 INFO L125 PetriNetUnfolderBase]: For 11454/11454 co-relation queries the response was YES. [2025-03-09 01:30:21,695 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5256 conditions, 843 events. 457/843 cut-off events. For 11454/11454 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 4067 event pairs, 105 based on Foata normal form. 9/852 useless extension candidates. Maximal degree in co-relation 4574. Up to 393 conditions per place. [2025-03-09 01:30:21,697 INFO L140 encePairwiseOnDemand]: 17/24 looper letters, 110 selfloop transitions, 48 changer transitions 2/161 dead transitions. [2025-03-09 01:30:21,697 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 161 transitions, 2743 flow [2025-03-09 01:30:21,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 01:30:21,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-09 01:30:21,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 88 transitions. [2025-03-09 01:30:21,698 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6111111111111112 [2025-03-09 01:30:21,698 INFO L175 Difference]: Start difference. First operand has 124 places, 120 transitions, 2051 flow. Second operand 6 states and 88 transitions. [2025-03-09 01:30:21,698 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 161 transitions, 2743 flow [2025-03-09 01:30:21,714 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 161 transitions, 2732 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-03-09 01:30:21,716 INFO L231 Difference]: Finished difference. Result has 131 places, 126 transitions, 2312 flow [2025-03-09 01:30:21,717 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=2040, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2312, PETRI_PLACES=131, PETRI_TRANSITIONS=126} [2025-03-09 01:30:21,717 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 105 predicate places. [2025-03-09 01:30:21,717 INFO L471 AbstractCegarLoop]: Abstraction has has 131 places, 126 transitions, 2312 flow [2025-03-09 01:30:21,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 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-09 01:30:21,717 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:30:21,717 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:30:21,723 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-09 01:30:21,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-03-09 01:30:21,918 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-09 01:30:21,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:30:21,918 INFO L85 PathProgramCache]: Analyzing trace with hash 891112716, now seen corresponding path program 5 times [2025-03-09 01:30:21,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:30:21,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582349668] [2025-03-09 01:30:21,918 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-09 01:30:21,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:30:21,921 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-03-09 01:30:21,922 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 01:30:21,922 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:30:21,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:21,939 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:30:21,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:30:21,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582349668] [2025-03-09 01:30:21,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582349668] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:30:21,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:30:21,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 01:30:21,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167575444] [2025-03-09 01:30:21,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:30:21,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:30:21,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:30:21,940 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:30:21,940 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:30:21,943 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 24 [2025-03-09 01:30:21,944 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 126 transitions, 2312 flow. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 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-09 01:30:21,944 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:30:21,944 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 24 [2025-03-09 01:30:21,944 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:30:22,114 INFO L124 PetriNetUnfolderBase]: 446/826 cut-off events. [2025-03-09 01:30:22,114 INFO L125 PetriNetUnfolderBase]: For 12138/12138 co-relation queries the response was YES. [2025-03-09 01:30:22,117 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5388 conditions, 826 events. 446/826 cut-off events. For 12138/12138 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 3970 event pairs, 71 based on Foata normal form. 6/832 useless extension candidates. Maximal degree in co-relation 4730. Up to 230 conditions per place. [2025-03-09 01:30:22,119 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 112 selfloop transitions, 44 changer transitions 2/159 dead transitions. [2025-03-09 01:30:22,119 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 159 transitions, 2851 flow [2025-03-09 01:30:22,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 01:30:22,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-09 01:30:22,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 98 transitions. [2025-03-09 01:30:22,120 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5104166666666666 [2025-03-09 01:30:22,120 INFO L175 Difference]: Start difference. First operand has 131 places, 126 transitions, 2312 flow. Second operand 8 states and 98 transitions. [2025-03-09 01:30:22,120 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 159 transitions, 2851 flow [2025-03-09 01:30:22,145 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 159 transitions, 2803 flow, removed 20 selfloop flow, removed 1 redundant places. [2025-03-09 01:30:22,147 INFO L231 Difference]: Finished difference. Result has 137 places, 122 transitions, 2266 flow [2025-03-09 01:30:22,147 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=2224, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2266, PETRI_PLACES=137, PETRI_TRANSITIONS=122} [2025-03-09 01:30:22,147 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 111 predicate places. [2025-03-09 01:30:22,148 INFO L471 AbstractCegarLoop]: Abstraction has has 137 places, 122 transitions, 2266 flow [2025-03-09 01:30:22,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 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-09 01:30:22,148 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:30:22,148 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:30:22,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-09 01:30:22,148 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-09 01:30:22,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:30:22,149 INFO L85 PathProgramCache]: Analyzing trace with hash 1960984073, now seen corresponding path program 5 times [2025-03-09 01:30:22,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:30:22,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945893562] [2025-03-09 01:30:22,149 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-09 01:30:22,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:30:22,152 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-03-09 01:30:22,154 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 01:30:22,154 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:30:22,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:22,175 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-09 01:30:22,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:30:22,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945893562] [2025-03-09 01:30:22,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945893562] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:30:22,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1691057713] [2025-03-09 01:30:22,176 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-09 01:30:22,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:30:22,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:30:22,181 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-09 01:30:22,182 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-09 01:30:22,207 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-03-09 01:30:22,216 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 01:30:22,217 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:30:22,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:22,217 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 01:30:22,218 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:30:22,224 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-09 01:30:22,224 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:30:22,243 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:30:22,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1691057713] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-09 01:30:22,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-09 01:30:22,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 6 [2025-03-09 01:30:22,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178204250] [2025-03-09 01:30:22,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:30:22,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:30:22,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:30:22,244 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:30:22,244 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-09 01:30:22,247 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 24 [2025-03-09 01:30:22,247 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 122 transitions, 2266 flow. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 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-09 01:30:22,247 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:30:22,247 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 24 [2025-03-09 01:30:22,247 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:30:22,352 INFO L124 PetriNetUnfolderBase]: 406/737 cut-off events. [2025-03-09 01:30:22,352 INFO L125 PetriNetUnfolderBase]: For 12053/12053 co-relation queries the response was YES. [2025-03-09 01:30:22,354 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5013 conditions, 737 events. 406/737 cut-off events. For 12053/12053 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 3355 event pairs, 50 based on Foata normal form. 14/751 useless extension candidates. Maximal degree in co-relation 4497. Up to 437 conditions per place. [2025-03-09 01:30:22,357 INFO L140 encePairwiseOnDemand]: 19/24 looper letters, 91 selfloop transitions, 39 changer transitions 0/131 dead transitions. [2025-03-09 01:30:22,357 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 131 transitions, 2510 flow [2025-03-09 01:30:22,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:30:22,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:30:22,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2025-03-09 01:30:22,358 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5416666666666666 [2025-03-09 01:30:22,358 INFO L175 Difference]: Start difference. First operand has 137 places, 122 transitions, 2266 flow. Second operand 5 states and 65 transitions. [2025-03-09 01:30:22,358 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 131 transitions, 2510 flow [2025-03-09 01:30:22,376 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 131 transitions, 2291 flow, removed 31 selfloop flow, removed 9 redundant places. [2025-03-09 01:30:22,378 INFO L231 Difference]: Finished difference. Result has 130 places, 113 transitions, 1970 flow [2025-03-09 01:30:22,378 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=1827, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1970, PETRI_PLACES=130, PETRI_TRANSITIONS=113} [2025-03-09 01:30:22,378 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 104 predicate places. [2025-03-09 01:30:22,379 INFO L471 AbstractCegarLoop]: Abstraction has has 130 places, 113 transitions, 1970 flow [2025-03-09 01:30:22,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 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-09 01:30:22,379 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:30:22,379 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:30:22,385 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-09 01:30:22,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-03-09 01:30:22,583 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-09 01:30:22,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:30:22,583 INFO L85 PathProgramCache]: Analyzing trace with hash 87371333, now seen corresponding path program 6 times [2025-03-09 01:30:22,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:30:22,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480382425] [2025-03-09 01:30:22,584 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-09 01:30:22,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:30:22,587 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 18 statements into 2 equivalence classes. [2025-03-09 01:30:22,588 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 01:30:22,589 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-03-09 01:30:22,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:22,606 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:30:22,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:30:22,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480382425] [2025-03-09 01:30:22,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480382425] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:30:22,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:30:22,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 01:30:22,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406707192] [2025-03-09 01:30:22,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:30:22,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:30:22,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:30:22,607 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:30:22,607 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:30:22,610 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 24 [2025-03-09 01:30:22,610 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 113 transitions, 1970 flow. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 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-09 01:30:22,610 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:30:22,610 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 24 [2025-03-09 01:30:22,610 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:30:22,717 INFO L124 PetriNetUnfolderBase]: 352/642 cut-off events. [2025-03-09 01:30:22,718 INFO L125 PetriNetUnfolderBase]: For 8973/8973 co-relation queries the response was YES. [2025-03-09 01:30:22,719 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4305 conditions, 642 events. 352/642 cut-off events. For 8973/8973 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2797 event pairs, 21 based on Foata normal form. 7/649 useless extension candidates. Maximal degree in co-relation 3786. Up to 239 conditions per place. [2025-03-09 01:30:22,722 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 103 selfloop transitions, 26 changer transitions 2/132 dead transitions. [2025-03-09 01:30:22,722 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 132 transitions, 2375 flow [2025-03-09 01:30:22,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 01:30:22,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-09 01:30:22,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 72 transitions. [2025-03-09 01:30:22,723 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5 [2025-03-09 01:30:22,723 INFO L175 Difference]: Start difference. First operand has 130 places, 113 transitions, 1970 flow. Second operand 6 states and 72 transitions. [2025-03-09 01:30:22,723 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 132 transitions, 2375 flow [2025-03-09 01:30:22,737 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 132 transitions, 2288 flow, removed 9 selfloop flow, removed 4 redundant places. [2025-03-09 01:30:22,739 INFO L231 Difference]: Finished difference. Result has 130 places, 103 transitions, 1773 flow [2025-03-09 01:30:22,739 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=1762, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1773, PETRI_PLACES=130, PETRI_TRANSITIONS=103} [2025-03-09 01:30:22,739 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 104 predicate places. [2025-03-09 01:30:22,739 INFO L471 AbstractCegarLoop]: Abstraction has has 130 places, 103 transitions, 1773 flow [2025-03-09 01:30:22,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 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-09 01:30:22,740 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:30:22,740 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:30:22,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-09 01:30:22,740 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-09 01:30:22,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:30:22,740 INFO L85 PathProgramCache]: Analyzing trace with hash -1873456034, now seen corresponding path program 6 times [2025-03-09 01:30:22,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:30:22,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116898015] [2025-03-09 01:30:22,741 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-09 01:30:22,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:30:22,743 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 18 statements into 2 equivalence classes. [2025-03-09 01:30:22,745 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 01:30:22,745 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-03-09 01:30:22,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:22,764 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:30:22,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:30:22,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116898015] [2025-03-09 01:30:22,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116898015] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:30:22,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:30:22,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 01:30:22,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349815235] [2025-03-09 01:30:22,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:30:22,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:30:22,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:30:22,766 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:30:22,766 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:30:22,769 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 24 [2025-03-09 01:30:22,769 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 103 transitions, 1773 flow. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 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-09 01:30:22,769 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:30:22,769 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 24 [2025-03-09 01:30:22,769 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:30:22,866 INFO L124 PetriNetUnfolderBase]: 309/562 cut-off events. [2025-03-09 01:30:22,866 INFO L125 PetriNetUnfolderBase]: For 8105/8105 co-relation queries the response was YES. [2025-03-09 01:30:22,868 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3855 conditions, 562 events. 309/562 cut-off events. For 8105/8105 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2363 event pairs, 68 based on Foata normal form. 10/572 useless extension candidates. Maximal degree in co-relation 3734. Up to 248 conditions per place. [2025-03-09 01:30:22,869 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 69 selfloop transitions, 30 changer transitions 9/109 dead transitions. [2025-03-09 01:30:22,869 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 109 transitions, 1954 flow [2025-03-09 01:30:22,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 01:30:22,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-09 01:30:22,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 73 transitions. [2025-03-09 01:30:22,870 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.43452380952380953 [2025-03-09 01:30:22,870 INFO L175 Difference]: Start difference. First operand has 130 places, 103 transitions, 1773 flow. Second operand 7 states and 73 transitions. [2025-03-09 01:30:22,870 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 109 transitions, 1954 flow [2025-03-09 01:30:22,882 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 109 transitions, 1863 flow, removed 8 selfloop flow, removed 7 redundant places. [2025-03-09 01:30:22,883 INFO L231 Difference]: Finished difference. Result has 125 places, 90 transitions, 1501 flow [2025-03-09 01:30:22,884 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=1560, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1501, PETRI_PLACES=125, PETRI_TRANSITIONS=90} [2025-03-09 01:30:22,886 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 99 predicate places. [2025-03-09 01:30:22,887 INFO L471 AbstractCegarLoop]: Abstraction has has 125 places, 90 transitions, 1501 flow [2025-03-09 01:30:22,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 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-09 01:30:22,887 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:30:22,887 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:30:22,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-09 01:30:22,887 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-09 01:30:22,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:30:22,888 INFO L85 PathProgramCache]: Analyzing trace with hash 1645798342, now seen corresponding path program 1 times [2025-03-09 01:30:22,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:30:22,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872020536] [2025-03-09 01:30:22,888 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:30:22,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:30:22,890 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-09 01:30:22,891 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-09 01:30:22,891 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:30:22,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:22,980 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-09 01:30:22,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:30:22,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872020536] [2025-03-09 01:30:22,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872020536] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:30:22,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [572935669] [2025-03-09 01:30:22,980 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:30:22,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:30:22,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:30:22,982 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-09 01:30:22,984 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-09 01:30:23,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-09 01:30:23,013 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-09 01:30:23,013 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:30:23,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:23,014 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-09 01:30:23,014 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:30:23,100 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-09 01:30:23,101 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:30:23,332 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-09 01:30:23,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [572935669] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:30:23,332 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:30:23,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 22 [2025-03-09 01:30:23,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715467220] [2025-03-09 01:30:23,332 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:30:23,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-09 01:30:23,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:30:23,333 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-09 01:30:23,333 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=420, Unknown=0, NotChecked=0, Total=506 [2025-03-09 01:30:23,344 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 24 [2025-03-09 01:30:23,344 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 90 transitions, 1501 flow. Second operand has 23 states, 23 states have (on average 5.695652173913044) internal successors, (131), 23 states have internal predecessors, (131), 0 states have call successors, (0), 0 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-09 01:30:23,345 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:30:23,345 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 24 [2025-03-09 01:30:23,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:30:24,407 INFO L124 PetriNetUnfolderBase]: 694/1300 cut-off events. [2025-03-09 01:30:24,407 INFO L125 PetriNetUnfolderBase]: For 15074/15074 co-relation queries the response was YES. [2025-03-09 01:30:24,410 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7547 conditions, 1300 events. 694/1300 cut-off events. For 15074/15074 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 6977 event pairs, 33 based on Foata normal form. 2/1302 useless extension candidates. Maximal degree in co-relation 7412. Up to 242 conditions per place. [2025-03-09 01:30:24,413 INFO L140 encePairwiseOnDemand]: 14/24 looper letters, 129 selfloop transitions, 87 changer transitions 68/285 dead transitions. [2025-03-09 01:30:24,413 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 285 transitions, 4063 flow [2025-03-09 01:30:24,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-03-09 01:30:24,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2025-03-09 01:30:24,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 346 transitions. [2025-03-09 01:30:24,415 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.40046296296296297 [2025-03-09 01:30:24,415 INFO L175 Difference]: Start difference. First operand has 125 places, 90 transitions, 1501 flow. Second operand 36 states and 346 transitions. [2025-03-09 01:30:24,415 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 285 transitions, 4063 flow [2025-03-09 01:30:24,430 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 285 transitions, 3770 flow, removed 63 selfloop flow, removed 8 redundant places. [2025-03-09 01:30:24,433 INFO L231 Difference]: Finished difference. Result has 162 places, 129 transitions, 2363 flow [2025-03-09 01:30:24,433 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=1391, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=36, PETRI_FLOW=2363, PETRI_PLACES=162, PETRI_TRANSITIONS=129} [2025-03-09 01:30:24,435 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 136 predicate places. [2025-03-09 01:30:24,435 INFO L471 AbstractCegarLoop]: Abstraction has has 162 places, 129 transitions, 2363 flow [2025-03-09 01:30:24,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 5.695652173913044) internal successors, (131), 23 states have internal predecessors, (131), 0 states have call successors, (0), 0 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-09 01:30:24,435 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:30:24,435 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:30:24,441 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-09 01:30:24,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:30:24,636 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-09 01:30:24,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:30:24,637 INFO L85 PathProgramCache]: Analyzing trace with hash 1385387230, now seen corresponding path program 2 times [2025-03-09 01:30:24,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:30:24,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856408026] [2025-03-09 01:30:24,637 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:30:24,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:30:24,639 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-03-09 01:30:24,641 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-03-09 01:30:24,641 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:30:24,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:24,722 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-09 01:30:24,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:30:24,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856408026] [2025-03-09 01:30:24,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856408026] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:30:24,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [516496683] [2025-03-09 01:30:24,723 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:30:24,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:30:24,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:30:24,725 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-09 01:30:24,727 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-09 01:30:24,748 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-03-09 01:30:24,757 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-03-09 01:30:24,757 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:30:24,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:24,758 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-09 01:30:24,759 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:30:24,858 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-09 01:30:24,859 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:30:25,018 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-09 01:30:25,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [516496683] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:30:25,018 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:30:25,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 22 [2025-03-09 01:30:25,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101956259] [2025-03-09 01:30:25,019 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:30:25,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-09 01:30:25,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:30:25,020 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-09 01:30:25,020 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=410, Unknown=0, NotChecked=0, Total=506 [2025-03-09 01:30:25,031 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 24 [2025-03-09 01:30:25,031 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 129 transitions, 2363 flow. Second operand has 23 states, 23 states have (on average 5.478260869565218) internal successors, (126), 23 states have internal predecessors, (126), 0 states have call successors, (0), 0 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-09 01:30:25,031 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:30:25,031 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 24 [2025-03-09 01:30:25,031 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:30:25,459 INFO L124 PetriNetUnfolderBase]: 751/1463 cut-off events. [2025-03-09 01:30:25,459 INFO L125 PetriNetUnfolderBase]: For 18321/18321 co-relation queries the response was YES. [2025-03-09 01:30:25,465 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8486 conditions, 1463 events. 751/1463 cut-off events. For 18321/18321 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 8409 event pairs, 98 based on Foata normal form. 3/1466 useless extension candidates. Maximal degree in co-relation 8340. Up to 594 conditions per place. [2025-03-09 01:30:25,469 INFO L140 encePairwiseOnDemand]: 14/24 looper letters, 102 selfloop transitions, 99 changer transitions 12/214 dead transitions. [2025-03-09 01:30:25,469 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 214 transitions, 3874 flow [2025-03-09 01:30:25,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-09 01:30:25,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-09 01:30:25,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 134 transitions. [2025-03-09 01:30:25,470 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42948717948717946 [2025-03-09 01:30:25,470 INFO L175 Difference]: Start difference. First operand has 162 places, 129 transitions, 2363 flow. Second operand 13 states and 134 transitions. [2025-03-09 01:30:25,470 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 214 transitions, 3874 flow [2025-03-09 01:30:25,509 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 214 transitions, 3038 flow, removed 237 selfloop flow, removed 19 redundant places. [2025-03-09 01:30:25,511 INFO L231 Difference]: Finished difference. Result has 149 places, 161 transitions, 2461 flow [2025-03-09 01:30:25,511 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=1794, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=69, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=2461, PETRI_PLACES=149, PETRI_TRANSITIONS=161} [2025-03-09 01:30:25,512 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 123 predicate places. [2025-03-09 01:30:25,512 INFO L471 AbstractCegarLoop]: Abstraction has has 149 places, 161 transitions, 2461 flow [2025-03-09 01:30:25,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 5.478260869565218) internal successors, (126), 23 states have internal predecessors, (126), 0 states have call successors, (0), 0 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-09 01:30:25,512 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:30:25,512 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:30:25,518 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-09 01:30:25,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:30:25,713 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-09 01:30:25,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:30:25,713 INFO L85 PathProgramCache]: Analyzing trace with hash -1414536294, now seen corresponding path program 3 times [2025-03-09 01:30:25,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:30:25,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698716159] [2025-03-09 01:30:25,714 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 01:30:25,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:30:25,716 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 19 statements into 2 equivalence classes. [2025-03-09 01:30:25,719 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-03-09 01:30:25,719 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-09 01:30:25,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:25,810 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-09 01:30:25,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:30:25,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698716159] [2025-03-09 01:30:25,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698716159] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:30:25,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1776353992] [2025-03-09 01:30:25,810 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 01:30:25,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:30:25,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:30:25,812 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-09 01:30:25,813 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-09 01:30:25,835 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 19 statements into 2 equivalence classes. [2025-03-09 01:30:25,843 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-03-09 01:30:25,843 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-09 01:30:25,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:25,844 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-09 01:30:25,845 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:30:25,935 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-09 01:30:25,935 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:30:26,101 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-09 01:30:26,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1776353992] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:30:26,102 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:30:26,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 22 [2025-03-09 01:30:26,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86745390] [2025-03-09 01:30:26,102 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:30:26,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-09 01:30:26,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:30:26,103 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-09 01:30:26,104 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=407, Unknown=0, NotChecked=0, Total=506 [2025-03-09 01:30:26,111 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 24 [2025-03-09 01:30:26,111 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 161 transitions, 2461 flow. Second operand has 23 states, 23 states have (on average 5.391304347826087) internal successors, (124), 23 states have internal predecessors, (124), 0 states have call successors, (0), 0 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-09 01:30:26,111 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:30:26,111 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 24 [2025-03-09 01:30:26,111 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:30:26,605 INFO L124 PetriNetUnfolderBase]: 897/1738 cut-off events. [2025-03-09 01:30:26,605 INFO L125 PetriNetUnfolderBase]: For 17129/17129 co-relation queries the response was YES. [2025-03-09 01:30:26,611 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9072 conditions, 1738 events. 897/1738 cut-off events. For 17129/17129 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 10304 event pairs, 85 based on Foata normal form. 6/1744 useless extension candidates. Maximal degree in co-relation 8945. Up to 438 conditions per place. [2025-03-09 01:30:26,615 INFO L140 encePairwiseOnDemand]: 14/24 looper letters, 89 selfloop transitions, 144 changer transitions 27/261 dead transitions. [2025-03-09 01:30:26,615 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 261 transitions, 4138 flow [2025-03-09 01:30:26,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-09 01:30:26,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-03-09 01:30:26,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 172 transitions. [2025-03-09 01:30:26,616 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.39814814814814814 [2025-03-09 01:30:26,616 INFO L175 Difference]: Start difference. First operand has 149 places, 161 transitions, 2461 flow. Second operand 18 states and 172 transitions. [2025-03-09 01:30:26,616 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 261 transitions, 4138 flow [2025-03-09 01:30:26,652 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 261 transitions, 3997 flow, removed 34 selfloop flow, removed 5 redundant places. [2025-03-09 01:30:26,655 INFO L231 Difference]: Finished difference. Result has 167 places, 196 transitions, 3401 flow [2025-03-09 01:30:26,656 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=2362, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=111, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=3401, PETRI_PLACES=167, PETRI_TRANSITIONS=196} [2025-03-09 01:30:26,656 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 141 predicate places. [2025-03-09 01:30:26,657 INFO L471 AbstractCegarLoop]: Abstraction has has 167 places, 196 transitions, 3401 flow [2025-03-09 01:30:26,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 5.391304347826087) internal successors, (124), 23 states have internal predecessors, (124), 0 states have call successors, (0), 0 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-09 01:30:26,657 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:30:26,657 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:30:26,663 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-09 01:30:26,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:30:26,858 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-09 01:30:26,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:30:26,858 INFO L85 PathProgramCache]: Analyzing trace with hash -475859452, now seen corresponding path program 4 times [2025-03-09 01:30:26,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:30:26,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401503829] [2025-03-09 01:30:26,858 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 01:30:26,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:30:26,860 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 19 statements into 2 equivalence classes. [2025-03-09 01:30:26,862 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-03-09 01:30:26,864 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 01:30:26,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:26,945 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-09 01:30:26,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:30:26,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401503829] [2025-03-09 01:30:26,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401503829] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:30:26,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [736215955] [2025-03-09 01:30:26,945 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 01:30:26,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:30:26,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:30:26,947 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-09 01:30:26,949 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-09 01:30:26,970 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 19 statements into 2 equivalence classes. [2025-03-09 01:30:26,978 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-03-09 01:30:26,978 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 01:30:26,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:26,978 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-09 01:30:26,979 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:30:27,075 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-09 01:30:27,075 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:30:27,224 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-09 01:30:27,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [736215955] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:30:27,224 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:30:27,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 22 [2025-03-09 01:30:27,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959205240] [2025-03-09 01:30:27,224 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:30:27,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-09 01:30:27,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:30:27,225 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-09 01:30:27,225 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=418, Unknown=0, NotChecked=0, Total=506 [2025-03-09 01:30:27,227 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 24 [2025-03-09 01:30:27,228 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 196 transitions, 3401 flow. Second operand has 23 states, 23 states have (on average 5.478260869565218) internal successors, (126), 23 states have internal predecessors, (126), 0 states have call successors, (0), 0 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-09 01:30:27,228 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:30:27,228 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 24 [2025-03-09 01:30:27,228 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:30:27,730 INFO L124 PetriNetUnfolderBase]: 834/1627 cut-off events. [2025-03-09 01:30:27,730 INFO L125 PetriNetUnfolderBase]: For 19498/19498 co-relation queries the response was YES. [2025-03-09 01:30:27,735 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9458 conditions, 1627 events. 834/1627 cut-off events. For 19498/19498 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 9612 event pairs, 99 based on Foata normal form. 4/1631 useless extension candidates. Maximal degree in co-relation 9325. Up to 523 conditions per place. [2025-03-09 01:30:27,739 INFO L140 encePairwiseOnDemand]: 14/24 looper letters, 83 selfloop transitions, 139 changer transitions 16/239 dead transitions. [2025-03-09 01:30:27,739 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 239 transitions, 4207 flow [2025-03-09 01:30:27,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-09 01:30:27,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-03-09 01:30:27,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 160 transitions. [2025-03-09 01:30:27,740 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.39215686274509803 [2025-03-09 01:30:27,740 INFO L175 Difference]: Start difference. First operand has 167 places, 196 transitions, 3401 flow. Second operand 17 states and 160 transitions. [2025-03-09 01:30:27,740 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 239 transitions, 4207 flow [2025-03-09 01:30:27,788 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 239 transitions, 3958 flow, removed 94 selfloop flow, removed 5 redundant places. [2025-03-09 01:30:27,791 INFO L231 Difference]: Finished difference. Result has 178 places, 191 transitions, 3343 flow [2025-03-09 01:30:27,791 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=3162, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=196, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=139, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=3343, PETRI_PLACES=178, PETRI_TRANSITIONS=191} [2025-03-09 01:30:27,791 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 152 predicate places. [2025-03-09 01:30:27,791 INFO L471 AbstractCegarLoop]: Abstraction has has 178 places, 191 transitions, 3343 flow [2025-03-09 01:30:27,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 5.478260869565218) internal successors, (126), 23 states have internal predecessors, (126), 0 states have call successors, (0), 0 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-09 01:30:27,791 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:30:27,791 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:30:27,798 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-09 01:30:27,992 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,SelfDestructingSolverStorable31 [2025-03-09 01:30:27,992 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-09 01:30:27,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:30:27,992 INFO L85 PathProgramCache]: Analyzing trace with hash -125612958, now seen corresponding path program 5 times [2025-03-09 01:30:27,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:30:27,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700923860] [2025-03-09 01:30:27,993 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-09 01:30:27,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:30:27,995 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-03-09 01:30:27,996 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-03-09 01:30:27,996 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:30:27,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:28,049 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:30:28,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:30:28,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700923860] [2025-03-09 01:30:28,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700923860] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:30:28,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1137665532] [2025-03-09 01:30:28,050 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-09 01:30:28,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:30:28,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:30:28,052 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-09 01:30:28,053 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-09 01:30:28,075 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-03-09 01:30:28,083 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-03-09 01:30:28,083 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:30:28,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:28,084 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-09 01:30:28,085 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:30:28,132 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:30:28,132 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 01:30:28,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1137665532] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:30:28,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 01:30:28,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 11 [2025-03-09 01:30:28,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352838809] [2025-03-09 01:30:28,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:30:28,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-09 01:30:28,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:30:28,133 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-09 01:30:28,133 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2025-03-09 01:30:28,138 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 24 [2025-03-09 01:30:28,139 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 191 transitions, 3343 flow. Second operand has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 0 states have call successors, (0), 0 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-09 01:30:28,139 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:30:28,139 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 24 [2025-03-09 01:30:28,139 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:30:28,316 INFO L124 PetriNetUnfolderBase]: 776/1489 cut-off events. [2025-03-09 01:30:28,317 INFO L125 PetriNetUnfolderBase]: For 18772/18772 co-relation queries the response was YES. [2025-03-09 01:30:28,321 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9003 conditions, 1489 events. 776/1489 cut-off events. For 18772/18772 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 8337 event pairs, 173 based on Foata normal form. 2/1491 useless extension candidates. Maximal degree in co-relation 8877. Up to 997 conditions per place. [2025-03-09 01:30:28,324 INFO L140 encePairwiseOnDemand]: 16/24 looper letters, 118 selfloop transitions, 55 changer transitions 47/221 dead transitions. [2025-03-09 01:30:28,324 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 221 transitions, 4083 flow [2025-03-09 01:30:28,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-09 01:30:28,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-09 01:30:28,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 93 transitions. [2025-03-09 01:30:28,325 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4305555555555556 [2025-03-09 01:30:28,325 INFO L175 Difference]: Start difference. First operand has 178 places, 191 transitions, 3343 flow. Second operand 9 states and 93 transitions. [2025-03-09 01:30:28,325 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 221 transitions, 4083 flow [2025-03-09 01:30:28,366 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 221 transitions, 3883 flow, removed 6 selfloop flow, removed 13 redundant places. [2025-03-09 01:30:28,368 INFO L231 Difference]: Finished difference. Result has 172 places, 164 transitions, 2725 flow [2025-03-09 01:30:28,368 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=3152, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=191, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2725, PETRI_PLACES=172, PETRI_TRANSITIONS=164} [2025-03-09 01:30:28,369 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 146 predicate places. [2025-03-09 01:30:28,369 INFO L471 AbstractCegarLoop]: Abstraction has has 172 places, 164 transitions, 2725 flow [2025-03-09 01:30:28,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 0 states have call successors, (0), 0 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-09 01:30:28,369 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:30:28,369 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:30:28,375 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-09 01:30:28,569 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,SelfDestructingSolverStorable32 [2025-03-09 01:30:28,570 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-09 01:30:28,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:30:28,570 INFO L85 PathProgramCache]: Analyzing trace with hash 1451938962, now seen corresponding path program 6 times [2025-03-09 01:30:28,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:30:28,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667002544] [2025-03-09 01:30:28,570 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-09 01:30:28,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:30:28,572 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 19 statements into 2 equivalence classes. [2025-03-09 01:30:28,575 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-03-09 01:30:28,575 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-03-09 01:30:28,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:28,657 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-09 01:30:28,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:30:28,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667002544] [2025-03-09 01:30:28,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667002544] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:30:28,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [540712725] [2025-03-09 01:30:28,658 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-09 01:30:28,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:30:28,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:30:28,660 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-09 01:30:28,662 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-09 01:30:28,682 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 19 statements into 2 equivalence classes. [2025-03-09 01:30:28,690 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-03-09 01:30:28,691 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-03-09 01:30:28,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:28,691 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-09 01:30:28,692 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:30:28,781 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-09 01:30:28,781 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:30:28,943 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-09 01:30:28,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [540712725] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:30:28,943 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:30:28,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 22 [2025-03-09 01:30:28,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563336240] [2025-03-09 01:30:28,944 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:30:28,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-09 01:30:28,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:30:28,944 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-09 01:30:28,944 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=416, Unknown=0, NotChecked=0, Total=506 [2025-03-09 01:30:28,954 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 24 [2025-03-09 01:30:28,954 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 164 transitions, 2725 flow. Second operand has 23 states, 23 states have (on average 5.565217391304348) internal successors, (128), 23 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-09 01:30:28,954 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:30:28,954 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 24 [2025-03-09 01:30:28,954 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:30:29,290 INFO L124 PetriNetUnfolderBase]: 737/1456 cut-off events. [2025-03-09 01:30:29,290 INFO L125 PetriNetUnfolderBase]: For 16241/16241 co-relation queries the response was YES. [2025-03-09 01:30:29,295 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8000 conditions, 1456 events. 737/1456 cut-off events. For 16241/16241 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 8414 event pairs, 111 based on Foata normal form. 2/1458 useless extension candidates. Maximal degree in co-relation 7864. Up to 647 conditions per place. [2025-03-09 01:30:29,298 INFO L140 encePairwiseOnDemand]: 14/24 looper letters, 105 selfloop transitions, 93 changer transitions 20/219 dead transitions. [2025-03-09 01:30:29,298 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 219 transitions, 3667 flow [2025-03-09 01:30:29,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-09 01:30:29,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-09 01:30:29,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 138 transitions. [2025-03-09 01:30:29,299 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4107142857142857 [2025-03-09 01:30:29,299 INFO L175 Difference]: Start difference. First operand has 172 places, 164 transitions, 2725 flow. Second operand 14 states and 138 transitions. [2025-03-09 01:30:29,299 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 219 transitions, 3667 flow [2025-03-09 01:30:29,335 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 219 transitions, 3300 flow, removed 27 selfloop flow, removed 18 redundant places. [2025-03-09 01:30:29,338 INFO L231 Difference]: Finished difference. Result has 158 places, 159 transitions, 2536 flow [2025-03-09 01:30:29,338 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=2400, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=164, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=89, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=2536, PETRI_PLACES=158, PETRI_TRANSITIONS=159} [2025-03-09 01:30:29,338 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 132 predicate places. [2025-03-09 01:30:29,338 INFO L471 AbstractCegarLoop]: Abstraction has has 158 places, 159 transitions, 2536 flow [2025-03-09 01:30:29,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 5.565217391304348) internal successors, (128), 23 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-09 01:30:29,338 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:30:29,338 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:30:29,345 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-03-09 01:30:29,539 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,SelfDestructingSolverStorable33 [2025-03-09 01:30:29,539 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-09 01:30:29,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:30:29,539 INFO L85 PathProgramCache]: Analyzing trace with hash 1612998694, now seen corresponding path program 7 times [2025-03-09 01:30:29,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:30:29,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399074490] [2025-03-09 01:30:29,540 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-09 01:30:29,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:30:29,542 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-09 01:30:29,543 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-09 01:30:29,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:30:29,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:29,606 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-09 01:30:29,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:30:29,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399074490] [2025-03-09 01:30:29,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399074490] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:30:29,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1900919107] [2025-03-09 01:30:29,607 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-09 01:30:29,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:30:29,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:30:29,608 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-09 01:30:29,609 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-09 01:30:29,630 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-09 01:30:29,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-09 01:30:29,637 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:30:29,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:29,637 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-09 01:30:29,638 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:30:29,702 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-09 01:30:29,702 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:30:29,837 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-09 01:30:29,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1900919107] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:30:29,837 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:30:29,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 20 [2025-03-09 01:30:29,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425279458] [2025-03-09 01:30:29,838 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:30:29,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-09 01:30:29,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:30:29,838 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-09 01:30:29,838 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2025-03-09 01:30:29,841 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 24 [2025-03-09 01:30:29,841 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 159 transitions, 2536 flow. Second operand has 21 states, 21 states have (on average 5.476190476190476) internal successors, (115), 21 states have internal predecessors, (115), 0 states have call successors, (0), 0 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-09 01:30:29,841 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:30:29,841 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 24 [2025-03-09 01:30:29,841 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:30:30,340 INFO L124 PetriNetUnfolderBase]: 1140/2257 cut-off events. [2025-03-09 01:30:30,340 INFO L125 PetriNetUnfolderBase]: For 22153/22153 co-relation queries the response was YES. [2025-03-09 01:30:30,346 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12556 conditions, 2257 events. 1140/2257 cut-off events. For 22153/22153 co-relation queries the response was YES. Maximal size of possible extension queue 181. Compared 14744 event pairs, 67 based on Foata normal form. 27/2284 useless extension candidates. Maximal degree in co-relation 12373. Up to 592 conditions per place. [2025-03-09 01:30:30,351 INFO L140 encePairwiseOnDemand]: 14/24 looper letters, 104 selfloop transitions, 207 changer transitions 35/347 dead transitions. [2025-03-09 01:30:30,351 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 347 transitions, 6008 flow [2025-03-09 01:30:30,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-09 01:30:30,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-03-09 01:30:30,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 215 transitions. [2025-03-09 01:30:30,352 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4071969696969697 [2025-03-09 01:30:30,352 INFO L175 Difference]: Start difference. First operand has 158 places, 159 transitions, 2536 flow. Second operand 22 states and 215 transitions. [2025-03-09 01:30:30,352 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 347 transitions, 6008 flow [2025-03-09 01:30:30,398 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 347 transitions, 5757 flow, removed 19 selfloop flow, removed 9 redundant places. [2025-03-09 01:30:30,402 INFO L231 Difference]: Finished difference. Result has 177 places, 260 transitions, 4792 flow [2025-03-09 01:30:30,402 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=2406, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=111, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=4792, PETRI_PLACES=177, PETRI_TRANSITIONS=260} [2025-03-09 01:30:30,402 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 151 predicate places. [2025-03-09 01:30:30,402 INFO L471 AbstractCegarLoop]: Abstraction has has 177 places, 260 transitions, 4792 flow [2025-03-09 01:30:30,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 5.476190476190476) internal successors, (115), 21 states have internal predecessors, (115), 0 states have call successors, (0), 0 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-09 01:30:30,402 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:30:30,402 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:30:30,408 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-03-09 01:30:30,603 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,SelfDestructingSolverStorable34 [2025-03-09 01:30:30,603 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-09 01:30:30,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:30:30,603 INFO L85 PathProgramCache]: Analyzing trace with hash 653159854, now seen corresponding path program 8 times [2025-03-09 01:30:30,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:30:30,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018839017] [2025-03-09 01:30:30,603 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:30:30,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:30:30,605 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-03-09 01:30:30,607 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-03-09 01:30:30,607 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:30:30,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:30,686 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-09 01:30:30,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:30:30,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018839017] [2025-03-09 01:30:30,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018839017] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:30:30,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [136839219] [2025-03-09 01:30:30,686 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:30:30,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:30:30,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:30:30,690 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-09 01:30:30,691 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-09 01:30:30,715 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-03-09 01:30:30,727 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-03-09 01:30:30,727 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:30:30,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:30,727 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-09 01:30:30,728 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:30:30,807 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-09 01:30:30,807 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:30:30,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-09 01:30:30,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [136839219] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:30:30,946 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:30:30,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 21 [2025-03-09 01:30:30,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069419491] [2025-03-09 01:30:30,947 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:30:30,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-09 01:30:30,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:30:30,947 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-09 01:30:30,947 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=362, Unknown=0, NotChecked=0, Total=462 [2025-03-09 01:30:30,958 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 24 [2025-03-09 01:30:30,958 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 260 transitions, 4792 flow. Second operand has 22 states, 22 states have (on average 5.5) internal successors, (121), 22 states have internal predecessors, (121), 0 states have call successors, (0), 0 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-09 01:30:30,958 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:30:30,958 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 24 [2025-03-09 01:30:30,958 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:30:31,397 INFO L124 PetriNetUnfolderBase]: 1166/2284 cut-off events. [2025-03-09 01:30:31,397 INFO L125 PetriNetUnfolderBase]: For 29192/29192 co-relation queries the response was YES. [2025-03-09 01:30:31,403 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14600 conditions, 2284 events. 1166/2284 cut-off events. For 29192/29192 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 14696 event pairs, 215 based on Foata normal form. 2/2286 useless extension candidates. Maximal degree in co-relation 14409. Up to 1374 conditions per place. [2025-03-09 01:30:31,407 INFO L140 encePairwiseOnDemand]: 14/24 looper letters, 156 selfloop transitions, 153 changer transitions 23/333 dead transitions. [2025-03-09 01:30:31,407 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 333 transitions, 6690 flow [2025-03-09 01:30:31,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-09 01:30:31,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-09 01:30:31,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 118 transitions. [2025-03-09 01:30:31,407 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3782051282051282 [2025-03-09 01:30:31,407 INFO L175 Difference]: Start difference. First operand has 177 places, 260 transitions, 4792 flow. Second operand 13 states and 118 transitions. [2025-03-09 01:30:31,407 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 333 transitions, 6690 flow [2025-03-09 01:30:31,485 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 333 transitions, 6253 flow, removed 147 selfloop flow, removed 8 redundant places. [2025-03-09 01:30:31,489 INFO L231 Difference]: Finished difference. Result has 184 places, 278 transitions, 5193 flow [2025-03-09 01:30:31,489 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=4436, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=260, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=135, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=5193, PETRI_PLACES=184, PETRI_TRANSITIONS=278} [2025-03-09 01:30:31,490 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 158 predicate places. [2025-03-09 01:30:31,490 INFO L471 AbstractCegarLoop]: Abstraction has has 184 places, 278 transitions, 5193 flow [2025-03-09 01:30:31,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 5.5) internal successors, (121), 22 states have internal predecessors, (121), 0 states have call successors, (0), 0 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-09 01:30:31,490 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:30:31,490 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:30:31,496 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-03-09 01:30:31,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:30:31,691 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-09 01:30:31,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:30:31,691 INFO L85 PathProgramCache]: Analyzing trace with hash -791998076, now seen corresponding path program 9 times [2025-03-09 01:30:31,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:30:31,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900103769] [2025-03-09 01:30:31,691 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 01:30:31,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:30:31,694 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 19 statements into 2 equivalence classes. [2025-03-09 01:30:31,695 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-03-09 01:30:31,695 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-09 01:30:31,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:31,764 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-09 01:30:31,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:30:31,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900103769] [2025-03-09 01:30:31,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900103769] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:30:31,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2127248813] [2025-03-09 01:30:31,765 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 01:30:31,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:30:31,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:30:31,767 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-09 01:30:31,768 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-09 01:30:31,791 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 19 statements into 2 equivalence classes. [2025-03-09 01:30:31,798 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-03-09 01:30:31,799 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-09 01:30:31,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:31,799 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-09 01:30:31,800 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:30:31,864 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-09 01:30:31,864 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:30:31,984 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-09 01:30:31,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2127248813] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:30:31,984 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:30:31,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 21 [2025-03-09 01:30:31,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823237803] [2025-03-09 01:30:31,984 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:30:31,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-09 01:30:31,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:30:31,985 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-09 01:30:31,985 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=379, Unknown=0, NotChecked=0, Total=462 [2025-03-09 01:30:31,994 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 24 [2025-03-09 01:30:31,994 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 278 transitions, 5193 flow. Second operand has 22 states, 22 states have (on average 5.5) internal successors, (121), 22 states have internal predecessors, (121), 0 states have call successors, (0), 0 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-09 01:30:31,994 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:30:31,994 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 24 [2025-03-09 01:30:31,994 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:30:32,486 INFO L124 PetriNetUnfolderBase]: 1323/2578 cut-off events. [2025-03-09 01:30:32,486 INFO L125 PetriNetUnfolderBase]: For 33330/33330 co-relation queries the response was YES. [2025-03-09 01:30:32,495 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16313 conditions, 2578 events. 1323/2578 cut-off events. For 33330/33330 co-relation queries the response was YES. Maximal size of possible extension queue 207. Compared 16991 event pairs, 232 based on Foata normal form. 7/2585 useless extension candidates. Maximal degree in co-relation 16121. Up to 1348 conditions per place. [2025-03-09 01:30:32,500 INFO L140 encePairwiseOnDemand]: 14/24 looper letters, 131 selfloop transitions, 130 changer transitions 95/357 dead transitions. [2025-03-09 01:30:32,500 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 357 transitions, 7091 flow [2025-03-09 01:30:32,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-09 01:30:32,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-09 01:30:32,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 124 transitions. [2025-03-09 01:30:32,501 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.36904761904761907 [2025-03-09 01:30:32,501 INFO L175 Difference]: Start difference. First operand has 184 places, 278 transitions, 5193 flow. Second operand 14 states and 124 transitions. [2025-03-09 01:30:32,501 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 357 transitions, 7091 flow [2025-03-09 01:30:32,587 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 357 transitions, 6928 flow, removed 5 selfloop flow, removed 7 redundant places. [2025-03-09 01:30:32,591 INFO L231 Difference]: Finished difference. Result has 189 places, 250 transitions, 4749 flow [2025-03-09 01:30:32,591 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=5052, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=278, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=130, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=4749, PETRI_PLACES=189, PETRI_TRANSITIONS=250} [2025-03-09 01:30:32,591 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 163 predicate places. [2025-03-09 01:30:32,591 INFO L471 AbstractCegarLoop]: Abstraction has has 189 places, 250 transitions, 4749 flow [2025-03-09 01:30:32,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 5.5) internal successors, (121), 22 states have internal predecessors, (121), 0 states have call successors, (0), 0 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-09 01:30:32,591 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:30:32,591 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:30:32,597 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-09 01:30:32,792 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,SelfDestructingSolverStorable36 [2025-03-09 01:30:32,792 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-09 01:30:32,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:30:32,792 INFO L85 PathProgramCache]: Analyzing trace with hash 958864060, now seen corresponding path program 10 times [2025-03-09 01:30:32,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:30:32,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377991264] [2025-03-09 01:30:32,792 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 01:30:32,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:30:32,794 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 19 statements into 2 equivalence classes. [2025-03-09 01:30:32,796 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-03-09 01:30:32,796 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 01:30:32,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:32,870 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-09 01:30:32,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:30:32,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377991264] [2025-03-09 01:30:32,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377991264] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:30:32,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [583092095] [2025-03-09 01:30:32,871 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 01:30:32,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:30:32,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:30:32,874 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-09 01:30:32,876 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-09 01:30:32,900 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 19 statements into 2 equivalence classes. [2025-03-09 01:30:32,908 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-03-09 01:30:32,908 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 01:30:32,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:32,909 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-09 01:30:32,909 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:30:33,017 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-09 01:30:33,017 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:30:33,178 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-09 01:30:33,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [583092095] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:30:33,178 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:30:33,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 22 [2025-03-09 01:30:33,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179264271] [2025-03-09 01:30:33,178 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:30:33,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-09 01:30:33,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:30:33,179 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-09 01:30:33,179 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=415, Unknown=0, NotChecked=0, Total=506 [2025-03-09 01:30:33,187 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 24 [2025-03-09 01:30:33,187 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 250 transitions, 4749 flow. Second operand has 23 states, 23 states have (on average 5.434782608695652) internal successors, (125), 23 states have internal predecessors, (125), 0 states have call successors, (0), 0 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-09 01:30:33,187 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:30:33,187 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 24 [2025-03-09 01:30:33,187 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:30:34,147 INFO L124 PetriNetUnfolderBase]: 1563/3201 cut-off events. [2025-03-09 01:30:34,147 INFO L125 PetriNetUnfolderBase]: For 40522/40522 co-relation queries the response was YES. [2025-03-09 01:30:34,155 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19086 conditions, 3201 events. 1563/3201 cut-off events. For 40522/40522 co-relation queries the response was YES. Maximal size of possible extension queue 272. Compared 23223 event pairs, 79 based on Foata normal form. 30/3231 useless extension candidates. Maximal degree in co-relation 18823. Up to 659 conditions per place. [2025-03-09 01:30:34,161 INFO L140 encePairwiseOnDemand]: 14/24 looper letters, 144 selfloop transitions, 262 changer transitions 43/450 dead transitions. [2025-03-09 01:30:34,161 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 450 transitions, 8737 flow [2025-03-09 01:30:34,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-03-09 01:30:34,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2025-03-09 01:30:34,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 332 transitions. [2025-03-09 01:30:34,162 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.38425925925925924 [2025-03-09 01:30:34,162 INFO L175 Difference]: Start difference. First operand has 189 places, 250 transitions, 4749 flow. Second operand 36 states and 332 transitions. [2025-03-09 01:30:34,162 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 214 places, 450 transitions, 8737 flow [2025-03-09 01:30:34,268 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 450 transitions, 8100 flow, removed 23 selfloop flow, removed 15 redundant places. [2025-03-09 01:30:34,273 INFO L231 Difference]: Finished difference. Result has 208 places, 325 transitions, 6604 flow [2025-03-09 01:30:34,273 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=4131, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=239, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=159, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=36, PETRI_FLOW=6604, PETRI_PLACES=208, PETRI_TRANSITIONS=325} [2025-03-09 01:30:34,274 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 182 predicate places. [2025-03-09 01:30:34,274 INFO L471 AbstractCegarLoop]: Abstraction has has 208 places, 325 transitions, 6604 flow [2025-03-09 01:30:34,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 5.434782608695652) internal successors, (125), 23 states have internal predecessors, (125), 0 states have call successors, (0), 0 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-09 01:30:34,274 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:30:34,274 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:30:34,280 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-03-09 01:30:34,474 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,SelfDestructingSolverStorable37 [2025-03-09 01:30:34,475 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-09 01:30:34,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:30:34,475 INFO L85 PathProgramCache]: Analyzing trace with hash 2043642146, now seen corresponding path program 11 times [2025-03-09 01:30:34,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:30:34,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84100881] [2025-03-09 01:30:34,475 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-09 01:30:34,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:30:34,477 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-03-09 01:30:34,478 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-03-09 01:30:34,478 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:30:34,478 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:34,532 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:30:34,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:30:34,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84100881] [2025-03-09 01:30:34,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84100881] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:30:34,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1805005379] [2025-03-09 01:30:34,533 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-09 01:30:34,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:30:34,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:30:34,535 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-09 01:30:34,537 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-09 01:30:34,557 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-03-09 01:30:34,565 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-03-09 01:30:34,565 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:30:34,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:34,566 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-09 01:30:34,566 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:30:34,623 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:30:34,624 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 01:30:34,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1805005379] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:30:34,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 01:30:34,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 12 [2025-03-09 01:30:34,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092899197] [2025-03-09 01:30:34,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:30:34,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-09 01:30:34,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:30:34,625 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-09 01:30:34,625 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2025-03-09 01:30:34,633 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 24 [2025-03-09 01:30:34,634 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 325 transitions, 6604 flow. Second operand has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 0 states have call successors, (0), 0 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-09 01:30:34,634 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:30:34,634 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 24 [2025-03-09 01:30:34,634 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:30:35,058 INFO L124 PetriNetUnfolderBase]: 1477/2989 cut-off events. [2025-03-09 01:30:35,058 INFO L125 PetriNetUnfolderBase]: For 38396/38396 co-relation queries the response was YES. [2025-03-09 01:30:35,069 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19033 conditions, 2989 events. 1477/2989 cut-off events. For 38396/38396 co-relation queries the response was YES. Maximal size of possible extension queue 251. Compared 20957 event pairs, 371 based on Foata normal form. 4/2993 useless extension candidates. Maximal degree in co-relation 18774. Up to 2148 conditions per place. [2025-03-09 01:30:35,077 INFO L140 encePairwiseOnDemand]: 16/24 looper letters, 217 selfloop transitions, 127 changer transitions 25/370 dead transitions. [2025-03-09 01:30:35,077 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 370 transitions, 8103 flow [2025-03-09 01:30:35,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-09 01:30:35,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-09 01:30:35,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 90 transitions. [2025-03-09 01:30:35,078 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2025-03-09 01:30:35,078 INFO L175 Difference]: Start difference. First operand has 208 places, 325 transitions, 6604 flow. Second operand 9 states and 90 transitions. [2025-03-09 01:30:35,078 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 213 places, 370 transitions, 8103 flow [2025-03-09 01:30:35,233 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 201 places, 370 transitions, 7634 flow, removed 188 selfloop flow, removed 12 redundant places. [2025-03-09 01:30:35,238 INFO L231 Difference]: Finished difference. Result has 205 places, 330 transitions, 6718 flow [2025-03-09 01:30:35,239 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=6169, PETRI_DIFFERENCE_MINUEND_PLACES=193, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=325, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=109, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=206, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=6718, PETRI_PLACES=205, PETRI_TRANSITIONS=330} [2025-03-09 01:30:35,240 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 179 predicate places. [2025-03-09 01:30:35,240 INFO L471 AbstractCegarLoop]: Abstraction has has 205 places, 330 transitions, 6718 flow [2025-03-09 01:30:35,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 0 states have call successors, (0), 0 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-09 01:30:35,241 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:30:35,241 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:30:35,246 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-03-09 01:30:35,441 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,SelfDestructingSolverStorable38 [2025-03-09 01:30:35,441 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-09 01:30:35,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:30:35,442 INFO L85 PathProgramCache]: Analyzing trace with hash -484507826, now seen corresponding path program 12 times [2025-03-09 01:30:35,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:30:35,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908510261] [2025-03-09 01:30:35,442 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-09 01:30:35,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:30:35,444 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 19 statements into 2 equivalence classes. [2025-03-09 01:30:35,445 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-03-09 01:30:35,445 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-03-09 01:30:35,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:35,516 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-09 01:30:35,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:30:35,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908510261] [2025-03-09 01:30:35,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908510261] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:30:35,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1444713584] [2025-03-09 01:30:35,516 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-09 01:30:35,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:30:35,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:30:35,518 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-09 01:30:35,520 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-09 01:30:35,544 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 19 statements into 2 equivalence classes. [2025-03-09 01:30:35,551 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-03-09 01:30:35,551 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-03-09 01:30:35,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:35,552 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-09 01:30:35,552 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:30:35,595 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-09 01:30:35,596 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:30:35,811 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-09 01:30:35,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1444713584] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:30:35,812 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:30:35,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 18 [2025-03-09 01:30:35,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574313744] [2025-03-09 01:30:35,812 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:30:35,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-09 01:30:35,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:30:35,812 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-09 01:30:35,812 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2025-03-09 01:30:35,817 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 24 [2025-03-09 01:30:35,818 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 330 transitions, 6718 flow. Second operand has 19 states, 19 states have (on average 5.631578947368421) internal successors, (107), 19 states have internal predecessors, (107), 0 states have call successors, (0), 0 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-09 01:30:35,818 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:30:35,818 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 24 [2025-03-09 01:30:35,818 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:30:36,674 INFO L124 PetriNetUnfolderBase]: 1502/3048 cut-off events. [2025-03-09 01:30:36,675 INFO L125 PetriNetUnfolderBase]: For 38893/38893 co-relation queries the response was YES. [2025-03-09 01:30:36,686 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19411 conditions, 3048 events. 1502/3048 cut-off events. For 38893/38893 co-relation queries the response was YES. Maximal size of possible extension queue 255. Compared 21522 event pairs, 69 based on Foata normal form. 46/3094 useless extension candidates. Maximal degree in co-relation 19346. Up to 933 conditions per place. [2025-03-09 01:30:36,693 INFO L140 encePairwiseOnDemand]: 14/24 looper letters, 99 selfloop transitions, 252 changer transitions 50/402 dead transitions. [2025-03-09 01:30:36,693 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 402 transitions, 8390 flow [2025-03-09 01:30:36,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-09 01:30:36,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2025-03-09 01:30:36,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 202 transitions. [2025-03-09 01:30:36,693 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3506944444444444 [2025-03-09 01:30:36,693 INFO L175 Difference]: Start difference. First operand has 205 places, 330 transitions, 6718 flow. Second operand 24 states and 202 transitions. [2025-03-09 01:30:36,694 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 223 places, 402 transitions, 8390 flow [2025-03-09 01:30:36,870 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 211 places, 402 transitions, 7978 flow, removed 9 selfloop flow, removed 12 redundant places. [2025-03-09 01:30:36,875 INFO L231 Difference]: Finished difference. Result has 222 places, 319 transitions, 6947 flow [2025-03-09 01:30:36,875 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=6015, PETRI_DIFFERENCE_MINUEND_PLACES=188, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=312, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=226, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=6947, PETRI_PLACES=222, PETRI_TRANSITIONS=319} [2025-03-09 01:30:36,876 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 196 predicate places. [2025-03-09 01:30:36,876 INFO L471 AbstractCegarLoop]: Abstraction has has 222 places, 319 transitions, 6947 flow [2025-03-09 01:30:36,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 5.631578947368421) internal successors, (107), 19 states have internal predecessors, (107), 0 states have call successors, (0), 0 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-09 01:30:36,876 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:30:36,876 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:30:36,881 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2025-03-09 01:30:37,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2025-03-09 01:30:37,076 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-09 01:30:37,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:30:37,077 INFO L85 PathProgramCache]: Analyzing trace with hash -1029015228, now seen corresponding path program 13 times [2025-03-09 01:30:37,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:30:37,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230714844] [2025-03-09 01:30:37,077 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-09 01:30:37,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:30:37,079 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-09 01:30:37,080 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-09 01:30:37,080 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:30:37,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:37,158 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-09 01:30:37,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:30:37,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230714844] [2025-03-09 01:30:37,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230714844] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:30:37,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2031167026] [2025-03-09 01:30:37,158 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-09 01:30:37,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:30:37,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:30:37,161 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-09 01:30:37,162 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-09 01:30:37,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-09 01:30:37,191 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-09 01:30:37,191 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:30:37,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:37,192 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-09 01:30:37,193 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:30:37,245 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:30:37,246 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:30:37,391 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-09 01:30:37,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2031167026] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:30:37,391 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:30:37,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2025-03-09 01:30:37,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894297114] [2025-03-09 01:30:37,391 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:30:37,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-09 01:30:37,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:30:37,392 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-09 01:30:37,392 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=300, Unknown=0, NotChecked=0, Total=380 [2025-03-09 01:30:37,397 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 24 [2025-03-09 01:30:37,397 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 319 transitions, 6947 flow. Second operand has 20 states, 20 states have (on average 5.5) internal successors, (110), 20 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-09 01:30:37,397 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:30:37,397 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 24 [2025-03-09 01:30:37,397 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:30:38,081 INFO L124 PetriNetUnfolderBase]: 1378/2845 cut-off events. [2025-03-09 01:30:38,081 INFO L125 PetriNetUnfolderBase]: For 39329/39329 co-relation queries the response was YES. [2025-03-09 01:30:38,090 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18733 conditions, 2845 events. 1378/2845 cut-off events. For 39329/39329 co-relation queries the response was YES. Maximal size of possible extension queue 231. Compared 20086 event pairs, 59 based on Foata normal form. 9/2854 useless extension candidates. Maximal degree in co-relation 18662. Up to 1005 conditions per place. [2025-03-09 01:30:38,095 INFO L140 encePairwiseOnDemand]: 14/24 looper letters, 86 selfloop transitions, 232 changer transitions 61/380 dead transitions. [2025-03-09 01:30:38,095 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 236 places, 380 transitions, 8413 flow [2025-03-09 01:30:38,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-09 01:30:38,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-03-09 01:30:38,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 184 transitions. [2025-03-09 01:30:38,096 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3484848484848485 [2025-03-09 01:30:38,096 INFO L175 Difference]: Start difference. First operand has 222 places, 319 transitions, 6947 flow. Second operand 22 states and 184 transitions. [2025-03-09 01:30:38,096 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 236 places, 380 transitions, 8413 flow [2025-03-09 01:30:38,219 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 224 places, 380 transitions, 7938 flow, removed 108 selfloop flow, removed 12 redundant places. [2025-03-09 01:30:38,223 INFO L231 Difference]: Finished difference. Result has 227 places, 295 transitions, 6485 flow [2025-03-09 01:30:38,224 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=6496, PETRI_DIFFERENCE_MINUEND_PLACES=203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=319, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=224, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=6485, PETRI_PLACES=227, PETRI_TRANSITIONS=295} [2025-03-09 01:30:38,224 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 201 predicate places. [2025-03-09 01:30:38,224 INFO L471 AbstractCegarLoop]: Abstraction has has 227 places, 295 transitions, 6485 flow [2025-03-09 01:30:38,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 5.5) internal successors, (110), 20 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-09 01:30:38,224 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:30:38,224 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:30:38,230 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2025-03-09 01:30:38,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:30:38,425 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-09 01:30:38,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:30:38,426 INFO L85 PathProgramCache]: Analyzing trace with hash 1434954974, now seen corresponding path program 14 times [2025-03-09 01:30:38,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:30:38,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395759219] [2025-03-09 01:30:38,426 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:30:38,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:30:38,428 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-03-09 01:30:38,429 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-03-09 01:30:38,429 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:30:38,429 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:38,518 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-09 01:30:38,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:30:38,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395759219] [2025-03-09 01:30:38,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395759219] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:30:38,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1632549452] [2025-03-09 01:30:38,519 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:30:38,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:30:38,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:30:38,526 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-09 01:30:38,526 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-09 01:30:38,556 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-03-09 01:30:38,568 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-03-09 01:30:38,569 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:30:38,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:38,570 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-09 01:30:38,571 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:30:38,657 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-09 01:30:38,657 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:30:38,781 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-09 01:30:38,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1632549452] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:30:38,781 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:30:38,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 22 [2025-03-09 01:30:38,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051809524] [2025-03-09 01:30:38,781 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:30:38,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-09 01:30:38,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:30:38,782 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-09 01:30:38,782 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=406, Unknown=0, NotChecked=0, Total=506 [2025-03-09 01:30:38,794 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 24 [2025-03-09 01:30:38,794 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 227 places, 295 transitions, 6485 flow. Second operand has 23 states, 23 states have (on average 5.478260869565218) internal successors, (126), 23 states have internal predecessors, (126), 0 states have call successors, (0), 0 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-09 01:30:38,794 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:30:38,794 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 24 [2025-03-09 01:30:38,794 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:30:39,340 INFO L124 PetriNetUnfolderBase]: 1693/3553 cut-off events. [2025-03-09 01:30:39,340 INFO L125 PetriNetUnfolderBase]: For 50947/50947 co-relation queries the response was YES. [2025-03-09 01:30:39,353 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22506 conditions, 3553 events. 1693/3553 cut-off events. For 50947/50947 co-relation queries the response was YES. Maximal size of possible extension queue 298. Compared 26681 event pairs, 325 based on Foata normal form. 4/3557 useless extension candidates. Maximal degree in co-relation 22437. Up to 1133 conditions per place. [2025-03-09 01:30:39,360 INFO L140 encePairwiseOnDemand]: 14/24 looper letters, 225 selfloop transitions, 178 changer transitions 13/417 dead transitions. [2025-03-09 01:30:39,360 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 230 places, 417 transitions, 9567 flow [2025-03-09 01:30:39,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-09 01:30:39,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-09 01:30:39,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 141 transitions. [2025-03-09 01:30:39,361 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.39166666666666666 [2025-03-09 01:30:39,361 INFO L175 Difference]: Start difference. First operand has 227 places, 295 transitions, 6485 flow. Second operand 15 states and 141 transitions. [2025-03-09 01:30:39,361 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 230 places, 417 transitions, 9567 flow [2025-03-09 01:30:39,516 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 417 transitions, 8751 flow, removed 50 selfloop flow, removed 23 redundant places. [2025-03-09 01:30:39,521 INFO L231 Difference]: Finished difference. Result has 213 places, 341 transitions, 7504 flow [2025-03-09 01:30:39,521 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=5837, PETRI_DIFFERENCE_MINUEND_PLACES=193, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=295, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=132, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=7504, PETRI_PLACES=213, PETRI_TRANSITIONS=341} [2025-03-09 01:30:39,522 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 187 predicate places. [2025-03-09 01:30:39,522 INFO L471 AbstractCegarLoop]: Abstraction has has 213 places, 341 transitions, 7504 flow [2025-03-09 01:30:39,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 5.478260869565218) internal successors, (126), 23 states have internal predecessors, (126), 0 states have call successors, (0), 0 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-09 01:30:39,522 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:30:39,522 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:30:39,527 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2025-03-09 01:30:39,722 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,SelfDestructingSolverStorable41 [2025-03-09 01:30:39,722 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-09 01:30:39,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:30:39,723 INFO L85 PathProgramCache]: Analyzing trace with hash -1327861052, now seen corresponding path program 15 times [2025-03-09 01:30:39,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:30:39,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065453003] [2025-03-09 01:30:39,723 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 01:30:39,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:30:39,725 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 19 statements into 2 equivalence classes. [2025-03-09 01:30:39,726 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-03-09 01:30:39,726 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-09 01:30:39,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:39,785 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-09 01:30:39,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:30:39,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065453003] [2025-03-09 01:30:39,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065453003] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:30:39,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [171044385] [2025-03-09 01:30:39,785 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 01:30:39,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:30:39,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:30:39,787 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-09 01:30:39,788 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-09 01:30:39,807 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 19 statements into 2 equivalence classes. [2025-03-09 01:30:39,814 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-03-09 01:30:39,814 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-09 01:30:39,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:39,815 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-09 01:30:39,815 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:30:39,867 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-09 01:30:39,868 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:30:39,997 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-09 01:30:39,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [171044385] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:30:39,997 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:30:39,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 20 [2025-03-09 01:30:39,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780171109] [2025-03-09 01:30:39,997 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:30:39,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-09 01:30:39,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:30:39,998 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-09 01:30:39,998 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=329, Unknown=0, NotChecked=0, Total=420 [2025-03-09 01:30:40,004 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 24 [2025-03-09 01:30:40,004 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 213 places, 341 transitions, 7504 flow. Second operand has 21 states, 21 states have (on average 5.428571428571429) internal successors, (114), 21 states have internal predecessors, (114), 0 states have call successors, (0), 0 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-09 01:30:40,004 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:30:40,005 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 24 [2025-03-09 01:30:40,005 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:30:40,757 INFO L124 PetriNetUnfolderBase]: 2039/4278 cut-off events. [2025-03-09 01:30:40,757 INFO L125 PetriNetUnfolderBase]: For 59025/59025 co-relation queries the response was YES. [2025-03-09 01:30:40,773 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28582 conditions, 4278 events. 2039/4278 cut-off events. For 59025/59025 co-relation queries the response was YES. Maximal size of possible extension queue 355. Compared 33455 event pairs, 272 based on Foata normal form. 3/4281 useless extension candidates. Maximal degree in co-relation 28515. Up to 2404 conditions per place. [2025-03-09 01:30:40,826 INFO L140 encePairwiseOnDemand]: 13/24 looper letters, 204 selfloop transitions, 354 changer transitions 22/581 dead transitions. [2025-03-09 01:30:40,826 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 236 places, 581 transitions, 13732 flow [2025-03-09 01:30:40,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-09 01:30:40,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2025-03-09 01:30:40,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 236 transitions. [2025-03-09 01:30:40,827 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3933333333333333 [2025-03-09 01:30:40,827 INFO L175 Difference]: Start difference. First operand has 213 places, 341 transitions, 7504 flow. Second operand 25 states and 236 transitions. [2025-03-09 01:30:40,827 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 236 places, 581 transitions, 13732 flow [2025-03-09 01:30:41,056 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 227 places, 581 transitions, 13498 flow, removed 25 selfloop flow, removed 9 redundant places. [2025-03-09 01:30:41,064 INFO L231 Difference]: Finished difference. Result has 238 places, 510 transitions, 12779 flow [2025-03-09 01:30:41,064 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=7358, PETRI_DIFFERENCE_MINUEND_PLACES=203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=341, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=203, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=12779, PETRI_PLACES=238, PETRI_TRANSITIONS=510} [2025-03-09 01:30:41,064 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 212 predicate places. [2025-03-09 01:30:41,064 INFO L471 AbstractCegarLoop]: Abstraction has has 238 places, 510 transitions, 12779 flow [2025-03-09 01:30:41,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 5.428571428571429) internal successors, (114), 21 states have internal predecessors, (114), 0 states have call successors, (0), 0 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-09 01:30:41,065 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:30:41,065 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:30:41,070 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2025-03-09 01:30:41,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:30:41,265 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-09 01:30:41,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:30:41,266 INFO L85 PathProgramCache]: Analyzing trace with hash -1852776166, now seen corresponding path program 16 times [2025-03-09 01:30:41,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:30:41,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029508909] [2025-03-09 01:30:41,266 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 01:30:41,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:30:41,268 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 19 statements into 2 equivalence classes. [2025-03-09 01:30:41,273 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-03-09 01:30:41,273 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 01:30:41,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:41,340 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-09 01:30:41,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:30:41,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029508909] [2025-03-09 01:30:41,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029508909] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:30:41,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1728918321] [2025-03-09 01:30:41,341 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 01:30:41,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:30:41,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:30:41,342 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-09 01:30:41,343 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-09 01:30:41,365 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 19 statements into 2 equivalence classes. [2025-03-09 01:30:41,371 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-03-09 01:30:41,371 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 01:30:41,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:41,372 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-09 01:30:41,372 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:30:41,450 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-09 01:30:41,450 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:30:41,592 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-09 01:30:41,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1728918321] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:30:41,592 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:30:41,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 23 [2025-03-09 01:30:41,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38117484] [2025-03-09 01:30:41,592 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:30:41,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-09 01:30:41,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:30:41,593 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-09 01:30:41,593 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=465, Unknown=0, NotChecked=0, Total=552 [2025-03-09 01:30:41,596 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 24 [2025-03-09 01:30:41,596 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 238 places, 510 transitions, 12779 flow. Second operand has 24 states, 24 states have (on average 5.458333333333333) internal successors, (131), 24 states have internal predecessors, (131), 0 states have call successors, (0), 0 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-09 01:30:41,596 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:30:41,596 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 24 [2025-03-09 01:30:41,596 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:30:43,163 INFO L124 PetriNetUnfolderBase]: 2807/5856 cut-off events. [2025-03-09 01:30:43,164 INFO L125 PetriNetUnfolderBase]: For 84602/84602 co-relation queries the response was YES. [2025-03-09 01:30:43,182 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40044 conditions, 5856 events. 2807/5856 cut-off events. For 84602/84602 co-relation queries the response was YES. Maximal size of possible extension queue 508. Compared 48906 event pairs, 222 based on Foata normal form. 72/5928 useless extension candidates. Maximal degree in co-relation 39970. Up to 2276 conditions per place. [2025-03-09 01:30:43,191 INFO L140 encePairwiseOnDemand]: 13/24 looper letters, 200 selfloop transitions, 237 changer transitions 308/746 dead transitions. [2025-03-09 01:30:43,191 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 274 places, 746 transitions, 18666 flow [2025-03-09 01:30:43,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2025-03-09 01:30:43,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2025-03-09 01:30:43,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 339 transitions. [2025-03-09 01:30:43,192 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.36217948717948717 [2025-03-09 01:30:43,192 INFO L175 Difference]: Start difference. First operand has 238 places, 510 transitions, 12779 flow. Second operand 39 states and 339 transitions. [2025-03-09 01:30:43,192 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 274 places, 746 transitions, 18666 flow [2025-03-09 01:30:43,645 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 272 places, 746 transitions, 18239 flow, removed 208 selfloop flow, removed 2 redundant places. [2025-03-09 01:30:43,654 INFO L231 Difference]: Finished difference. Result has 288 places, 384 transitions, 9698 flow [2025-03-09 01:30:43,654 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=12414, PETRI_DIFFERENCE_MINUEND_PLACES=234, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=510, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=216, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=283, PETRI_DIFFERENCE_SUBTRAHEND_STATES=39, PETRI_FLOW=9698, PETRI_PLACES=288, PETRI_TRANSITIONS=384} [2025-03-09 01:30:43,654 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 262 predicate places. [2025-03-09 01:30:43,654 INFO L471 AbstractCegarLoop]: Abstraction has has 288 places, 384 transitions, 9698 flow [2025-03-09 01:30:43,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 5.458333333333333) internal successors, (131), 24 states have internal predecessors, (131), 0 states have call successors, (0), 0 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-09 01:30:43,655 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:30:43,655 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:30:43,660 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-09 01:30:43,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:30:43,855 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-09 01:30:43,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:30:43,856 INFO L85 PathProgramCache]: Analyzing trace with hash 778172442, now seen corresponding path program 17 times [2025-03-09 01:30:43,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:30:43,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445936001] [2025-03-09 01:30:43,856 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-09 01:30:43,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:30:43,858 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-03-09 01:30:43,859 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-03-09 01:30:43,859 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:30:43,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:43,900 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:30:43,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:30:43,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445936001] [2025-03-09 01:30:43,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445936001] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:30:43,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2090358623] [2025-03-09 01:30:43,901 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-09 01:30:43,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:30:43,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:30:43,903 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-09 01:30:43,904 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-09 01:30:43,923 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-03-09 01:30:43,931 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-03-09 01:30:43,931 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:30:43,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:43,932 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-09 01:30:43,932 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:30:43,965 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:30:43,965 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 01:30:43,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2090358623] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:30:43,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 01:30:43,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 10 [2025-03-09 01:30:43,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320729831] [2025-03-09 01:30:43,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:30:43,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-09 01:30:43,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:30:43,966 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-09 01:30:43,966 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2025-03-09 01:30:43,970 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 24 [2025-03-09 01:30:43,971 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 288 places, 384 transitions, 9698 flow. Second operand has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 0 states have call successors, (0), 0 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-09 01:30:43,971 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:30:43,971 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 24 [2025-03-09 01:30:43,971 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:30:44,515 INFO L124 PetriNetUnfolderBase]: 1703/3592 cut-off events. [2025-03-09 01:30:44,515 INFO L125 PetriNetUnfolderBase]: For 56545/56545 co-relation queries the response was YES. [2025-03-09 01:30:44,531 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25116 conditions, 3592 events. 1703/3592 cut-off events. For 56545/56545 co-relation queries the response was YES. Maximal size of possible extension queue 297. Compared 27338 event pairs, 108 based on Foata normal form. 31/3623 useless extension candidates. Maximal degree in co-relation 25026. Up to 1129 conditions per place. [2025-03-09 01:30:44,537 INFO L140 encePairwiseOnDemand]: 16/24 looper letters, 176 selfloop transitions, 151 changer transitions 86/414 dead transitions. [2025-03-09 01:30:44,537 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 274 places, 414 transitions, 11050 flow [2025-03-09 01:30:44,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-09 01:30:44,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-09 01:30:44,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 83 transitions. [2025-03-09 01:30:44,538 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.38425925925925924 [2025-03-09 01:30:44,538 INFO L175 Difference]: Start difference. First operand has 288 places, 384 transitions, 9698 flow. Second operand 9 states and 83 transitions. [2025-03-09 01:30:44,538 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 274 places, 414 transitions, 11050 flow [2025-03-09 01:30:44,770 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 236 places, 414 transitions, 10135 flow, removed 127 selfloop flow, removed 38 redundant places. [2025-03-09 01:30:44,775 INFO L231 Difference]: Finished difference. Result has 237 places, 318 transitions, 7757 flow [2025-03-09 01:30:44,776 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=8827, PETRI_DIFFERENCE_MINUEND_PLACES=228, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=384, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=151, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=233, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=7757, PETRI_PLACES=237, PETRI_TRANSITIONS=318} [2025-03-09 01:30:44,776 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 211 predicate places. [2025-03-09 01:30:44,776 INFO L471 AbstractCegarLoop]: Abstraction has has 237 places, 318 transitions, 7757 flow [2025-03-09 01:30:44,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 0 states have call successors, (0), 0 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-09 01:30:44,776 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:30:44,776 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:30:44,782 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2025-03-09 01:30:44,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:30:44,977 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-09 01:30:44,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:30:44,977 INFO L85 PathProgramCache]: Analyzing trace with hash 1889787818, now seen corresponding path program 18 times [2025-03-09 01:30:44,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:30:44,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069536200] [2025-03-09 01:30:44,977 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-09 01:30:44,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:30:44,979 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 19 statements into 2 equivalence classes. [2025-03-09 01:30:44,980 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-03-09 01:30:44,980 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-03-09 01:30:44,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:45,047 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-09 01:30:45,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:30:45,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069536200] [2025-03-09 01:30:45,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069536200] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:30:45,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1646959690] [2025-03-09 01:30:45,047 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-09 01:30:45,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:30:45,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:30:45,049 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-09 01:30:45,051 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-09 01:30:45,071 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 19 statements into 2 equivalence classes. [2025-03-09 01:30:45,077 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-03-09 01:30:45,077 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-03-09 01:30:45,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:45,078 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-09 01:30:45,078 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:30:45,146 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:30:45,146 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:30:45,270 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-09 01:30:45,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1646959690] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:30:45,270 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:30:45,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 22 [2025-03-09 01:30:45,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963885318] [2025-03-09 01:30:45,270 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:30:45,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-09 01:30:45,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:30:45,271 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-09 01:30:45,271 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=410, Unknown=0, NotChecked=0, Total=506 [2025-03-09 01:30:45,279 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 24 [2025-03-09 01:30:45,279 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 237 places, 318 transitions, 7757 flow. Second operand has 23 states, 23 states have (on average 5.434782608695652) internal successors, (125), 23 states have internal predecessors, (125), 0 states have call successors, (0), 0 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-09 01:30:45,279 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:30:45,279 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 24 [2025-03-09 01:30:45,279 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:30:45,693 INFO L124 PetriNetUnfolderBase]: 1062/2388 cut-off events. [2025-03-09 01:30:45,693 INFO L125 PetriNetUnfolderBase]: For 34276/34276 co-relation queries the response was YES. [2025-03-09 01:30:45,702 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16218 conditions, 2388 events. 1062/2388 cut-off events. For 34276/34276 co-relation queries the response was YES. Maximal size of possible extension queue 214. Compared 17735 event pairs, 258 based on Foata normal form. 4/2392 useless extension candidates. Maximal degree in co-relation 16143. Up to 1459 conditions per place. [2025-03-09 01:30:45,707 INFO L140 encePairwiseOnDemand]: 14/24 looper letters, 187 selfloop transitions, 139 changer transitions 25/352 dead transitions. [2025-03-09 01:30:45,707 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 234 places, 352 transitions, 8757 flow [2025-03-09 01:30:45,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-09 01:30:45,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-09 01:30:45,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 119 transitions. [2025-03-09 01:30:45,708 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3814102564102564 [2025-03-09 01:30:45,708 INFO L175 Difference]: Start difference. First operand has 237 places, 318 transitions, 7757 flow. Second operand 13 states and 119 transitions. [2025-03-09 01:30:45,708 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 234 places, 352 transitions, 8757 flow [2025-03-09 01:30:45,818 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 352 transitions, 8194 flow, removed 20 selfloop flow, removed 18 redundant places. [2025-03-09 01:30:45,823 INFO L231 Difference]: Finished difference. Result has 219 places, 304 transitions, 7219 flow [2025-03-09 01:30:45,824 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=7229, PETRI_DIFFERENCE_MINUEND_PLACES=204, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=318, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=137, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=179, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=7219, PETRI_PLACES=219, PETRI_TRANSITIONS=304} [2025-03-09 01:30:45,824 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 193 predicate places. [2025-03-09 01:30:45,825 INFO L471 AbstractCegarLoop]: Abstraction has has 219 places, 304 transitions, 7219 flow [2025-03-09 01:30:45,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 5.434782608695652) internal successors, (125), 23 states have internal predecessors, (125), 0 states have call successors, (0), 0 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-09 01:30:45,825 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:30:45,825 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:30:45,830 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2025-03-09 01:30:46,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:30:46,026 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-09 01:30:46,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:30:46,026 INFO L85 PathProgramCache]: Analyzing trace with hash -2080923524, now seen corresponding path program 19 times [2025-03-09 01:30:46,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:30:46,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518897430] [2025-03-09 01:30:46,026 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-09 01:30:46,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:30:46,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-09 01:30:46,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-09 01:30:46,029 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:30:46,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:46,093 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-09 01:30:46,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:30:46,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518897430] [2025-03-09 01:30:46,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518897430] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:30:46,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [766807524] [2025-03-09 01:30:46,093 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-09 01:30:46,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:30:46,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:30:46,095 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-09 01:30:46,096 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-09 01:30:46,114 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-09 01:30:46,121 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-09 01:30:46,121 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:30:46,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:46,121 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-09 01:30:46,123 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:30:46,191 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-09 01:30:46,191 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:30:46,302 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-09 01:30:46,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [766807524] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:30:46,302 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:30:46,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 22 [2025-03-09 01:30:46,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499235894] [2025-03-09 01:30:46,302 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:30:46,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-09 01:30:46,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:30:46,302 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-09 01:30:46,303 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=408, Unknown=0, NotChecked=0, Total=506 [2025-03-09 01:30:46,315 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 24 [2025-03-09 01:30:46,315 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 304 transitions, 7219 flow. Second operand has 23 states, 23 states have (on average 5.434782608695652) internal successors, (125), 23 states have internal predecessors, (125), 0 states have call successors, (0), 0 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-09 01:30:46,316 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:30:46,316 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 24 [2025-03-09 01:30:46,316 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:30:46,757 INFO L124 PetriNetUnfolderBase]: 1002/2237 cut-off events. [2025-03-09 01:30:46,757 INFO L125 PetriNetUnfolderBase]: For 28004/28004 co-relation queries the response was YES. [2025-03-09 01:30:46,765 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14688 conditions, 2237 events. 1002/2237 cut-off events. For 28004/28004 co-relation queries the response was YES. Maximal size of possible extension queue 198. Compared 16268 event pairs, 45 based on Foata normal form. 11/2248 useless extension candidates. Maximal degree in co-relation 14620. Up to 750 conditions per place. [2025-03-09 01:30:46,769 INFO L140 encePairwiseOnDemand]: 14/24 looper letters, 136 selfloop transitions, 165 changer transitions 36/338 dead transitions. [2025-03-09 01:30:46,769 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 232 places, 338 transitions, 8230 flow [2025-03-09 01:30:46,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-09 01:30:46,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-09 01:30:46,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 129 transitions. [2025-03-09 01:30:46,770 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.35833333333333334 [2025-03-09 01:30:46,770 INFO L175 Difference]: Start difference. First operand has 219 places, 304 transitions, 7219 flow. Second operand 15 states and 129 transitions. [2025-03-09 01:30:46,770 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 232 places, 338 transitions, 8230 flow [2025-03-09 01:30:46,862 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 220 places, 338 transitions, 7889 flow, removed 29 selfloop flow, removed 12 redundant places. [2025-03-09 01:30:46,867 INFO L231 Difference]: Finished difference. Result has 223 places, 280 transitions, 6701 flow [2025-03-09 01:30:46,867 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=6885, PETRI_DIFFERENCE_MINUEND_PLACES=206, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=304, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=162, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=6701, PETRI_PLACES=223, PETRI_TRANSITIONS=280} [2025-03-09 01:30:46,867 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 197 predicate places. [2025-03-09 01:30:46,868 INFO L471 AbstractCegarLoop]: Abstraction has has 223 places, 280 transitions, 6701 flow [2025-03-09 01:30:46,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 5.434782608695652) internal successors, (125), 23 states have internal predecessors, (125), 0 states have call successors, (0), 0 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-09 01:30:46,868 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:30:46,868 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:30:46,873 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2025-03-09 01:30:47,068 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,SelfDestructingSolverStorable46 [2025-03-09 01:30:47,068 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-09 01:30:47,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:30:47,069 INFO L85 PathProgramCache]: Analyzing trace with hash 1384512602, now seen corresponding path program 20 times [2025-03-09 01:30:47,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:30:47,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250292553] [2025-03-09 01:30:47,069 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:30:47,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:30:47,071 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-03-09 01:30:47,072 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-03-09 01:30:47,072 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:30:47,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:47,130 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-09 01:30:47,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:30:47,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250292553] [2025-03-09 01:30:47,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250292553] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:30:47,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1962756769] [2025-03-09 01:30:47,130 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:30:47,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:30:47,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:30:47,132 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-09 01:30:47,134 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-09 01:30:47,152 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-03-09 01:30:47,159 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-03-09 01:30:47,159 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:30:47,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:47,159 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-09 01:30:47,159 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:30:47,230 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-09 01:30:47,230 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:30:47,342 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-09 01:30:47,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1962756769] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:30:47,342 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:30:47,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 22 [2025-03-09 01:30:47,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238220654] [2025-03-09 01:30:47,343 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:30:47,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-09 01:30:47,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:30:47,343 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-09 01:30:47,343 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=409, Unknown=0, NotChecked=0, Total=506 [2025-03-09 01:30:47,350 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 24 [2025-03-09 01:30:47,351 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 223 places, 280 transitions, 6701 flow. Second operand has 23 states, 23 states have (on average 5.478260869565218) internal successors, (126), 23 states have internal predecessors, (126), 0 states have call successors, (0), 0 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-09 01:30:47,351 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:30:47,351 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 24 [2025-03-09 01:30:47,351 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:30:47,762 INFO L124 PetriNetUnfolderBase]: 837/1784 cut-off events. [2025-03-09 01:30:47,762 INFO L125 PetriNetUnfolderBase]: For 25904/25904 co-relation queries the response was YES. [2025-03-09 01:30:47,769 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12861 conditions, 1784 events. 837/1784 cut-off events. For 25904/25904 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 11794 event pairs, 23 based on Foata normal form. 7/1791 useless extension candidates. Maximal degree in co-relation 12793. Up to 578 conditions per place. [2025-03-09 01:30:47,772 INFO L140 encePairwiseOnDemand]: 14/24 looper letters, 128 selfloop transitions, 107 changer transitions 76/312 dead transitions. [2025-03-09 01:30:47,772 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 236 places, 312 transitions, 7573 flow [2025-03-09 01:30:47,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-09 01:30:47,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-09 01:30:47,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 127 transitions. [2025-03-09 01:30:47,773 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3527777777777778 [2025-03-09 01:30:47,773 INFO L175 Difference]: Start difference. First operand has 223 places, 280 transitions, 6701 flow. Second operand 15 states and 127 transitions. [2025-03-09 01:30:47,773 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 236 places, 312 transitions, 7573 flow [2025-03-09 01:30:47,870 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 222 places, 312 transitions, 7059 flow, removed 15 selfloop flow, removed 14 redundant places. [2025-03-09 01:30:47,875 INFO L231 Difference]: Finished difference. Result has 224 places, 218 transitions, 4925 flow [2025-03-09 01:30:47,875 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=6187, PETRI_DIFFERENCE_MINUEND_PLACES=208, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=280, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=107, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=173, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=4925, PETRI_PLACES=224, PETRI_TRANSITIONS=218} [2025-03-09 01:30:47,876 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 198 predicate places. [2025-03-09 01:30:47,876 INFO L471 AbstractCegarLoop]: Abstraction has has 224 places, 218 transitions, 4925 flow [2025-03-09 01:30:47,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 5.478260869565218) internal successors, (126), 23 states have internal predecessors, (126), 0 states have call successors, (0), 0 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-09 01:30:47,876 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:30:47,876 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:30:47,882 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-09 01:30:48,076 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,SelfDestructingSolverStorable47 [2025-03-09 01:30:48,077 INFO L396 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-09 01:30:48,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:30:48,077 INFO L85 PathProgramCache]: Analyzing trace with hash -2009396360, now seen corresponding path program 21 times [2025-03-09 01:30:48,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:30:48,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419093382] [2025-03-09 01:30:48,077 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 01:30:48,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:30:48,079 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 19 statements into 2 equivalence classes. [2025-03-09 01:30:48,081 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-03-09 01:30:48,081 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-09 01:30:48,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:48,153 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-09 01:30:48,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:30:48,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419093382] [2025-03-09 01:30:48,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419093382] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:30:48,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [852728704] [2025-03-09 01:30:48,153 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 01:30:48,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:30:48,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:30:48,155 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-09 01:30:48,156 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-09 01:30:48,176 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 19 statements into 2 equivalence classes. [2025-03-09 01:30:48,184 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-03-09 01:30:48,184 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-09 01:30:48,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:48,184 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-09 01:30:48,185 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:30:48,255 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-09 01:30:48,255 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:30:48,398 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-09 01:30:48,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [852728704] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:30:48,398 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:30:48,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 21 [2025-03-09 01:30:48,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925332737] [2025-03-09 01:30:48,398 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:30:48,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-09 01:30:48,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:30:48,399 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-09 01:30:48,399 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=360, Unknown=0, NotChecked=0, Total=462 [2025-03-09 01:30:48,404 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 24 [2025-03-09 01:30:48,404 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 224 places, 218 transitions, 4925 flow. Second operand has 22 states, 22 states have (on average 5.5) internal successors, (121), 22 states have internal predecessors, (121), 0 states have call successors, (0), 0 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-09 01:30:48,404 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:30:48,404 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 24 [2025-03-09 01:30:48,404 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:30:48,740 INFO L124 PetriNetUnfolderBase]: 609/1341 cut-off events. [2025-03-09 01:30:48,740 INFO L125 PetriNetUnfolderBase]: For 18709/18709 co-relation queries the response was YES. [2025-03-09 01:30:48,746 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9185 conditions, 1341 events. 609/1341 cut-off events. For 18709/18709 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 8419 event pairs, 152 based on Foata normal form. 2/1343 useless extension candidates. Maximal degree in co-relation 9118. Up to 813 conditions per place. [2025-03-09 01:30:48,750 INFO L140 encePairwiseOnDemand]: 14/24 looper letters, 145 selfloop transitions, 67 changer transitions 24/237 dead transitions. [2025-03-09 01:30:48,750 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 237 transitions, 5518 flow [2025-03-09 01:30:48,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-09 01:30:48,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-09 01:30:48,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 100 transitions. [2025-03-09 01:30:48,751 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3472222222222222 [2025-03-09 01:30:48,751 INFO L175 Difference]: Start difference. First operand has 224 places, 218 transitions, 4925 flow. Second operand 12 states and 100 transitions. [2025-03-09 01:30:48,751 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 229 places, 237 transitions, 5518 flow [2025-03-09 01:30:48,806 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 237 transitions, 5027 flow, removed 41 selfloop flow, removed 22 redundant places. [2025-03-09 01:30:48,810 INFO L231 Difference]: Finished difference. Result has 208 places, 208 transitions, 4371 flow [2025-03-09 01:30:48,810 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=4442, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=218, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=67, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=151, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=4371, PETRI_PLACES=208, PETRI_TRANSITIONS=208} [2025-03-09 01:30:48,810 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 182 predicate places. [2025-03-09 01:30:48,810 INFO L471 AbstractCegarLoop]: Abstraction has has 208 places, 208 transitions, 4371 flow [2025-03-09 01:30:48,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 5.5) internal successors, (121), 22 states have internal predecessors, (121), 0 states have call successors, (0), 0 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-09 01:30:48,811 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:30:48,811 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:30:48,816 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-09 01:30:49,011 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,SelfDestructingSolverStorable48 [2025-03-09 01:30:49,011 INFO L396 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-09 01:30:49,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:30:49,011 INFO L85 PathProgramCache]: Analyzing trace with hash 2095138940, now seen corresponding path program 22 times [2025-03-09 01:30:49,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:30:49,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367102337] [2025-03-09 01:30:49,012 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 01:30:49,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:30:49,014 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 19 statements into 2 equivalence classes. [2025-03-09 01:30:49,015 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-03-09 01:30:49,016 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 01:30:49,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:49,091 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-09 01:30:49,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:30:49,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367102337] [2025-03-09 01:30:49,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367102337] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:30:49,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1598978369] [2025-03-09 01:30:49,091 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 01:30:49,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:30:49,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:30:49,093 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-09 01:30:49,093 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-09 01:30:49,113 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 19 statements into 2 equivalence classes. [2025-03-09 01:30:49,120 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-03-09 01:30:49,120 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 01:30:49,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:49,121 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-09 01:30:49,121 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:30:49,207 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-09 01:30:49,207 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:30:49,327 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-09 01:30:49,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1598978369] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:30:49,327 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:30:49,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 22 [2025-03-09 01:30:49,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385223782] [2025-03-09 01:30:49,328 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:30:49,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-09 01:30:49,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:30:49,328 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-09 01:30:49,328 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=417, Unknown=0, NotChecked=0, Total=506 [2025-03-09 01:30:49,335 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 24 [2025-03-09 01:30:49,335 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 208 transitions, 4371 flow. Second operand has 23 states, 23 states have (on average 5.434782608695652) internal successors, (125), 23 states have internal predecessors, (125), 0 states have call successors, (0), 0 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-09 01:30:49,335 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:30:49,335 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 24 [2025-03-09 01:30:49,335 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:30:49,633 INFO L124 PetriNetUnfolderBase]: 575/1257 cut-off events. [2025-03-09 01:30:49,633 INFO L125 PetriNetUnfolderBase]: For 14913/14913 co-relation queries the response was YES. [2025-03-09 01:30:49,637 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8177 conditions, 1257 events. 575/1257 cut-off events. For 14913/14913 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 7705 event pairs, 23 based on Foata normal form. 3/1260 useless extension candidates. Maximal degree in co-relation 8117. Up to 377 conditions per place. [2025-03-09 01:30:49,640 INFO L140 encePairwiseOnDemand]: 14/24 looper letters, 119 selfloop transitions, 90 changer transitions 26/236 dead transitions. [2025-03-09 01:30:49,640 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 236 transitions, 4994 flow [2025-03-09 01:30:49,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-09 01:30:49,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-09 01:30:49,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 123 transitions. [2025-03-09 01:30:49,640 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3416666666666667 [2025-03-09 01:30:49,640 INFO L175 Difference]: Start difference. First operand has 208 places, 208 transitions, 4371 flow. Second operand 15 states and 123 transitions. [2025-03-09 01:30:49,640 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 210 places, 236 transitions, 4994 flow [2025-03-09 01:30:49,678 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 236 transitions, 4798 flow, removed 11 selfloop flow, removed 11 redundant places. [2025-03-09 01:30:49,681 INFO L231 Difference]: Finished difference. Result has 200 places, 194 transitions, 4093 flow [2025-03-09 01:30:49,681 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=4177, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=208, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=90, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=4093, PETRI_PLACES=200, PETRI_TRANSITIONS=194} [2025-03-09 01:30:49,681 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 174 predicate places. [2025-03-09 01:30:49,681 INFO L471 AbstractCegarLoop]: Abstraction has has 200 places, 194 transitions, 4093 flow [2025-03-09 01:30:49,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 5.434782608695652) internal successors, (125), 23 states have internal predecessors, (125), 0 states have call successors, (0), 0 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-09 01:30:49,681 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:30:49,681 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:30:49,687 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Ended with exit code 0 [2025-03-09 01:30:49,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2025-03-09 01:30:49,882 INFO L396 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-09 01:30:49,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:30:49,882 INFO L85 PathProgramCache]: Analyzing trace with hash -2139220180, now seen corresponding path program 23 times [2025-03-09 01:30:49,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:30:49,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472159669] [2025-03-09 01:30:49,882 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-09 01:30:49,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:30:49,884 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-03-09 01:30:49,885 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-03-09 01:30:49,885 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:30:49,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:49,907 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:30:49,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:30:49,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472159669] [2025-03-09 01:30:49,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472159669] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:30:49,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1613830917] [2025-03-09 01:30:49,907 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-09 01:30:49,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:30:49,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:30:49,909 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:30:49,910 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2025-03-09 01:30:49,929 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-03-09 01:30:49,936 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-03-09 01:30:49,936 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:30:49,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:49,936 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-09 01:30:49,936 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:30:49,944 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:30:49,945 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:30:49,980 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:30:49,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1613830917] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:30:49,980 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:30:49,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2025-03-09 01:30:49,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142682627] [2025-03-09 01:30:49,980 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:30:49,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-09 01:30:49,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:30:49,981 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-09 01:30:49,981 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2025-03-09 01:30:49,985 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 24 [2025-03-09 01:30:49,986 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 194 transitions, 4093 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:30:49,986 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:30:49,986 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 24 [2025-03-09 01:30:49,986 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:30:50,205 INFO L124 PetriNetUnfolderBase]: 545/1155 cut-off events. [2025-03-09 01:30:50,205 INFO L125 PetriNetUnfolderBase]: For 16140/16140 co-relation queries the response was YES. [2025-03-09 01:30:50,209 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8188 conditions, 1155 events. 545/1155 cut-off events. For 16140/16140 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 6704 event pairs, 144 based on Foata normal form. 32/1187 useless extension candidates. Maximal degree in co-relation 8131. Up to 552 conditions per place. [2025-03-09 01:30:50,212 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 175 selfloop transitions, 68 changer transitions 12/256 dead transitions. [2025-03-09 01:30:50,212 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 256 transitions, 5340 flow [2025-03-09 01:30:50,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-09 01:30:50,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-03-09 01:30:50,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 148 transitions. [2025-03-09 01:30:50,212 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3854166666666667 [2025-03-09 01:30:50,212 INFO L175 Difference]: Start difference. First operand has 200 places, 194 transitions, 4093 flow. Second operand 16 states and 148 transitions. [2025-03-09 01:30:50,212 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 256 transitions, 5340 flow [2025-03-09 01:30:50,262 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 256 transitions, 4785 flow, removed 38 selfloop flow, removed 22 redundant places. [2025-03-09 01:30:50,265 INFO L231 Difference]: Finished difference. Result has 180 places, 196 transitions, 3795 flow [2025-03-09 01:30:50,265 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=3248, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=176, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=3795, PETRI_PLACES=180, PETRI_TRANSITIONS=196} [2025-03-09 01:30:50,265 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 154 predicate places. [2025-03-09 01:30:50,265 INFO L471 AbstractCegarLoop]: Abstraction has has 180 places, 196 transitions, 3795 flow [2025-03-09 01:30:50,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:30:50,265 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:30:50,265 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:30:50,271 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2025-03-09 01:30:50,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:30:50,466 INFO L396 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-09 01:30:50,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:30:50,466 INFO L85 PathProgramCache]: Analyzing trace with hash -206964488, now seen corresponding path program 24 times [2025-03-09 01:30:50,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:30:50,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310217671] [2025-03-09 01:30:50,466 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-09 01:30:50,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:30:50,468 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 20 statements into 3 equivalence classes. [2025-03-09 01:30:50,470 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 20 of 20 statements. [2025-03-09 01:30:50,470 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-03-09 01:30:50,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:50,497 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:30:50,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:30:50,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310217671] [2025-03-09 01:30:50,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310217671] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:30:50,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [144749455] [2025-03-09 01:30:50,497 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-09 01:30:50,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:30:50,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:30:50,499 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:30:50,499 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2025-03-09 01:30:50,519 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 20 statements into 3 equivalence classes. [2025-03-09 01:30:50,525 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 20 of 20 statements. [2025-03-09 01:30:50,526 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-03-09 01:30:50,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:50,526 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-09 01:30:50,526 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:30:50,599 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:30:50,600 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:30:50,752 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:30:50,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [144749455] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:30:50,752 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:30:50,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 11] total 25 [2025-03-09 01:30:50,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883790925] [2025-03-09 01:30:50,752 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:30:50,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-09 01:30:50,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:30:50,753 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-09 01:30:50,753 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=484, Unknown=0, NotChecked=0, Total=600 [2025-03-09 01:30:50,762 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 24 [2025-03-09 01:30:50,762 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 196 transitions, 3795 flow. Second operand has 25 states, 25 states have (on average 5.88) internal successors, (147), 25 states have internal predecessors, (147), 0 states have call successors, (0), 0 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-09 01:30:50,762 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:30:50,762 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 24 [2025-03-09 01:30:50,762 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:30:51,301 INFO L124 PetriNetUnfolderBase]: 719/1510 cut-off events. [2025-03-09 01:30:51,301 INFO L125 PetriNetUnfolderBase]: For 15860/15860 co-relation queries the response was YES. [2025-03-09 01:30:51,306 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10206 conditions, 1510 events. 719/1510 cut-off events. For 15860/15860 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 9188 event pairs, 147 based on Foata normal form. 26/1536 useless extension candidates. Maximal degree in co-relation 10152. Up to 579 conditions per place. [2025-03-09 01:30:51,309 INFO L140 encePairwiseOnDemand]: 14/24 looper letters, 152 selfloop transitions, 126 changer transitions 29/308 dead transitions. [2025-03-09 01:30:51,309 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 308 transitions, 6059 flow [2025-03-09 01:30:51,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-03-09 01:30:51,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2025-03-09 01:30:51,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 213 transitions. [2025-03-09 01:30:51,310 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.34134615384615385 [2025-03-09 01:30:51,310 INFO L175 Difference]: Start difference. First operand has 180 places, 196 transitions, 3795 flow. Second operand 26 states and 213 transitions. [2025-03-09 01:30:51,310 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 308 transitions, 6059 flow [2025-03-09 01:30:51,353 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 308 transitions, 5769 flow, removed 139 selfloop flow, removed 3 redundant places. [2025-03-09 01:30:51,356 INFO L231 Difference]: Finished difference. Result has 215 places, 239 transitions, 4979 flow [2025-03-09 01:30:51,356 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=3525, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=191, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=81, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=4979, PETRI_PLACES=215, PETRI_TRANSITIONS=239} [2025-03-09 01:30:51,357 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 189 predicate places. [2025-03-09 01:30:51,357 INFO L471 AbstractCegarLoop]: Abstraction has has 215 places, 239 transitions, 4979 flow [2025-03-09 01:30:51,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 5.88) internal successors, (147), 25 states have internal predecessors, (147), 0 states have call successors, (0), 0 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-09 01:30:51,357 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:30:51,357 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:30:51,363 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Ended with exit code 0 [2025-03-09 01:30:51,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable51 [2025-03-09 01:30:51,558 INFO L396 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-09 01:30:51,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:30:51,558 INFO L85 PathProgramCache]: Analyzing trace with hash 384006309, now seen corresponding path program 25 times [2025-03-09 01:30:51,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:30:51,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093086343] [2025-03-09 01:30:51,558 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-09 01:30:51,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:30:51,560 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-09 01:30:51,561 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-09 01:30:51,562 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:30:51,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:51,581 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:30:51,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:30:51,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093086343] [2025-03-09 01:30:51,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093086343] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:30:51,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1365667220] [2025-03-09 01:30:51,582 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-09 01:30:51,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:30:51,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:30:51,583 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:30:51,584 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2025-03-09 01:30:51,604 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-09 01:30:51,610 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-09 01:30:51,611 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:30:51,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:51,611 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-09 01:30:51,611 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:30:51,619 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:30:51,619 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:30:51,657 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:30:51,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1365667220] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:30:51,658 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:30:51,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2025-03-09 01:30:51,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578620358] [2025-03-09 01:30:51,658 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:30:51,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-09 01:30:51,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:30:51,658 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-09 01:30:51,658 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2025-03-09 01:30:51,662 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 24 [2025-03-09 01:30:51,663 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 215 places, 239 transitions, 4979 flow. Second operand has 11 states, 11 states have (on average 6.181818181818182) internal successors, (68), 11 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-09 01:30:51,663 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:30:51,663 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 24 [2025-03-09 01:30:51,663 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:30:51,898 INFO L124 PetriNetUnfolderBase]: 708/1479 cut-off events. [2025-03-09 01:30:51,898 INFO L125 PetriNetUnfolderBase]: For 19653/19653 co-relation queries the response was YES. [2025-03-09 01:30:51,904 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10616 conditions, 1479 events. 708/1479 cut-off events. For 19653/19653 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 8805 event pairs, 201 based on Foata normal form. 12/1491 useless extension candidates. Maximal degree in co-relation 10546. Up to 748 conditions per place. [2025-03-09 01:30:51,907 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 223 selfloop transitions, 66 changer transitions 4/294 dead transitions. [2025-03-09 01:30:51,907 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 294 transitions, 6383 flow [2025-03-09 01:30:51,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-09 01:30:51,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-09 01:30:51,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 117 transitions. [2025-03-09 01:30:51,908 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.375 [2025-03-09 01:30:51,908 INFO L175 Difference]: Start difference. First operand has 215 places, 239 transitions, 4979 flow. Second operand 13 states and 117 transitions. [2025-03-09 01:30:51,908 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 294 transitions, 6383 flow [2025-03-09 01:30:51,975 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 210 places, 294 transitions, 6020 flow, removed 153 selfloop flow, removed 11 redundant places. [2025-03-09 01:30:51,979 INFO L231 Difference]: Finished difference. Result has 218 places, 261 transitions, 5315 flow [2025-03-09 01:30:51,979 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=4658, PETRI_DIFFERENCE_MINUEND_PLACES=198, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=239, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=177, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=5315, PETRI_PLACES=218, PETRI_TRANSITIONS=261} [2025-03-09 01:30:51,979 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 192 predicate places. [2025-03-09 01:30:51,979 INFO L471 AbstractCegarLoop]: Abstraction has has 218 places, 261 transitions, 5315 flow [2025-03-09 01:30:51,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.181818181818182) internal successors, (68), 11 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-09 01:30:51,979 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:30:51,979 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:30:51,985 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Ended with exit code 0 [2025-03-09 01:30:52,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52,32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:30:52,180 INFO L396 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-09 01:30:52,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:30:52,180 INFO L85 PathProgramCache]: Analyzing trace with hash 689061843, now seen corresponding path program 26 times [2025-03-09 01:30:52,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:30:52,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842565881] [2025-03-09 01:30:52,181 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:30:52,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:30:52,182 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-03-09 01:30:52,184 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-03-09 01:30:52,184 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:30:52,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:52,263 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:30:52,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:30:52,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842565881] [2025-03-09 01:30:52,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842565881] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:30:52,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2004800592] [2025-03-09 01:30:52,263 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:30:52,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:30:52,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:30:52,265 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:30:52,266 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2025-03-09 01:30:52,286 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-03-09 01:30:52,293 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-03-09 01:30:52,293 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:30:52,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:52,294 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-09 01:30:52,294 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:30:52,383 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:30:52,384 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:30:52,548 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:30:52,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2004800592] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:30:52,548 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:30:52,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 27 [2025-03-09 01:30:52,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627916668] [2025-03-09 01:30:52,548 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:30:52,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-09 01:30:52,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:30:52,549 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-09 01:30:52,549 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=625, Unknown=0, NotChecked=0, Total=756 [2025-03-09 01:30:52,555 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 24 [2025-03-09 01:30:52,555 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 261 transitions, 5315 flow. Second operand has 28 states, 28 states have (on average 5.428571428571429) internal successors, (152), 28 states have internal predecessors, (152), 0 states have call successors, (0), 0 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-09 01:30:52,555 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:30:52,555 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 24 [2025-03-09 01:30:52,555 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:30:53,002 INFO L124 PetriNetUnfolderBase]: 835/1745 cut-off events. [2025-03-09 01:30:53,002 INFO L125 PetriNetUnfolderBase]: For 21376/21376 co-relation queries the response was YES. [2025-03-09 01:30:53,008 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12073 conditions, 1745 events. 835/1745 cut-off events. For 21376/21376 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 10916 event pairs, 3 based on Foata normal form. 10/1755 useless extension candidates. Maximal degree in co-relation 12000. Up to 438 conditions per place. [2025-03-09 01:30:53,011 INFO L140 encePairwiseOnDemand]: 14/24 looper letters, 181 selfloop transitions, 123 changer transitions 35/340 dead transitions. [2025-03-09 01:30:53,011 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 232 places, 340 transitions, 7158 flow [2025-03-09 01:30:53,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-09 01:30:53,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-09 01:30:53,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 131 transitions. [2025-03-09 01:30:53,012 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3638888888888889 [2025-03-09 01:30:53,012 INFO L175 Difference]: Start difference. First operand has 218 places, 261 transitions, 5315 flow. Second operand 15 states and 131 transitions. [2025-03-09 01:30:53,012 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 232 places, 340 transitions, 7158 flow [2025-03-09 01:30:53,081 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 340 transitions, 7074 flow, removed 28 selfloop flow, removed 4 redundant places. [2025-03-09 01:30:53,085 INFO L231 Difference]: Finished difference. Result has 232 places, 272 transitions, 5916 flow [2025-03-09 01:30:53,086 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=5233, PETRI_DIFFERENCE_MINUEND_PLACES=214, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=261, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=103, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=5916, PETRI_PLACES=232, PETRI_TRANSITIONS=272} [2025-03-09 01:30:53,086 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 206 predicate places. [2025-03-09 01:30:53,086 INFO L471 AbstractCegarLoop]: Abstraction has has 232 places, 272 transitions, 5916 flow [2025-03-09 01:30:53,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 5.428571428571429) internal successors, (152), 28 states have internal predecessors, (152), 0 states have call successors, (0), 0 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-09 01:30:53,086 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:30:53,086 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:30:53,091 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Ended with exit code 0 [2025-03-09 01:30:53,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:30:53,286 INFO L396 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-09 01:30:53,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:30:53,287 INFO L85 PathProgramCache]: Analyzing trace with hash 1058757695, now seen corresponding path program 27 times [2025-03-09 01:30:53,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:30:53,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402602913] [2025-03-09 01:30:53,287 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 01:30:53,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:30:53,289 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 21 statements into 2 equivalence classes. [2025-03-09 01:30:53,290 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-03-09 01:30:53,290 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-09 01:30:53,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:53,362 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:30:53,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:30:53,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402602913] [2025-03-09 01:30:53,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402602913] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:30:53,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [198145609] [2025-03-09 01:30:53,362 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 01:30:53,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:30:53,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:30:53,365 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:30:53,365 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2025-03-09 01:30:53,384 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 21 statements into 2 equivalence classes. [2025-03-09 01:30:53,391 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-03-09 01:30:53,391 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-09 01:30:53,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:53,392 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-09 01:30:53,392 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:30:53,477 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:30:53,477 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:30:53,634 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:30:53,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [198145609] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:30:53,634 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:30:53,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 27 [2025-03-09 01:30:53,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798168324] [2025-03-09 01:30:53,634 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:30:53,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-09 01:30:53,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:30:53,635 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-09 01:30:53,635 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=636, Unknown=0, NotChecked=0, Total=756 [2025-03-09 01:30:53,640 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 24 [2025-03-09 01:30:53,640 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 232 places, 272 transitions, 5916 flow. Second operand has 28 states, 28 states have (on average 5.392857142857143) internal successors, (151), 28 states have internal predecessors, (151), 0 states have call successors, (0), 0 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-09 01:30:53,640 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:30:53,640 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 24 [2025-03-09 01:30:53,640 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:30:54,001 INFO L124 PetriNetUnfolderBase]: 718/1483 cut-off events. [2025-03-09 01:30:54,001 INFO L125 PetriNetUnfolderBase]: For 21844/21844 co-relation queries the response was YES. [2025-03-09 01:30:54,008 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10905 conditions, 1483 events. 718/1483 cut-off events. For 21844/21844 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 8804 event pairs, 3 based on Foata normal form. 5/1488 useless extension candidates. Maximal degree in co-relation 10828. Up to 367 conditions per place. [2025-03-09 01:30:54,011 INFO L140 encePairwiseOnDemand]: 14/24 looper letters, 122 selfloop transitions, 79 changer transitions 121/323 dead transitions. [2025-03-09 01:30:54,011 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 244 places, 323 transitions, 6922 flow [2025-03-09 01:30:54,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-09 01:30:54,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-03-09 01:30:54,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 141 transitions. [2025-03-09 01:30:54,012 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3671875 [2025-03-09 01:30:54,012 INFO L175 Difference]: Start difference. First operand has 232 places, 272 transitions, 5916 flow. Second operand 16 states and 141 transitions. [2025-03-09 01:30:54,012 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 244 places, 323 transitions, 6922 flow [2025-03-09 01:30:54,096 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 236 places, 323 transitions, 6821 flow, removed 5 selfloop flow, removed 8 redundant places. [2025-03-09 01:30:54,100 INFO L231 Difference]: Finished difference. Result has 237 places, 172 transitions, 3701 flow [2025-03-09 01:30:54,100 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=5827, PETRI_DIFFERENCE_MINUEND_PLACES=221, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=272, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=79, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=193, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=3701, PETRI_PLACES=237, PETRI_TRANSITIONS=172} [2025-03-09 01:30:54,100 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 211 predicate places. [2025-03-09 01:30:54,100 INFO L471 AbstractCegarLoop]: Abstraction has has 237 places, 172 transitions, 3701 flow [2025-03-09 01:30:54,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 5.392857142857143) internal successors, (151), 28 states have internal predecessors, (151), 0 states have call successors, (0), 0 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-09 01:30:54,100 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:30:54,100 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:30:54,106 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Ended with exit code 0 [2025-03-09 01:30:54,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable54 [2025-03-09 01:30:54,301 INFO L396 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-09 01:30:54,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:30:54,301 INFO L85 PathProgramCache]: Analyzing trace with hash -1871448629, now seen corresponding path program 28 times [2025-03-09 01:30:54,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:30:54,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408549261] [2025-03-09 01:30:54,301 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 01:30:54,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:30:54,303 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 21 statements into 2 equivalence classes. [2025-03-09 01:30:54,304 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-03-09 01:30:54,304 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 01:30:54,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:54,401 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:30:54,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:30:54,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408549261] [2025-03-09 01:30:54,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408549261] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:30:54,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1327067714] [2025-03-09 01:30:54,402 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 01:30:54,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:30:54,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:30:54,404 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:30:54,405 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2025-03-09 01:30:54,424 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 21 statements into 2 equivalence classes. [2025-03-09 01:30:54,430 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-03-09 01:30:54,430 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 01:30:54,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:54,431 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-09 01:30:54,431 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:30:54,547 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:30:54,547 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:30:54,714 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:30:54,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1327067714] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:30:54,714 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:30:54,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 28 [2025-03-09 01:30:54,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259576716] [2025-03-09 01:30:54,715 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:30:54,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-03-09 01:30:54,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:30:54,715 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-03-09 01:30:54,715 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=681, Unknown=0, NotChecked=0, Total=812 [2025-03-09 01:30:54,720 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 24 [2025-03-09 01:30:54,720 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 237 places, 172 transitions, 3701 flow. Second operand has 29 states, 29 states have (on average 5.344827586206897) internal successors, (155), 29 states have internal predecessors, (155), 0 states have call successors, (0), 0 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-09 01:30:54,720 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:30:54,720 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 24 [2025-03-09 01:30:54,720 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:30:55,089 INFO L124 PetriNetUnfolderBase]: 441/995 cut-off events. [2025-03-09 01:30:55,089 INFO L125 PetriNetUnfolderBase]: For 14029/14029 co-relation queries the response was YES. [2025-03-09 01:30:55,093 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6770 conditions, 995 events. 441/995 cut-off events. For 14029/14029 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 5636 event pairs, 3 based on Foata normal form. 1/996 useless extension candidates. Maximal degree in co-relation 6694. Up to 301 conditions per place. [2025-03-09 01:30:55,095 INFO L140 encePairwiseOnDemand]: 14/24 looper letters, 117 selfloop transitions, 84 changer transitions 8/210 dead transitions. [2025-03-09 01:30:55,095 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 246 places, 210 transitions, 4307 flow [2025-03-09 01:30:55,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-09 01:30:55,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-09 01:30:55,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 135 transitions. [2025-03-09 01:30:55,096 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.375 [2025-03-09 01:30:55,096 INFO L175 Difference]: Start difference. First operand has 237 places, 172 transitions, 3701 flow. Second operand 15 states and 135 transitions. [2025-03-09 01:30:55,096 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 246 places, 210 transitions, 4307 flow [2025-03-09 01:30:55,132 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 210 transitions, 3657 flow, removed 73 selfloop flow, removed 39 redundant places. [2025-03-09 01:30:55,134 INFO L231 Difference]: Finished difference. Result has 209 places, 172 transitions, 3278 flow [2025-03-09 01:30:55,134 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=3086, PETRI_DIFFERENCE_MINUEND_PLACES=193, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=172, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=82, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=3278, PETRI_PLACES=209, PETRI_TRANSITIONS=172} [2025-03-09 01:30:55,135 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 183 predicate places. [2025-03-09 01:30:55,135 INFO L471 AbstractCegarLoop]: Abstraction has has 209 places, 172 transitions, 3278 flow [2025-03-09 01:30:55,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 5.344827586206897) internal successors, (155), 29 states have internal predecessors, (155), 0 states have call successors, (0), 0 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-09 01:30:55,135 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:30:55,135 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:30:55,140 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Ended with exit code 0 [2025-03-09 01:30:55,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55,35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:30:55,335 INFO L396 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-09 01:30:55,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:30:55,336 INFO L85 PathProgramCache]: Analyzing trace with hash -1791051671, now seen corresponding path program 29 times [2025-03-09 01:30:55,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:30:55,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750581782] [2025-03-09 01:30:55,336 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-09 01:30:55,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:30:55,338 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-03-09 01:30:55,339 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-03-09 01:30:55,339 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:30:55,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:55,381 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 01:30:55,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:30:55,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750581782] [2025-03-09 01:30:55,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750581782] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:30:55,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [420552553] [2025-03-09 01:30:55,381 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-09 01:30:55,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:30:55,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:30:55,383 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:30:55,383 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2025-03-09 01:30:55,403 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-03-09 01:30:55,409 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-03-09 01:30:55,409 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:30:55,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:55,410 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-09 01:30:55,410 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:30:55,460 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 01:30:55,460 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 01:30:55,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [420552553] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:30:55,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 01:30:55,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 12 [2025-03-09 01:30:55,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668587337] [2025-03-09 01:30:55,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:30:55,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-09 01:30:55,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:30:55,461 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-09 01:30:55,461 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2025-03-09 01:30:55,466 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 24 [2025-03-09 01:30:55,466 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 172 transitions, 3278 flow. Second operand has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:30:55,466 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:30:55,466 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 24 [2025-03-09 01:30:55,466 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:30:55,586 INFO L124 PetriNetUnfolderBase]: 430/959 cut-off events. [2025-03-09 01:30:55,586 INFO L125 PetriNetUnfolderBase]: For 9633/9633 co-relation queries the response was YES. [2025-03-09 01:30:55,589 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5932 conditions, 959 events. 430/959 cut-off events. For 9633/9633 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 5336 event pairs, 86 based on Foata normal form. 5/964 useless extension candidates. Maximal degree in co-relation 5872. Up to 398 conditions per place. [2025-03-09 01:30:55,590 INFO L140 encePairwiseOnDemand]: 16/24 looper letters, 77 selfloop transitions, 28 changer transitions 83/189 dead transitions. [2025-03-09 01:30:55,590 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 189 transitions, 3716 flow [2025-03-09 01:30:55,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-09 01:30:55,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-09 01:30:55,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 85 transitions. [2025-03-09 01:30:55,592 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.39351851851851855 [2025-03-09 01:30:55,592 INFO L175 Difference]: Start difference. First operand has 209 places, 172 transitions, 3278 flow. Second operand 9 states and 85 transitions. [2025-03-09 01:30:55,592 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 189 transitions, 3716 flow [2025-03-09 01:30:55,619 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 189 transitions, 3481 flow, removed 9 selfloop flow, removed 15 redundant places. [2025-03-09 01:30:55,620 INFO L231 Difference]: Finished difference. Result has 201 places, 98 transitions, 1678 flow [2025-03-09 01:30:55,621 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=3043, PETRI_DIFFERENCE_MINUEND_PLACES=192, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=172, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1678, PETRI_PLACES=201, PETRI_TRANSITIONS=98} [2025-03-09 01:30:55,621 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 175 predicate places. [2025-03-09 01:30:55,621 INFO L471 AbstractCegarLoop]: Abstraction has has 201 places, 98 transitions, 1678 flow [2025-03-09 01:30:55,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:30:55,621 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:30:55,621 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:30:55,627 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Ended with exit code 0 [2025-03-09 01:30:55,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable56 [2025-03-09 01:30:55,822 INFO L396 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-09 01:30:55,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:30:55,822 INFO L85 PathProgramCache]: Analyzing trace with hash 1722597509, now seen corresponding path program 30 times [2025-03-09 01:30:55,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:30:55,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058902007] [2025-03-09 01:30:55,822 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-09 01:30:55,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:30:55,824 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 21 statements into 3 equivalence classes. [2025-03-09 01:30:55,825 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 21 of 21 statements. [2025-03-09 01:30:55,826 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-03-09 01:30:55,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:55,870 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 01:30:55,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:30:55,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058902007] [2025-03-09 01:30:55,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058902007] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:30:55,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1579688033] [2025-03-09 01:30:55,870 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-09 01:30:55,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:30:55,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:30:55,872 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:30:55,873 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2025-03-09 01:30:55,892 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 21 statements into 3 equivalence classes. [2025-03-09 01:30:55,899 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 21 of 21 statements. [2025-03-09 01:30:55,899 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-03-09 01:30:55,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:55,899 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-09 01:30:55,900 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:30:55,992 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:30:55,992 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:30:56,152 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:30:56,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1579688033] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:30:56,152 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:30:56,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 12, 12] total 25 [2025-03-09 01:30:56,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331739790] [2025-03-09 01:30:56,152 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:30:56,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-09 01:30:56,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:30:56,153 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-09 01:30:56,153 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=528, Unknown=0, NotChecked=0, Total=650 [2025-03-09 01:30:56,158 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 24 [2025-03-09 01:30:56,159 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 98 transitions, 1678 flow. Second operand has 26 states, 26 states have (on average 5.6923076923076925) internal successors, (148), 26 states have internal predecessors, (148), 0 states have call successors, (0), 0 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-09 01:30:56,159 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:30:56,159 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 24 [2025-03-09 01:30:56,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:30:56,442 INFO L124 PetriNetUnfolderBase]: 257/611 cut-off events. [2025-03-09 01:30:56,442 INFO L125 PetriNetUnfolderBase]: For 4521/4521 co-relation queries the response was YES. [2025-03-09 01:30:56,444 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3359 conditions, 611 events. 257/611 cut-off events. For 4521/4521 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3174 event pairs, 9 based on Foata normal form. 9/620 useless extension candidates. Maximal degree in co-relation 3300. Up to 180 conditions per place. [2025-03-09 01:30:56,445 INFO L140 encePairwiseOnDemand]: 14/24 looper letters, 47 selfloop transitions, 45 changer transitions 36/129 dead transitions. [2025-03-09 01:30:56,445 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 129 transitions, 2004 flow [2025-03-09 01:30:56,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-09 01:30:56,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-03-09 01:30:56,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 159 transitions. [2025-03-09 01:30:56,445 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.31547619047619047 [2025-03-09 01:30:56,445 INFO L175 Difference]: Start difference. First operand has 201 places, 98 transitions, 1678 flow. Second operand 21 states and 159 transitions. [2025-03-09 01:30:56,445 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 129 transitions, 2004 flow [2025-03-09 01:30:56,455 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 129 transitions, 1422 flow, removed 26 selfloop flow, removed 49 redundant places. [2025-03-09 01:30:56,456 INFO L231 Difference]: Finished difference. Result has 147 places, 70 transitions, 754 flow [2025-03-09 01:30:56,456 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=1096, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=754, PETRI_PLACES=147, PETRI_TRANSITIONS=70} [2025-03-09 01:30:56,456 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 121 predicate places. [2025-03-09 01:30:56,456 INFO L471 AbstractCegarLoop]: Abstraction has has 147 places, 70 transitions, 754 flow [2025-03-09 01:30:56,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 5.6923076923076925) internal successors, (148), 26 states have internal predecessors, (148), 0 states have call successors, (0), 0 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-09 01:30:56,457 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:30:56,457 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:30:56,463 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Ended with exit code 0 [2025-03-09 01:30:56,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57,37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:30:56,657 INFO L396 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-09 01:30:56,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:30:56,658 INFO L85 PathProgramCache]: Analyzing trace with hash 1882667007, now seen corresponding path program 31 times [2025-03-09 01:30:56,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:30:56,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36053716] [2025-03-09 01:30:56,658 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-09 01:30:56,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:30:56,660 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-09 01:30:56,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-09 01:30:56,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:30:56,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:56,741 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:30:56,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:30:56,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36053716] [2025-03-09 01:30:56,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36053716] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:30:56,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [612010575] [2025-03-09 01:30:56,741 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-09 01:30:56,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:30:56,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:30:56,743 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:30:56,744 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2025-03-09 01:30:56,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-09 01:30:56,771 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-09 01:30:56,771 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:30:56,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:56,772 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-09 01:30:56,772 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:30:56,857 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:30:56,857 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:30:56,996 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:30:56,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [612010575] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:30:56,996 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:30:56,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 27 [2025-03-09 01:30:56,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043941214] [2025-03-09 01:30:56,997 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:30:56,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-09 01:30:56,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:30:56,997 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-09 01:30:56,997 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=625, Unknown=0, NotChecked=0, Total=756 [2025-03-09 01:30:57,010 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 24 [2025-03-09 01:30:57,011 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 70 transitions, 754 flow. Second operand has 28 states, 28 states have (on average 5.392857142857143) internal successors, (151), 28 states have internal predecessors, (151), 0 states have call successors, (0), 0 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-09 01:30:57,011 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:30:57,011 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 24 [2025-03-09 01:30:57,011 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:30:57,218 INFO L124 PetriNetUnfolderBase]: 142/331 cut-off events. [2025-03-09 01:30:57,218 INFO L125 PetriNetUnfolderBase]: For 869/869 co-relation queries the response was YES. [2025-03-09 01:30:57,218 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1526 conditions, 331 events. 142/331 cut-off events. For 869/869 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1274 event pairs, 13 based on Foata normal form. 1/332 useless extension candidates. Maximal degree in co-relation 1493. Up to 85 conditions per place. [2025-03-09 01:30:57,219 INFO L140 encePairwiseOnDemand]: 14/24 looper letters, 48 selfloop transitions, 27 changer transitions 14/90 dead transitions. [2025-03-09 01:30:57,219 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 90 transitions, 977 flow [2025-03-09 01:30:57,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-09 01:30:57,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-09 01:30:57,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 107 transitions. [2025-03-09 01:30:57,220 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.31845238095238093 [2025-03-09 01:30:57,220 INFO L175 Difference]: Start difference. First operand has 147 places, 70 transitions, 754 flow. Second operand 14 states and 107 transitions. [2025-03-09 01:30:57,220 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 90 transitions, 977 flow [2025-03-09 01:30:57,222 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 90 transitions, 771 flow, removed 1 selfloop flow, removed 31 redundant places. [2025-03-09 01:30:57,223 INFO L231 Difference]: Finished difference. Result has 118 places, 66 transitions, 564 flow [2025-03-09 01:30:57,223 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=548, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=564, PETRI_PLACES=118, PETRI_TRANSITIONS=66} [2025-03-09 01:30:57,223 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 92 predicate places. [2025-03-09 01:30:57,223 INFO L471 AbstractCegarLoop]: Abstraction has has 118 places, 66 transitions, 564 flow [2025-03-09 01:30:57,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 5.392857142857143) internal successors, (151), 28 states have internal predecessors, (151), 0 states have call successors, (0), 0 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-09 01:30:57,224 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:30:57,224 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:30:57,229 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Ended with exit code 0 [2025-03-09 01:30:57,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable58 [2025-03-09 01:30:57,424 INFO L396 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-09 01:30:57,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:30:57,425 INFO L85 PathProgramCache]: Analyzing trace with hash 437509077, now seen corresponding path program 32 times [2025-03-09 01:30:57,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:30:57,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542110067] [2025-03-09 01:30:57,425 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:30:57,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:30:57,427 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-03-09 01:30:57,428 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-03-09 01:30:57,428 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:30:57,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:57,499 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:30:57,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:30:57,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542110067] [2025-03-09 01:30:57,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542110067] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:30:57,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1555854835] [2025-03-09 01:30:57,499 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:30:57,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:30:57,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:30:57,501 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:30:57,502 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2025-03-09 01:30:57,521 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-03-09 01:30:57,528 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-03-09 01:30:57,528 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:30:57,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:57,529 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-09 01:30:57,529 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:30:57,621 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:30:57,621 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:30:57,789 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:30:57,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1555854835] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:30:57,789 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:30:57,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 27 [2025-03-09 01:30:57,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454932141] [2025-03-09 01:30:57,790 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:30:57,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-09 01:30:57,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:30:57,790 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-09 01:30:57,790 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=630, Unknown=0, NotChecked=0, Total=756 [2025-03-09 01:30:57,794 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 24 [2025-03-09 01:30:57,795 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 66 transitions, 564 flow. Second operand has 28 states, 28 states have (on average 5.392857142857143) internal successors, (151), 28 states have internal predecessors, (151), 0 states have call successors, (0), 0 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-09 01:30:57,795 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:30:57,795 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 24 [2025-03-09 01:30:57,795 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:30:57,992 INFO L124 PetriNetUnfolderBase]: 128/289 cut-off events. [2025-03-09 01:30:57,993 INFO L125 PetriNetUnfolderBase]: For 533/533 co-relation queries the response was YES. [2025-03-09 01:30:57,993 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1181 conditions, 289 events. 128/289 cut-off events. For 533/533 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1044 event pairs, 5 based on Foata normal form. 4/293 useless extension candidates. Maximal degree in co-relation 1150. Up to 80 conditions per place. [2025-03-09 01:30:57,993 INFO L140 encePairwiseOnDemand]: 14/24 looper letters, 0 selfloop transitions, 0 changer transitions 77/77 dead transitions. [2025-03-09 01:30:57,993 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 77 transitions, 740 flow [2025-03-09 01:30:57,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-09 01:30:57,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-09 01:30:57,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 91 transitions. [2025-03-09 01:30:57,994 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2916666666666667 [2025-03-09 01:30:57,994 INFO L175 Difference]: Start difference. First operand has 118 places, 66 transitions, 564 flow. Second operand 13 states and 91 transitions. [2025-03-09 01:30:57,994 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 77 transitions, 740 flow [2025-03-09 01:30:57,996 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 77 transitions, 655 flow, removed 6 selfloop flow, removed 13 redundant places. [2025-03-09 01:30:57,996 INFO L231 Difference]: Finished difference. Result has 106 places, 0 transitions, 0 flow [2025-03-09 01:30:57,996 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=473, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=0, PETRI_PLACES=106, PETRI_TRANSITIONS=0} [2025-03-09 01:30:57,996 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 80 predicate places. [2025-03-09 01:30:57,996 INFO L471 AbstractCegarLoop]: Abstraction has has 106 places, 0 transitions, 0 flow [2025-03-09 01:30:57,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 5.392857142857143) internal successors, (151), 28 states have internal predecessors, (151), 0 states have call successors, (0), 0 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-09 01:30:57,998 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (3 of 4 remaining) [2025-03-09 01:30:57,999 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (2 of 4 remaining) [2025-03-09 01:30:57,999 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2025-03-09 01:30:57,999 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2025-03-09 01:30:58,004 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Ended with exit code 0 [2025-03-09 01:30:58,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable59 [2025-03-09 01:30:58,200 INFO L422 BasicCegarLoop]: Path program histogram: [32, 16, 6, 6] [2025-03-09 01:30:58,202 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-09 01:30:58,202 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-09 01:30:58,205 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.03 01:30:58 BasicIcfg [2025-03-09 01:30:58,206 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-09 01:30:58,206 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-09 01:30:58,207 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-09 01:30:58,207 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-09 01:30:58,207 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:30:13" (3/4) ... [2025-03-09 01:30:58,208 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-09 01:30:58,210 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-03-09 01:30:58,210 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-03-09 01:30:58,214 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 41 nodes and edges [2025-03-09 01:30:58,215 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2025-03-09 01:30:58,215 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2025-03-09 01:30:58,215 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-09 01:30:58,272 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-09 01:30:58,272 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-09 01:30:58,272 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-09 01:30:58,273 INFO L158 Benchmark]: Toolchain (without parser) took 45664.50ms. Allocated memory was 167.8MB in the beginning and 947.9MB in the end (delta: 780.1MB). Free memory was 123.5MB in the beginning and 635.3MB in the end (delta: -511.8MB). Peak memory consumption was 267.3MB. Max. memory is 16.1GB. [2025-03-09 01:30:58,273 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 192.9MB. Free memory is still 107.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 01:30:58,273 INFO L158 Benchmark]: CACSL2BoogieTranslator took 163.13ms. Allocated memory is still 167.8MB. Free memory was 122.5MB in the beginning and 112.3MB in the end (delta: 10.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 01:30:58,273 INFO L158 Benchmark]: Boogie Procedure Inliner took 19.29ms. Allocated memory is still 167.8MB. Free memory was 112.3MB in the beginning and 111.3MB in the end (delta: 991.0kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 01:30:58,273 INFO L158 Benchmark]: Boogie Preprocessor took 19.27ms. Allocated memory is still 167.8MB. Free memory was 111.3MB in the beginning and 109.9MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 01:30:58,273 INFO L158 Benchmark]: IcfgBuilder took 295.33ms. Allocated memory is still 167.8MB. Free memory was 109.9MB in the beginning and 90.1MB in the end (delta: 19.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-09 01:30:58,273 INFO L158 Benchmark]: TraceAbstraction took 45095.25ms. Allocated memory was 167.8MB in the beginning and 947.9MB in the end (delta: 780.1MB). Free memory was 89.1MB in the beginning and 642.3MB in the end (delta: -553.2MB). Peak memory consumption was 225.4MB. Max. memory is 16.1GB. [2025-03-09 01:30:58,274 INFO L158 Benchmark]: Witness Printer took 65.78ms. Allocated memory is still 947.9MB. Free memory was 642.3MB in the beginning and 635.3MB in the end (delta: 7.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 01:30:58,274 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 192.9MB. Free memory is still 107.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 163.13ms. Allocated memory is still 167.8MB. Free memory was 122.5MB in the beginning and 112.3MB in the end (delta: 10.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 19.29ms. Allocated memory is still 167.8MB. Free memory was 112.3MB in the beginning and 111.3MB in the end (delta: 991.0kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 19.27ms. Allocated memory is still 167.8MB. Free memory was 111.3MB in the beginning and 109.9MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 295.33ms. Allocated memory is still 167.8MB. Free memory was 109.9MB in the beginning and 90.1MB in the end (delta: 19.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 45095.25ms. Allocated memory was 167.8MB in the beginning and 947.9MB in the end (delta: 780.1MB). Free memory was 89.1MB in the beginning and 642.3MB in the end (delta: -553.2MB). Peak memory consumption was 225.4MB. Max. memory is 16.1GB. * Witness Printer took 65.78ms. Allocated memory is still 947.9MB. Free memory was 642.3MB in the beginning and 635.3MB in the end (delta: 7.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 21]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 61]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 35 locations, 38 edges, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 45.0s, OverallIterations: 60, TraceHistogramMax: 2, PathProgramHistogramMax: 32, EmptinessCheckTime: 0.0s, AutomataDifference: 24.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3303 SdHoareTripleChecker+Valid, 8.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3257 mSDsluCounter, 533 SdHoareTripleChecker+Invalid, 6.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 463 mSDsCounter, 786 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 22881 IncrementalHoareTripleChecker+Invalid, 23667 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 786 mSolverCounterUnsat, 70 mSDtfsCounter, 22881 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2288 GetRequests, 1073 SyntacticMatches, 10 SemanticMatches, 1205 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8869 ImplicationChecksByTransitivity, 9.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=12779occurred in iteration=43, InterpolantAutomatonStates: 779, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 10.7s InterpolantComputationTime, 1846 NumberOfCodeBlocks, 1846 NumberOfCodeBlocksAsserted, 172 NumberOfCheckSat, 2369 ConstructedInterpolants, 0 QuantifiedInterpolants, 13148 SizeOfPredicates, 119 NumberOfNonLiveVariables, 3757 ConjunctsInSsa, 465 ConjunctsInUnsatCore, 132 InterpolantComputations, 32 PerfectInterpolantSequences, 61/332 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-09 01:30:58,287 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE