./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread/triangular-longest-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread/triangular-longest-2.i -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 874fb84f685baf0441a9bf8db1864605baa10908128545fe3028b9b499246108 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 09:43:38,124 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 09:43:38,181 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-04 09:43:38,187 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 09:43:38,187 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 09:43:38,209 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 09:43:38,211 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 09:43:38,211 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 09:43:38,212 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 09:43:38,212 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 09:43:38,212 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 09:43:38,212 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 09:43:38,213 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 09:43:38,213 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 09:43:38,213 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 09:43:38,213 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 09:43:38,213 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 09:43:38,213 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 09:43:38,213 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 09:43:38,214 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 09:43:38,214 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 09:43:38,214 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 09:43:38,214 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-04 09:43:38,214 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 09:43:38,214 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 09:43:38,214 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 09:43:38,214 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 09:43:38,214 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 09:43:38,214 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 09:43:38,214 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 09:43:38,214 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 09:43:38,214 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 09:43:38,215 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 09:43:38,215 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 09:43:38,215 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 09:43:38,215 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 09:43:38,215 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 09:43:38,215 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 09:43:38,215 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 09:43:38,216 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 09:43:38,216 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 09:43:38,216 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 09:43:38,216 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 -> 874fb84f685baf0441a9bf8db1864605baa10908128545fe3028b9b499246108 [2025-03-04 09:43:38,443 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 09:43:38,450 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 09:43:38,453 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 09:43:38,453 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 09:43:38,454 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 09:43:38,455 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread/triangular-longest-2.i [2025-03-04 09:43:39,625 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa9a1058e/ab11055660d34afbb7b7ef2c46a45376/FLAGf19363bdc [2025-03-04 09:43:39,886 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 09:43:39,887 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/triangular-longest-2.i [2025-03-04 09:43:39,901 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa9a1058e/ab11055660d34afbb7b7ef2c46a45376/FLAGf19363bdc [2025-03-04 09:43:39,916 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa9a1058e/ab11055660d34afbb7b7ef2c46a45376 [2025-03-04 09:43:39,918 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 09:43:39,920 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 09:43:39,921 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 09:43:39,921 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 09:43:39,924 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 09:43:39,925 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 09:43:39" (1/1) ... [2025-03-04 09:43:39,926 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19b94396 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:43:39, skipping insertion in model container [2025-03-04 09:43:39,926 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 09:43:39" (1/1) ... [2025-03-04 09:43:39,958 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 09:43:40,194 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 09:43:40,203 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 09:43:40,244 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 09:43:40,274 INFO L204 MainTranslator]: Completed translation [2025-03-04 09:43:40,276 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:43:40 WrapperNode [2025-03-04 09:43:40,276 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 09:43:40,277 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 09:43:40,277 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 09:43:40,277 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 09:43:40,282 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:43:40" (1/1) ... [2025-03-04 09:43:40,291 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:43:40" (1/1) ... [2025-03-04 09:43:40,302 INFO L138 Inliner]: procedures = 168, calls = 17, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 39 [2025-03-04 09:43:40,302 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 09:43:40,303 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 09:43:40,303 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 09:43:40,303 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 09:43:40,308 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:43:40" (1/1) ... [2025-03-04 09:43:40,309 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:43:40" (1/1) ... [2025-03-04 09:43:40,311 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:43:40" (1/1) ... [2025-03-04 09:43:40,322 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-04 09:43:40,323 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:43:40" (1/1) ... [2025-03-04 09:43:40,324 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:43:40" (1/1) ... [2025-03-04 09:43:40,326 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:43:40" (1/1) ... [2025-03-04 09:43:40,331 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:43:40" (1/1) ... [2025-03-04 09:43:40,332 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:43:40" (1/1) ... [2025-03-04 09:43:40,332 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:43:40" (1/1) ... [2025-03-04 09:43:40,333 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 09:43:40,334 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 09:43:40,334 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 09:43:40,334 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 09:43:40,335 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:43:40" (1/1) ... [2025-03-04 09:43:40,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 09:43:40,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:43:40,361 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 09:43:40,365 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 09:43:40,379 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2025-03-04 09:43:40,379 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2025-03-04 09:43:40,379 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2025-03-04 09:43:40,379 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2025-03-04 09:43:40,380 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-04 09:43:40,380 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 09:43:40,380 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 09:43:40,380 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-04 09:43:40,380 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 09:43:40,380 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 09:43:40,381 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 09:43:40,464 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 09:43:40,466 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 09:43:40,589 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 09:43:40,590 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 09:43:40,650 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 09:43:40,650 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 09:43:40,650 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 09:43:40 BoogieIcfgContainer [2025-03-04 09:43:40,650 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 09:43:40,652 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 09:43:40,652 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 09:43:40,655 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 09:43:40,656 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 09:43:39" (1/3) ... [2025-03-04 09:43:40,656 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ce866df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 09:43:40, skipping insertion in model container [2025-03-04 09:43:40,656 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:43:40" (2/3) ... [2025-03-04 09:43:40,656 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ce866df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 09:43:40, skipping insertion in model container [2025-03-04 09:43:40,656 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 09:43:40" (3/3) ... [2025-03-04 09:43:40,657 INFO L128 eAbstractionObserver]: Analyzing ICFG triangular-longest-2.i [2025-03-04 09:43:40,667 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 09:43:40,668 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG triangular-longest-2.i that has 3 procedures, 26 locations, 1 initial locations, 2 loop locations, and 2 error locations. [2025-03-04 09:43:40,668 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 09:43:40,706 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-04 09:43:40,732 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 29 transitions, 66 flow [2025-03-04 09:43:40,753 INFO L124 PetriNetUnfolderBase]: 4/27 cut-off events. [2025-03-04 09:43:40,755 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 09:43:40,758 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34 conditions, 27 events. 4/27 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 37 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 27. Up to 2 conditions per place. [2025-03-04 09:43:40,759 INFO L82 GeneralOperation]: Start removeDead. Operand has 32 places, 29 transitions, 66 flow [2025-03-04 09:43:40,761 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 30 places, 27 transitions, 60 flow [2025-03-04 09:43:40,768 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 09:43:40,776 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;@5a5d77f1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 09:43:40,777 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-03-04 09:43:40,783 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 09:43:40,783 INFO L124 PetriNetUnfolderBase]: 4/24 cut-off events. [2025-03-04 09:43:40,783 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 09:43:40,783 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:43:40,784 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:43:40,784 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 09:43:40,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:43:40,789 INFO L85 PathProgramCache]: Analyzing trace with hash 1499979287, now seen corresponding path program 1 times [2025-03-04 09:43:40,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:43:40,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884340849] [2025-03-04 09:43:40,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:43:40,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:43:40,862 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 09:43:40,879 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 09:43:40,880 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:43:40,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:43:40,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:43:40,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:43:40,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884340849] [2025-03-04 09:43:40,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884340849] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:43:40,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:43:40,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 09:43:40,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737903094] [2025-03-04 09:43:40,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:43:40,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:43:40,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:43:40,985 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:43:40,985 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:43:40,986 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2025-03-04 09:43:40,989 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 27 transitions, 60 flow. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:43:40,989 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:43:40,989 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2025-03-04 09:43:40,989 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:43:41,107 INFO L124 PetriNetUnfolderBase]: 185/363 cut-off events. [2025-03-04 09:43:41,108 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-04 09:43:41,109 INFO L83 FinitePrefix]: Finished finitePrefix Result has 667 conditions, 363 events. 185/363 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1602 event pairs, 135 based on Foata normal form. 32/390 useless extension candidates. Maximal degree in co-relation 657. Up to 290 conditions per place. [2025-03-04 09:43:41,111 INFO L140 encePairwiseOnDemand]: 25/29 looper letters, 15 selfloop transitions, 1 changer transitions 1/23 dead transitions. [2025-03-04 09:43:41,111 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 23 transitions, 86 flow [2025-03-04 09:43:41,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:43:41,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 09:43:41,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 44 transitions. [2025-03-04 09:43:41,123 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5057471264367817 [2025-03-04 09:43:41,124 INFO L175 Difference]: Start difference. First operand has 30 places, 27 transitions, 60 flow. Second operand 3 states and 44 transitions. [2025-03-04 09:43:41,124 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 23 transitions, 86 flow [2025-03-04 09:43:41,127 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 23 transitions, 84 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 09:43:41,130 INFO L231 Difference]: Finished difference. Result has 28 places, 22 transitions, 50 flow [2025-03-04 09:43:41,133 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=50, PETRI_PLACES=28, PETRI_TRANSITIONS=22} [2025-03-04 09:43:41,136 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, -2 predicate places. [2025-03-04 09:43:41,137 INFO L471 AbstractCegarLoop]: Abstraction has has 28 places, 22 transitions, 50 flow [2025-03-04 09:43:41,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:43:41,138 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:43:41,138 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:43:41,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 09:43:41,138 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 09:43:41,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:43:41,140 INFO L85 PathProgramCache]: Analyzing trace with hash 1499979786, now seen corresponding path program 1 times [2025-03-04 09:43:41,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:43:41,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123216915] [2025-03-04 09:43:41,140 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:43:41,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:43:41,153 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 09:43:41,160 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 09:43:41,167 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:43:41,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:43:41,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:43:41,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:43:41,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123216915] [2025-03-04 09:43:41,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123216915] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:43:41,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:43:41,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 09:43:41,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950420117] [2025-03-04 09:43:41,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:43:41,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 09:43:41,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:43:41,359 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 09:43:41,359 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 09:43:41,362 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2025-03-04 09:43:41,362 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 22 transitions, 50 flow. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:43:41,363 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:43:41,363 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2025-03-04 09:43:41,363 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:43:41,527 INFO L124 PetriNetUnfolderBase]: 273/491 cut-off events. [2025-03-04 09:43:41,527 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 09:43:41,528 INFO L83 FinitePrefix]: Finished finitePrefix Result has 931 conditions, 491 events. 273/491 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2024 event pairs, 45 based on Foata normal form. 0/478 useless extension candidates. Maximal degree in co-relation 925. Up to 181 conditions per place. [2025-03-04 09:43:41,532 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 25 selfloop transitions, 4 changer transitions 21/54 dead transitions. [2025-03-04 09:43:41,532 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 54 transitions, 212 flow [2025-03-04 09:43:41,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 09:43:41,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 09:43:41,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 99 transitions. [2025-03-04 09:43:41,533 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5689655172413793 [2025-03-04 09:43:41,533 INFO L175 Difference]: Start difference. First operand has 28 places, 22 transitions, 50 flow. Second operand 6 states and 99 transitions. [2025-03-04 09:43:41,533 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 54 transitions, 212 flow [2025-03-04 09:43:41,533 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 54 transitions, 211 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 09:43:41,535 INFO L231 Difference]: Finished difference. Result has 35 places, 23 transitions, 74 flow [2025-03-04 09:43:41,535 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=49, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=74, PETRI_PLACES=35, PETRI_TRANSITIONS=23} [2025-03-04 09:43:41,535 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 5 predicate places. [2025-03-04 09:43:41,535 INFO L471 AbstractCegarLoop]: Abstraction has has 35 places, 23 transitions, 74 flow [2025-03-04 09:43:41,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:43:41,536 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:43:41,536 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:43:41,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 09:43:41,537 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 09:43:41,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:43:41,538 INFO L85 PathProgramCache]: Analyzing trace with hash -1591607260, now seen corresponding path program 1 times [2025-03-04 09:43:41,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:43:41,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63054279] [2025-03-04 09:43:41,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:43:41,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:43:41,547 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 09:43:41,552 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 09:43:41,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:43:41,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:43:41,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:43:41,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:43:41,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63054279] [2025-03-04 09:43:41,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63054279] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:43:41,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:43:41,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 09:43:41,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702072823] [2025-03-04 09:43:41,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:43:41,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 09:43:41,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:43:41,675 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 09:43:41,675 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 09:43:41,676 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2025-03-04 09:43:41,677 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 23 transitions, 74 flow. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:43:41,677 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:43:41,677 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2025-03-04 09:43:41,677 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:43:41,876 INFO L124 PetriNetUnfolderBase]: 382/707 cut-off events. [2025-03-04 09:43:41,877 INFO L125 PetriNetUnfolderBase]: For 285/291 co-relation queries the response was YES. [2025-03-04 09:43:41,880 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1605 conditions, 707 events. 382/707 cut-off events. For 285/291 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 3107 event pairs, 65 based on Foata normal form. 33/739 useless extension candidates. Maximal degree in co-relation 1594. Up to 246 conditions per place. [2025-03-04 09:43:41,883 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 46 selfloop transitions, 9 changer transitions 20/79 dead transitions. [2025-03-04 09:43:41,884 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 79 transitions, 382 flow [2025-03-04 09:43:41,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 09:43:41,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 09:43:41,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 144 transitions. [2025-03-04 09:43:41,886 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5517241379310345 [2025-03-04 09:43:41,886 INFO L175 Difference]: Start difference. First operand has 35 places, 23 transitions, 74 flow. Second operand 9 states and 144 transitions. [2025-03-04 09:43:41,886 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 79 transitions, 382 flow [2025-03-04 09:43:41,888 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 79 transitions, 366 flow, removed 8 selfloop flow, removed 2 redundant places. [2025-03-04 09:43:41,890 INFO L231 Difference]: Finished difference. Result has 44 places, 32 transitions, 159 flow [2025-03-04 09:43:41,891 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=159, PETRI_PLACES=44, PETRI_TRANSITIONS=32} [2025-03-04 09:43:41,892 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 14 predicate places. [2025-03-04 09:43:41,892 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 32 transitions, 159 flow [2025-03-04 09:43:41,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:43:41,893 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:43:41,893 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:43:41,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 09:43:41,893 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 09:43:41,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:43:41,894 INFO L85 PathProgramCache]: Analyzing trace with hash -1595175136, now seen corresponding path program 2 times [2025-03-04 09:43:41,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:43:41,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755026048] [2025-03-04 09:43:41,894 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 09:43:41,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:43:41,901 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 1 equivalence classes. [2025-03-04 09:43:41,907 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 09:43:41,908 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 09:43:41,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:43:42,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:43:42,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:43:42,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755026048] [2025-03-04 09:43:42,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755026048] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:43:42,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:43:42,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 09:43:42,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176079395] [2025-03-04 09:43:42,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:43:42,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 09:43:42,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:43:42,003 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 09:43:42,003 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 09:43:42,007 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2025-03-04 09:43:42,007 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 32 transitions, 159 flow. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:43:42,008 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:43:42,008 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2025-03-04 09:43:42,008 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:43:42,169 INFO L124 PetriNetUnfolderBase]: 328/614 cut-off events. [2025-03-04 09:43:42,169 INFO L125 PetriNetUnfolderBase]: For 1001/1013 co-relation queries the response was YES. [2025-03-04 09:43:42,171 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1744 conditions, 614 events. 328/614 cut-off events. For 1001/1013 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2617 event pairs, 65 based on Foata normal form. 57/670 useless extension candidates. Maximal degree in co-relation 1726. Up to 234 conditions per place. [2025-03-04 09:43:42,172 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 38 selfloop transitions, 9 changer transitions 28/79 dead transitions. [2025-03-04 09:43:42,172 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 79 transitions, 499 flow [2025-03-04 09:43:42,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 09:43:42,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 09:43:42,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 127 transitions. [2025-03-04 09:43:42,174 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5474137931034483 [2025-03-04 09:43:42,174 INFO L175 Difference]: Start difference. First operand has 44 places, 32 transitions, 159 flow. Second operand 8 states and 127 transitions. [2025-03-04 09:43:42,174 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 79 transitions, 499 flow [2025-03-04 09:43:42,177 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 79 transitions, 491 flow, removed 4 selfloop flow, removed 2 redundant places. [2025-03-04 09:43:42,178 INFO L231 Difference]: Finished difference. Result has 51 places, 34 transitions, 213 flow [2025-03-04 09:43:42,178 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=153, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=213, PETRI_PLACES=51, PETRI_TRANSITIONS=34} [2025-03-04 09:43:42,179 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 21 predicate places. [2025-03-04 09:43:42,179 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 34 transitions, 213 flow [2025-03-04 09:43:42,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:43:42,179 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:43:42,179 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:43:42,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 09:43:42,180 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 09:43:42,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:43:42,180 INFO L85 PathProgramCache]: Analyzing trace with hash 29952673, now seen corresponding path program 1 times [2025-03-04 09:43:42,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:43:42,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720411955] [2025-03-04 09:43:42,180 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:43:42,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:43:42,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 09:43:42,188 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 09:43:42,188 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:43:42,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:43:42,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:43:42,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:43:42,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720411955] [2025-03-04 09:43:42,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720411955] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:43:42,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:43:42,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 09:43:42,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646869317] [2025-03-04 09:43:42,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:43:42,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 09:43:42,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:43:42,288 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 09:43:42,288 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-04 09:43:42,289 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2025-03-04 09:43:42,289 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 34 transitions, 213 flow. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:43:42,289 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:43:42,289 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2025-03-04 09:43:42,289 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:43:42,451 INFO L124 PetriNetUnfolderBase]: 355/668 cut-off events. [2025-03-04 09:43:42,451 INFO L125 PetriNetUnfolderBase]: For 1815/1827 co-relation queries the response was YES. [2025-03-04 09:43:42,453 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2075 conditions, 668 events. 355/668 cut-off events. For 1815/1827 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 2929 event pairs, 80 based on Foata normal form. 21/688 useless extension candidates. Maximal degree in co-relation 2052. Up to 258 conditions per place. [2025-03-04 09:43:42,454 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 43 selfloop transitions, 16 changer transitions 21/84 dead transitions. [2025-03-04 09:43:42,454 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 84 transitions, 600 flow [2025-03-04 09:43:42,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 09:43:42,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 09:43:42,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 140 transitions. [2025-03-04 09:43:42,455 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5363984674329502 [2025-03-04 09:43:42,456 INFO L175 Difference]: Start difference. First operand has 51 places, 34 transitions, 213 flow. Second operand 9 states and 140 transitions. [2025-03-04 09:43:42,456 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 84 transitions, 600 flow [2025-03-04 09:43:42,461 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 84 transitions, 530 flow, removed 24 selfloop flow, removed 7 redundant places. [2025-03-04 09:43:42,462 INFO L231 Difference]: Finished difference. Result has 54 places, 42 transitions, 300 flow [2025-03-04 09:43:42,462 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=177, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=300, PETRI_PLACES=54, PETRI_TRANSITIONS=42} [2025-03-04 09:43:42,462 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 24 predicate places. [2025-03-04 09:43:42,462 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 42 transitions, 300 flow [2025-03-04 09:43:42,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:43:42,462 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:43:42,462 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:43:42,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 09:43:42,463 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 09:43:42,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:43:42,463 INFO L85 PathProgramCache]: Analyzing trace with hash 1774460803, now seen corresponding path program 2 times [2025-03-04 09:43:42,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:43:42,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016131970] [2025-03-04 09:43:42,463 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 09:43:42,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:43:42,467 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 1 equivalence classes. [2025-03-04 09:43:42,469 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 09:43:42,470 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 09:43:42,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:43:42,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:43:42,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:43:42,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016131970] [2025-03-04 09:43:42,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016131970] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:43:42,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:43:42,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 09:43:42,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369401373] [2025-03-04 09:43:42,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:43:42,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 09:43:42,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:43:42,540 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 09:43:42,540 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-04 09:43:42,541 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2025-03-04 09:43:42,542 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 42 transitions, 300 flow. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:43:42,542 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:43:42,542 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2025-03-04 09:43:42,542 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:43:42,762 INFO L124 PetriNetUnfolderBase]: 526/980 cut-off events. [2025-03-04 09:43:42,763 INFO L125 PetriNetUnfolderBase]: For 3325/3337 co-relation queries the response was YES. [2025-03-04 09:43:42,765 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3197 conditions, 980 events. 526/980 cut-off events. For 3325/3337 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 4650 event pairs, 53 based on Foata normal form. 39/1016 useless extension candidates. Maximal degree in co-relation 3173. Up to 256 conditions per place. [2025-03-04 09:43:42,768 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 57 selfloop transitions, 22 changer transitions 23/106 dead transitions. [2025-03-04 09:43:42,768 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 106 transitions, 796 flow [2025-03-04 09:43:42,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 09:43:42,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-04 09:43:42,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 174 transitions. [2025-03-04 09:43:42,769 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5454545454545454 [2025-03-04 09:43:42,769 INFO L175 Difference]: Start difference. First operand has 54 places, 42 transitions, 300 flow. Second operand 11 states and 174 transitions. [2025-03-04 09:43:42,769 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 106 transitions, 796 flow [2025-03-04 09:43:42,775 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 106 transitions, 736 flow, removed 26 selfloop flow, removed 3 redundant places. [2025-03-04 09:43:42,776 INFO L231 Difference]: Finished difference. Result has 66 places, 48 transitions, 410 flow [2025-03-04 09:43:42,776 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=266, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=410, PETRI_PLACES=66, PETRI_TRANSITIONS=48} [2025-03-04 09:43:42,778 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 36 predicate places. [2025-03-04 09:43:42,779 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 48 transitions, 410 flow [2025-03-04 09:43:42,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:43:42,779 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:43:42,779 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:43:42,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 09:43:42,779 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 09:43:42,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:43:42,780 INFO L85 PathProgramCache]: Analyzing trace with hash 1950453345, now seen corresponding path program 3 times [2025-03-04 09:43:42,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:43:42,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613767990] [2025-03-04 09:43:42,780 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 09:43:42,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:43:42,786 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 16 statements into 1 equivalence classes. [2025-03-04 09:43:42,789 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 09:43:42,790 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 09:43:42,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:43:42,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:43:42,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:43:42,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613767990] [2025-03-04 09:43:42,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613767990] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:43:42,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:43:42,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 09:43:42,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572749242] [2025-03-04 09:43:42,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:43:42,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 09:43:42,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:43:42,892 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 09:43:42,892 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 09:43:42,893 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2025-03-04 09:43:42,893 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 48 transitions, 410 flow. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:43:42,893 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:43:42,893 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2025-03-04 09:43:42,893 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:43:43,081 INFO L124 PetriNetUnfolderBase]: 463/878 cut-off events. [2025-03-04 09:43:43,081 INFO L125 PetriNetUnfolderBase]: For 5153/5165 co-relation queries the response was YES. [2025-03-04 09:43:43,084 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3299 conditions, 878 events. 463/878 cut-off events. For 5153/5165 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 4098 event pairs, 71 based on Foata normal form. 57/932 useless extension candidates. Maximal degree in co-relation 3269. Up to 226 conditions per place. [2025-03-04 09:43:43,086 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 44 selfloop transitions, 22 changer transitions 31/101 dead transitions. [2025-03-04 09:43:43,086 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 101 transitions, 934 flow [2025-03-04 09:43:43,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 09:43:43,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 09:43:43,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 155 transitions. [2025-03-04 09:43:43,087 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5344827586206896 [2025-03-04 09:43:43,087 INFO L175 Difference]: Start difference. First operand has 66 places, 48 transitions, 410 flow. Second operand 10 states and 155 transitions. [2025-03-04 09:43:43,087 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 101 transitions, 934 flow [2025-03-04 09:43:43,096 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 101 transitions, 868 flow, removed 23 selfloop flow, removed 5 redundant places. [2025-03-04 09:43:43,098 INFO L231 Difference]: Finished difference. Result has 72 places, 49 transitions, 466 flow [2025-03-04 09:43:43,098 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=370, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=466, PETRI_PLACES=72, PETRI_TRANSITIONS=49} [2025-03-04 09:43:43,099 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 42 predicate places. [2025-03-04 09:43:43,099 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 49 transitions, 466 flow [2025-03-04 09:43:43,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:43:43,100 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:43:43,100 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:43:43,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 09:43:43,101 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 09:43:43,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:43:43,101 INFO L85 PathProgramCache]: Analyzing trace with hash 1345523814, now seen corresponding path program 1 times [2025-03-04 09:43:43,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:43:43,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919236032] [2025-03-04 09:43:43,101 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:43:43,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:43:43,108 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 09:43:43,111 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 09:43:43,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:43:43,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:43:43,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:43:43,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:43:43,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919236032] [2025-03-04 09:43:43,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919236032] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:43:43,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:43:43,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 09:43:43,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24013499] [2025-03-04 09:43:43,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:43:43,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 09:43:43,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:43:43,190 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 09:43:43,190 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-04 09:43:43,191 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2025-03-04 09:43:43,191 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 49 transitions, 466 flow. Second operand has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:43:43,191 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:43:43,192 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2025-03-04 09:43:43,192 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:43:43,402 INFO L124 PetriNetUnfolderBase]: 472/887 cut-off events. [2025-03-04 09:43:43,402 INFO L125 PetriNetUnfolderBase]: For 6011/6023 co-relation queries the response was YES. [2025-03-04 09:43:43,404 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3467 conditions, 887 events. 472/887 cut-off events. For 6011/6023 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 4149 event pairs, 59 based on Foata normal form. 30/914 useless extension candidates. Maximal degree in co-relation 3434. Up to 160 conditions per place. [2025-03-04 09:43:43,406 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 45 selfloop transitions, 28 changer transitions 23/100 dead transitions. [2025-03-04 09:43:43,406 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 100 transitions, 964 flow [2025-03-04 09:43:43,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 09:43:43,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 09:43:43,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 155 transitions. [2025-03-04 09:43:43,410 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5344827586206896 [2025-03-04 09:43:43,410 INFO L175 Difference]: Start difference. First operand has 72 places, 49 transitions, 466 flow. Second operand 10 states and 155 transitions. [2025-03-04 09:43:43,410 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 100 transitions, 964 flow [2025-03-04 09:43:43,419 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 100 transitions, 882 flow, removed 24 selfloop flow, removed 8 redundant places. [2025-03-04 09:43:43,420 INFO L231 Difference]: Finished difference. Result has 74 places, 52 transitions, 546 flow [2025-03-04 09:43:43,420 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=410, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=546, PETRI_PLACES=74, PETRI_TRANSITIONS=52} [2025-03-04 09:43:43,423 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 44 predicate places. [2025-03-04 09:43:43,423 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 52 transitions, 546 flow [2025-03-04 09:43:43,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:43:43,423 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:43:43,423 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:43:43,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 09:43:43,423 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 09:43:43,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:43:43,424 INFO L85 PathProgramCache]: Analyzing trace with hash 51256293, now seen corresponding path program 1 times [2025-03-04 09:43:43,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:43:43,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507012525] [2025-03-04 09:43:43,424 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:43:43,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:43:43,430 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 09:43:43,433 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 09:43:43,434 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:43:43,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:43:43,542 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:43:43,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:43:43,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507012525] [2025-03-04 09:43:43,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507012525] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:43:43,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1865362789] [2025-03-04 09:43:43,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:43:43,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:43:43,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:43:43,545 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 09:43:43,546 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 09:43:43,583 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 09:43:43,593 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 09:43:43,593 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:43:43,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:43:43,595 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 09:43:43,597 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:43:43,665 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:43:43,665 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 09:43:43,789 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:43:43,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1865362789] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 09:43:43,789 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 09:43:43,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2025-03-04 09:43:43,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473646345] [2025-03-04 09:43:43,790 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 09:43:43,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 09:43:43,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:43:43,790 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 09:43:43,791 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2025-03-04 09:43:43,796 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2025-03-04 09:43:43,797 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 52 transitions, 546 flow. Second operand has 13 states, 13 states have (on average 10.153846153846153) internal successors, (132), 13 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:43:43,797 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:43:43,797 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2025-03-04 09:43:43,797 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:43:44,153 INFO L124 PetriNetUnfolderBase]: 616/1163 cut-off events. [2025-03-04 09:43:44,153 INFO L125 PetriNetUnfolderBase]: For 10829/10841 co-relation queries the response was YES. [2025-03-04 09:43:44,156 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4986 conditions, 1163 events. 616/1163 cut-off events. For 10829/10841 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 5206 event pairs, 161 based on Foata normal form. 75/1237 useless extension candidates. Maximal degree in co-relation 4952. Up to 540 conditions per place. [2025-03-04 09:43:44,160 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 68 selfloop transitions, 19 changer transitions 67/158 dead transitions. [2025-03-04 09:43:44,160 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 158 transitions, 1624 flow [2025-03-04 09:43:44,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-04 09:43:44,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-03-04 09:43:44,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 288 transitions. [2025-03-04 09:43:44,161 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5226860254083484 [2025-03-04 09:43:44,161 INFO L175 Difference]: Start difference. First operand has 74 places, 52 transitions, 546 flow. Second operand 19 states and 288 transitions. [2025-03-04 09:43:44,161 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 158 transitions, 1624 flow [2025-03-04 09:43:44,173 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 158 transitions, 1528 flow, removed 30 selfloop flow, removed 7 redundant places. [2025-03-04 09:43:44,174 INFO L231 Difference]: Finished difference. Result has 96 places, 58 transitions, 683 flow [2025-03-04 09:43:44,174 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=480, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=683, PETRI_PLACES=96, PETRI_TRANSITIONS=58} [2025-03-04 09:43:44,175 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 66 predicate places. [2025-03-04 09:43:44,175 INFO L471 AbstractCegarLoop]: Abstraction has has 96 places, 58 transitions, 683 flow [2025-03-04 09:43:44,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 10.153846153846153) internal successors, (132), 13 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:43:44,176 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:43:44,176 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:43:44,182 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 09:43:44,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:43:44,380 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 09:43:44,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:43:44,380 INFO L85 PathProgramCache]: Analyzing trace with hash 1429829831, now seen corresponding path program 2 times [2025-03-04 09:43:44,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:43:44,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979504470] [2025-03-04 09:43:44,381 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 09:43:44,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:43:44,385 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-03-04 09:43:44,388 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 09:43:44,389 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 09:43:44,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:43:44,470 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:43:44,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:43:44,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979504470] [2025-03-04 09:43:44,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979504470] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:43:44,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [308223783] [2025-03-04 09:43:44,471 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 09:43:44,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:43:44,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:43:44,473 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 09:43:44,474 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 09:43:44,504 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-03-04 09:43:44,513 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 09:43:44,514 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 09:43:44,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:43:44,515 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 09:43:44,516 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:43:44,555 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:43:44,556 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 09:43:44,632 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:43:44,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [308223783] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 09:43:44,633 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 09:43:44,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2025-03-04 09:43:44,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702491121] [2025-03-04 09:43:44,633 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 09:43:44,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 09:43:44,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:43:44,634 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 09:43:44,634 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2025-03-04 09:43:44,637 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2025-03-04 09:43:44,637 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 58 transitions, 683 flow. Second operand has 13 states, 13 states have (on average 10.153846153846153) internal successors, (132), 13 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:43:44,637 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:43:44,637 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2025-03-04 09:43:44,637 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:43:45,200 INFO L124 PetriNetUnfolderBase]: 904/1691 cut-off events. [2025-03-04 09:43:45,201 INFO L125 PetriNetUnfolderBase]: For 37645/37657 co-relation queries the response was YES. [2025-03-04 09:43:45,205 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9526 conditions, 1691 events. 904/1691 cut-off events. For 37645/37657 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 8392 event pairs, 74 based on Foata normal form. 84/1774 useless extension candidates. Maximal degree in co-relation 9481. Up to 321 conditions per place. [2025-03-04 09:43:45,210 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 89 selfloop transitions, 49 changer transitions 80/222 dead transitions. [2025-03-04 09:43:45,210 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 222 transitions, 2891 flow [2025-03-04 09:43:45,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-03-04 09:43:45,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2025-03-04 09:43:45,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 415 transitions. [2025-03-04 09:43:45,211 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5300127713920817 [2025-03-04 09:43:45,211 INFO L175 Difference]: Start difference. First operand has 96 places, 58 transitions, 683 flow. Second operand 27 states and 415 transitions. [2025-03-04 09:43:45,211 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 222 transitions, 2891 flow [2025-03-04 09:43:45,230 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 222 transitions, 2344 flow, removed 261 selfloop flow, removed 12 redundant places. [2025-03-04 09:43:45,232 INFO L231 Difference]: Finished difference. Result has 122 places, 74 transitions, 1088 flow [2025-03-04 09:43:45,233 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=546, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=1088, PETRI_PLACES=122, PETRI_TRANSITIONS=74} [2025-03-04 09:43:45,233 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 92 predicate places. [2025-03-04 09:43:45,233 INFO L471 AbstractCegarLoop]: Abstraction has has 122 places, 74 transitions, 1088 flow [2025-03-04 09:43:45,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 10.153846153846153) internal successors, (132), 13 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:43:45,233 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:43:45,233 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:43:45,239 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 09:43:45,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-04 09:43:45,437 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 09:43:45,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:43:45,438 INFO L85 PathProgramCache]: Analyzing trace with hash -1043992632, now seen corresponding path program 1 times [2025-03-04 09:43:45,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:43:45,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690484489] [2025-03-04 09:43:45,438 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:43:45,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:43:45,442 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 09:43:45,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 09:43:45,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:43:45,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:43:45,526 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:43:45,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:43:45,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690484489] [2025-03-04 09:43:45,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690484489] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:43:45,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [441362709] [2025-03-04 09:43:45,527 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:43:45,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:43:45,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:43:45,530 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 09:43:45,531 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 09:43:45,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 09:43:45,571 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 09:43:45,571 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:43:45,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:43:45,572 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 09:43:45,574 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:43:45,617 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:43:45,617 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 09:43:45,717 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:43:45,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [441362709] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 09:43:45,717 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 09:43:45,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2025-03-04 09:43:45,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593861073] [2025-03-04 09:43:45,717 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 09:43:45,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-04 09:43:45,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:43:45,718 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-04 09:43:45,718 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2025-03-04 09:43:45,720 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2025-03-04 09:43:45,721 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 74 transitions, 1088 flow. Second operand has 15 states, 15 states have (on average 10.133333333333333) internal successors, (152), 15 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-04 09:43:45,721 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:43:45,721 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2025-03-04 09:43:45,721 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:43:46,306 INFO L124 PetriNetUnfolderBase]: 1138/2163 cut-off events. [2025-03-04 09:43:46,306 INFO L125 PetriNetUnfolderBase]: For 88272/88278 co-relation queries the response was YES. [2025-03-04 09:43:46,312 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14943 conditions, 2163 events. 1138/2163 cut-off events. For 88272/88278 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 11504 event pairs, 153 based on Foata normal form. 69/2229 useless extension candidates. Maximal degree in co-relation 14886. Up to 490 conditions per place. [2025-03-04 09:43:46,321 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 99 selfloop transitions, 54 changer transitions 67/224 dead transitions. [2025-03-04 09:43:46,321 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 224 transitions, 3706 flow [2025-03-04 09:43:46,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-04 09:43:46,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2025-03-04 09:43:46,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 384 transitions. [2025-03-04 09:43:46,326 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5296551724137931 [2025-03-04 09:43:46,326 INFO L175 Difference]: Start difference. First operand has 122 places, 74 transitions, 1088 flow. Second operand 25 states and 384 transitions. [2025-03-04 09:43:46,326 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 224 transitions, 3706 flow [2025-03-04 09:43:46,375 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 224 transitions, 3123 flow, removed 275 selfloop flow, removed 13 redundant places. [2025-03-04 09:43:46,378 INFO L231 Difference]: Finished difference. Result has 140 places, 85 transitions, 1379 flow [2025-03-04 09:43:46,378 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=815, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=1379, PETRI_PLACES=140, PETRI_TRANSITIONS=85} [2025-03-04 09:43:46,379 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 110 predicate places. [2025-03-04 09:43:46,379 INFO L471 AbstractCegarLoop]: Abstraction has has 140 places, 85 transitions, 1379 flow [2025-03-04 09:43:46,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 10.133333333333333) internal successors, (152), 15 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-04 09:43:46,379 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:43:46,379 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:43:46,385 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 09:43:46,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:43:46,585 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 09:43:46,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:43:46,585 INFO L85 PathProgramCache]: Analyzing trace with hash -230915460, now seen corresponding path program 2 times [2025-03-04 09:43:46,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:43:46,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574456300] [2025-03-04 09:43:46,585 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 09:43:46,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:43:46,589 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-04 09:43:46,592 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 09:43:46,592 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 09:43:46,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:43:46,664 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:43:46,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:43:46,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574456300] [2025-03-04 09:43:46,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574456300] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:43:46,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [67967855] [2025-03-04 09:43:46,664 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 09:43:46,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:43:46,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:43:46,666 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 09:43:46,668 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 09:43:46,697 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-04 09:43:46,706 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 09:43:46,706 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 09:43:46,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:43:46,707 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 09:43:46,707 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:43:46,744 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:43:46,745 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 09:43:46,831 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:43:46,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [67967855] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 09:43:46,831 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 09:43:46,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2025-03-04 09:43:46,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275754322] [2025-03-04 09:43:46,833 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 09:43:46,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-04 09:43:46,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:43:46,833 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-04 09:43:46,833 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2025-03-04 09:43:46,835 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2025-03-04 09:43:46,835 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 85 transitions, 1379 flow. Second operand has 15 states, 15 states have (on average 10.133333333333333) internal successors, (152), 15 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-04 09:43:46,835 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:43:46,835 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2025-03-04 09:43:46,835 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:43:47,533 INFO L124 PetriNetUnfolderBase]: 1255/2407 cut-off events. [2025-03-04 09:43:47,534 INFO L125 PetriNetUnfolderBase]: For 140501/140507 co-relation queries the response was YES. [2025-03-04 09:43:47,542 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18013 conditions, 2407 events. 1255/2407 cut-off events. For 140501/140507 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 12959 event pairs, 65 based on Foata normal form. 141/2545 useless extension candidates. Maximal degree in co-relation 17950. Up to 507 conditions per place. [2025-03-04 09:43:47,552 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 89 selfloop transitions, 79 changer transitions 98/270 dead transitions. [2025-03-04 09:43:47,552 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 270 transitions, 5249 flow [2025-03-04 09:43:47,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-03-04 09:43:47,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2025-03-04 09:43:47,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 429 transitions. [2025-03-04 09:43:47,555 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5283251231527094 [2025-03-04 09:43:47,555 INFO L175 Difference]: Start difference. First operand has 140 places, 85 transitions, 1379 flow. Second operand 28 states and 429 transitions. [2025-03-04 09:43:47,555 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 270 transitions, 5249 flow [2025-03-04 09:43:47,637 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 270 transitions, 4472 flow, removed 350 selfloop flow, removed 18 redundant places. [2025-03-04 09:43:47,640 INFO L231 Difference]: Finished difference. Result has 161 places, 106 transitions, 2008 flow [2025-03-04 09:43:47,640 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=1069, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=28, PETRI_FLOW=2008, PETRI_PLACES=161, PETRI_TRANSITIONS=106} [2025-03-04 09:43:47,640 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 131 predicate places. [2025-03-04 09:43:47,640 INFO L471 AbstractCegarLoop]: Abstraction has has 161 places, 106 transitions, 2008 flow [2025-03-04 09:43:47,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 10.133333333333333) internal successors, (152), 15 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-04 09:43:47,640 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:43:47,640 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:43:47,646 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-04 09:43:47,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:43:47,843 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 09:43:47,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:43:47,845 INFO L85 PathProgramCache]: Analyzing trace with hash 1186221288, now seen corresponding path program 3 times [2025-03-04 09:43:47,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:43:47,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657152653] [2025-03-04 09:43:47,845 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 09:43:47,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:43:47,848 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 34 statements into 5 equivalence classes. [2025-03-04 09:43:47,857 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 34 of 34 statements. [2025-03-04 09:43:47,857 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-03-04 09:43:47,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:43:47,997 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:43:47,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:43:47,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657152653] [2025-03-04 09:43:47,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657152653] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:43:47,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1438767815] [2025-03-04 09:43:47,998 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 09:43:47,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:43:47,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:43:48,000 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 09:43:48,001 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 09:43:48,027 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 34 statements into 5 equivalence classes. [2025-03-04 09:43:48,037 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 34 of 34 statements. [2025-03-04 09:43:48,037 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-03-04 09:43:48,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:43:48,038 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-04 09:43:48,039 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:43:48,092 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:43:48,093 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 09:43:48,227 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:43:48,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1438767815] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 09:43:48,227 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 09:43:48,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 24 [2025-03-04 09:43:48,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588297720] [2025-03-04 09:43:48,228 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 09:43:48,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-04 09:43:48,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:43:48,228 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-04 09:43:48,229 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=468, Unknown=0, NotChecked=0, Total=600 [2025-03-04 09:43:48,230 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2025-03-04 09:43:48,230 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 106 transitions, 2008 flow. Second operand has 25 states, 25 states have (on average 10.0) internal successors, (250), 25 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:43:48,230 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:43:48,230 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2025-03-04 09:43:48,230 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:43:49,510 INFO L124 PetriNetUnfolderBase]: 1723/3198 cut-off events. [2025-03-04 09:43:49,511 INFO L125 PetriNetUnfolderBase]: For 262206/262212 co-relation queries the response was YES. [2025-03-04 09:43:49,521 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27712 conditions, 3198 events. 1723/3198 cut-off events. For 262206/262212 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 16169 event pairs, 42 based on Foata normal form. 96/3293 useless extension candidates. Maximal degree in co-relation 27639. Up to 681 conditions per place. [2025-03-04 09:43:49,534 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 142 selfloop transitions, 115 changer transitions 135/396 dead transitions. [2025-03-04 09:43:49,534 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 396 transitions, 8460 flow [2025-03-04 09:43:49,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2025-03-04 09:43:49,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2025-03-04 09:43:49,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 703 transitions. [2025-03-04 09:43:49,536 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5269865067466267 [2025-03-04 09:43:49,536 INFO L175 Difference]: Start difference. First operand has 161 places, 106 transitions, 2008 flow. Second operand 46 states and 703 transitions. [2025-03-04 09:43:49,536 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 396 transitions, 8460 flow [2025-03-04 09:43:49,666 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 396 transitions, 7151 flow, removed 626 selfloop flow, removed 18 redundant places. [2025-03-04 09:43:49,670 INFO L231 Difference]: Finished difference. Result has 208 places, 140 transitions, 3111 flow [2025-03-04 09:43:49,670 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=1505, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=82, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=46, PETRI_FLOW=3111, PETRI_PLACES=208, PETRI_TRANSITIONS=140} [2025-03-04 09:43:49,670 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 178 predicate places. [2025-03-04 09:43:49,670 INFO L471 AbstractCegarLoop]: Abstraction has has 208 places, 140 transitions, 3111 flow [2025-03-04 09:43:49,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 10.0) internal successors, (250), 25 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:43:49,671 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:43:49,671 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:43:49,677 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-04 09:43:49,871 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,SelfDestructingSolverStorable12 [2025-03-04 09:43:49,871 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 09:43:49,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:43:49,872 INFO L85 PathProgramCache]: Analyzing trace with hash -275691621, now seen corresponding path program 4 times [2025-03-04 09:43:49,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:43:49,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543325209] [2025-03-04 09:43:49,872 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 09:43:49,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:43:49,876 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 52 statements into 2 equivalence classes. [2025-03-04 09:43:49,882 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 52 of 52 statements. [2025-03-04 09:43:49,883 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 09:43:49,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:43:50,174 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 94 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:43:50,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:43:50,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543325209] [2025-03-04 09:43:50,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543325209] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:43:50,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [363895646] [2025-03-04 09:43:50,175 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 09:43:50,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:43:50,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:43:50,177 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 09:43:50,178 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 09:43:50,209 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 52 statements into 2 equivalence classes. [2025-03-04 09:43:50,224 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 52 of 52 statements. [2025-03-04 09:43:50,224 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 09:43:50,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:43:50,225 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-04 09:43:50,226 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:43:50,325 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 94 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:43:50,325 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 09:43:50,662 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 94 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:43:50,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [363895646] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 09:43:50,662 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 09:43:50,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 34 [2025-03-04 09:43:50,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483398641] [2025-03-04 09:43:50,663 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 09:43:50,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-03-04 09:43:50,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:43:50,663 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-03-04 09:43:50,664 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=267, Invalid=923, Unknown=0, NotChecked=0, Total=1190 [2025-03-04 09:43:50,667 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2025-03-04 09:43:50,667 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 140 transitions, 3111 flow. Second operand has 35 states, 35 states have (on average 10.028571428571428) internal successors, (351), 35 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:43:50,667 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:43:50,667 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2025-03-04 09:43:50,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:43:52,224 INFO L124 PetriNetUnfolderBase]: 2227/4290 cut-off events. [2025-03-04 09:43:52,224 INFO L125 PetriNetUnfolderBase]: For 593468/593474 co-relation queries the response was YES. [2025-03-04 09:43:52,245 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46045 conditions, 4290 events. 2227/4290 cut-off events. For 593468/593474 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 22475 event pairs, 421 based on Foata normal form. 159/4446 useless extension candidates. Maximal degree in co-relation 45954. Up to 1483 conditions per place. [2025-03-04 09:43:52,260 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 190 selfloop transitions, 102 changer transitions 189/485 dead transitions. [2025-03-04 09:43:52,260 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 252 places, 485 transitions, 13868 flow [2025-03-04 09:43:52,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2025-03-04 09:43:52,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2025-03-04 09:43:52,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 818 transitions. [2025-03-04 09:43:52,262 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5128526645768025 [2025-03-04 09:43:52,262 INFO L175 Difference]: Start difference. First operand has 208 places, 140 transitions, 3111 flow. Second operand 55 states and 818 transitions. [2025-03-04 09:43:52,262 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 252 places, 485 transitions, 13868 flow [2025-03-04 09:43:52,756 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 223 places, 485 transitions, 10154 flow, removed 1815 selfloop flow, removed 29 redundant places. [2025-03-04 09:43:52,760 INFO L231 Difference]: Finished difference. Result has 256 places, 182 transitions, 4008 flow [2025-03-04 09:43:52,761 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=2121, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=68, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=55, PETRI_FLOW=4008, PETRI_PLACES=256, PETRI_TRANSITIONS=182} [2025-03-04 09:43:52,761 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 226 predicate places. [2025-03-04 09:43:52,761 INFO L471 AbstractCegarLoop]: Abstraction has has 256 places, 182 transitions, 4008 flow [2025-03-04 09:43:52,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 10.028571428571428) internal successors, (351), 35 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:43:52,762 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:43:52,762 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:43:52,767 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-04 09:43:52,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:43:52,962 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 09:43:52,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:43:52,963 INFO L85 PathProgramCache]: Analyzing trace with hash 298707663, now seen corresponding path program 5 times [2025-03-04 09:43:52,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:43:52,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852396747] [2025-03-04 09:43:52,963 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 09:43:52,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:43:52,968 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 52 statements into 5 equivalence classes. [2025-03-04 09:43:52,976 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) and asserted 52 of 52 statements. [2025-03-04 09:43:52,980 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2025-03-04 09:43:52,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:43:53,238 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:43:53,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:43:53,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852396747] [2025-03-04 09:43:53,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852396747] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:43:53,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [834375581] [2025-03-04 09:43:53,238 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 09:43:53,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:43:53,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:43:53,240 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 09:43:53,242 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 09:43:53,273 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 52 statements into 5 equivalence classes. [2025-03-04 09:43:53,285 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) and asserted 52 of 52 statements. [2025-03-04 09:43:53,285 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2025-03-04 09:43:53,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:43:53,286 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-04 09:43:53,290 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:43:53,396 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 1 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:43:53,396 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 09:43:53,726 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:43:53,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [834375581] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 09:43:53,727 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 09:43:53,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 35 [2025-03-04 09:43:53,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797711871] [2025-03-04 09:43:53,727 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 09:43:53,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-03-04 09:43:53,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:43:53,728 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-03-04 09:43:53,728 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=224, Invalid=1036, Unknown=0, NotChecked=0, Total=1260 [2025-03-04 09:43:53,730 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2025-03-04 09:43:53,731 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 256 places, 182 transitions, 4008 flow. Second operand has 36 states, 36 states have (on average 10.083333333333334) internal successors, (363), 36 states have internal predecessors, (363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:43:53,731 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:43:53,731 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2025-03-04 09:43:53,731 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:43:55,630 INFO L124 PetriNetUnfolderBase]: 2776/5543 cut-off events. [2025-03-04 09:43:55,630 INFO L125 PetriNetUnfolderBase]: For 989874/989880 co-relation queries the response was YES. [2025-03-04 09:43:55,659 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61739 conditions, 5543 events. 2776/5543 cut-off events. For 989874/989880 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 31446 event pairs, 194 based on Foata normal form. 159/5701 useless extension candidates. Maximal degree in co-relation 61633. Up to 1383 conditions per place. [2025-03-04 09:43:55,682 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 180 selfloop transitions, 194 changer transitions 201/579 dead transitions. [2025-03-04 09:43:55,683 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 299 places, 579 transitions, 16600 flow [2025-03-04 09:43:55,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2025-03-04 09:43:55,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2025-03-04 09:43:55,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 913 transitions. [2025-03-04 09:43:55,685 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5161107970604861 [2025-03-04 09:43:55,685 INFO L175 Difference]: Start difference. First operand has 256 places, 182 transitions, 4008 flow. Second operand 61 states and 913 transitions. [2025-03-04 09:43:55,685 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 299 places, 579 transitions, 16600 flow [2025-03-04 09:43:56,690 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 268 places, 579 transitions, 14069 flow, removed 1228 selfloop flow, removed 31 redundant places. [2025-03-04 09:43:56,696 INFO L231 Difference]: Finished difference. Result has 304 places, 243 transitions, 6034 flow [2025-03-04 09:43:56,697 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=3105, PETRI_DIFFERENCE_MINUEND_PLACES=208, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=182, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=141, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=61, PETRI_FLOW=6034, PETRI_PLACES=304, PETRI_TRANSITIONS=243} [2025-03-04 09:43:56,697 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 274 predicate places. [2025-03-04 09:43:56,697 INFO L471 AbstractCegarLoop]: Abstraction has has 304 places, 243 transitions, 6034 flow [2025-03-04 09:43:56,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 10.083333333333334) internal successors, (363), 36 states have internal predecessors, (363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:43:56,697 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:43:56,697 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:43:56,703 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-04 09:43:56,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:43:56,901 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 09:43:56,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:43:56,902 INFO L85 PathProgramCache]: Analyzing trace with hash 861354237, now seen corresponding path program 6 times [2025-03-04 09:43:56,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:43:56,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919389675] [2025-03-04 09:43:56,902 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 09:43:56,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:43:56,907 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 52 statements into 6 equivalence classes. [2025-03-04 09:43:56,918 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) and asserted 52 of 52 statements. [2025-03-04 09:43:56,919 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2025-03-04 09:43:56,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:43:57,141 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:43:57,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:43:57,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919389675] [2025-03-04 09:43:57,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919389675] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:43:57,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [797045378] [2025-03-04 09:43:57,141 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 09:43:57,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:43:57,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:43:57,144 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 09:43:57,145 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 09:43:57,176 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 52 statements into 6 equivalence classes. [2025-03-04 09:43:57,190 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) and asserted 52 of 52 statements. [2025-03-04 09:43:57,190 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2025-03-04 09:43:57,190 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:43:57,191 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-04 09:43:57,192 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:43:57,274 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:43:57,274 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 09:43:57,578 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:43:57,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [797045378] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 09:43:57,578 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 09:43:57,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 34 [2025-03-04 09:43:57,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624388584] [2025-03-04 09:43:57,579 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 09:43:57,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-03-04 09:43:57,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:43:57,579 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-03-04 09:43:57,580 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=971, Unknown=0, NotChecked=0, Total=1190 [2025-03-04 09:43:57,585 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2025-03-04 09:43:57,586 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 304 places, 243 transitions, 6034 flow. Second operand has 35 states, 35 states have (on average 10.057142857142857) internal successors, (352), 35 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:43:57,586 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:43:57,586 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2025-03-04 09:43:57,586 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:43:59,990 INFO L124 PetriNetUnfolderBase]: 3703/7336 cut-off events. [2025-03-04 09:43:59,991 INFO L125 PetriNetUnfolderBase]: For 1947876/1947882 co-relation queries the response was YES. [2025-03-04 09:44:00,032 INFO L83 FinitePrefix]: Finished finitePrefix Result has 95948 conditions, 7336 events. 3703/7336 cut-off events. For 1947876/1947882 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 42987 event pairs, 83 based on Foata normal form. 159/7492 useless extension candidates. Maximal degree in co-relation 95824. Up to 1830 conditions per place. [2025-03-04 09:44:00,065 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 226 selfloop transitions, 275 changer transitions 205/710 dead transitions. [2025-03-04 09:44:00,065 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 357 places, 710 transitions, 23692 flow [2025-03-04 09:44:00,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2025-03-04 09:44:00,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2025-03-04 09:44:00,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 1081 transitions. [2025-03-04 09:44:00,067 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5250121418164158 [2025-03-04 09:44:00,067 INFO L175 Difference]: Start difference. First operand has 304 places, 243 transitions, 6034 flow. Second operand 71 states and 1081 transitions. [2025-03-04 09:44:00,067 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 357 places, 710 transitions, 23692 flow [2025-03-04 09:44:01,850 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 326 places, 710 transitions, 19832 flow, removed 1881 selfloop flow, removed 31 redundant places. [2025-03-04 09:44:01,858 INFO L231 Difference]: Finished difference. Result has 368 places, 304 transitions, 8548 flow [2025-03-04 09:44:01,858 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=4570, PETRI_DIFFERENCE_MINUEND_PLACES=256, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=243, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=215, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=71, PETRI_FLOW=8548, PETRI_PLACES=368, PETRI_TRANSITIONS=304} [2025-03-04 09:44:01,859 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 338 predicate places. [2025-03-04 09:44:01,859 INFO L471 AbstractCegarLoop]: Abstraction has has 368 places, 304 transitions, 8548 flow [2025-03-04 09:44:01,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 10.057142857142857) internal successors, (352), 35 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:44:01,859 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:44:01,859 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:44:01,866 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-04 09:44:02,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-04 09:44:02,060 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 09:44:02,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:44:02,061 INFO L85 PathProgramCache]: Analyzing trace with hash 303633273, now seen corresponding path program 7 times [2025-03-04 09:44:02,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:44:02,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475418283] [2025-03-04 09:44:02,061 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 09:44:02,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:44:02,066 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-04 09:44:02,072 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-04 09:44:02,073 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:44:02,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:44:02,393 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 0 proven. 217 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:44:02,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:44:02,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475418283] [2025-03-04 09:44:02,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475418283] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:44:02,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [993861693] [2025-03-04 09:44:02,394 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 09:44:02,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:44:02,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:44:02,397 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 09:44:02,399 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-04 09:44:02,429 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-04 09:44:02,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-04 09:44:02,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:44:02,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:44:02,445 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-04 09:44:02,447 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:44:02,539 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 0 proven. 217 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:44:02,540 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 09:44:02,910 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 0 proven. 217 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:44:02,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [993861693] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 09:44:02,911 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 09:44:02,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 44 [2025-03-04 09:44:02,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207047272] [2025-03-04 09:44:02,911 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 09:44:02,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2025-03-04 09:44:02,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:44:02,912 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2025-03-04 09:44:02,912 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=461, Invalid=1519, Unknown=0, NotChecked=0, Total=1980 [2025-03-04 09:44:02,917 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2025-03-04 09:44:02,918 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 368 places, 304 transitions, 8548 flow. Second operand has 45 states, 45 states have (on average 10.044444444444444) internal successors, (452), 45 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:44:02,918 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:44:02,918 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2025-03-04 09:44:02,918 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:44:07,456 INFO L124 PetriNetUnfolderBase]: 5458/10754 cut-off events. [2025-03-04 09:44:07,457 INFO L125 PetriNetUnfolderBase]: For 4477878/4477884 co-relation queries the response was YES. [2025-03-04 09:44:07,547 INFO L83 FinitePrefix]: Finished finitePrefix Result has 170400 conditions, 10754 events. 5458/10754 cut-off events. For 4477878/4477884 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 64468 event pairs, 66 based on Foata normal form. 393/11146 useless extension candidates. Maximal degree in co-relation 170251. Up to 2730 conditions per place. [2025-03-04 09:44:07,603 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 313 selfloop transitions, 404 changer transitions 341/1062 dead transitions. [2025-03-04 09:44:07,603 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 455 places, 1062 transitions, 45015 flow [2025-03-04 09:44:07,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2025-03-04 09:44:07,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2025-03-04 09:44:07,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 1599 transitions. [2025-03-04 09:44:07,610 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5251231527093596 [2025-03-04 09:44:07,610 INFO L175 Difference]: Start difference. First operand has 368 places, 304 transitions, 8548 flow. Second operand 105 states and 1599 transitions. [2025-03-04 09:44:07,610 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 455 places, 1062 transitions, 45015 flow [2025-03-04 09:44:11,952 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 419 places, 1062 transitions, 34677 flow, removed 5073 selfloop flow, removed 36 redundant places. [2025-03-04 09:44:11,963 INFO L231 Difference]: Finished difference. Result has 483 places, 435 transitions, 14013 flow [2025-03-04 09:44:11,964 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=6142, PETRI_DIFFERENCE_MINUEND_PLACES=315, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=304, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=275, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=105, PETRI_FLOW=14013, PETRI_PLACES=483, PETRI_TRANSITIONS=435} [2025-03-04 09:44:11,964 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 453 predicate places. [2025-03-04 09:44:11,964 INFO L471 AbstractCegarLoop]: Abstraction has has 483 places, 435 transitions, 14013 flow [2025-03-04 09:44:11,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 10.044444444444444) internal successors, (452), 45 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:44:11,964 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:44:11,965 INFO L206 CegarLoopForPetriNet]: trace histogram [19, 19, 18, 17, 17, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:44:11,970 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-04 09:44:12,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-04 09:44:12,165 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 09:44:12,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:44:12,166 INFO L85 PathProgramCache]: Analyzing trace with hash 1571425393, now seen corresponding path program 8 times [2025-03-04 09:44:12,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:44:12,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994690579] [2025-03-04 09:44:12,167 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 09:44:12,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:44:12,172 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 118 statements into 2 equivalence classes. [2025-03-04 09:44:12,186 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 118 of 118 statements. [2025-03-04 09:44:12,186 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 09:44:12,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:44:12,720 INFO L134 CoverageAnalysis]: Checked inductivity of 752 backedges. 0 proven. 751 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 09:44:12,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:44:12,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994690579] [2025-03-04 09:44:12,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994690579] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:44:12,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1522610082] [2025-03-04 09:44:12,721 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 09:44:12,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:44:12,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:44:12,723 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 09:44:12,724 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-04 09:44:12,758 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 118 statements into 2 equivalence classes. [2025-03-04 09:44:12,777 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 118 of 118 statements. [2025-03-04 09:44:12,777 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 09:44:12,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:44:12,779 INFO L256 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-03-04 09:44:12,780 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:44:12,908 INFO L134 CoverageAnalysis]: Checked inductivity of 752 backedges. 0 proven. 751 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 09:44:12,909 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 09:44:13,386 INFO L134 CoverageAnalysis]: Checked inductivity of 752 backedges. 0 proven. 751 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 09:44:13,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1522610082] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 09:44:13,386 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 09:44:13,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 46 [2025-03-04 09:44:13,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876548405] [2025-03-04 09:44:13,387 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 09:44:13,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2025-03-04 09:44:13,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:44:13,388 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2025-03-04 09:44:13,388 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=467, Invalid=1695, Unknown=0, NotChecked=0, Total=2162 [2025-03-04 09:44:13,392 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2025-03-04 09:44:13,392 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 483 places, 435 transitions, 14013 flow. Second operand has 47 states, 47 states have (on average 10.170212765957446) internal successors, (478), 47 states have internal predecessors, (478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:44:13,392 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:44:13,392 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2025-03-04 09:44:13,392 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:44:20,164 INFO L124 PetriNetUnfolderBase]: 7537/14449 cut-off events. [2025-03-04 09:44:20,165 INFO L125 PetriNetUnfolderBase]: For 8431027/8431033 co-relation queries the response was YES. [2025-03-04 09:44:20,300 INFO L83 FinitePrefix]: Finished finitePrefix Result has 250415 conditions, 14449 events. 7537/14449 cut-off events. For 8431027/8431033 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 86979 event pairs, 65 based on Foata normal form. 60/14506 useless extension candidates. Maximal degree in co-relation 250220. Up to 3417 conditions per place. [2025-03-04 09:44:20,372 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 312 selfloop transitions, 579 changer transitions 195/1090 dead transitions. [2025-03-04 09:44:20,372 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 545 places, 1090 transitions, 50174 flow [2025-03-04 09:44:20,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2025-03-04 09:44:20,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2025-03-04 09:44:20,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 1299 transitions. [2025-03-04 09:44:20,374 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5208500400962309 [2025-03-04 09:44:20,374 INFO L175 Difference]: Start difference. First operand has 483 places, 435 transitions, 14013 flow. Second operand 86 states and 1299 transitions. [2025-03-04 09:44:20,374 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 545 places, 1090 transitions, 50174 flow [2025-03-04 09:44:35,948 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 490 places, 1090 transitions, 32333 flow, removed 8746 selfloop flow, removed 55 redundant places. [2025-03-04 09:44:35,960 INFO L231 Difference]: Finished difference. Result has 510 places, 616 transitions, 15456 flow [2025-03-04 09:44:35,961 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=9074, PETRI_DIFFERENCE_MINUEND_PLACES=405, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=435, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=403, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=86, PETRI_FLOW=15456, PETRI_PLACES=510, PETRI_TRANSITIONS=616} [2025-03-04 09:44:35,961 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 480 predicate places. [2025-03-04 09:44:35,961 INFO L471 AbstractCegarLoop]: Abstraction has has 510 places, 616 transitions, 15456 flow [2025-03-04 09:44:35,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 10.170212765957446) internal successors, (478), 47 states have internal predecessors, (478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:44:35,962 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:44:35,962 INFO L206 CegarLoopForPetriNet]: trace histogram [20, 20, 20, 20, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:44:35,968 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-04 09:44:36,162 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,SelfDestructingSolverStorable17 [2025-03-04 09:44:36,163 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 09:44:36,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:44:36,165 INFO L85 PathProgramCache]: Analyzing trace with hash 994843478, now seen corresponding path program 9 times [2025-03-04 09:44:36,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:44:36,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495605071] [2025-03-04 09:44:36,165 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 09:44:36,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:44:36,170 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 130 statements into 20 equivalence classes. [2025-03-04 09:44:36,198 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) and asserted 130 of 130 statements. [2025-03-04 09:44:36,199 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2025-03-04 09:44:36,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 09:44:36,199 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 09:44:36,201 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-04 09:44:36,212 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-04 09:44:36,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:44:36,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 09:44:36,242 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 09:44:36,243 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 09:44:36,243 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (3 of 4 remaining) [2025-03-04 09:44:36,245 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (2 of 4 remaining) [2025-03-04 09:44:36,245 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2025-03-04 09:44:36,245 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2025-03-04 09:44:36,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-04 09:44:36,245 INFO L422 BasicCegarLoop]: Path program histogram: [9, 3, 2, 2, 1, 1, 1] [2025-03-04 09:44:36,356 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-04 09:44:36,357 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 09:44:36,362 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 09:44:36 BasicIcfg [2025-03-04 09:44:36,363 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 09:44:36,364 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 09:44:36,364 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 09:44:36,364 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 09:44:36,365 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 09:43:40" (3/4) ... [2025-03-04 09:44:36,366 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-04 09:44:36,367 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 09:44:36,368 INFO L158 Benchmark]: Toolchain (without parser) took 56447.90ms. Allocated memory was 142.6MB in the beginning and 1.9GB in the end (delta: 1.8GB). Free memory was 110.9MB in the beginning and 702.4MB in the end (delta: -591.5MB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. [2025-03-04 09:44:36,368 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 226.5MB. Free memory is still 147.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 09:44:36,368 INFO L158 Benchmark]: CACSL2BoogieTranslator took 355.69ms. Allocated memory is still 142.6MB. Free memory was 110.9MB in the beginning and 91.3MB in the end (delta: 19.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 09:44:36,369 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.84ms. Allocated memory is still 142.6MB. Free memory was 91.3MB in the beginning and 90.1MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 09:44:36,369 INFO L158 Benchmark]: Boogie Preprocessor took 30.38ms. Allocated memory is still 142.6MB. Free memory was 90.1MB in the beginning and 88.7MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 09:44:36,369 INFO L158 Benchmark]: IcfgBuilder took 316.67ms. Allocated memory is still 142.6MB. Free memory was 88.7MB in the beginning and 70.2MB in the end (delta: 18.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 09:44:36,370 INFO L158 Benchmark]: TraceAbstraction took 55710.83ms. Allocated memory was 142.6MB in the beginning and 1.9GB in the end (delta: 1.8GB). Free memory was 69.7MB in the beginning and 702.7MB in the end (delta: -633.1MB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. [2025-03-04 09:44:36,370 INFO L158 Benchmark]: Witness Printer took 3.47ms. Allocated memory is still 1.9GB. Free memory was 702.7MB in the beginning and 702.4MB in the end (delta: 291.4kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 09:44:36,371 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 226.5MB. Free memory is still 147.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 355.69ms. Allocated memory is still 142.6MB. Free memory was 110.9MB in the beginning and 91.3MB in the end (delta: 19.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.84ms. Allocated memory is still 142.6MB. Free memory was 91.3MB in the beginning and 90.1MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 30.38ms. Allocated memory is still 142.6MB. Free memory was 90.1MB in the beginning and 88.7MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 316.67ms. Allocated memory is still 142.6MB. Free memory was 88.7MB in the beginning and 70.2MB in the end (delta: 18.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 55710.83ms. Allocated memory was 142.6MB in the beginning and 1.9GB in the end (delta: 1.8GB). Free memory was 69.7MB in the beginning and 702.7MB in the end (delta: -633.1MB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. * Witness Printer took 3.47ms. Allocated memory is still 1.9GB. Free memory was 702.7MB in the beginning and 702.4MB in the end (delta: 291.4kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 693]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 693. Possible FailurePath: [L694] 0 int i = 3, j = 6; [L712] 0 pthread_t id1, id2; [L713] FCALL, FORK 0 pthread_create(&id1, ((void *)0), t1, ((void *)0)) VAL [\old(arg)={0:0}, \old(argc)=51, \old(argv)={49:50}, argc=51, i=3, id1=2, j=6] [L696] 1 int k = 0; VAL [\old(arg)={0:0}, arg={0:0}, i=3, j=6, k=0] [L696] COND TRUE 1 k < 20 VAL [\old(arg)={0:0}, arg={0:0}, i=3, j=6, k=0] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, arg={0:0}, i=7, j=6, k=0] [L714] FCALL, FORK 0 pthread_create(&id2, ((void *)0), t2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(argc)=51, \old(argv)={49:50}, arg={0:0}, argc=51, i=7, id1=2, id2=3, j=6, k=0] [L704] 2 int k = 0; VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=7, j=6, k=0, k=0] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=7, j=6, k=0, k=1] [L704] COND TRUE 2 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=7, j=6, k=0, k=1] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=7, j=8, k=0, k=1] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=7, j=8, k=1, k=1] [L696] COND TRUE 1 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=7, j=8, k=1, k=1] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=9, j=8, k=1, k=1] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=9, j=8, k=1, k=2] [L696] COND TRUE 1 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=9, j=8, k=1, k=2] [L704] COND TRUE 2 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=9, j=8, k=1, k=2] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=9, j=10, k=1, k=2] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=9, j=10, k=2, k=2] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=11, j=10, k=2, k=2] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=11, j=10, k=2, k=3] [L696] COND TRUE 1 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=11, j=10, k=2, k=3] [L704] COND TRUE 2 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=11, j=10, k=2, k=3] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=11, j=12, k=2, k=3] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=11, j=12, k=3, k=3] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=13, j=12, k=3, k=3] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=13, j=12, k=3, k=4] [L704] COND TRUE 2 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=13, j=12, k=3, k=4] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=13, j=14, k=3, k=4] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=13, j=14, k=4, k=4] [L696] COND TRUE 1 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=13, j=14, k=4, k=4] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=15, j=14, k=4, k=4] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=15, j=14, k=4, k=5] [L696] COND TRUE 1 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=15, j=14, k=4, k=5] [L704] COND TRUE 2 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=15, j=14, k=4, k=5] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=15, j=16, k=4, k=5] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=15, j=16, k=5, k=5] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=17, j=16, k=5, k=5] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=17, j=16, k=5, k=6] [L704] COND TRUE 2 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=17, j=16, k=5, k=6] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=17, j=18, k=5, k=6] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=17, j=18, k=6, k=6] [L696] COND TRUE 1 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=17, j=18, k=6, k=6] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=19, j=18, k=6, k=6] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=19, j=18, k=6, k=7] [L704] COND TRUE 2 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=19, j=18, k=6, k=7] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=19, j=20, k=6, k=7] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=19, j=20, k=7, k=7] [L696] COND TRUE 1 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=19, j=20, k=7, k=7] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=21, j=20, k=7, k=7] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=21, j=20, k=7, k=8] [L704] COND TRUE 2 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=21, j=20, k=7, k=8] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=21, j=22, k=7, k=8] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=21, j=22, k=8, k=8] [L696] COND TRUE 1 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=21, j=22, k=8, k=8] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=23, j=22, k=8, k=8] [L704] COND TRUE 2 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=23, j=22, k=8, k=8] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=23, j=22, k=8, k=9] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=23, j=24, k=8, k=9] [L696] COND TRUE 1 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=23, j=24, k=8, k=9] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=23, j=24, k=9, k=9] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=25, j=24, k=9, k=9] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=25, j=24, k=10, k=9] [L704] COND TRUE 2 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=25, j=24, k=10, k=9] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=25, j=26, k=10, k=9] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=25, j=26, k=10, k=10] [L696] COND TRUE 1 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=25, j=26, k=10, k=10] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=27, j=26, k=10, k=10] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=27, j=26, k=10, k=11] [L704] COND TRUE 2 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=27, j=26, k=10, k=11] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=27, j=28, k=10, k=11] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=27, j=28, k=11, k=11] [L704] COND TRUE 2 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=27, j=28, k=11, k=11] [L696] COND TRUE 1 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=27, j=28, k=11, k=11] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=29, j=28, k=11, k=11] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=29, j=28, k=11, k=12] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=29, j=30, k=11, k=12] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=29, j=30, k=12, k=12] [L696] COND TRUE 1 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=29, j=30, k=12, k=12] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=31, j=30, k=12, k=12] [L704] COND TRUE 2 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=31, j=30, k=12, k=12] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=31, j=30, k=12, k=13] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=31, j=32, k=12, k=13] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=31, j=32, k=13, k=13] [L704] COND TRUE 2 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=31, j=32, k=13, k=13] [L696] COND TRUE 1 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=31, j=32, k=13, k=13] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=33, j=32, k=13, k=13] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=33, j=32, k=13, k=14] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=33, j=34, k=13, k=14] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=33, j=34, k=14, k=14] [L696] COND TRUE 1 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=33, j=34, k=14, k=14] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=35, j=34, k=14, k=14] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=35, j=34, k=14, k=15] [L696] COND TRUE 1 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=35, j=34, k=14, k=15] [L704] COND TRUE 2 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=35, j=34, k=14, k=15] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=35, j=36, k=14, k=15] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=35, j=36, k=15, k=15] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=37, j=36, k=15, k=15] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=37, j=36, k=15, k=16] [L704] COND TRUE 2 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=37, j=36, k=15, k=16] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=37, j=38, k=15, k=16] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=37, j=38, k=16, k=16] [L696] COND TRUE 1 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=37, j=38, k=16, k=16] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=39, j=38, k=16, k=16] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=39, j=38, k=16, k=17] [L704] COND TRUE 2 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=39, j=38, k=16, k=17] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=39, j=40, k=16, k=17] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=39, j=40, k=17, k=17] [L704] COND TRUE 2 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=39, j=40, k=17, k=17] [L696] COND TRUE 1 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=39, j=40, k=17, k=17] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=41, j=40, k=17, k=17] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=41, j=40, k=17, k=18] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=41, j=42, k=17, k=18] [L696] COND TRUE 1 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=41, j=42, k=17, k=18] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=41, j=42, k=18, k=18] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=43, j=42, k=18, k=18] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=43, j=42, k=18, k=19] [L696] COND TRUE 1 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=43, j=42, k=18, k=19] [L704] COND TRUE 2 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=43, j=42, k=18, k=19] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=43, j=44, k=18, k=19] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=43, j=44, k=19, k=19] [L716] 0 int condI = i >= (2*20 +6); VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(argc)=51, \old(argv)={49:50}, arg={0:0}, arg={0:0}, argc=51, condI=0, i=43, id1=2, id2=3, j=44, k=19, k=19] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=45, j=44, k=19, k=19] [L704] COND TRUE 2 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=45, j=44, k=19, k=19] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=45, j=46, k=19, k=19] [L719] 0 int condJ = j >= (2*20 +6); VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(argc)=51, \old(argv)={49:50}, arg={0:0}, arg={0:0}, argc=51, condI=0, condJ=1, i=45, id1=2, id2=3, j=46, k=19, k=19] [L721] COND TRUE 0 condI || condJ [L722] CALL 0 reach_error() [L693] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=45, j=46, k=19, k=19] [L693] 0 __assert_fail ("0", "triangular-longest-2.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=45, j=46, k=19, k=19] - UnprovableResult [Line: 711]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 714]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 713]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 38 locations, 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: 55.5s, OverallIterations: 19, TraceHistogramMax: 20, PathProgramHistogramMax: 9, EmptinessCheckTime: 0.0s, AutomataDifference: 46.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 8389 SdHoareTripleChecker+Valid, 4.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 8386 mSDsluCounter, 21 SdHoareTripleChecker+Invalid, 3.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 20 mSDsCounter, 452 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7147 IncrementalHoareTripleChecker+Invalid, 7599 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 452 mSolverCounterUnsat, 1 mSDtfsCounter, 7147 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1593 GetRequests, 769 SyntacticMatches, 31 SemanticMatches, 793 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22461 ImplicationChecksByTransitivity, 8.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=15456occurred in iteration=18, InterpolantAutomatonStates: 589, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 6.0s InterpolantComputationTime, 1157 NumberOfCodeBlocks, 1157 NumberOfCodeBlocksAsserted, 82 NumberOfCheckSat, 1446 ConstructedInterpolants, 0 QuantifiedInterpolants, 5729 SizeOfPredicates, 128 NumberOfNonLiveVariables, 1355 ConjunctsInSsa, 180 ConjunctsInUnsatCore, 38 InterpolantComputations, 8 PerfectInterpolantSequences, 4/3621 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-04 09:44:36,387 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 Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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/pthread/triangular-longest-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.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 874fb84f685baf0441a9bf8db1864605baa10908128545fe3028b9b499246108 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 09:44:38,380 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 09:44:38,487 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2025-03-04 09:44:38,495 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 09:44:38,495 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 09:44:38,522 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 09:44:38,524 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 09:44:38,524 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 09:44:38,524 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 09:44:38,524 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 09:44:38,524 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 09:44:38,525 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 09:44:38,525 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 09:44:38,525 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 09:44:38,525 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 09:44:38,526 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 09:44:38,526 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 09:44:38,526 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 09:44:38,526 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 09:44:38,526 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 09:44:38,526 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 09:44:38,526 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 09:44:38,526 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-04 09:44:38,526 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 09:44:38,526 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 09:44:38,526 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-04 09:44:38,526 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-04 09:44:38,526 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 09:44:38,526 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 09:44:38,526 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 09:44:38,526 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 09:44:38,526 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 09:44:38,526 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 09:44:38,526 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 09:44:38,526 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 09:44:38,526 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 09:44:38,527 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 09:44:38,527 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 09:44:38,527 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-04 09:44:38,527 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-04 09:44:38,527 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 09:44:38,527 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 09:44:38,527 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 09:44:38,527 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 09:44:38,527 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 -> 874fb84f685baf0441a9bf8db1864605baa10908128545fe3028b9b499246108 [2025-03-04 09:44:38,816 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 09:44:38,823 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 09:44:38,824 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 09:44:38,825 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 09:44:38,825 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 09:44:38,826 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread/triangular-longest-2.i [2025-03-04 09:44:39,941 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f641bde1/2297871236604b71a16ce585b60565f8/FLAGc06499e54 [2025-03-04 09:44:40,202 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 09:44:40,203 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/triangular-longest-2.i [2025-03-04 09:44:40,216 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f641bde1/2297871236604b71a16ce585b60565f8/FLAGc06499e54 [2025-03-04 09:44:40,524 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f641bde1/2297871236604b71a16ce585b60565f8 [2025-03-04 09:44:40,526 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 09:44:40,528 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 09:44:40,529 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 09:44:40,529 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 09:44:40,532 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 09:44:40,532 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 09:44:40" (1/1) ... [2025-03-04 09:44:40,533 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4baae7d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:44:40, skipping insertion in model container [2025-03-04 09:44:40,533 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 09:44:40" (1/1) ... [2025-03-04 09:44:40,553 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 09:44:40,743 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 09:44:40,753 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 09:44:40,785 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 09:44:40,810 INFO L204 MainTranslator]: Completed translation [2025-03-04 09:44:40,810 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:44:40 WrapperNode [2025-03-04 09:44:40,811 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 09:44:40,811 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 09:44:40,811 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 09:44:40,811 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 09:44:40,816 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:44:40" (1/1) ... [2025-03-04 09:44:40,825 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:44:40" (1/1) ... [2025-03-04 09:44:40,838 INFO L138 Inliner]: procedures = 169, calls = 17, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 40 [2025-03-04 09:44:40,840 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 09:44:40,841 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 09:44:40,841 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 09:44:40,841 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 09:44:40,846 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:44:40" (1/1) ... [2025-03-04 09:44:40,846 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:44:40" (1/1) ... [2025-03-04 09:44:40,850 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:44:40" (1/1) ... [2025-03-04 09:44:40,861 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-04 09:44:40,865 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:44:40" (1/1) ... [2025-03-04 09:44:40,865 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:44:40" (1/1) ... [2025-03-04 09:44:40,872 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:44:40" (1/1) ... [2025-03-04 09:44:40,876 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:44:40" (1/1) ... [2025-03-04 09:44:40,877 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:44:40" (1/1) ... [2025-03-04 09:44:40,879 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:44:40" (1/1) ... [2025-03-04 09:44:40,880 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 09:44:40,882 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 09:44:40,882 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 09:44:40,882 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 09:44:40,883 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:44:40" (1/1) ... [2025-03-04 09:44:40,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 09:44:40,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:44:40,916 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 09:44:40,918 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 09:44:40,937 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2025-03-04 09:44:40,937 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2025-03-04 09:44:40,938 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2025-03-04 09:44:40,938 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2025-03-04 09:44:40,938 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-04 09:44:40,938 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 09:44:40,938 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-04 09:44:40,938 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-04 09:44:40,938 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 09:44:40,938 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 09:44:40,939 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 09:44:41,023 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 09:44:41,025 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 09:44:41,157 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 09:44:41,157 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 09:44:41,236 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 09:44:41,236 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 09:44:41,236 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 09:44:41 BoogieIcfgContainer [2025-03-04 09:44:41,238 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 09:44:41,241 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 09:44:41,241 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 09:44:41,245 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 09:44:41,245 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 09:44:40" (1/3) ... [2025-03-04 09:44:41,245 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a02e30b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 09:44:41, skipping insertion in model container [2025-03-04 09:44:41,245 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:44:40" (2/3) ... [2025-03-04 09:44:41,246 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a02e30b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 09:44:41, skipping insertion in model container [2025-03-04 09:44:41,246 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 09:44:41" (3/3) ... [2025-03-04 09:44:41,246 INFO L128 eAbstractionObserver]: Analyzing ICFG triangular-longest-2.i [2025-03-04 09:44:41,257 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 09:44:41,259 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG triangular-longest-2.i that has 3 procedures, 26 locations, 1 initial locations, 2 loop locations, and 2 error locations. [2025-03-04 09:44:41,259 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 09:44:41,292 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-04 09:44:41,318 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 29 transitions, 66 flow [2025-03-04 09:44:41,352 INFO L124 PetriNetUnfolderBase]: 4/27 cut-off events. [2025-03-04 09:44:41,354 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 09:44:41,357 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34 conditions, 27 events. 4/27 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 37 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 27. Up to 2 conditions per place. [2025-03-04 09:44:41,357 INFO L82 GeneralOperation]: Start removeDead. Operand has 32 places, 29 transitions, 66 flow [2025-03-04 09:44:41,359 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 30 places, 27 transitions, 60 flow [2025-03-04 09:44:41,368 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 09:44:41,375 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;@509124f4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 09:44:41,376 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-03-04 09:44:41,384 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 09:44:41,384 INFO L124 PetriNetUnfolderBase]: 4/24 cut-off events. [2025-03-04 09:44:41,384 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 09:44:41,384 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:44:41,385 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:44:41,385 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 09:44:41,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:44:41,390 INFO L85 PathProgramCache]: Analyzing trace with hash -1483129001, now seen corresponding path program 1 times [2025-03-04 09:44:41,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 09:44:41,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1916478085] [2025-03-04 09:44:41,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:44:41,401 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:44:41,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:44:41,403 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 09:44:41,404 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 09:44:41,463 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 09:44:41,474 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 09:44:41,474 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:44:41,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:44:41,476 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 09:44:41,478 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:44:41,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:44:41,515 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 09:44:41,516 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 09:44:41,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1916478085] [2025-03-04 09:44:41,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1916478085] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:44:41,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:44:41,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 09:44:41,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664385993] [2025-03-04 09:44:41,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:44:41,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:44:41,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 09:44:41,542 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:44:41,542 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:44:41,543 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2025-03-04 09:44:41,546 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 27 transitions, 60 flow. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:44:41,546 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:44:41,546 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2025-03-04 09:44:41,546 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:44:41,635 INFO L124 PetriNetUnfolderBase]: 185/363 cut-off events. [2025-03-04 09:44:41,635 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-04 09:44:41,637 INFO L83 FinitePrefix]: Finished finitePrefix Result has 667 conditions, 363 events. 185/363 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1602 event pairs, 135 based on Foata normal form. 32/390 useless extension candidates. Maximal degree in co-relation 657. Up to 290 conditions per place. [2025-03-04 09:44:41,640 INFO L140 encePairwiseOnDemand]: 25/29 looper letters, 15 selfloop transitions, 1 changer transitions 1/23 dead transitions. [2025-03-04 09:44:41,640 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 23 transitions, 86 flow [2025-03-04 09:44:41,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:44:41,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 09:44:41,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 44 transitions. [2025-03-04 09:44:41,648 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5057471264367817 [2025-03-04 09:44:41,649 INFO L175 Difference]: Start difference. First operand has 30 places, 27 transitions, 60 flow. Second operand 3 states and 44 transitions. [2025-03-04 09:44:41,650 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 23 transitions, 86 flow [2025-03-04 09:44:41,652 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 23 transitions, 84 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 09:44:41,653 INFO L231 Difference]: Finished difference. Result has 28 places, 22 transitions, 50 flow [2025-03-04 09:44:41,654 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=50, PETRI_PLACES=28, PETRI_TRANSITIONS=22} [2025-03-04 09:44:41,656 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, -2 predicate places. [2025-03-04 09:44:41,656 INFO L471 AbstractCegarLoop]: Abstraction has has 28 places, 22 transitions, 50 flow [2025-03-04 09:44:41,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:44:41,656 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:44:41,657 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:44:41,664 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 09:44:41,858 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 [2025-03-04 09:44:41,858 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 09:44:41,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:44:41,859 INFO L85 PathProgramCache]: Analyzing trace with hash -1483128502, now seen corresponding path program 1 times [2025-03-04 09:44:41,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 09:44:41,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [221791565] [2025-03-04 09:44:41,859 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:44:41,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:44:41,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:44:41,862 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 09:44:41,862 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 09:44:41,899 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 09:44:41,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 09:44:41,906 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:44:41,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:44:41,907 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 09:44:41,908 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:44:41,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:44:41,984 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 09:44:41,984 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 09:44:41,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [221791565] [2025-03-04 09:44:41,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [221791565] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:44:41,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:44:41,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 09:44:41,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765704935] [2025-03-04 09:44:41,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:44:41,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 09:44:41,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 09:44:41,986 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 09:44:41,986 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 09:44:41,987 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2025-03-04 09:44:41,987 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 22 transitions, 50 flow. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:44:41,987 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:44:41,987 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2025-03-04 09:44:41,987 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:44:42,201 INFO L124 PetriNetUnfolderBase]: 328/596 cut-off events. [2025-03-04 09:44:42,202 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 09:44:42,203 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1129 conditions, 596 events. 328/596 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 2646 event pairs, 45 based on Foata normal form. 0/580 useless extension candidates. Maximal degree in co-relation 1123. Up to 243 conditions per place. [2025-03-04 09:44:42,206 INFO L140 encePairwiseOnDemand]: 22/29 looper letters, 29 selfloop transitions, 7 changer transitions 29/69 dead transitions. [2025-03-04 09:44:42,206 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 69 transitions, 274 flow [2025-03-04 09:44:42,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 09:44:42,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 09:44:42,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 131 transitions. [2025-03-04 09:44:42,209 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5646551724137931 [2025-03-04 09:44:42,209 INFO L175 Difference]: Start difference. First operand has 28 places, 22 transitions, 50 flow. Second operand 8 states and 131 transitions. [2025-03-04 09:44:42,209 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 69 transitions, 274 flow [2025-03-04 09:44:42,209 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 69 transitions, 273 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 09:44:42,212 INFO L231 Difference]: Finished difference. Result has 39 places, 26 transitions, 100 flow [2025-03-04 09:44:42,212 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=49, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=100, PETRI_PLACES=39, PETRI_TRANSITIONS=26} [2025-03-04 09:44:42,213 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 9 predicate places. [2025-03-04 09:44:42,213 INFO L471 AbstractCegarLoop]: Abstraction has has 39 places, 26 transitions, 100 flow [2025-03-04 09:44:42,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:44:42,213 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:44:42,213 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:44:42,219 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 09:44:42,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:44:42,414 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 09:44:42,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:44:42,415 INFO L85 PathProgramCache]: Analyzing trace with hash 284669415, now seen corresponding path program 1 times [2025-03-04 09:44:42,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 09:44:42,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [733073804] [2025-03-04 09:44:42,415 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:44:42,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:44:42,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:44:42,417 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 09:44:42,418 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 09:44:42,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 09:44:42,459 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 09:44:42,460 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:44:42,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:44:42,461 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 09:44:42,462 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:44:42,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:44:42,514 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 09:44:42,514 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 09:44:42,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [733073804] [2025-03-04 09:44:42,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [733073804] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:44:42,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:44:42,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 09:44:42,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61152511] [2025-03-04 09:44:42,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:44:42,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 09:44:42,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 09:44:42,515 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 09:44:42,515 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 09:44:42,517 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2025-03-04 09:44:42,517 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 26 transitions, 100 flow. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:44:42,517 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:44:42,517 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2025-03-04 09:44:42,517 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:44:42,673 INFO L124 PetriNetUnfolderBase]: 247/458 cut-off events. [2025-03-04 09:44:42,673 INFO L125 PetriNetUnfolderBase]: For 414/420 co-relation queries the response was YES. [2025-03-04 09:44:42,674 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1187 conditions, 458 events. 247/458 cut-off events. For 414/420 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1851 event pairs, 48 based on Foata normal form. 18/475 useless extension candidates. Maximal degree in co-relation 1174. Up to 190 conditions per place. [2025-03-04 09:44:42,676 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 30 selfloop transitions, 9 changer transitions 16/59 dead transitions. [2025-03-04 09:44:42,677 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 59 transitions, 316 flow [2025-03-04 09:44:42,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 09:44:42,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 09:44:42,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 110 transitions. [2025-03-04 09:44:42,678 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.541871921182266 [2025-03-04 09:44:42,678 INFO L175 Difference]: Start difference. First operand has 39 places, 26 transitions, 100 flow. Second operand 7 states and 110 transitions. [2025-03-04 09:44:42,678 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 59 transitions, 316 flow [2025-03-04 09:44:42,681 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 59 transitions, 312 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-03-04 09:44:42,681 INFO L231 Difference]: Finished difference. Result has 42 places, 29 transitions, 143 flow [2025-03-04 09:44:42,682 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=143, PETRI_PLACES=42, PETRI_TRANSITIONS=29} [2025-03-04 09:44:42,684 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 12 predicate places. [2025-03-04 09:44:42,684 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 29 transitions, 143 flow [2025-03-04 09:44:42,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:44:42,685 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:44:42,685 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:44:42,691 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-04 09:44:42,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:44:42,886 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 09:44:42,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:44:42,886 INFO L85 PathProgramCache]: Analyzing trace with hash 92675750, now seen corresponding path program 1 times [2025-03-04 09:44:42,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 09:44:42,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [41355460] [2025-03-04 09:44:42,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:44:42,887 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:44:42,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:44:42,889 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 09:44:42,889 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 09:44:42,922 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 09:44:42,928 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 09:44:42,928 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:44:42,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:44:42,929 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 09:44:42,930 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:44:42,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:44:42,982 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 09:44:42,982 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 09:44:42,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [41355460] [2025-03-04 09:44:42,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [41355460] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:44:42,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:44:42,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 09:44:42,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268625063] [2025-03-04 09:44:42,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:44:42,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 09:44:42,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 09:44:42,983 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 09:44:42,983 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 09:44:42,984 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2025-03-04 09:44:42,985 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 29 transitions, 143 flow. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:44:42,985 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:44:42,985 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2025-03-04 09:44:42,985 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:44:43,169 INFO L124 PetriNetUnfolderBase]: 391/731 cut-off events. [2025-03-04 09:44:43,169 INFO L125 PetriNetUnfolderBase]: For 1182/1188 co-relation queries the response was YES. [2025-03-04 09:44:43,170 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2121 conditions, 731 events. 391/731 cut-off events. For 1182/1188 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 3253 event pairs, 89 based on Foata normal form. 33/763 useless extension candidates. Maximal degree in co-relation 2104. Up to 264 conditions per place. [2025-03-04 09:44:43,173 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 47 selfloop transitions, 11 changer transitions 20/82 dead transitions. [2025-03-04 09:44:43,173 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 82 transitions, 517 flow [2025-03-04 09:44:43,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 09:44:43,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 09:44:43,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 144 transitions. [2025-03-04 09:44:43,174 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5517241379310345 [2025-03-04 09:44:43,174 INFO L175 Difference]: Start difference. First operand has 42 places, 29 transitions, 143 flow. Second operand 9 states and 144 transitions. [2025-03-04 09:44:43,174 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 82 transitions, 517 flow [2025-03-04 09:44:43,178 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 82 transitions, 478 flow, removed 17 selfloop flow, removed 3 redundant places. [2025-03-04 09:44:43,179 INFO L231 Difference]: Finished difference. Result has 52 places, 36 transitions, 236 flow [2025-03-04 09:44:43,179 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=236, PETRI_PLACES=52, PETRI_TRANSITIONS=36} [2025-03-04 09:44:43,180 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 22 predicate places. [2025-03-04 09:44:43,180 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 36 transitions, 236 flow [2025-03-04 09:44:43,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:44:43,180 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:44:43,180 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:44:43,190 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-04 09:44:43,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:44:43,381 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 09:44:43,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:44:43,381 INFO L85 PathProgramCache]: Analyzing trace with hash 89107874, now seen corresponding path program 2 times [2025-03-04 09:44:43,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 09:44:43,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1618219471] [2025-03-04 09:44:43,382 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 09:44:43,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:44:43,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:44:43,385 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 09:44:43,386 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 09:44:43,418 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 1 equivalence classes. [2025-03-04 09:44:43,424 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 09:44:43,424 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 09:44:43,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:44:43,424 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 09:44:43,425 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:44:43,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:44:43,474 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 09:44:43,475 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 09:44:43,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1618219471] [2025-03-04 09:44:43,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1618219471] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:44:43,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:44:43,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 09:44:43,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597796163] [2025-03-04 09:44:43,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:44:43,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 09:44:43,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 09:44:43,478 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 09:44:43,478 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 09:44:43,480 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2025-03-04 09:44:43,481 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 36 transitions, 236 flow. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:44:43,481 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:44:43,481 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2025-03-04 09:44:43,481 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:44:43,687 INFO L124 PetriNetUnfolderBase]: 346/661 cut-off events. [2025-03-04 09:44:43,687 INFO L125 PetriNetUnfolderBase]: For 2134/2140 co-relation queries the response was YES. [2025-03-04 09:44:43,689 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2195 conditions, 661 events. 346/661 cut-off events. For 2134/2140 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2921 event pairs, 82 based on Foata normal form. 45/705 useless extension candidates. Maximal degree in co-relation 2172. Up to 273 conditions per place. [2025-03-04 09:44:43,691 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 40 selfloop transitions, 12 changer transitions 30/86 dead transitions. [2025-03-04 09:44:43,691 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 86 transitions, 655 flow [2025-03-04 09:44:43,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 09:44:43,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 09:44:43,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 140 transitions. [2025-03-04 09:44:43,693 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5363984674329502 [2025-03-04 09:44:43,694 INFO L175 Difference]: Start difference. First operand has 52 places, 36 transitions, 236 flow. Second operand 9 states and 140 transitions. [2025-03-04 09:44:43,694 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 86 transitions, 655 flow [2025-03-04 09:44:43,698 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 86 transitions, 595 flow, removed 30 selfloop flow, removed 2 redundant places. [2025-03-04 09:44:43,699 INFO L231 Difference]: Finished difference. Result has 60 places, 39 transitions, 278 flow [2025-03-04 09:44:43,699 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=278, PETRI_PLACES=60, PETRI_TRANSITIONS=39} [2025-03-04 09:44:43,700 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 30 predicate places. [2025-03-04 09:44:43,700 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 39 transitions, 278 flow [2025-03-04 09:44:43,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:44:43,700 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:44:43,700 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:44:43,707 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-04 09:44:43,900 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 [2025-03-04 09:44:43,901 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 09:44:43,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:44:43,902 INFO L85 PathProgramCache]: Analyzing trace with hash 146694531, now seen corresponding path program 1 times [2025-03-04 09:44:43,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 09:44:43,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1405563316] [2025-03-04 09:44:43,902 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:44:43,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:44:43,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:44:43,904 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 09:44:43,905 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 09:44:43,940 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 09:44:43,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 09:44:43,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:44:43,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:44:43,947 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 09:44:43,948 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:44:44,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:44:44,006 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 09:44:44,006 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 09:44:44,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1405563316] [2025-03-04 09:44:44,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1405563316] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:44:44,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:44:44,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 09:44:44,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891874717] [2025-03-04 09:44:44,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:44:44,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 09:44:44,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 09:44:44,007 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 09:44:44,007 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-04 09:44:44,012 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2025-03-04 09:44:44,012 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 39 transitions, 278 flow. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:44:44,012 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:44:44,012 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2025-03-04 09:44:44,012 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:44:44,264 INFO L124 PetriNetUnfolderBase]: 526/1004 cut-off events. [2025-03-04 09:44:44,264 INFO L125 PetriNetUnfolderBase]: For 4650/4656 co-relation queries the response was YES. [2025-03-04 09:44:44,266 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3670 conditions, 1004 events. 526/1004 cut-off events. For 4650/4656 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 4920 event pairs, 116 based on Foata normal form. 27/1030 useless extension candidates. Maximal degree in co-relation 3642. Up to 331 conditions per place. [2025-03-04 09:44:44,269 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 64 selfloop transitions, 15 changer transitions 25/108 dead transitions. [2025-03-04 09:44:44,269 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 108 transitions, 884 flow [2025-03-04 09:44:44,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 09:44:44,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-04 09:44:44,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 190 transitions. [2025-03-04 09:44:44,271 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5459770114942529 [2025-03-04 09:44:44,271 INFO L175 Difference]: Start difference. First operand has 60 places, 39 transitions, 278 flow. Second operand 12 states and 190 transitions. [2025-03-04 09:44:44,271 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 108 transitions, 884 flow [2025-03-04 09:44:44,276 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 108 transitions, 838 flow, removed 17 selfloop flow, removed 4 redundant places. [2025-03-04 09:44:44,277 INFO L231 Difference]: Finished difference. Result has 71 places, 45 transitions, 382 flow [2025-03-04 09:44:44,277 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=248, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=382, PETRI_PLACES=71, PETRI_TRANSITIONS=45} [2025-03-04 09:44:44,277 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 41 predicate places. [2025-03-04 09:44:44,277 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 45 transitions, 382 flow [2025-03-04 09:44:44,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:44:44,278 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:44:44,278 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:44:44,284 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-04 09:44:44,478 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 [2025-03-04 09:44:44,478 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 09:44:44,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:44:44,479 INFO L85 PathProgramCache]: Analyzing trace with hash 1157274665, now seen corresponding path program 2 times [2025-03-04 09:44:44,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 09:44:44,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [462278086] [2025-03-04 09:44:44,480 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 09:44:44,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:44:44,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:44:44,482 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 09:44:44,483 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 09:44:44,517 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 1 equivalence classes. [2025-03-04 09:44:44,525 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 09:44:44,525 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 09:44:44,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:44:44,526 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 09:44:44,527 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:44:44,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:44:44,583 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 09:44:44,583 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 09:44:44,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [462278086] [2025-03-04 09:44:44,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [462278086] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:44:44,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:44:44,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 09:44:44,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616638779] [2025-03-04 09:44:44,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:44:44,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 09:44:44,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 09:44:44,585 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 09:44:44,585 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-04 09:44:44,587 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2025-03-04 09:44:44,587 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 45 transitions, 382 flow. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:44:44,588 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:44:44,588 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2025-03-04 09:44:44,588 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:44:44,823 INFO L124 PetriNetUnfolderBase]: 481/936 cut-off events. [2025-03-04 09:44:44,823 INFO L125 PetriNetUnfolderBase]: For 7976/7982 co-relation queries the response was YES. [2025-03-04 09:44:44,825 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3897 conditions, 936 events. 481/936 cut-off events. For 7976/7982 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 4615 event pairs, 126 based on Foata normal form. 45/980 useless extension candidates. Maximal degree in co-relation 3864. Up to 340 conditions per place. [2025-03-04 09:44:44,828 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 53 selfloop transitions, 15 changer transitions 29/101 dead transitions. [2025-03-04 09:44:44,828 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 101 transitions, 1009 flow [2025-03-04 09:44:44,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 09:44:44,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 09:44:44,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 158 transitions. [2025-03-04 09:44:44,829 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5448275862068965 [2025-03-04 09:44:44,829 INFO L175 Difference]: Start difference. First operand has 71 places, 45 transitions, 382 flow. Second operand 10 states and 158 transitions. [2025-03-04 09:44:44,829 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 101 transitions, 1009 flow [2025-03-04 09:44:44,836 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 101 transitions, 836 flow, removed 76 selfloop flow, removed 8 redundant places. [2025-03-04 09:44:44,837 INFO L231 Difference]: Finished difference. Result has 74 places, 48 transitions, 387 flow [2025-03-04 09:44:44,837 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=306, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=387, PETRI_PLACES=74, PETRI_TRANSITIONS=48} [2025-03-04 09:44:44,838 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 44 predicate places. [2025-03-04 09:44:44,838 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 48 transitions, 387 flow [2025-03-04 09:44:44,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:44:44,838 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:44:44,838 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:44:44,845 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-04 09:44:45,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:44:45,042 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 09:44:45,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:44:45,042 INFO L85 PathProgramCache]: Analyzing trace with hash 1853511785, now seen corresponding path program 3 times [2025-03-04 09:44:45,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 09:44:45,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [317566632] [2025-03-04 09:44:45,043 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 09:44:45,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:44:45,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:44:45,045 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 09:44:45,046 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 09:44:45,086 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 16 statements into 1 equivalence classes. [2025-03-04 09:44:45,092 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 09:44:45,092 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 09:44:45,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:44:45,093 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 09:44:45,094 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:44:45,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:44:45,172 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 09:44:45,172 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 09:44:45,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [317566632] [2025-03-04 09:44:45,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [317566632] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:44:45,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:44:45,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 09:44:45,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744810725] [2025-03-04 09:44:45,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:44:45,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 09:44:45,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 09:44:45,173 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 09:44:45,173 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 09:44:45,177 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2025-03-04 09:44:45,177 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 48 transitions, 387 flow. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:44:45,177 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:44:45,177 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2025-03-04 09:44:45,177 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:44:45,396 INFO L124 PetriNetUnfolderBase]: 436/842 cut-off events. [2025-03-04 09:44:45,396 INFO L125 PetriNetUnfolderBase]: For 6421/6427 co-relation queries the response was YES. [2025-03-04 09:44:45,399 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3361 conditions, 842 events. 436/842 cut-off events. For 6421/6427 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 4073 event pairs, 152 based on Foata normal form. 33/874 useless extension candidates. Maximal degree in co-relation 3327. Up to 555 conditions per place. [2025-03-04 09:44:45,401 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 54 selfloop transitions, 9 changer transitions 29/96 dead transitions. [2025-03-04 09:44:45,401 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 96 transitions, 875 flow [2025-03-04 09:44:45,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 09:44:45,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 09:44:45,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 153 transitions. [2025-03-04 09:44:45,402 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5275862068965518 [2025-03-04 09:44:45,402 INFO L175 Difference]: Start difference. First operand has 74 places, 48 transitions, 387 flow. Second operand 10 states and 153 transitions. [2025-03-04 09:44:45,403 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 96 transitions, 875 flow [2025-03-04 09:44:45,410 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 96 transitions, 828 flow, removed 14 selfloop flow, removed 5 redundant places. [2025-03-04 09:44:45,412 INFO L231 Difference]: Finished difference. Result has 80 places, 50 transitions, 413 flow [2025-03-04 09:44:45,412 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=346, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=413, PETRI_PLACES=80, PETRI_TRANSITIONS=50} [2025-03-04 09:44:45,413 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 50 predicate places. [2025-03-04 09:44:45,413 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 50 transitions, 413 flow [2025-03-04 09:44:45,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:44:45,414 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:44:45,414 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:44:45,420 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-04 09:44:45,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:44:45,614 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 09:44:45,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:44:45,615 INFO L85 PathProgramCache]: Analyzing trace with hash -1597813599, now seen corresponding path program 4 times [2025-03-04 09:44:45,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 09:44:45,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1394865260] [2025-03-04 09:44:45,615 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 09:44:45,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:44:45,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:44:45,617 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 09:44:45,618 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-04 09:44:45,648 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 16 statements into 2 equivalence classes. [2025-03-04 09:44:45,654 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 09:44:45,655 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 09:44:45,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:44:45,656 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 09:44:45,656 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:44:45,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:44:45,713 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 09:44:45,713 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 09:44:45,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1394865260] [2025-03-04 09:44:45,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1394865260] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:44:45,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:44:45,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 09:44:45,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078540860] [2025-03-04 09:44:45,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:44:45,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 09:44:45,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 09:44:45,714 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 09:44:45,714 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-04 09:44:45,717 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2025-03-04 09:44:45,718 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 50 transitions, 413 flow. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:44:45,718 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:44:45,718 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2025-03-04 09:44:45,718 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:44:45,938 INFO L124 PetriNetUnfolderBase]: 463/890 cut-off events. [2025-03-04 09:44:45,938 INFO L125 PetriNetUnfolderBase]: For 7762/7768 co-relation queries the response was YES. [2025-03-04 09:44:45,942 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3640 conditions, 890 events. 463/890 cut-off events. For 7762/7768 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 4365 event pairs, 152 based on Foata normal form. 18/907 useless extension candidates. Maximal degree in co-relation 3603. Up to 456 conditions per place. [2025-03-04 09:44:45,945 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 54 selfloop transitions, 16 changer transitions 21/95 dead transitions. [2025-03-04 09:44:45,945 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 95 transitions, 911 flow [2025-03-04 09:44:45,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 09:44:45,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 09:44:45,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 140 transitions. [2025-03-04 09:44:45,946 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5363984674329502 [2025-03-04 09:44:45,946 INFO L175 Difference]: Start difference. First operand has 80 places, 50 transitions, 413 flow. Second operand 9 states and 140 transitions. [2025-03-04 09:44:45,946 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 95 transitions, 911 flow [2025-03-04 09:44:45,955 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 95 transitions, 839 flow, removed 29 selfloop flow, removed 8 redundant places. [2025-03-04 09:44:45,956 INFO L231 Difference]: Finished difference. Result has 81 places, 53 transitions, 472 flow [2025-03-04 09:44:45,956 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=365, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=472, PETRI_PLACES=81, PETRI_TRANSITIONS=53} [2025-03-04 09:44:45,957 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 51 predicate places. [2025-03-04 09:44:45,957 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 53 transitions, 472 flow [2025-03-04 09:44:45,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:44:45,957 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:44:45,957 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:44:45,965 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-04 09:44:46,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:44:46,161 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 09:44:46,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:44:46,162 INFO L85 PathProgramCache]: Analyzing trace with hash 979589608, now seen corresponding path program 1 times [2025-03-04 09:44:46,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 09:44:46,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [176439513] [2025-03-04 09:44:46,162 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:44:46,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:44:46,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:44:46,164 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 09:44:46,165 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-04 09:44:46,197 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 09:44:46,204 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 09:44:46,204 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:44:46,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:44:46,205 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 09:44:46,206 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:44:46,263 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:44:46,264 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 09:44:46,424 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:44:46,424 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 09:44:46,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [176439513] [2025-03-04 09:44:46,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [176439513] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 09:44:46,424 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 09:44:46,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2025-03-04 09:44:46,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916726118] [2025-03-04 09:44:46,424 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 09:44:46,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 09:44:46,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 09:44:46,425 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 09:44:46,425 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2025-03-04 09:44:46,426 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2025-03-04 09:44:46,427 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 53 transitions, 472 flow. Second operand has 13 states, 13 states have (on average 10.076923076923077) internal successors, (131), 13 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-04 09:44:46,427 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:44:46,427 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2025-03-04 09:44:46,427 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:44:47,077 INFO L124 PetriNetUnfolderBase]: 697/1288 cut-off events. [2025-03-04 09:44:47,077 INFO L125 PetriNetUnfolderBase]: For 15157/15163 co-relation queries the response was YES. [2025-03-04 09:44:47,081 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5886 conditions, 1288 events. 697/1288 cut-off events. For 15157/15163 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 6106 event pairs, 36 based on Foata normal form. 51/1338 useless extension candidates. Maximal degree in co-relation 5849. Up to 219 conditions per place. [2025-03-04 09:44:47,084 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 69 selfloop transitions, 43 changer transitions 60/176 dead transitions. [2025-03-04 09:44:47,084 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 176 transitions, 1786 flow [2025-03-04 09:44:47,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-04 09:44:47,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-03-04 09:44:47,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 323 transitions. [2025-03-04 09:44:47,086 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5303776683087028 [2025-03-04 09:44:47,086 INFO L175 Difference]: Start difference. First operand has 81 places, 53 transitions, 472 flow. Second operand 21 states and 323 transitions. [2025-03-04 09:44:47,086 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 176 transitions, 1786 flow [2025-03-04 09:44:47,099 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 176 transitions, 1697 flow, removed 34 selfloop flow, removed 6 redundant places. [2025-03-04 09:44:47,100 INFO L231 Difference]: Finished difference. Result has 103 places, 69 transitions, 897 flow [2025-03-04 09:44:47,100 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=413, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=897, PETRI_PLACES=103, PETRI_TRANSITIONS=69} [2025-03-04 09:44:47,101 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 73 predicate places. [2025-03-04 09:44:47,101 INFO L471 AbstractCegarLoop]: Abstraction has has 103 places, 69 transitions, 897 flow [2025-03-04 09:44:47,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 10.076923076923077) internal successors, (131), 13 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-04 09:44:47,101 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:44:47,101 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:44:47,108 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-04 09:44:47,301 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 [2025-03-04 09:44:47,302 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 09:44:47,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:44:47,302 INFO L85 PathProgramCache]: Analyzing trace with hash 1762401677, now seen corresponding path program 1 times [2025-03-04 09:44:47,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 09:44:47,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1447734529] [2025-03-04 09:44:47,303 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:44:47,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:44:47,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:44:47,305 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 09:44:47,306 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-04 09:44:47,334 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 09:44:47,340 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 09:44:47,340 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:44:47,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:44:47,341 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 09:44:47,342 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:44:47,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:44:47,400 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 09:44:47,400 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 09:44:47,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1447734529] [2025-03-04 09:44:47,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1447734529] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:44:47,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:44:47,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 09:44:47,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463595871] [2025-03-04 09:44:47,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:44:47,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 09:44:47,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 09:44:47,401 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 09:44:47,401 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-04 09:44:47,403 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2025-03-04 09:44:47,403 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 69 transitions, 897 flow. Second operand has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:44:47,403 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:44:47,403 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2025-03-04 09:44:47,403 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:44:47,712 INFO L124 PetriNetUnfolderBase]: 679/1286 cut-off events. [2025-03-04 09:44:47,712 INFO L125 PetriNetUnfolderBase]: For 19364/19370 co-relation queries the response was YES. [2025-03-04 09:44:47,715 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6183 conditions, 1286 events. 679/1286 cut-off events. For 19364/19370 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 6464 event pairs, 239 based on Foata normal form. 33/1318 useless extension candidates. Maximal degree in co-relation 6138. Up to 828 conditions per place. [2025-03-04 09:44:47,718 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 73 selfloop transitions, 15 changer transitions 31/123 dead transitions. [2025-03-04 09:44:47,718 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 123 transitions, 1585 flow [2025-03-04 09:44:47,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 09:44:47,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-04 09:44:47,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 168 transitions. [2025-03-04 09:44:47,720 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5266457680250783 [2025-03-04 09:44:47,721 INFO L175 Difference]: Start difference. First operand has 103 places, 69 transitions, 897 flow. Second operand 11 states and 168 transitions. [2025-03-04 09:44:47,721 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 123 transitions, 1585 flow [2025-03-04 09:44:47,745 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 123 transitions, 1171 flow, removed 188 selfloop flow, removed 14 redundant places. [2025-03-04 09:44:47,746 INFO L231 Difference]: Finished difference. Result has 99 places, 71 transitions, 676 flow [2025-03-04 09:44:47,747 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=585, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=676, PETRI_PLACES=99, PETRI_TRANSITIONS=71} [2025-03-04 09:44:47,747 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 69 predicate places. [2025-03-04 09:44:47,747 INFO L471 AbstractCegarLoop]: Abstraction has has 99 places, 71 transitions, 676 flow [2025-03-04 09:44:47,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:44:47,748 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:44:47,748 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:44:47,754 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-04 09:44:47,948 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 [2025-03-04 09:44:47,949 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 09:44:47,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:44:47,949 INFO L85 PathProgramCache]: Analyzing trace with hash 860098855, now seen corresponding path program 2 times [2025-03-04 09:44:47,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 09:44:47,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1082394575] [2025-03-04 09:44:47,950 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 09:44:47,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:44:47,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:44:47,952 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 09:44:47,954 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-04 09:44:47,983 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-03-04 09:44:47,990 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 09:44:47,990 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 09:44:47,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:44:47,991 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 09:44:47,992 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:44:48,046 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:44:48,046 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 09:44:48,176 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:44:48,176 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 09:44:48,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1082394575] [2025-03-04 09:44:48,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1082394575] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 09:44:48,176 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 09:44:48,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2025-03-04 09:44:48,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572190132] [2025-03-04 09:44:48,176 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 09:44:48,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 09:44:48,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 09:44:48,177 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 09:44:48,177 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2025-03-04 09:44:48,178 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2025-03-04 09:44:48,178 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 71 transitions, 676 flow. Second operand has 13 states, 13 states have (on average 10.076923076923077) internal successors, (131), 13 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-04 09:44:48,178 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:44:48,178 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2025-03-04 09:44:48,178 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:44:49,106 INFO L124 PetriNetUnfolderBase]: 1210/2256 cut-off events. [2025-03-04 09:44:49,106 INFO L125 PetriNetUnfolderBase]: For 34086/34092 co-relation queries the response was YES. [2025-03-04 09:44:49,111 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11035 conditions, 2256 events. 1210/2256 cut-off events. For 34086/34092 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 12176 event pairs, 82 based on Foata normal form. 69/2324 useless extension candidates. Maximal degree in co-relation 10993. Up to 475 conditions per place. [2025-03-04 09:44:49,118 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 129 selfloop transitions, 50 changer transitions 59/242 dead transitions. [2025-03-04 09:44:49,118 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 242 transitions, 2760 flow [2025-03-04 09:44:49,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-03-04 09:44:49,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2025-03-04 09:44:49,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 421 transitions. [2025-03-04 09:44:49,119 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5376756066411239 [2025-03-04 09:44:49,119 INFO L175 Difference]: Start difference. First operand has 99 places, 71 transitions, 676 flow. Second operand 27 states and 421 transitions. [2025-03-04 09:44:49,120 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 242 transitions, 2760 flow [2025-03-04 09:44:49,141 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 242 transitions, 2561 flow, removed 87 selfloop flow, removed 8 redundant places. [2025-03-04 09:44:49,145 INFO L231 Difference]: Finished difference. Result has 131 places, 93 transitions, 1241 flow [2025-03-04 09:44:49,145 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=611, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=1241, PETRI_PLACES=131, PETRI_TRANSITIONS=93} [2025-03-04 09:44:49,147 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 101 predicate places. [2025-03-04 09:44:49,147 INFO L471 AbstractCegarLoop]: Abstraction has has 131 places, 93 transitions, 1241 flow [2025-03-04 09:44:49,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 10.076923076923077) internal successors, (131), 13 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-04 09:44:49,147 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:44:49,147 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:44:49,154 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-03-04 09:44:49,347 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 [2025-03-04 09:44:49,348 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 09:44:49,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:44:49,348 INFO L85 PathProgramCache]: Analyzing trace with hash 853905203, now seen corresponding path program 3 times [2025-03-04 09:44:49,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 09:44:49,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [269358307] [2025-03-04 09:44:49,348 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 09:44:49,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:44:49,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:44:49,350 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 09:44:49,351 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-04 09:44:49,379 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 19 statements into 1 equivalence classes. [2025-03-04 09:44:49,385 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 09:44:49,385 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 09:44:49,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:44:49,385 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 09:44:49,386 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:44:49,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:44:49,434 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 09:44:49,434 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 09:44:49,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [269358307] [2025-03-04 09:44:49,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [269358307] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:44:49,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:44:49,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 09:44:49,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526216035] [2025-03-04 09:44:49,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:44:49,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 09:44:49,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 09:44:49,435 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 09:44:49,435 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-04 09:44:49,436 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2025-03-04 09:44:49,437 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 93 transitions, 1241 flow. Second operand has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:44:49,437 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:44:49,437 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2025-03-04 09:44:49,437 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:44:49,809 INFO L124 PetriNetUnfolderBase]: 1075/2087 cut-off events. [2025-03-04 09:44:49,810 INFO L125 PetriNetUnfolderBase]: For 55759/55765 co-relation queries the response was YES. [2025-03-04 09:44:49,817 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11294 conditions, 2087 events. 1075/2087 cut-off events. For 55759/55765 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 11680 event pairs, 426 based on Foata normal form. 81/2167 useless extension candidates. Maximal degree in co-relation 11238. Up to 1194 conditions per place. [2025-03-04 09:44:49,829 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 93 selfloop transitions, 22 changer transitions 40/159 dead transitions. [2025-03-04 09:44:49,829 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 159 transitions, 2315 flow [2025-03-04 09:44:49,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 09:44:49,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-04 09:44:49,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 172 transitions. [2025-03-04 09:44:49,831 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5391849529780565 [2025-03-04 09:44:49,831 INFO L175 Difference]: Start difference. First operand has 131 places, 93 transitions, 1241 flow. Second operand 11 states and 172 transitions. [2025-03-04 09:44:49,831 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 159 transitions, 2315 flow [2025-03-04 09:44:49,883 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 159 transitions, 1780 flow, removed 254 selfloop flow, removed 13 redundant places. [2025-03-04 09:44:49,885 INFO L231 Difference]: Finished difference. Result has 126 places, 96 transitions, 1046 flow [2025-03-04 09:44:49,885 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=936, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1046, PETRI_PLACES=126, PETRI_TRANSITIONS=96} [2025-03-04 09:44:49,886 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 96 predicate places. [2025-03-04 09:44:49,886 INFO L471 AbstractCegarLoop]: Abstraction has has 126 places, 96 transitions, 1046 flow [2025-03-04 09:44:49,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:44:49,886 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:44:49,886 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:44:49,892 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-03-04 09:44:50,086 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 [2025-03-04 09:44:50,087 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 09:44:50,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:44:50,087 INFO L85 PathProgramCache]: Analyzing trace with hash 2054828168, now seen corresponding path program 1 times [2025-03-04 09:44:50,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 09:44:50,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1784631921] [2025-03-04 09:44:50,087 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:44:50,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:44:50,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:44:50,090 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 09:44:50,092 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-04 09:44:50,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 09:44:50,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 09:44:50,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:44:50,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:44:50,134 INFO L256 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 09:44:50,135 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:44:50,195 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-04 09:44:50,196 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 09:44:50,366 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-04 09:44:50,367 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 09:44:50,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1784631921] [2025-03-04 09:44:50,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1784631921] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 09:44:50,367 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 09:44:50,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2025-03-04 09:44:50,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544484502] [2025-03-04 09:44:50,367 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 09:44:50,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-04 09:44:50,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 09:44:50,367 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-04 09:44:50,368 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2025-03-04 09:44:50,370 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2025-03-04 09:44:50,370 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 96 transitions, 1046 flow. Second operand has 15 states, 15 states have (on average 10.066666666666666) internal successors, (151), 15 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-04 09:44:50,370 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:44:50,370 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2025-03-04 09:44:50,370 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:44:51,327 INFO L124 PetriNetUnfolderBase]: 1255/2340 cut-off events. [2025-03-04 09:44:51,327 INFO L125 PetriNetUnfolderBase]: For 46594/46600 co-relation queries the response was YES. [2025-03-04 09:44:51,334 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11480 conditions, 2340 events. 1255/2340 cut-off events. For 46594/46600 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 12310 event pairs, 62 based on Foata normal form. 78/2417 useless extension candidates. Maximal degree in co-relation 11427. Up to 369 conditions per place. [2025-03-04 09:44:51,339 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 101 selfloop transitions, 75 changer transitions 78/258 dead transitions. [2025-03-04 09:44:51,339 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 258 transitions, 3063 flow [2025-03-04 09:44:51,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-03-04 09:44:51,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2025-03-04 09:44:51,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 399 transitions. [2025-03-04 09:44:51,341 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5291777188328912 [2025-03-04 09:44:51,341 INFO L175 Difference]: Start difference. First operand has 126 places, 96 transitions, 1046 flow. Second operand 26 states and 399 transitions. [2025-03-04 09:44:51,341 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 258 transitions, 3063 flow [2025-03-04 09:44:51,385 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 258 transitions, 2955 flow, removed 40 selfloop flow, removed 6 redundant places. [2025-03-04 09:44:51,387 INFO L231 Difference]: Finished difference. Result has 155 places, 118 transitions, 1586 flow [2025-03-04 09:44:51,387 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=958, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=1586, PETRI_PLACES=155, PETRI_TRANSITIONS=118} [2025-03-04 09:44:51,387 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 125 predicate places. [2025-03-04 09:44:51,388 INFO L471 AbstractCegarLoop]: Abstraction has has 155 places, 118 transitions, 1586 flow [2025-03-04 09:44:51,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 10.066666666666666) internal successors, (151), 15 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-04 09:44:51,388 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:44:51,388 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:44:51,394 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-04 09:44:51,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:44:51,590 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 09:44:51,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:44:51,590 INFO L85 PathProgramCache]: Analyzing trace with hash -1613716725, now seen corresponding path program 2 times [2025-03-04 09:44:51,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 09:44:51,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [687642631] [2025-03-04 09:44:51,591 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 09:44:51,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:44:51,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:44:51,593 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 09:44:51,593 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-04 09:44:51,622 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-03-04 09:44:51,631 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 09:44:51,631 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 09:44:51,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:44:51,632 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 09:44:51,633 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:44:51,751 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 09:44:51,751 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 09:44:51,981 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 09:44:51,981 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 09:44:51,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [687642631] [2025-03-04 09:44:51,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [687642631] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 09:44:51,981 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 09:44:51,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2025-03-04 09:44:51,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90017312] [2025-03-04 09:44:51,981 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 09:44:51,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-04 09:44:51,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 09:44:51,982 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-04 09:44:51,982 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=280, Unknown=0, NotChecked=0, Total=342 [2025-03-04 09:44:51,983 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2025-03-04 09:44:51,983 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 118 transitions, 1586 flow. Second operand has 19 states, 19 states have (on average 10.263157894736842) internal successors, (195), 19 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:44:51,984 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:44:51,984 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2025-03-04 09:44:51,984 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:44:53,198 INFO L124 PetriNetUnfolderBase]: 1489/2846 cut-off events. [2025-03-04 09:44:53,198 INFO L125 PetriNetUnfolderBase]: For 90013/90019 co-relation queries the response was YES. [2025-03-04 09:44:53,208 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16233 conditions, 2846 events. 1489/2846 cut-off events. For 90013/90019 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 16187 event pairs, 310 based on Foata normal form. 87/2932 useless extension candidates. Maximal degree in co-relation 16169. Up to 1168 conditions per place. [2025-03-04 09:44:53,217 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 151 selfloop transitions, 64 changer transitions 105/324 dead transitions. [2025-03-04 09:44:53,217 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 324 transitions, 4728 flow [2025-03-04 09:44:53,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-03-04 09:44:53,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2025-03-04 09:44:53,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 496 transitions. [2025-03-04 09:44:53,219 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5182863113897597 [2025-03-04 09:44:53,219 INFO L175 Difference]: Start difference. First operand has 155 places, 118 transitions, 1586 flow. Second operand 33 states and 496 transitions. [2025-03-04 09:44:53,219 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 324 transitions, 4728 flow [2025-03-04 09:44:53,321 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 324 transitions, 4067 flow, removed 285 selfloop flow, removed 24 redundant places. [2025-03-04 09:44:53,324 INFO L231 Difference]: Finished difference. Result has 176 places, 144 transitions, 1978 flow [2025-03-04 09:44:53,324 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=1249, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=33, PETRI_FLOW=1978, PETRI_PLACES=176, PETRI_TRANSITIONS=144} [2025-03-04 09:44:53,325 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 146 predicate places. [2025-03-04 09:44:53,325 INFO L471 AbstractCegarLoop]: Abstraction has has 176 places, 144 transitions, 1978 flow [2025-03-04 09:44:53,325 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 10.263157894736842) internal successors, (195), 19 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:44:53,325 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:44:53,325 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:44:53,332 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-03-04 09:44:53,526 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 [2025-03-04 09:44:53,526 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 09:44:53,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:44:53,526 INFO L85 PathProgramCache]: Analyzing trace with hash -612340375, now seen corresponding path program 3 times [2025-03-04 09:44:53,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 09:44:53,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [776761947] [2025-03-04 09:44:53,527 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 09:44:53,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:44:53,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:44:53,528 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 09:44:53,529 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-04 09:44:53,557 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 31 statements into 3 equivalence classes. [2025-03-04 09:44:53,568 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 09:44:53,568 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-04 09:44:53,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:44:53,569 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 09:44:53,570 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:44:53,658 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 09:44:53,658 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 09:44:53,858 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 09:44:53,858 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 09:44:53,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [776761947] [2025-03-04 09:44:53,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [776761947] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 09:44:53,858 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 09:44:53,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2025-03-04 09:44:53,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593645506] [2025-03-04 09:44:53,858 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 09:44:53,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-04 09:44:53,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 09:44:53,859 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-04 09:44:53,859 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=282, Unknown=0, NotChecked=0, Total=342 [2025-03-04 09:44:53,863 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2025-03-04 09:44:53,864 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 144 transitions, 1978 flow. Second operand has 19 states, 19 states have (on average 10.263157894736842) internal successors, (195), 19 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:44:53,864 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:44:53,864 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2025-03-04 09:44:53,864 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:44:55,606 INFO L124 PetriNetUnfolderBase]: 2119/4082 cut-off events. [2025-03-04 09:44:55,607 INFO L125 PetriNetUnfolderBase]: For 205191/205197 co-relation queries the response was YES. [2025-03-04 09:44:55,623 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28284 conditions, 4082 events. 2119/4082 cut-off events. For 205191/205197 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 24298 event pairs, 162 based on Foata normal form. 87/4168 useless extension candidates. Maximal degree in co-relation 28213. Up to 765 conditions per place. [2025-03-04 09:44:55,635 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 185 selfloop transitions, 121 changer transitions 91/401 dead transitions. [2025-03-04 09:44:55,636 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 401 transitions, 7055 flow [2025-03-04 09:44:55,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2025-03-04 09:44:55,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2025-03-04 09:44:55,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 602 transitions. [2025-03-04 09:44:55,638 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5322723253757736 [2025-03-04 09:44:55,638 INFO L175 Difference]: Start difference. First operand has 176 places, 144 transitions, 1978 flow. Second operand 39 states and 602 transitions. [2025-03-04 09:44:55,639 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 401 transitions, 7055 flow [2025-03-04 09:44:55,788 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 401 transitions, 5852 flow, removed 579 selfloop flow, removed 19 redundant places. [2025-03-04 09:44:55,792 INFO L231 Difference]: Finished difference. Result has 207 places, 183 transitions, 3122 flow [2025-03-04 09:44:55,792 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=1661, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=90, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=39, PETRI_FLOW=3122, PETRI_PLACES=207, PETRI_TRANSITIONS=183} [2025-03-04 09:44:55,792 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 177 predicate places. [2025-03-04 09:44:55,792 INFO L471 AbstractCegarLoop]: Abstraction has has 207 places, 183 transitions, 3122 flow [2025-03-04 09:44:55,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 10.263157894736842) internal successors, (195), 19 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:44:55,792 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:44:55,792 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:44:55,799 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-04 09:44:55,993 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 [2025-03-04 09:44:55,993 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 09:44:55,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:44:55,994 INFO L85 PathProgramCache]: Analyzing trace with hash 1795207021, now seen corresponding path program 4 times [2025-03-04 09:44:55,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 09:44:55,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [926458035] [2025-03-04 09:44:55,994 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 09:44:55,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:44:55,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:44:55,996 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 09:44:55,996 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-03-04 09:44:56,025 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 31 statements into 2 equivalence classes. [2025-03-04 09:44:56,033 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 09:44:56,033 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 09:44:56,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:44:56,034 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 09:44:56,034 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:44:56,100 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 09:44:56,100 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 09:44:56,294 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 09:44:56,294 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 09:44:56,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [926458035] [2025-03-04 09:44:56,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [926458035] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 09:44:56,294 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 09:44:56,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2025-03-04 09:44:56,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144074630] [2025-03-04 09:44:56,294 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 09:44:56,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-04 09:44:56,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 09:44:56,295 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-04 09:44:56,295 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2025-03-04 09:44:56,296 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2025-03-04 09:44:56,296 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 183 transitions, 3122 flow. Second operand has 19 states, 19 states have (on average 10.263157894736842) internal successors, (195), 19 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:44:56,296 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:44:56,296 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2025-03-04 09:44:56,296 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:44:58,246 INFO L124 PetriNetUnfolderBase]: 2173/4205 cut-off events. [2025-03-04 09:44:58,247 INFO L125 PetriNetUnfolderBase]: For 270287/270293 co-relation queries the response was YES. [2025-03-04 09:44:58,266 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30283 conditions, 4205 events. 2173/4205 cut-off events. For 270287/270293 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 24761 event pairs, 124 based on Foata normal form. 159/4363 useless extension candidates. Maximal degree in co-relation 30199. Up to 819 conditions per place. [2025-03-04 09:44:58,277 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 154 selfloop transitions, 146 changer transitions 133/437 dead transitions. [2025-03-04 09:44:58,277 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 437 transitions, 8340 flow [2025-03-04 09:44:58,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2025-03-04 09:44:58,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2025-03-04 09:44:58,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 611 transitions. [2025-03-04 09:44:58,279 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5267241379310345 [2025-03-04 09:44:58,279 INFO L175 Difference]: Start difference. First operand has 207 places, 183 transitions, 3122 flow. Second operand 40 states and 611 transitions. [2025-03-04 09:44:58,279 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 237 places, 437 transitions, 8340 flow [2025-03-04 09:44:58,722 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 437 transitions, 6915 flow, removed 687 selfloop flow, removed 19 redundant places. [2025-03-04 09:44:58,726 INFO L231 Difference]: Finished difference. Result has 241 places, 205 transitions, 3584 flow [2025-03-04 09:44:58,726 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=2441, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=183, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=125, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=40, PETRI_FLOW=3584, PETRI_PLACES=241, PETRI_TRANSITIONS=205} [2025-03-04 09:44:58,726 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 211 predicate places. [2025-03-04 09:44:58,726 INFO L471 AbstractCegarLoop]: Abstraction has has 241 places, 205 transitions, 3584 flow [2025-03-04 09:44:58,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 10.263157894736842) internal successors, (195), 19 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:44:58,727 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:44:58,727 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:44:58,734 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-04 09:44:58,927 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 [2025-03-04 09:44:58,927 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 09:44:58,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:44:58,928 INFO L85 PathProgramCache]: Analyzing trace with hash -890586342, now seen corresponding path program 5 times [2025-03-04 09:44:58,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 09:44:58,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1238290100] [2025-03-04 09:44:58,928 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 09:44:58,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:44:58,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:44:58,931 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 09:44:58,932 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-03-04 09:44:58,964 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 37 statements into 4 equivalence classes. [2025-03-04 09:44:58,974 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 37 of 37 statements. [2025-03-04 09:44:58,974 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-03-04 09:44:58,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:44:58,975 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-04 09:44:58,976 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:44:59,102 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:44:59,102 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 09:44:59,373 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:44:59,373 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 09:44:59,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1238290100] [2025-03-04 09:44:59,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1238290100] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 09:44:59,374 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 09:44:59,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2025-03-04 09:44:59,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985847944] [2025-03-04 09:44:59,374 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 09:44:59,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-04 09:44:59,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 09:44:59,374 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-04 09:44:59,375 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=496, Unknown=0, NotChecked=0, Total=600 [2025-03-04 09:44:59,379 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2025-03-04 09:44:59,380 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 241 places, 205 transitions, 3584 flow. Second operand has 25 states, 25 states have (on average 10.04) internal successors, (251), 25 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:44:59,380 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:44:59,380 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2025-03-04 09:44:59,380 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:45:01,332 INFO L124 PetriNetUnfolderBase]: 2281/4478 cut-off events. [2025-03-04 09:45:01,332 INFO L125 PetriNetUnfolderBase]: For 370625/370631 co-relation queries the response was YES. [2025-03-04 09:45:01,355 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34459 conditions, 4478 events. 2281/4478 cut-off events. For 370625/370631 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 26241 event pairs, 983 based on Foata normal form. 123/4600 useless extension candidates. Maximal degree in co-relation 34361. Up to 3096 conditions per place. [2025-03-04 09:45:01,368 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 253 selfloop transitions, 31 changer transitions 133/421 dead transitions. [2025-03-04 09:45:01,369 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 267 places, 421 transitions, 9082 flow [2025-03-04 09:45:01,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2025-03-04 09:45:01,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2025-03-04 09:45:01,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 552 transitions. [2025-03-04 09:45:01,370 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5144454799627214 [2025-03-04 09:45:01,370 INFO L175 Difference]: Start difference. First operand has 241 places, 205 transitions, 3584 flow. Second operand 37 states and 552 transitions. [2025-03-04 09:45:01,371 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 267 places, 421 transitions, 9082 flow [2025-03-04 09:45:01,773 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 237 places, 421 transitions, 7933 flow, removed 514 selfloop flow, removed 30 redundant places. [2025-03-04 09:45:01,778 INFO L231 Difference]: Finished difference. Result has 264 places, 219 transitions, 3709 flow [2025-03-04 09:45:01,778 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=2857, PETRI_DIFFERENCE_MINUEND_PLACES=201, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=205, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=184, PETRI_DIFFERENCE_SUBTRAHEND_STATES=37, PETRI_FLOW=3709, PETRI_PLACES=264, PETRI_TRANSITIONS=219} [2025-03-04 09:45:01,778 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 234 predicate places. [2025-03-04 09:45:01,778 INFO L471 AbstractCegarLoop]: Abstraction has has 264 places, 219 transitions, 3709 flow [2025-03-04 09:45:01,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 10.04) internal successors, (251), 25 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:45:01,779 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:45:01,779 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:45:01,785 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2025-03-04 09:45:01,979 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 [2025-03-04 09:45:01,979 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 09:45:01,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:45:01,980 INFO L85 PathProgramCache]: Analyzing trace with hash 650458248, now seen corresponding path program 6 times [2025-03-04 09:45:01,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 09:45:01,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [727188002] [2025-03-04 09:45:01,980 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 09:45:01,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:45:01,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:45:01,982 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 09:45:01,983 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-03-04 09:45:02,015 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 37 statements into 5 equivalence classes. [2025-03-04 09:45:02,030 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) and asserted 37 of 37 statements. [2025-03-04 09:45:02,030 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2025-03-04 09:45:02,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:45:02,031 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-04 09:45:02,032 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:45:02,189 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:45:02,190 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 09:45:02,517 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:45:02,518 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 09:45:02,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [727188002] [2025-03-04 09:45:02,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [727188002] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 09:45:02,518 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 09:45:02,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2025-03-04 09:45:02,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429231377] [2025-03-04 09:45:02,518 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 09:45:02,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-04 09:45:02,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 09:45:02,519 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-04 09:45:02,519 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=503, Unknown=0, NotChecked=0, Total=600 [2025-03-04 09:45:02,523 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2025-03-04 09:45:02,523 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 264 places, 219 transitions, 3709 flow. Second operand has 25 states, 25 states have (on average 10.04) internal successors, (251), 25 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:45:02,523 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:45:02,523 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2025-03-04 09:45:02,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:45:04,828 INFO L124 PetriNetUnfolderBase]: 2407/4740 cut-off events. [2025-03-04 09:45:04,829 INFO L125 PetriNetUnfolderBase]: For 556846/556852 co-relation queries the response was YES. [2025-03-04 09:45:04,851 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40953 conditions, 4740 events. 2407/4740 cut-off events. For 556846/556852 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 28164 event pairs, 644 based on Foata normal form. 123/4862 useless extension candidates. Maximal degree in co-relation 40844. Up to 2098 conditions per place. [2025-03-04 09:45:04,861 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 229 selfloop transitions, 97 changer transitions 149/479 dead transitions. [2025-03-04 09:45:04,862 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 295 places, 479 transitions, 10934 flow [2025-03-04 09:45:04,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2025-03-04 09:45:04,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2025-03-04 09:45:04,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 673 transitions. [2025-03-04 09:45:04,863 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5157088122605364 [2025-03-04 09:45:04,863 INFO L175 Difference]: Start difference. First operand has 264 places, 219 transitions, 3709 flow. Second operand 45 states and 673 transitions. [2025-03-04 09:45:04,864 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 295 places, 479 transitions, 10934 flow [2025-03-04 09:45:05,294 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 275 places, 479 transitions, 9062 flow, removed 921 selfloop flow, removed 20 redundant places. [2025-03-04 09:45:05,298 INFO L231 Difference]: Finished difference. Result has 300 places, 233 transitions, 4133 flow [2025-03-04 09:45:05,299 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=3007, PETRI_DIFFERENCE_MINUEND_PLACES=231, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=219, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=83, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=45, PETRI_FLOW=4133, PETRI_PLACES=300, PETRI_TRANSITIONS=233} [2025-03-04 09:45:05,299 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 270 predicate places. [2025-03-04 09:45:05,299 INFO L471 AbstractCegarLoop]: Abstraction has has 300 places, 233 transitions, 4133 flow [2025-03-04 09:45:05,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 10.04) internal successors, (251), 25 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:45:05,299 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:45:05,299 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:45:05,306 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-04 09:45:05,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:45:05,500 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 09:45:05,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:45:05,500 INFO L85 PathProgramCache]: Analyzing trace with hash -200259646, now seen corresponding path program 7 times [2025-03-04 09:45:05,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 09:45:05,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [607949888] [2025-03-04 09:45:05,501 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 09:45:05,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:45:05,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:45:05,502 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 09:45:05,503 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-03-04 09:45:05,531 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-04 09:45:05,539 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-04 09:45:05,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:45:05,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:45:05,540 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-04 09:45:05,541 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:45:05,644 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:45:05,645 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 09:45:05,993 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:45:05,994 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 09:45:05,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [607949888] [2025-03-04 09:45:05,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [607949888] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 09:45:05,994 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 09:45:05,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2025-03-04 09:45:05,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543187261] [2025-03-04 09:45:05,994 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 09:45:05,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-04 09:45:05,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 09:45:05,994 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-04 09:45:05,995 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=508, Unknown=0, NotChecked=0, Total=600 [2025-03-04 09:45:06,001 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2025-03-04 09:45:06,001 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 300 places, 233 transitions, 4133 flow. Second operand has 25 states, 25 states have (on average 10.04) internal successors, (251), 25 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:45:06,001 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:45:06,001 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2025-03-04 09:45:06,001 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand