./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/parallel-misc-3-extended.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/weaver/parallel-misc-3-extended.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8cea87724a542982ff884c708bfc22195aa1904db80300e5b965108c3d86cb2f --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 01:22:39,061 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 01:22:39,105 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-09 01:22:39,111 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 01:22:39,112 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 01:22:39,132 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 01:22:39,132 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 01:22:39,132 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 01:22:39,133 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 01:22:39,133 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 01:22:39,133 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 01:22:39,133 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 01:22:39,134 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 01:22:39,134 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 01:22:39,134 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 01:22:39,134 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 01:22:39,134 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 01:22:39,134 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 01:22:39,134 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 01:22:39,134 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 01:22:39,134 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-09 01:22:39,134 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-09 01:22:39,135 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-09 01:22:39,135 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 01:22:39,135 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-09 01:22:39,135 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 01:22:39,135 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 01:22:39,135 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 01:22:39,135 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 01:22:39,135 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 01:22:39,135 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 01:22:39,135 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 01:22:39,135 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 01:22:39,135 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:22:39,135 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 01:22:39,135 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 01:22:39,135 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 01:22:39,135 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 01:22:39,135 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 01:22:39,136 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 01:22:39,136 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 01:22:39,136 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 01:22:39,136 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 -> 8cea87724a542982ff884c708bfc22195aa1904db80300e5b965108c3d86cb2f [2025-03-09 01:22:39,333 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 01:22:39,341 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 01:22:39,343 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 01:22:39,344 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 01:22:39,344 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 01:22:39,345 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/parallel-misc-3-extended.wvr.c [2025-03-09 01:22:40,453 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b0828eb30/dabf73f10ee94eb5b1658ed754fb32a5/FLAG4fc1f30ee [2025-03-09 01:22:40,656 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 01:22:40,657 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/parallel-misc-3-extended.wvr.c [2025-03-09 01:22:40,662 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b0828eb30/dabf73f10ee94eb5b1658ed754fb32a5/FLAG4fc1f30ee [2025-03-09 01:22:41,025 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b0828eb30/dabf73f10ee94eb5b1658ed754fb32a5 [2025-03-09 01:22:41,027 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 01:22:41,029 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 01:22:41,031 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 01:22:41,031 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 01:22:41,034 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 01:22:41,035 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:22:41" (1/1) ... [2025-03-09 01:22:41,037 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18484e25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:22:41, skipping insertion in model container [2025-03-09 01:22:41,037 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:22:41" (1/1) ... [2025-03-09 01:22:41,052 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 01:22:41,181 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:22:41,194 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 01:22:41,210 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:22:41,223 INFO L204 MainTranslator]: Completed translation [2025-03-09 01:22:41,224 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:22:41 WrapperNode [2025-03-09 01:22:41,224 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 01:22:41,225 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 01:22:41,225 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 01:22:41,226 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 01:22:41,231 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:22:41" (1/1) ... [2025-03-09 01:22:41,236 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:22:41" (1/1) ... [2025-03-09 01:22:41,249 INFO L138 Inliner]: procedures = 19, calls = 11, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 54 [2025-03-09 01:22:41,249 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 01:22:41,250 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 01:22:41,250 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 01:22:41,250 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 01:22:41,257 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:22:41" (1/1) ... [2025-03-09 01:22:41,258 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:22:41" (1/1) ... [2025-03-09 01:22:41,259 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:22:41" (1/1) ... [2025-03-09 01:22:41,270 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-09 01:22:41,272 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:22:41" (1/1) ... [2025-03-09 01:22:41,272 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:22:41" (1/1) ... [2025-03-09 01:22:41,275 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:22:41" (1/1) ... [2025-03-09 01:22:41,279 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:22:41" (1/1) ... [2025-03-09 01:22:41,280 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:22:41" (1/1) ... [2025-03-09 01:22:41,283 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:22:41" (1/1) ... [2025-03-09 01:22:41,284 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 01:22:41,284 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 01:22:41,284 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 01:22:41,284 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 01:22:41,285 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:22:41" (1/1) ... [2025-03-09 01:22:41,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:22:41,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:22:41,313 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-09 01:22:41,315 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-09 01:22:41,332 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 01:22:41,333 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-09 01:22:41,333 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-09 01:22:41,333 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-09 01:22:41,333 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-09 01:22:41,333 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-09 01:22:41,333 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-09 01:22:41,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 01:22:41,333 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 01:22:41,334 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 01:22:41,334 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-09 01:22:41,402 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 01:22:41,404 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 01:22:41,600 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-09 01:22:41,601 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 01:22:41,729 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 01:22:41,729 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 01:22:41,730 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:22:41 BoogieIcfgContainer [2025-03-09 01:22:41,730 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 01:22:41,731 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 01:22:41,731 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 01:22:41,734 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 01:22:41,735 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 01:22:41" (1/3) ... [2025-03-09 01:22:41,736 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c2903e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:22:41, skipping insertion in model container [2025-03-09 01:22:41,736 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:22:41" (2/3) ... [2025-03-09 01:22:41,736 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c2903e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:22:41, skipping insertion in model container [2025-03-09 01:22:41,736 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:22:41" (3/3) ... [2025-03-09 01:22:41,738 INFO L128 eAbstractionObserver]: Analyzing ICFG parallel-misc-3-extended.wvr.c [2025-03-09 01:22:41,748 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 01:22:41,749 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG parallel-misc-3-extended.wvr.c that has 4 procedures, 39 locations, 1 initial locations, 3 loop locations, and 2 error locations. [2025-03-09 01:22:41,749 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-09 01:22:41,801 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-09 01:22:41,824 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 44 transitions, 109 flow [2025-03-09 01:22:41,854 INFO L124 PetriNetUnfolderBase]: 6/41 cut-off events. [2025-03-09 01:22:41,855 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-09 01:22:41,858 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54 conditions, 41 events. 6/41 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 85 event pairs, 0 based on Foata normal form. 0/33 useless extension candidates. Maximal degree in co-relation 35. Up to 2 conditions per place. [2025-03-09 01:22:41,858 INFO L82 GeneralOperation]: Start removeDead. Operand has 48 places, 44 transitions, 109 flow [2025-03-09 01:22:41,860 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 44 places, 40 transitions, 98 flow [2025-03-09 01:22:41,866 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 01:22:41,874 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;@1fa4991a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 01:22:41,874 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-03-09 01:22:41,884 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-09 01:22:41,884 INFO L124 PetriNetUnfolderBase]: 6/37 cut-off events. [2025-03-09 01:22:41,884 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-09 01:22:41,885 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:22:41,885 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:22:41,886 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-09 01:22:41,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:22:41,890 INFO L85 PathProgramCache]: Analyzing trace with hash 1453559304, now seen corresponding path program 1 times [2025-03-09 01:22:41,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:22:41,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425302453] [2025-03-09 01:22:41,897 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:22:41,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:22:41,973 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-09 01:22:41,995 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 01:22:41,995 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:22:41,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:22:42,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:22:42,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:22:42,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425302453] [2025-03-09 01:22:42,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425302453] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:22:42,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:22:42,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:22:42,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245246383] [2025-03-09 01:22:42,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:22:42,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:22:42,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:22:42,138 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:22:42,139 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:22:42,140 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 44 [2025-03-09 01:22:42,145 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 40 transitions, 98 flow. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:22:42,145 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:22:42,146 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 44 [2025-03-09 01:22:42,146 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:22:42,428 INFO L124 PetriNetUnfolderBase]: 996/1607 cut-off events. [2025-03-09 01:22:42,428 INFO L125 PetriNetUnfolderBase]: For 85/85 co-relation queries the response was YES. [2025-03-09 01:22:42,434 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2944 conditions, 1607 events. 996/1607 cut-off events. For 85/85 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 8034 event pairs, 94 based on Foata normal form. 2/1448 useless extension candidates. Maximal degree in co-relation 2669. Up to 1177 conditions per place. [2025-03-09 01:22:42,445 INFO L140 encePairwiseOnDemand]: 35/44 looper letters, 32 selfloop transitions, 7 changer transitions 1/55 dead transitions. [2025-03-09 01:22:42,445 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 55 transitions, 223 flow [2025-03-09 01:22:42,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:22:42,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:22:42,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 99 transitions. [2025-03-09 01:22:42,455 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.75 [2025-03-09 01:22:42,456 INFO L175 Difference]: Start difference. First operand has 44 places, 40 transitions, 98 flow. Second operand 3 states and 99 transitions. [2025-03-09 01:22:42,456 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 55 transitions, 223 flow [2025-03-09 01:22:42,460 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 55 transitions, 201 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-09 01:22:42,461 INFO L231 Difference]: Finished difference. Result has 39 places, 44 transitions, 129 flow [2025-03-09 01:22:42,463 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=129, PETRI_PLACES=39, PETRI_TRANSITIONS=44} [2025-03-09 01:22:42,465 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, -5 predicate places. [2025-03-09 01:22:42,465 INFO L471 AbstractCegarLoop]: Abstraction has has 39 places, 44 transitions, 129 flow [2025-03-09 01:22:42,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:22:42,465 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:22:42,465 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:22:42,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 01:22:42,466 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-09 01:22:42,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:22:42,467 INFO L85 PathProgramCache]: Analyzing trace with hash 1539406788, now seen corresponding path program 1 times [2025-03-09 01:22:42,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:22:42,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144243289] [2025-03-09 01:22:42,467 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:22:42,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:22:42,473 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-09 01:22:42,490 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-09 01:22:42,490 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:22:42,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:22:42,575 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:22:42,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:22:42,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144243289] [2025-03-09 01:22:42,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144243289] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:22:42,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:22:42,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:22:42,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988422013] [2025-03-09 01:22:42,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:22:42,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:22:42,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:22:42,578 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:22:42,578 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:22:42,581 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 44 [2025-03-09 01:22:42,581 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 44 transitions, 129 flow. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:22:42,582 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:22:42,582 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 44 [2025-03-09 01:22:42,582 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:22:42,758 INFO L124 PetriNetUnfolderBase]: 1150/1837 cut-off events. [2025-03-09 01:22:42,759 INFO L125 PetriNetUnfolderBase]: For 570/570 co-relation queries the response was YES. [2025-03-09 01:22:42,764 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4063 conditions, 1837 events. 1150/1837 cut-off events. For 570/570 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 9729 event pairs, 142 based on Foata normal form. 49/1686 useless extension candidates. Maximal degree in co-relation 2850. Up to 900 conditions per place. [2025-03-09 01:22:42,773 INFO L140 encePairwiseOnDemand]: 41/44 looper letters, 43 selfloop transitions, 2 changer transitions 0/60 dead transitions. [2025-03-09 01:22:42,773 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 60 transitions, 265 flow [2025-03-09 01:22:42,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:22:42,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:22:42,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 97 transitions. [2025-03-09 01:22:42,775 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7348484848484849 [2025-03-09 01:22:42,775 INFO L175 Difference]: Start difference. First operand has 39 places, 44 transitions, 129 flow. Second operand 3 states and 97 transitions. [2025-03-09 01:22:42,775 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 60 transitions, 265 flow [2025-03-09 01:22:42,776 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 60 transitions, 256 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-09 01:22:42,777 INFO L231 Difference]: Finished difference. Result has 41 places, 45 transitions, 132 flow [2025-03-09 01:22:42,777 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=132, PETRI_PLACES=41, PETRI_TRANSITIONS=45} [2025-03-09 01:22:42,778 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, -3 predicate places. [2025-03-09 01:22:42,778 INFO L471 AbstractCegarLoop]: Abstraction has has 41 places, 45 transitions, 132 flow [2025-03-09 01:22:42,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:22:42,778 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:22:42,778 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:22:42,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-09 01:22:42,778 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-09 01:22:42,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:22:42,780 INFO L85 PathProgramCache]: Analyzing trace with hash -687277150, now seen corresponding path program 1 times [2025-03-09 01:22:42,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:22:42,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102240474] [2025-03-09 01:22:42,780 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:22:42,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:22:42,790 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-09 01:22:42,806 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-09 01:22:42,806 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:22:42,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:22:42,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:22:42,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:22:42,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102240474] [2025-03-09 01:22:42,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102240474] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:22:42,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:22:42,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:22:42,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062257325] [2025-03-09 01:22:42,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:22:42,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:22:42,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:22:42,874 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:22:42,874 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:22:42,876 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 44 [2025-03-09 01:22:42,876 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 45 transitions, 132 flow. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:22:42,877 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:22:42,877 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 44 [2025-03-09 01:22:42,877 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:22:43,078 INFO L124 PetriNetUnfolderBase]: 1223/1996 cut-off events. [2025-03-09 01:22:43,078 INFO L125 PetriNetUnfolderBase]: For 833/833 co-relation queries the response was YES. [2025-03-09 01:22:43,082 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4627 conditions, 1996 events. 1223/1996 cut-off events. For 833/833 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 11133 event pairs, 198 based on Foata normal form. 71/1802 useless extension candidates. Maximal degree in co-relation 2690. Up to 1041 conditions per place. [2025-03-09 01:22:43,091 INFO L140 encePairwiseOnDemand]: 41/44 looper letters, 44 selfloop transitions, 2 changer transitions 0/61 dead transitions. [2025-03-09 01:22:43,091 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 61 transitions, 277 flow [2025-03-09 01:22:43,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:22:43,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:22:43,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 96 transitions. [2025-03-09 01:22:43,092 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7272727272727273 [2025-03-09 01:22:43,092 INFO L175 Difference]: Start difference. First operand has 41 places, 45 transitions, 132 flow. Second operand 3 states and 96 transitions. [2025-03-09 01:22:43,092 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 61 transitions, 277 flow [2025-03-09 01:22:43,093 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 61 transitions, 274 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 01:22:43,093 INFO L231 Difference]: Finished difference. Result has 43 places, 46 transitions, 142 flow [2025-03-09 01:22:43,093 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=142, PETRI_PLACES=43, PETRI_TRANSITIONS=46} [2025-03-09 01:22:43,094 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, -1 predicate places. [2025-03-09 01:22:43,094 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 46 transitions, 142 flow [2025-03-09 01:22:43,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:22:43,094 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:22:43,094 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:22:43,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-09 01:22:43,094 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-09 01:22:43,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:22:43,095 INFO L85 PathProgramCache]: Analyzing trace with hash -1674446536, now seen corresponding path program 1 times [2025-03-09 01:22:43,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:22:43,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507028809] [2025-03-09 01:22:43,095 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:22:43,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:22:43,100 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-09 01:22:43,105 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-09 01:22:43,105 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:22:43,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:22:43,157 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:22:43,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:22:43,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507028809] [2025-03-09 01:22:43,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507028809] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:22:43,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:22:43,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:22:43,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712004214] [2025-03-09 01:22:43,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:22:43,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:22:43,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:22:43,158 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:22:43,158 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:22:43,162 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 44 [2025-03-09 01:22:43,163 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 46 transitions, 142 flow. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:22:43,163 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:22:43,163 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 44 [2025-03-09 01:22:43,163 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:22:43,352 INFO L124 PetriNetUnfolderBase]: 1417/2320 cut-off events. [2025-03-09 01:22:43,353 INFO L125 PetriNetUnfolderBase]: For 1118/1118 co-relation queries the response was YES. [2025-03-09 01:22:43,355 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5704 conditions, 2320 events. 1417/2320 cut-off events. For 1118/1118 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 13301 event pairs, 321 based on Foata normal form. 64/2116 useless extension candidates. Maximal degree in co-relation 2133. Up to 1031 conditions per place. [2025-03-09 01:22:43,362 INFO L140 encePairwiseOnDemand]: 41/44 looper letters, 45 selfloop transitions, 2 changer transitions 0/62 dead transitions. [2025-03-09 01:22:43,363 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 62 transitions, 295 flow [2025-03-09 01:22:43,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:22:43,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:22:43,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 95 transitions. [2025-03-09 01:22:43,364 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7196969696969697 [2025-03-09 01:22:43,365 INFO L175 Difference]: Start difference. First operand has 43 places, 46 transitions, 142 flow. Second operand 3 states and 95 transitions. [2025-03-09 01:22:43,365 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 62 transitions, 295 flow [2025-03-09 01:22:43,366 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 62 transitions, 292 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 01:22:43,367 INFO L231 Difference]: Finished difference. Result has 45 places, 47 transitions, 152 flow [2025-03-09 01:22:43,368 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=152, PETRI_PLACES=45, PETRI_TRANSITIONS=47} [2025-03-09 01:22:43,369 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 1 predicate places. [2025-03-09 01:22:43,369 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 47 transitions, 152 flow [2025-03-09 01:22:43,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:22:43,369 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:22:43,369 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:22:43,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-09 01:22:43,370 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-09 01:22:43,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:22:43,371 INFO L85 PathProgramCache]: Analyzing trace with hash -365850938, now seen corresponding path program 1 times [2025-03-09 01:22:43,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:22:43,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232902724] [2025-03-09 01:22:43,371 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:22:43,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:22:43,379 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-09 01:22:43,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-09 01:22:43,385 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:22:43,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:22:43,476 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:22:43,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:22:43,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232902724] [2025-03-09 01:22:43,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232902724] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:22:43,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:22:43,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:22:43,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822700833] [2025-03-09 01:22:43,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:22:43,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:22:43,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:22:43,477 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:22:43,477 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:22:43,479 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 44 [2025-03-09 01:22:43,480 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 47 transitions, 152 flow. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:22:43,480 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:22:43,480 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 44 [2025-03-09 01:22:43,480 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:22:43,713 INFO L124 PetriNetUnfolderBase]: 1557/2448 cut-off events. [2025-03-09 01:22:43,713 INFO L125 PetriNetUnfolderBase]: For 1225/1225 co-relation queries the response was YES. [2025-03-09 01:22:43,718 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6364 conditions, 2448 events. 1557/2448 cut-off events. For 1225/1225 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 13809 event pairs, 321 based on Foata normal form. 48/2360 useless extension candidates. Maximal degree in co-relation 2398. Up to 1323 conditions per place. [2025-03-09 01:22:43,732 INFO L140 encePairwiseOnDemand]: 41/44 looper letters, 44 selfloop transitions, 2 changer transitions 0/60 dead transitions. [2025-03-09 01:22:43,732 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 60 transitions, 292 flow [2025-03-09 01:22:43,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:22:43,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:22:43,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 92 transitions. [2025-03-09 01:22:43,733 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.696969696969697 [2025-03-09 01:22:43,733 INFO L175 Difference]: Start difference. First operand has 45 places, 47 transitions, 152 flow. Second operand 3 states and 92 transitions. [2025-03-09 01:22:43,733 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 60 transitions, 292 flow [2025-03-09 01:22:43,735 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 60 transitions, 290 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 01:22:43,735 INFO L231 Difference]: Finished difference. Result has 47 places, 46 transitions, 154 flow [2025-03-09 01:22:43,736 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=154, PETRI_PLACES=47, PETRI_TRANSITIONS=46} [2025-03-09 01:22:43,738 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 3 predicate places. [2025-03-09 01:22:43,738 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 46 transitions, 154 flow [2025-03-09 01:22:43,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:22:43,739 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:22:43,739 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:22:43,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-09 01:22:43,739 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-09 01:22:43,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:22:43,739 INFO L85 PathProgramCache]: Analyzing trace with hash -201530650, now seen corresponding path program 1 times [2025-03-09 01:22:43,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:22:43,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576132415] [2025-03-09 01:22:43,739 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:22:43,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:22:43,750 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-09 01:22:43,766 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-09 01:22:43,766 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:22:43,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:22:43,957 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:22:43,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:22:43,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576132415] [2025-03-09 01:22:43,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576132415] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:22:43,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:22:43,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:22:43,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177979405] [2025-03-09 01:22:43,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:22:43,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:22:43,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:22:43,959 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:22:43,959 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:22:43,970 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 44 [2025-03-09 01:22:43,970 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 46 transitions, 154 flow. Second operand has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:22:43,970 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:22:43,970 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 44 [2025-03-09 01:22:43,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:22:44,304 INFO L124 PetriNetUnfolderBase]: 2730/4169 cut-off events. [2025-03-09 01:22:44,304 INFO L125 PetriNetUnfolderBase]: For 2221/2277 co-relation queries the response was YES. [2025-03-09 01:22:44,310 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10885 conditions, 4169 events. 2730/4169 cut-off events. For 2221/2277 co-relation queries the response was YES. Maximal size of possible extension queue 182. Compared 23171 event pairs, 492 based on Foata normal form. 62/4017 useless extension candidates. Maximal degree in co-relation 4550. Up to 1624 conditions per place. [2025-03-09 01:22:44,327 INFO L140 encePairwiseOnDemand]: 39/44 looper letters, 64 selfloop transitions, 5 changer transitions 0/82 dead transitions. [2025-03-09 01:22:44,327 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 82 transitions, 420 flow [2025-03-09 01:22:44,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:22:44,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 01:22:44,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 128 transitions. [2025-03-09 01:22:44,328 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7272727272727273 [2025-03-09 01:22:44,328 INFO L175 Difference]: Start difference. First operand has 47 places, 46 transitions, 154 flow. Second operand 4 states and 128 transitions. [2025-03-09 01:22:44,329 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 82 transitions, 420 flow [2025-03-09 01:22:44,330 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 82 transitions, 412 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:22:44,331 INFO L231 Difference]: Finished difference. Result has 50 places, 48 transitions, 182 flow [2025-03-09 01:22:44,331 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=182, PETRI_PLACES=50, PETRI_TRANSITIONS=48} [2025-03-09 01:22:44,331 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 6 predicate places. [2025-03-09 01:22:44,331 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 48 transitions, 182 flow [2025-03-09 01:22:44,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:22:44,332 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:22:44,332 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:22:44,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-09 01:22:44,333 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-09 01:22:44,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:22:44,333 INFO L85 PathProgramCache]: Analyzing trace with hash -818889815, now seen corresponding path program 1 times [2025-03-09 01:22:44,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:22:44,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828464975] [2025-03-09 01:22:44,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:22:44,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:22:44,341 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-09 01:22:44,359 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-09 01:22:44,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:22:44,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:22:44,540 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 01:22:44,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:22:44,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828464975] [2025-03-09 01:22:44,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828464975] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:22:44,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:22:44,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:22:44,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364164228] [2025-03-09 01:22:44,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:22:44,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:22:44,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:22:44,542 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:22:44,542 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:22:44,546 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 44 [2025-03-09 01:22:44,547 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 48 transitions, 182 flow. Second operand has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:22:44,547 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:22:44,547 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 44 [2025-03-09 01:22:44,547 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:22:44,957 INFO L124 PetriNetUnfolderBase]: 4180/6087 cut-off events. [2025-03-09 01:22:44,957 INFO L125 PetriNetUnfolderBase]: For 5634/6118 co-relation queries the response was YES. [2025-03-09 01:22:44,964 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17655 conditions, 6087 events. 4180/6087 cut-off events. For 5634/6118 co-relation queries the response was YES. Maximal size of possible extension queue 267. Compared 35116 event pairs, 1044 based on Foata normal form. 269/6020 useless extension candidates. Maximal degree in co-relation 9714. Up to 2315 conditions per place. [2025-03-09 01:22:44,989 INFO L140 encePairwiseOnDemand]: 39/44 looper letters, 67 selfloop transitions, 5 changer transitions 0/86 dead transitions. [2025-03-09 01:22:44,989 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 86 transitions, 492 flow [2025-03-09 01:22:44,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:22:44,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 01:22:44,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 126 transitions. [2025-03-09 01:22:44,990 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7159090909090909 [2025-03-09 01:22:44,990 INFO L175 Difference]: Start difference. First operand has 50 places, 48 transitions, 182 flow. Second operand 4 states and 126 transitions. [2025-03-09 01:22:44,990 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 86 transitions, 492 flow [2025-03-09 01:22:44,993 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 86 transitions, 486 flow, removed 3 selfloop flow, removed 0 redundant places. [2025-03-09 01:22:44,993 INFO L231 Difference]: Finished difference. Result has 55 places, 50 transitions, 212 flow [2025-03-09 01:22:44,995 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=212, PETRI_PLACES=55, PETRI_TRANSITIONS=50} [2025-03-09 01:22:44,996 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 11 predicate places. [2025-03-09 01:22:44,996 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 50 transitions, 212 flow [2025-03-09 01:22:44,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:22:44,996 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:22:44,996 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:22:44,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-09 01:22:44,996 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-09 01:22:44,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:22:44,997 INFO L85 PathProgramCache]: Analyzing trace with hash -289624543, now seen corresponding path program 1 times [2025-03-09 01:22:44,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:22:44,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029527285] [2025-03-09 01:22:44,997 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:22:44,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:22:45,006 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-09 01:22:45,021 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-09 01:22:45,023 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:22:45,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:22:45,160 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-09 01:22:45,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:22:45,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029527285] [2025-03-09 01:22:45,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029527285] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:22:45,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:22:45,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:22:45,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790931858] [2025-03-09 01:22:45,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:22:45,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:22:45,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:22:45,161 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:22:45,161 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:22:45,165 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 44 [2025-03-09 01:22:45,165 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 50 transitions, 212 flow. Second operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:22:45,165 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:22:45,165 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 44 [2025-03-09 01:22:45,165 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:22:45,797 INFO L124 PetriNetUnfolderBase]: 6271/9089 cut-off events. [2025-03-09 01:22:45,797 INFO L125 PetriNetUnfolderBase]: For 12801/13773 co-relation queries the response was YES. [2025-03-09 01:22:45,812 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28469 conditions, 9089 events. 6271/9089 cut-off events. For 12801/13773 co-relation queries the response was YES. Maximal size of possible extension queue 373. Compared 54834 event pairs, 1732 based on Foata normal form. 571/9504 useless extension candidates. Maximal degree in co-relation 16297. Up to 3291 conditions per place. [2025-03-09 01:22:45,848 INFO L140 encePairwiseOnDemand]: 40/44 looper letters, 71 selfloop transitions, 5 changer transitions 0/91 dead transitions. [2025-03-09 01:22:45,848 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 91 transitions, 572 flow [2025-03-09 01:22:45,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:22:45,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 01:22:45,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 123 transitions. [2025-03-09 01:22:45,850 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6988636363636364 [2025-03-09 01:22:45,851 INFO L175 Difference]: Start difference. First operand has 55 places, 50 transitions, 212 flow. Second operand 4 states and 123 transitions. [2025-03-09 01:22:45,851 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 91 transitions, 572 flow [2025-03-09 01:22:45,854 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 91 transitions, 566 flow, removed 3 selfloop flow, removed 0 redundant places. [2025-03-09 01:22:45,855 INFO L231 Difference]: Finished difference. Result has 59 places, 53 transitions, 240 flow [2025-03-09 01:22:45,856 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=210, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=240, PETRI_PLACES=59, PETRI_TRANSITIONS=53} [2025-03-09 01:22:45,857 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 15 predicate places. [2025-03-09 01:22:45,857 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 53 transitions, 240 flow [2025-03-09 01:22:45,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:22:45,858 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:22:45,858 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:22:45,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-09 01:22:45,858 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-09 01:22:45,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:22:45,859 INFO L85 PathProgramCache]: Analyzing trace with hash -1170882473, now seen corresponding path program 1 times [2025-03-09 01:22:45,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:22:45,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194026216] [2025-03-09 01:22:45,859 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:22:45,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:22:45,869 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-09 01:22:45,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-09 01:22:45,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:22:45,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:22:46,029 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:22:46,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:22:46,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194026216] [2025-03-09 01:22:46,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194026216] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:22:46,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [331645226] [2025-03-09 01:22:46,030 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:22:46,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:22:46,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:22:46,032 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:22:46,034 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-09 01:22:46,073 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-09 01:22:46,093 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-09 01:22:46,093 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:22:46,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:22:46,096 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-09 01:22:46,100 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:22:46,175 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:22:46,176 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:22:46,234 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:22:46,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [331645226] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:22:46,235 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:22:46,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2025-03-09 01:22:46,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380643551] [2025-03-09 01:22:46,236 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:22:46,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:22:46,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:22:46,236 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:22:46,237 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:22:46,237 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 44 [2025-03-09 01:22:46,238 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 53 transitions, 240 flow. Second operand has 5 states, 5 states have (on average 24.2) internal successors, (121), 5 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:22:46,238 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:22:46,238 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 44 [2025-03-09 01:22:46,238 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:22:47,756 INFO L124 PetriNetUnfolderBase]: 13709/22568 cut-off events. [2025-03-09 01:22:47,756 INFO L125 PetriNetUnfolderBase]: For 31345/33195 co-relation queries the response was YES. [2025-03-09 01:22:47,803 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69472 conditions, 22568 events. 13709/22568 cut-off events. For 31345/33195 co-relation queries the response was YES. Maximal size of possible extension queue 612. Compared 162346 event pairs, 2553 based on Foata normal form. 878/23137 useless extension candidates. Maximal degree in co-relation 17508. Up to 8575 conditions per place. [2025-03-09 01:22:47,903 INFO L140 encePairwiseOnDemand]: 36/44 looper letters, 99 selfloop transitions, 22 changer transitions 1/140 dead transitions. [2025-03-09 01:22:47,904 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 140 transitions, 907 flow [2025-03-09 01:22:47,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:22:47,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:22:47,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 181 transitions. [2025-03-09 01:22:47,905 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8227272727272728 [2025-03-09 01:22:47,905 INFO L175 Difference]: Start difference. First operand has 59 places, 53 transitions, 240 flow. Second operand 5 states and 181 transitions. [2025-03-09 01:22:47,905 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 140 transitions, 907 flow [2025-03-09 01:22:47,910 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 140 transitions, 899 flow, removed 4 selfloop flow, removed 0 redundant places. [2025-03-09 01:22:47,911 INFO L231 Difference]: Finished difference. Result has 64 places, 71 transitions, 381 flow [2025-03-09 01:22:47,911 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=238, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=381, PETRI_PLACES=64, PETRI_TRANSITIONS=71} [2025-03-09 01:22:47,912 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 20 predicate places. [2025-03-09 01:22:47,912 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 71 transitions, 381 flow [2025-03-09 01:22:47,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.2) internal successors, (121), 5 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:22:47,912 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:22:47,912 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:22:47,919 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-09 01:22:48,117 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-09 01:22:48,118 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-09 01:22:48,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:22:48,118 INFO L85 PathProgramCache]: Analyzing trace with hash -236746115, now seen corresponding path program 2 times [2025-03-09 01:22:48,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:22:48,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148372854] [2025-03-09 01:22:48,119 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:22:48,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:22:48,132 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 44 statements into 2 equivalence classes. [2025-03-09 01:22:48,160 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 44 of 44 statements. [2025-03-09 01:22:48,160 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:22:48,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:22:48,321 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:22:48,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:22:48,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148372854] [2025-03-09 01:22:48,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148372854] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:22:48,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [62311079] [2025-03-09 01:22:48,321 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:22:48,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:22:48,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:22:48,325 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:22:48,326 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-09 01:22:48,371 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 44 statements into 2 equivalence classes. [2025-03-09 01:22:48,396 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 44 of 44 statements. [2025-03-09 01:22:48,396 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:22:48,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:22:48,397 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-09 01:22:48,398 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:22:48,456 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:22:48,456 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:22:48,512 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:22:48,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [62311079] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:22:48,512 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:22:48,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 5 [2025-03-09 01:22:48,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529132927] [2025-03-09 01:22:48,512 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:22:48,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 01:22:48,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:22:48,513 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 01:22:48,513 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-09 01:22:48,513 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 44 [2025-03-09 01:22:48,513 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 71 transitions, 381 flow. Second operand has 6 states, 6 states have (on average 23.333333333333332) internal successors, (140), 6 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:22:48,513 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:22:48,513 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 44 [2025-03-09 01:22:48,513 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:22:51,412 INFO L124 PetriNetUnfolderBase]: 25739/42370 cut-off events. [2025-03-09 01:22:51,412 INFO L125 PetriNetUnfolderBase]: For 78106/81786 co-relation queries the response was YES. [2025-03-09 01:22:51,544 INFO L83 FinitePrefix]: Finished finitePrefix Result has 145317 conditions, 42370 events. 25739/42370 cut-off events. For 78106/81786 co-relation queries the response was YES. Maximal size of possible extension queue 1283. Compared 339516 event pairs, 3091 based on Foata normal form. 1763/43591 useless extension candidates. Maximal degree in co-relation 36533. Up to 14115 conditions per place. [2025-03-09 01:22:51,891 INFO L140 encePairwiseOnDemand]: 36/44 looper letters, 123 selfloop transitions, 46 changer transitions 1/188 dead transitions. [2025-03-09 01:22:51,891 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 188 transitions, 1337 flow [2025-03-09 01:22:51,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 01:22:51,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-09 01:22:51,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 221 transitions. [2025-03-09 01:22:51,892 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8371212121212122 [2025-03-09 01:22:51,892 INFO L175 Difference]: Start difference. First operand has 64 places, 71 transitions, 381 flow. Second operand 6 states and 221 transitions. [2025-03-09 01:22:51,892 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 188 transitions, 1337 flow [2025-03-09 01:22:51,919 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 188 transitions, 1253 flow, removed 42 selfloop flow, removed 0 redundant places. [2025-03-09 01:22:51,920 INFO L231 Difference]: Finished difference. Result has 70 places, 95 transitions, 569 flow [2025-03-09 01:22:51,921 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=345, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=569, PETRI_PLACES=70, PETRI_TRANSITIONS=95} [2025-03-09 01:22:51,921 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 26 predicate places. [2025-03-09 01:22:51,921 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 95 transitions, 569 flow [2025-03-09 01:22:51,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.333333333333332) internal successors, (140), 6 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:22:51,921 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:22:51,921 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:22:51,928 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-09 01:22:52,122 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-09 01:22:52,122 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-09 01:22:52,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:22:52,122 INFO L85 PathProgramCache]: Analyzing trace with hash -35130905, now seen corresponding path program 3 times [2025-03-09 01:22:52,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:22:52,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082058390] [2025-03-09 01:22:52,123 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 01:22:52,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:22:52,131 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 44 statements into 3 equivalence classes. [2025-03-09 01:22:52,168 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 44 of 44 statements. [2025-03-09 01:22:52,168 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-09 01:22:52,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:22:52,306 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:22:52,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:22:52,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082058390] [2025-03-09 01:22:52,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082058390] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:22:52,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [21648568] [2025-03-09 01:22:52,307 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 01:22:52,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:22:52,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:22:52,309 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:22:52,310 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-09 01:22:52,345 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 44 statements into 3 equivalence classes. [2025-03-09 01:22:52,365 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 44 of 44 statements. [2025-03-09 01:22:52,365 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-09 01:22:52,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:22:52,367 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-09 01:22:52,368 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:22:52,430 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:22:52,431 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:22:52,481 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:22:52,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [21648568] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:22:52,481 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:22:52,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 6 [2025-03-09 01:22:52,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648751348] [2025-03-09 01:22:52,481 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:22:52,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 01:22:52,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:22:52,482 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 01:22:52,482 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-09 01:22:52,482 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 44 [2025-03-09 01:22:52,483 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 95 transitions, 569 flow. Second operand has 7 states, 7 states have (on average 22.714285714285715) internal successors, (159), 7 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:22:52,483 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:22:52,483 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 44 [2025-03-09 01:22:52,483 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:22:57,781 INFO L124 PetriNetUnfolderBase]: 41800/68998 cut-off events. [2025-03-09 01:22:57,782 INFO L125 PetriNetUnfolderBase]: For 134948/140774 co-relation queries the response was YES. [2025-03-09 01:22:58,045 INFO L83 FinitePrefix]: Finished finitePrefix Result has 239740 conditions, 68998 events. 41800/68998 cut-off events. For 134948/140774 co-relation queries the response was YES. Maximal size of possible extension queue 2252. Compared 596622 event pairs, 4298 based on Foata normal form. 2866/70816 useless extension candidates. Maximal degree in co-relation 63910. Up to 20701 conditions per place. [2025-03-09 01:22:58,366 INFO L140 encePairwiseOnDemand]: 36/44 looper letters, 146 selfloop transitions, 76 changer transitions 1/241 dead transitions. [2025-03-09 01:22:58,366 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 241 transitions, 1790 flow [2025-03-09 01:22:58,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 01:22:58,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-09 01:22:58,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 261 transitions. [2025-03-09 01:22:58,367 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8474025974025974 [2025-03-09 01:22:58,368 INFO L175 Difference]: Start difference. First operand has 70 places, 95 transitions, 569 flow. Second operand 7 states and 261 transitions. [2025-03-09 01:22:58,368 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 241 transitions, 1790 flow [2025-03-09 01:22:58,430 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 241 transitions, 1683 flow, removed 47 selfloop flow, removed 1 redundant places. [2025-03-09 01:22:58,435 INFO L231 Difference]: Finished difference. Result has 76 places, 125 transitions, 847 flow [2025-03-09 01:22:58,436 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=530, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=847, PETRI_PLACES=76, PETRI_TRANSITIONS=125} [2025-03-09 01:22:58,436 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 32 predicate places. [2025-03-09 01:22:58,436 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 125 transitions, 847 flow [2025-03-09 01:22:58,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.714285714285715) internal successors, (159), 7 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:22:58,436 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:22:58,437 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:22:58,443 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-09 01:22:58,637 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-09 01:22:58,637 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-09 01:22:58,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:22:58,638 INFO L85 PathProgramCache]: Analyzing trace with hash -907011215, now seen corresponding path program 4 times [2025-03-09 01:22:58,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:22:58,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894648779] [2025-03-09 01:22:58,638 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 01:22:58,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:22:58,652 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 44 statements into 2 equivalence classes. [2025-03-09 01:22:58,659 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 44 of 44 statements. [2025-03-09 01:22:58,660 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 01:22:58,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:22:58,774 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:22:58,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:22:58,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894648779] [2025-03-09 01:22:58,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894648779] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:22:58,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1190256223] [2025-03-09 01:22:58,774 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 01:22:58,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:22:58,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:22:58,780 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:22:58,782 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-09 01:22:58,815 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 44 statements into 2 equivalence classes. [2025-03-09 01:22:58,835 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 44 of 44 statements. [2025-03-09 01:22:58,835 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 01:22:58,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:22:58,837 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-09 01:22:58,838 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:22:58,885 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:22:58,885 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:22:58,934 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:22:58,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1190256223] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:22:58,934 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:22:58,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 5 [2025-03-09 01:22:58,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100514819] [2025-03-09 01:22:58,935 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:22:58,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 01:22:58,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:22:58,935 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 01:22:58,935 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-09 01:22:58,935 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 44 [2025-03-09 01:22:58,936 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 125 transitions, 847 flow. Second operand has 6 states, 6 states have (on average 23.333333333333332) internal successors, (140), 6 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:22:58,936 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:22:58,936 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 44 [2025-03-09 01:22:58,936 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:23:05,825 INFO L124 PetriNetUnfolderBase]: 53502/87536 cut-off events. [2025-03-09 01:23:05,826 INFO L125 PetriNetUnfolderBase]: For 210755/217900 co-relation queries the response was YES. [2025-03-09 01:23:06,111 INFO L83 FinitePrefix]: Finished finitePrefix Result has 320513 conditions, 87536 events. 53502/87536 cut-off events. For 210755/217900 co-relation queries the response was YES. Maximal size of possible extension queue 2788. Compared 776307 event pairs, 11037 based on Foata normal form. 3506/89210 useless extension candidates. Maximal degree in co-relation 95384. Up to 58694 conditions per place. [2025-03-09 01:23:06,448 INFO L140 encePairwiseOnDemand]: 36/44 looper letters, 185 selfloop transitions, 54 changer transitions 1/258 dead transitions. [2025-03-09 01:23:06,448 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 258 transitions, 2128 flow [2025-03-09 01:23:06,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 01:23:06,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-09 01:23:06,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 217 transitions. [2025-03-09 01:23:06,449 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.821969696969697 [2025-03-09 01:23:06,449 INFO L175 Difference]: Start difference. First operand has 76 places, 125 transitions, 847 flow. Second operand 6 states and 217 transitions. [2025-03-09 01:23:06,449 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 258 transitions, 2128 flow [2025-03-09 01:23:06,561 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 258 transitions, 2014 flow, removed 40 selfloop flow, removed 1 redundant places. [2025-03-09 01:23:06,563 INFO L231 Difference]: Finished difference. Result has 83 places, 175 transitions, 1352 flow [2025-03-09 01:23:06,563 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=799, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1352, PETRI_PLACES=83, PETRI_TRANSITIONS=175} [2025-03-09 01:23:06,564 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 39 predicate places. [2025-03-09 01:23:06,564 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 175 transitions, 1352 flow [2025-03-09 01:23:06,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.333333333333332) internal successors, (140), 6 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:23:06,564 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:23:06,564 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:23:06,572 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-09 01:23:06,771 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-09 01:23:06,771 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-09 01:23:06,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:23:06,772 INFO L85 PathProgramCache]: Analyzing trace with hash -287605475, now seen corresponding path program 5 times [2025-03-09 01:23:06,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:23:06,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677271871] [2025-03-09 01:23:06,772 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-09 01:23:06,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:23:06,786 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 44 statements into 3 equivalence classes. [2025-03-09 01:23:06,800 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 44 of 44 statements. [2025-03-09 01:23:06,801 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-03-09 01:23:06,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:23:06,919 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:23:06,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:23:06,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677271871] [2025-03-09 01:23:06,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677271871] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:23:06,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1613465212] [2025-03-09 01:23:06,920 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-09 01:23:06,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:23:06,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:23:06,922 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:23:06,923 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-09 01:23:06,957 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 44 statements into 3 equivalence classes. [2025-03-09 01:23:06,975 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 44 of 44 statements. [2025-03-09 01:23:06,975 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-03-09 01:23:06,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:23:06,978 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-09 01:23:07,140 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:23:07,232 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:23:07,233 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:23:07,283 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:23:07,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1613465212] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:23:07,283 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:23:07,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 7 [2025-03-09 01:23:07,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229743959] [2025-03-09 01:23:07,284 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:23:07,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-09 01:23:07,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:23:07,284 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-09 01:23:07,284 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-09 01:23:07,285 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 44 [2025-03-09 01:23:07,285 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 175 transitions, 1352 flow. Second operand has 8 states, 8 states have (on average 22.25) internal successors, (178), 8 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:23:07,285 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:23:07,285 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 44 [2025-03-09 01:23:07,285 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:23:17,732 INFO L124 PetriNetUnfolderBase]: 72115/118518 cut-off events. [2025-03-09 01:23:17,732 INFO L125 PetriNetUnfolderBase]: For 293909/304317 co-relation queries the response was YES. [2025-03-09 01:23:18,268 INFO L83 FinitePrefix]: Finished finitePrefix Result has 434066 conditions, 118518 events. 72115/118518 cut-off events. For 293909/304317 co-relation queries the response was YES. Maximal size of possible extension queue 4189. Compared 1097620 event pairs, 6914 based on Foata normal form. 5034/121543 useless extension candidates. Maximal degree in co-relation 146264. Up to 23338 conditions per place. [2025-03-09 01:23:18,914 INFO L140 encePairwiseOnDemand]: 36/44 looper letters, 170 selfloop transitions, 162 changer transitions 1/351 dead transitions. [2025-03-09 01:23:18,914 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 351 transitions, 2954 flow [2025-03-09 01:23:18,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 01:23:18,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-09 01:23:18,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 301 transitions. [2025-03-09 01:23:18,915 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8551136363636364 [2025-03-09 01:23:18,915 INFO L175 Difference]: Start difference. First operand has 83 places, 175 transitions, 1352 flow. Second operand 8 states and 301 transitions. [2025-03-09 01:23:18,915 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 351 transitions, 2954 flow [2025-03-09 01:23:19,077 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 351 transitions, 2942 flow, removed 6 selfloop flow, removed 0 redundant places. [2025-03-09 01:23:19,083 INFO L231 Difference]: Finished difference. Result has 91 places, 211 transitions, 1953 flow [2025-03-09 01:23:19,084 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=1340, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=175, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=132, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1953, PETRI_PLACES=91, PETRI_TRANSITIONS=211} [2025-03-09 01:23:19,085 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 47 predicate places. [2025-03-09 01:23:19,085 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 211 transitions, 1953 flow [2025-03-09 01:23:19,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 22.25) internal successors, (178), 8 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:23:19,085 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:23:19,086 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:23:19,092 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-09 01:23:19,286 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-09 01:23:19,287 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-09 01:23:19,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:23:19,287 INFO L85 PathProgramCache]: Analyzing trace with hash -1970452845, now seen corresponding path program 6 times [2025-03-09 01:23:19,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:23:19,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822810434] [2025-03-09 01:23:19,288 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-09 01:23:19,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:23:19,295 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 48 statements into 2 equivalence classes. [2025-03-09 01:23:19,312 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 48 of 48 statements. [2025-03-09 01:23:19,313 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-03-09 01:23:19,313 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:23:19,508 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 01:23:19,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:23:19,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822810434] [2025-03-09 01:23:19,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822810434] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:23:19,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [255171678] [2025-03-09 01:23:19,509 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-09 01:23:19,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:23:19,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:23:19,511 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:23:19,512 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-09 01:23:19,548 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 48 statements into 2 equivalence classes. [2025-03-09 01:23:19,569 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 48 of 48 statements. [2025-03-09 01:23:19,569 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-03-09 01:23:19,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:23:19,570 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-09 01:23:19,572 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:23:19,717 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 01:23:19,717 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 01:23:19,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [255171678] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:23:19,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 01:23:19,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 12 [2025-03-09 01:23:19,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126920572] [2025-03-09 01:23:19,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:23:19,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 01:23:19,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:23:19,718 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 01:23:19,718 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2025-03-09 01:23:19,723 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 44 [2025-03-09 01:23:19,724 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 211 transitions, 1953 flow. Second operand has 6 states, 6 states have (on average 21.0) internal successors, (126), 6 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:23:19,724 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:23:19,724 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 44 [2025-03-09 01:23:19,724 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand