./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/popl20-counter-determinism.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/popl20-counter-determinism.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 981eae178b9cad0bb64b87dda8360f4f1e2e23d7b9d396f9db2ad5a6977098c4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 01:24:25,787 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 01:24:25,837 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-09 01:24:25,845 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 01:24:25,845 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 01:24:25,860 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 01:24:25,862 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 01:24:25,862 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 01:24:25,862 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 01:24:25,863 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 01:24:25,863 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 01:24:25,863 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 01:24:25,864 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 01:24:25,864 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 01:24:25,864 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 01:24:25,864 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 01:24:25,864 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 01:24:25,864 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 01:24:25,865 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 01:24:25,865 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 01:24:25,865 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-09 01:24:25,865 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-09 01:24:25,865 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-09 01:24:25,865 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 01:24:25,865 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-09 01:24:25,865 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 01:24:25,865 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 01:24:25,865 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 01:24:25,865 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 01:24:25,865 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 01:24:25,866 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 01:24:25,866 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 01:24:25,866 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 01:24:25,866 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:24:25,866 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 01:24:25,866 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 01:24:25,866 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 01:24:25,866 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 01:24:25,866 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 01:24:25,866 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 01:24:25,866 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 01:24:25,866 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 01:24:25,866 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 -> 981eae178b9cad0bb64b87dda8360f4f1e2e23d7b9d396f9db2ad5a6977098c4 [2025-03-09 01:24:26,062 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 01:24:26,067 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 01:24:26,072 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 01:24:26,074 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 01:24:26,074 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 01:24:26,075 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-counter-determinism.wvr.c [2025-03-09 01:24:27,208 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/92a677641/9c25514da51d45efa773ed9d4c6c6c40/FLAG60b159c58 [2025-03-09 01:24:27,449 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 01:24:27,454 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-counter-determinism.wvr.c [2025-03-09 01:24:27,462 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/92a677641/9c25514da51d45efa773ed9d4c6c6c40/FLAG60b159c58 [2025-03-09 01:24:27,504 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/92a677641/9c25514da51d45efa773ed9d4c6c6c40 [2025-03-09 01:24:27,506 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 01:24:27,514 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 01:24:27,515 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 01:24:27,515 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 01:24:27,522 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 01:24:27,523 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:24:27" (1/1) ... [2025-03-09 01:24:27,524 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6be41b41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:24:27, skipping insertion in model container [2025-03-09 01:24:27,524 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:24:27" (1/1) ... [2025-03-09 01:24:27,542 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 01:24:27,665 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:24:27,674 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 01:24:27,691 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:24:27,706 INFO L204 MainTranslator]: Completed translation [2025-03-09 01:24:27,707 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:24:27 WrapperNode [2025-03-09 01:24:27,707 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 01:24:27,708 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 01:24:27,708 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 01:24:27,708 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 01:24:27,713 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:24:27" (1/1) ... [2025-03-09 01:24:27,719 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:24:27" (1/1) ... [2025-03-09 01:24:27,736 INFO L138 Inliner]: procedures = 20, calls = 14, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 90 [2025-03-09 01:24:27,737 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 01:24:27,738 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 01:24:27,738 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 01:24:27,738 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 01:24:27,744 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:24:27" (1/1) ... [2025-03-09 01:24:27,745 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:24:27" (1/1) ... [2025-03-09 01:24:27,748 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:24:27" (1/1) ... [2025-03-09 01:24:27,765 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:24:27,765 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:24:27" (1/1) ... [2025-03-09 01:24:27,765 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:24:27" (1/1) ... [2025-03-09 01:24:27,769 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:24:27" (1/1) ... [2025-03-09 01:24:27,770 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:24:27" (1/1) ... [2025-03-09 01:24:27,774 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:24:27" (1/1) ... [2025-03-09 01:24:27,778 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:24:27" (1/1) ... [2025-03-09 01:24:27,780 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 01:24:27,780 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 01:24:27,780 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 01:24:27,780 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 01:24:27,781 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:24:27" (1/1) ... [2025-03-09 01:24:27,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:24:27,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:24:27,810 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:24:27,815 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:24:27,830 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 01:24:27,831 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-09 01:24:27,831 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-09 01:24:27,831 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-09 01:24:27,831 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-09 01:24:27,831 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-09 01:24:27,831 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-09 01:24:27,831 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-03-09 01:24:27,831 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-03-09 01:24:27,831 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 01:24:27,831 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 01:24:27,831 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 01:24:27,832 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:24:27,908 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 01:24:27,910 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 01:24:28,102 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-09 01:24:28,102 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 01:24:28,192 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 01:24:28,192 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 01:24:28,193 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:24:28 BoogieIcfgContainer [2025-03-09 01:24:28,193 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 01:24:28,195 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 01:24:28,195 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 01:24:28,198 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 01:24:28,199 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 01:24:27" (1/3) ... [2025-03-09 01:24:28,199 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@333d7327 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:24:28, skipping insertion in model container [2025-03-09 01:24:28,199 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:24:27" (2/3) ... [2025-03-09 01:24:28,199 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@333d7327 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:24:28, skipping insertion in model container [2025-03-09 01:24:28,199 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:24:28" (3/3) ... [2025-03-09 01:24:28,200 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-counter-determinism.wvr.c [2025-03-09 01:24:28,211 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 01:24:28,212 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-counter-determinism.wvr.c that has 5 procedures, 39 locations, 1 initial locations, 4 loop locations, and 2 error locations. [2025-03-09 01:24:28,213 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-09 01:24:28,260 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-03-09 01:24:28,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 42 transitions, 112 flow [2025-03-09 01:24:28,310 INFO L124 PetriNetUnfolderBase]: 4/38 cut-off events. [2025-03-09 01:24:28,311 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-09 01:24:28,318 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55 conditions, 38 events. 4/38 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 49 event pairs, 0 based on Foata normal form. 0/32 useless extension candidates. Maximal degree in co-relation 33. Up to 2 conditions per place. [2025-03-09 01:24:28,318 INFO L82 GeneralOperation]: Start removeDead. Operand has 51 places, 42 transitions, 112 flow [2025-03-09 01:24:28,323 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 46 places, 37 transitions, 98 flow [2025-03-09 01:24:28,328 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 01:24:28,341 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;@4ba1e280, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 01:24:28,342 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-03-09 01:24:28,354 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-09 01:24:28,355 INFO L124 PetriNetUnfolderBase]: 4/34 cut-off events. [2025-03-09 01:24:28,355 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-09 01:24:28,355 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:24:28,356 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:24:28,356 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-09 01:24:28,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:24:28,361 INFO L85 PathProgramCache]: Analyzing trace with hash 38495472, now seen corresponding path program 1 times [2025-03-09 01:24:28,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:24:28,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5942768] [2025-03-09 01:24:28,370 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:24:28,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:24:28,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-09 01:24:28,462 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-09 01:24:28,462 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:24:28,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:24:28,637 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:24:28,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:24:28,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5942768] [2025-03-09 01:24:28,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5942768] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:24:28,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:24:28,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:24:28,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458814745] [2025-03-09 01:24:28,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:24:28,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:24:28,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:24:28,666 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:24:28,666 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:24:28,668 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2025-03-09 01:24:28,669 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 37 transitions, 98 flow. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states 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:24:28,669 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:24:28,670 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2025-03-09 01:24:28,670 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:24:29,221 INFO L124 PetriNetUnfolderBase]: 5145/6904 cut-off events. [2025-03-09 01:24:29,221 INFO L125 PetriNetUnfolderBase]: For 496/496 co-relation queries the response was YES. [2025-03-09 01:24:29,233 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14135 conditions, 6904 events. 5145/6904 cut-off events. For 496/496 co-relation queries the response was YES. Maximal size of possible extension queue 333. Compared 30829 event pairs, 1020 based on Foata normal form. 2/6292 useless extension candidates. Maximal degree in co-relation 12513. Up to 5288 conditions per place. [2025-03-09 01:24:29,263 INFO L140 encePairwiseOnDemand]: 35/42 looper letters, 51 selfloop transitions, 5 changer transitions 1/60 dead transitions. [2025-03-09 01:24:29,263 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 60 transitions, 279 flow [2025-03-09 01:24:29,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:24:29,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:24:29,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 83 transitions. [2025-03-09 01:24:29,275 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6587301587301587 [2025-03-09 01:24:29,276 INFO L175 Difference]: Start difference. First operand has 46 places, 37 transitions, 98 flow. Second operand 3 states and 83 transitions. [2025-03-09 01:24:29,277 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 60 transitions, 279 flow [2025-03-09 01:24:29,289 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 60 transitions, 249 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-03-09 01:24:29,293 INFO L231 Difference]: Finished difference. Result has 39 places, 39 transitions, 111 flow [2025-03-09 01:24:29,295 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=111, PETRI_PLACES=39, PETRI_TRANSITIONS=39} [2025-03-09 01:24:29,299 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, -7 predicate places. [2025-03-09 01:24:29,299 INFO L471 AbstractCegarLoop]: Abstraction has has 39 places, 39 transitions, 111 flow [2025-03-09 01:24:29,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states 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:24:29,299 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:24:29,299 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] [2025-03-09 01:24:29,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 01:24:29,300 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-09 01:24:29,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:24:29,301 INFO L85 PathProgramCache]: Analyzing trace with hash -775783981, now seen corresponding path program 1 times [2025-03-09 01:24:29,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:24:29,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701007988] [2025-03-09 01:24:29,301 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:24:29,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:24:29,315 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-09 01:24:29,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-09 01:24:29,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:24:29,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:24:29,443 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:24:29,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:24:29,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701007988] [2025-03-09 01:24:29,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701007988] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:24:29,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:24:29,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 01:24:29,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638160855] [2025-03-09 01:24:29,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:24:29,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:24:29,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:24:29,446 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:24:29,446 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:24:29,456 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 42 [2025-03-09 01:24:29,457 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 39 transitions, 111 flow. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states 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:24:29,457 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:24:29,457 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 42 [2025-03-09 01:24:29,457 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:24:30,353 INFO L124 PetriNetUnfolderBase]: 11897/15433 cut-off events. [2025-03-09 01:24:30,353 INFO L125 PetriNetUnfolderBase]: For 1960/1997 co-relation queries the response was YES. [2025-03-09 01:24:30,372 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35104 conditions, 15433 events. 11897/15433 cut-off events. For 1960/1997 co-relation queries the response was YES. Maximal size of possible extension queue 641. Compared 73422 event pairs, 3629 based on Foata normal form. 2/13224 useless extension candidates. Maximal degree in co-relation 5584. Up to 7867 conditions per place. [2025-03-09 01:24:30,427 INFO L140 encePairwiseOnDemand]: 35/42 looper letters, 101 selfloop transitions, 10 changer transitions 0/113 dead transitions. [2025-03-09 01:24:30,428 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 113 transitions, 540 flow [2025-03-09 01:24:30,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:24:30,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:24:30,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 133 transitions. [2025-03-09 01:24:30,430 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6333333333333333 [2025-03-09 01:24:30,430 INFO L175 Difference]: Start difference. First operand has 39 places, 39 transitions, 111 flow. Second operand 5 states and 133 transitions. [2025-03-09 01:24:30,430 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 113 transitions, 540 flow [2025-03-09 01:24:30,431 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 113 transitions, 525 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 01:24:30,433 INFO L231 Difference]: Finished difference. Result has 45 places, 48 transitions, 169 flow [2025-03-09 01:24:30,433 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=169, PETRI_PLACES=45, PETRI_TRANSITIONS=48} [2025-03-09 01:24:30,434 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, -1 predicate places. [2025-03-09 01:24:30,434 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 48 transitions, 169 flow [2025-03-09 01:24:30,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states 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:24:30,434 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:24:30,434 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] [2025-03-09 01:24:30,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-09 01:24:30,435 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-09 01:24:30,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:24:30,435 INFO L85 PathProgramCache]: Analyzing trace with hash -1782274233, now seen corresponding path program 2 times [2025-03-09 01:24:30,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:24:30,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098008470] [2025-03-09 01:24:30,436 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:24:30,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:24:30,444 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-03-09 01:24:30,454 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-09 01:24:30,455 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:24:30,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:24:30,528 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:24:30,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:24:30,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098008470] [2025-03-09 01:24:30,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098008470] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:24:30,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1195352570] [2025-03-09 01:24:30,529 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:24:30,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:24:30,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:24:30,531 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:24:30,533 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:24:30,580 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-03-09 01:24:30,600 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-09 01:24:30,601 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:24:30,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:24:30,602 INFO L256 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 01:24:30,605 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:24:30,648 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:24:30,651 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:24:30,682 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:24:30,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1195352570] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:24:30,684 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:24:30,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9 [2025-03-09 01:24:30,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925259964] [2025-03-09 01:24:30,684 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:24:30,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-09 01:24:30,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:24:30,685 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-09 01:24:30,685 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-09 01:24:30,702 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 42 [2025-03-09 01:24:30,703 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 48 transitions, 169 flow. Second operand has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 9 states have internal predecessors, (98), 0 states have call successors, (0), 0 states 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:24:30,703 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:24:30,703 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 42 [2025-03-09 01:24:30,703 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:24:32,044 INFO L124 PetriNetUnfolderBase]: 16200/21085 cut-off events. [2025-03-09 01:24:32,044 INFO L125 PetriNetUnfolderBase]: For 7124/7124 co-relation queries the response was YES. [2025-03-09 01:24:32,086 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54801 conditions, 21085 events. 16200/21085 cut-off events. For 7124/7124 co-relation queries the response was YES. Maximal size of possible extension queue 861. Compared 106381 event pairs, 1341 based on Foata normal form. 346/20599 useless extension candidates. Maximal degree in co-relation 27430. Up to 4494 conditions per place. [2025-03-09 01:24:32,282 INFO L140 encePairwiseOnDemand]: 34/42 looper letters, 260 selfloop transitions, 36 changer transitions 0/298 dead transitions. [2025-03-09 01:24:32,282 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 298 transitions, 1478 flow [2025-03-09 01:24:32,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-09 01:24:32,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-09 01:24:32,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 366 transitions. [2025-03-09 01:24:32,288 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6224489795918368 [2025-03-09 01:24:32,288 INFO L175 Difference]: Start difference. First operand has 45 places, 48 transitions, 169 flow. Second operand 14 states and 366 transitions. [2025-03-09 01:24:32,288 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 298 transitions, 1478 flow [2025-03-09 01:24:32,300 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 298 transitions, 1478 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-09 01:24:32,302 INFO L231 Difference]: Finished difference. Result has 64 places, 76 transitions, 405 flow [2025-03-09 01:24:32,303 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=169, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=405, PETRI_PLACES=64, PETRI_TRANSITIONS=76} [2025-03-09 01:24:32,304 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 18 predicate places. [2025-03-09 01:24:32,304 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 76 transitions, 405 flow [2025-03-09 01:24:32,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 9 states have internal predecessors, (98), 0 states have call successors, (0), 0 states 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:24:32,304 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:24:32,305 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] [2025-03-09 01:24:32,312 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:24:32,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:24:32,505 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-09 01:24:32,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:24:32,506 INFO L85 PathProgramCache]: Analyzing trace with hash -493380627, now seen corresponding path program 3 times [2025-03-09 01:24:32,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:24:32,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616121322] [2025-03-09 01:24:32,506 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 01:24:32,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:24:32,511 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 2 equivalence classes. [2025-03-09 01:24:32,518 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-09 01:24:32,522 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-09 01:24:32,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:24:32,588 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:24:32,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:24:32,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616121322] [2025-03-09 01:24:32,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616121322] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:24:32,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:24:32,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 01:24:32,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688835368] [2025-03-09 01:24:32,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:24:32,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:24:32,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:24:32,591 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:24:32,591 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:24:32,596 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 42 [2025-03-09 01:24:32,597 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 76 transitions, 405 flow. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states 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:24:32,597 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:24:32,597 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 42 [2025-03-09 01:24:32,597 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:24:33,861 INFO L124 PetriNetUnfolderBase]: 22784/29853 cut-off events. [2025-03-09 01:24:33,861 INFO L125 PetriNetUnfolderBase]: For 36227/36227 co-relation queries the response was YES. [2025-03-09 01:24:33,916 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91261 conditions, 29853 events. 22784/29853 cut-off events. For 36227/36227 co-relation queries the response was YES. Maximal size of possible extension queue 1119. Compared 154912 event pairs, 6160 based on Foata normal form. 76/28749 useless extension candidates. Maximal degree in co-relation 82690. Up to 14037 conditions per place. [2025-03-09 01:24:34,035 INFO L140 encePairwiseOnDemand]: 36/42 looper letters, 145 selfloop transitions, 19 changer transitions 0/166 dead transitions. [2025-03-09 01:24:34,036 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 166 transitions, 1106 flow [2025-03-09 01:24:34,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:24:34,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:24:34,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 132 transitions. [2025-03-09 01:24:34,037 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6285714285714286 [2025-03-09 01:24:34,037 INFO L175 Difference]: Start difference. First operand has 64 places, 76 transitions, 405 flow. Second operand 5 states and 132 transitions. [2025-03-09 01:24:34,037 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 166 transitions, 1106 flow [2025-03-09 01:24:34,353 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 166 transitions, 1059 flow, removed 13 selfloop flow, removed 1 redundant places. [2025-03-09 01:24:34,355 INFO L231 Difference]: Finished difference. Result has 70 places, 84 transitions, 504 flow [2025-03-09 01:24:34,355 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=376, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=504, PETRI_PLACES=70, PETRI_TRANSITIONS=84} [2025-03-09 01:24:34,356 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 24 predicate places. [2025-03-09 01:24:34,356 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 84 transitions, 504 flow [2025-03-09 01:24:34,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states 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:24:34,356 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:24:34,356 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] [2025-03-09 01:24:34,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-09 01:24:34,356 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-09 01:24:34,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:24:34,357 INFO L85 PathProgramCache]: Analyzing trace with hash 61485161, now seen corresponding path program 1 times [2025-03-09 01:24:34,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:24:34,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220263878] [2025-03-09 01:24:34,357 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:24:34,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:24:34,363 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-09 01:24:34,372 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-09 01:24:34,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:24:34,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:24:34,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:24:34,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:24:34,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220263878] [2025-03-09 01:24:34,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220263878] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:24:34,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:24:34,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 01:24:34,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127456050] [2025-03-09 01:24:34,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:24:34,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:24:34,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:24:34,455 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:24:34,455 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:24:34,462 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 42 [2025-03-09 01:24:34,462 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 84 transitions, 504 flow. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states 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:24:34,462 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:24:34,462 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 42 [2025-03-09 01:24:34,462 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:24:36,238 INFO L124 PetriNetUnfolderBase]: 25215/33211 cut-off events. [2025-03-09 01:24:36,239 INFO L125 PetriNetUnfolderBase]: For 51132/51274 co-relation queries the response was YES. [2025-03-09 01:24:36,313 INFO L83 FinitePrefix]: Finished finitePrefix Result has 104163 conditions, 33211 events. 25215/33211 cut-off events. For 51132/51274 co-relation queries the response was YES. Maximal size of possible extension queue 1157. Compared 177108 event pairs, 7139 based on Foata normal form. 0/30400 useless extension candidates. Maximal degree in co-relation 92606. Up to 14514 conditions per place. [2025-03-09 01:24:36,420 INFO L140 encePairwiseOnDemand]: 36/42 looper letters, 139 selfloop transitions, 17 changer transitions 0/160 dead transitions. [2025-03-09 01:24:36,420 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 160 transitions, 1103 flow [2025-03-09 01:24:36,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:24:36,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:24:36,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 137 transitions. [2025-03-09 01:24:36,421 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6523809523809524 [2025-03-09 01:24:36,421 INFO L175 Difference]: Start difference. First operand has 70 places, 84 transitions, 504 flow. Second operand 5 states and 137 transitions. [2025-03-09 01:24:36,421 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 160 transitions, 1103 flow [2025-03-09 01:24:36,686 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 160 transitions, 1056 flow, removed 14 selfloop flow, removed 1 redundant places. [2025-03-09 01:24:36,688 INFO L231 Difference]: Finished difference. Result has 75 places, 86 transitions, 533 flow [2025-03-09 01:24:36,688 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=479, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=533, PETRI_PLACES=75, PETRI_TRANSITIONS=86} [2025-03-09 01:24:36,689 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 29 predicate places. [2025-03-09 01:24:36,689 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 86 transitions, 533 flow [2025-03-09 01:24:36,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states 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:24:36,689 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:24:36,689 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] [2025-03-09 01:24:36,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-09 01:24:36,689 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-09 01:24:36,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:24:36,689 INFO L85 PathProgramCache]: Analyzing trace with hash 1975266725, now seen corresponding path program 1 times [2025-03-09 01:24:36,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:24:36,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148501295] [2025-03-09 01:24:36,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:24:36,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:24:36,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-09 01:24:36,698 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-09 01:24:36,698 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:24:36,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:24:36,724 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:24:36,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:24:36,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148501295] [2025-03-09 01:24:36,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148501295] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:24:36,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:24:36,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:24:36,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788952336] [2025-03-09 01:24:36,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:24:36,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:24:36,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:24:36,725 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:24:36,725 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:24:36,725 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2025-03-09 01:24:36,725 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 86 transitions, 533 flow. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states 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:24:36,725 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:24:36,725 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2025-03-09 01:24:36,725 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:24:37,509 INFO L124 PetriNetUnfolderBase]: 13368/17935 cut-off events. [2025-03-09 01:24:37,509 INFO L125 PetriNetUnfolderBase]: For 38584/39680 co-relation queries the response was YES. [2025-03-09 01:24:37,544 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59055 conditions, 17935 events. 13368/17935 cut-off events. For 38584/39680 co-relation queries the response was YES. Maximal size of possible extension queue 726. Compared 92486 event pairs, 4232 based on Foata normal form. 597/17723 useless extension candidates. Maximal degree in co-relation 48933. Up to 12915 conditions per place. [2025-03-09 01:24:37,593 INFO L140 encePairwiseOnDemand]: 39/42 looper letters, 92 selfloop transitions, 3 changer transitions 0/99 dead transitions. [2025-03-09 01:24:37,593 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 99 transitions, 731 flow [2025-03-09 01:24:37,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:24:37,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:24:37,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 82 transitions. [2025-03-09 01:24:37,594 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6507936507936508 [2025-03-09 01:24:37,594 INFO L175 Difference]: Start difference. First operand has 75 places, 86 transitions, 533 flow. Second operand 3 states and 82 transitions. [2025-03-09 01:24:37,594 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 99 transitions, 731 flow [2025-03-09 01:24:37,630 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 99 transitions, 709 flow, removed 1 selfloop flow, removed 3 redundant places. [2025-03-09 01:24:37,631 INFO L231 Difference]: Finished difference. Result has 73 places, 75 transitions, 440 flow [2025-03-09 01:24:37,631 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=421, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=440, PETRI_PLACES=73, PETRI_TRANSITIONS=75} [2025-03-09 01:24:37,632 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 27 predicate places. [2025-03-09 01:24:37,632 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 75 transitions, 440 flow [2025-03-09 01:24:37,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states 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:24:37,632 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:24:37,632 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] [2025-03-09 01:24:37,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-09 01:24:37,632 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-09 01:24:37,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:24:37,633 INFO L85 PathProgramCache]: Analyzing trace with hash -1714628283, now seen corresponding path program 2 times [2025-03-09 01:24:37,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:24:37,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130688912] [2025-03-09 01:24:37,633 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:24:37,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:24:37,637 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 1 equivalence classes. [2025-03-09 01:24:37,640 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-09 01:24:37,641 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 01:24:37,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:24:37,682 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:24:37,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:24:37,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130688912] [2025-03-09 01:24:37,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130688912] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:24:37,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:24:37,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 01:24:37,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460369099] [2025-03-09 01:24:37,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:24:37,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:24:37,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:24:37,683 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:24:37,684 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:24:37,688 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 42 [2025-03-09 01:24:37,688 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 75 transitions, 440 flow. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states 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:24:37,689 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:24:37,689 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 42 [2025-03-09 01:24:37,689 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:24:39,278 INFO L124 PetriNetUnfolderBase]: 25352/33180 cut-off events. [2025-03-09 01:24:39,278 INFO L125 PetriNetUnfolderBase]: For 62046/62046 co-relation queries the response was YES. [2025-03-09 01:24:39,394 INFO L83 FinitePrefix]: Finished finitePrefix Result has 112497 conditions, 33180 events. 25352/33180 cut-off events. For 62046/62046 co-relation queries the response was YES. Maximal size of possible extension queue 1027. Compared 169885 event pairs, 8858 based on Foata normal form. 180/30316 useless extension candidates. Maximal degree in co-relation 95596. Up to 19522 conditions per place. [2025-03-09 01:24:39,521 INFO L140 encePairwiseOnDemand]: 34/42 looper letters, 133 selfloop transitions, 33 changer transitions 0/167 dead transitions. [2025-03-09 01:24:39,521 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 167 transitions, 1301 flow [2025-03-09 01:24:39,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:24:39,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:24:39,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 130 transitions. [2025-03-09 01:24:39,522 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6190476190476191 [2025-03-09 01:24:39,522 INFO L175 Difference]: Start difference. First operand has 73 places, 75 transitions, 440 flow. Second operand 5 states and 130 transitions. [2025-03-09 01:24:39,522 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 167 transitions, 1301 flow [2025-03-09 01:24:39,743 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 167 transitions, 1294 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 01:24:39,744 INFO L231 Difference]: Finished difference. Result has 79 places, 96 transitions, 711 flow [2025-03-09 01:24:39,744 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=437, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=711, PETRI_PLACES=79, PETRI_TRANSITIONS=96} [2025-03-09 01:24:39,745 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 33 predicate places. [2025-03-09 01:24:39,745 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 96 transitions, 711 flow [2025-03-09 01:24:39,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states 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:24:39,745 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:24:39,745 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] [2025-03-09 01:24:39,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-09 01:24:39,745 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-09 01:24:39,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:24:39,746 INFO L85 PathProgramCache]: Analyzing trace with hash -18790587, now seen corresponding path program 3 times [2025-03-09 01:24:39,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:24:39,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508992449] [2025-03-09 01:24:39,746 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 01:24:39,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:24:39,752 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 1 equivalence classes. [2025-03-09 01:24:39,755 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-09 01:24:39,755 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-09 01:24:39,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:24:39,800 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:24:39,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:24:39,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508992449] [2025-03-09 01:24:39,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508992449] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:24:39,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:24:39,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 01:24:39,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888078452] [2025-03-09 01:24:39,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:24:39,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:24:39,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:24:39,802 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:24:39,802 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:24:39,808 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 42 [2025-03-09 01:24:39,809 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 96 transitions, 711 flow. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states 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:24:39,809 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:24:39,809 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 42 [2025-03-09 01:24:39,810 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:24:41,701 INFO L124 PetriNetUnfolderBase]: 32000/41833 cut-off events. [2025-03-09 01:24:41,701 INFO L125 PetriNetUnfolderBase]: For 111899/112087 co-relation queries the response was YES. [2025-03-09 01:24:41,875 INFO L83 FinitePrefix]: Finished finitePrefix Result has 157830 conditions, 41833 events. 32000/41833 cut-off events. For 111899/112087 co-relation queries the response was YES. Maximal size of possible extension queue 1332. Compared 220305 event pairs, 10363 based on Foata normal form. 86/39986 useless extension candidates. Maximal degree in co-relation 124694. Up to 22982 conditions per place. [2025-03-09 01:24:42,052 INFO L140 encePairwiseOnDemand]: 35/42 looper letters, 172 selfloop transitions, 24 changer transitions 0/200 dead transitions. [2025-03-09 01:24:42,053 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 200 transitions, 1747 flow [2025-03-09 01:24:42,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:24:42,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:24:42,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 127 transitions. [2025-03-09 01:24:42,053 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6047619047619047 [2025-03-09 01:24:42,053 INFO L175 Difference]: Start difference. First operand has 79 places, 96 transitions, 711 flow. Second operand 5 states and 127 transitions. [2025-03-09 01:24:42,053 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 200 transitions, 1747 flow [2025-03-09 01:24:42,727 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 200 transitions, 1701 flow, removed 3 selfloop flow, removed 1 redundant places. [2025-03-09 01:24:42,729 INFO L231 Difference]: Finished difference. Result has 85 places, 114 transitions, 960 flow [2025-03-09 01:24:42,729 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=677, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=960, PETRI_PLACES=85, PETRI_TRANSITIONS=114} [2025-03-09 01:24:42,729 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 39 predicate places. [2025-03-09 01:24:42,729 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 114 transitions, 960 flow [2025-03-09 01:24:42,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states 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:24:42,730 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:24:42,730 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] [2025-03-09 01:24:42,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-09 01:24:42,730 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-09 01:24:42,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:24:42,730 INFO L85 PathProgramCache]: Analyzing trace with hash 475019667, now seen corresponding path program 1 times [2025-03-09 01:24:42,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:24:42,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198940907] [2025-03-09 01:24:42,730 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:24:42,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:24:42,735 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-09 01:24:42,738 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-09 01:24:42,738 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:24:42,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:24:42,760 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:24:42,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:24:42,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198940907] [2025-03-09 01:24:42,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198940907] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:24:42,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:24:42,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:24:42,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823481861] [2025-03-09 01:24:42,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:24:42,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:24:42,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:24:42,761 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:24:42,761 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:24:42,762 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2025-03-09 01:24:42,762 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 114 transitions, 960 flow. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states 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:24:42,762 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:24:42,762 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2025-03-09 01:24:42,762 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:24:44,357 INFO L124 PetriNetUnfolderBase]: 22425/30386 cut-off events. [2025-03-09 01:24:44,358 INFO L125 PetriNetUnfolderBase]: For 100676/102796 co-relation queries the response was YES. [2025-03-09 01:24:44,476 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119363 conditions, 30386 events. 22425/30386 cut-off events. For 100676/102796 co-relation queries the response was YES. Maximal size of possible extension queue 1016. Compared 167326 event pairs, 5934 based on Foata normal form. 115/29432 useless extension candidates. Maximal degree in co-relation 95467. Up to 19373 conditions per place. [2025-03-09 01:24:44,593 INFO L140 encePairwiseOnDemand]: 39/42 looper letters, 168 selfloop transitions, 3 changer transitions 7/184 dead transitions. [2025-03-09 01:24:44,593 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 184 transitions, 1944 flow [2025-03-09 01:24:44,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:24:44,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:24:44,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 78 transitions. [2025-03-09 01:24:44,594 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6190476190476191 [2025-03-09 01:24:44,594 INFO L175 Difference]: Start difference. First operand has 85 places, 114 transitions, 960 flow. Second operand 3 states and 78 transitions. [2025-03-09 01:24:44,594 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 184 transitions, 1944 flow [2025-03-09 01:24:44,744 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 184 transitions, 1928 flow, removed 8 selfloop flow, removed 0 redundant places. [2025-03-09 01:24:44,746 INFO L231 Difference]: Finished difference. Result has 88 places, 111 transitions, 934 flow [2025-03-09 01:24:44,746 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=940, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=934, PETRI_PLACES=88, PETRI_TRANSITIONS=111} [2025-03-09 01:24:44,746 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 42 predicate places. [2025-03-09 01:24:44,747 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 111 transitions, 934 flow [2025-03-09 01:24:44,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states 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:24:44,747 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:24:44,747 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] [2025-03-09 01:24:44,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-09 01:24:44,747 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-09 01:24:44,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:24:44,747 INFO L85 PathProgramCache]: Analyzing trace with hash 814392643, now seen corresponding path program 4 times [2025-03-09 01:24:44,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:24:44,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390909588] [2025-03-09 01:24:44,747 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 01:24:44,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:24:44,752 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 26 statements into 2 equivalence classes. [2025-03-09 01:24:44,755 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 25 of 26 statements. [2025-03-09 01:24:44,757 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-09 01:24:44,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:24:44,791 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:24:44,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:24:44,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390909588] [2025-03-09 01:24:44,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390909588] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:24:44,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [756664428] [2025-03-09 01:24:44,793 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 01:24:44,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:24:44,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:24:44,795 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:24:44,796 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:24:44,830 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 26 statements into 2 equivalence classes. [2025-03-09 01:24:44,844 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 25 of 26 statements. [2025-03-09 01:24:44,844 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-09 01:24:44,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:24:44,845 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 01:24:44,846 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:24:44,885 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:24:44,885 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:24:44,902 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:24:44,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [756664428] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:24:44,903 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:24:44,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-03-09 01:24:44,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268075655] [2025-03-09 01:24:44,903 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:24:44,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 01:24:44,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:24:44,904 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 01:24:44,904 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-09 01:24:44,907 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 42 [2025-03-09 01:24:44,908 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 111 transitions, 934 flow. Second operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 0 states 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:24:44,908 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:24:44,908 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 42 [2025-03-09 01:24:44,908 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:24:47,092 INFO L124 PetriNetUnfolderBase]: 29557/39350 cut-off events. [2025-03-09 01:24:47,092 INFO L125 PetriNetUnfolderBase]: For 117899/121280 co-relation queries the response was YES. [2025-03-09 01:24:47,217 INFO L83 FinitePrefix]: Finished finitePrefix Result has 152236 conditions, 39350 events. 29557/39350 cut-off events. For 117899/121280 co-relation queries the response was YES. Maximal size of possible extension queue 1149. Compared 215413 event pairs, 6648 based on Foata normal form. 684/39873 useless extension candidates. Maximal degree in co-relation 131004. Up to 14499 conditions per place. [2025-03-09 01:24:47,343 INFO L140 encePairwiseOnDemand]: 35/42 looper letters, 255 selfloop transitions, 38 changer transitions 0/296 dead transitions. [2025-03-09 01:24:47,343 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 296 transitions, 2638 flow [2025-03-09 01:24:47,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 01:24:47,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-09 01:24:47,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 209 transitions. [2025-03-09 01:24:47,348 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6220238095238095 [2025-03-09 01:24:47,348 INFO L175 Difference]: Start difference. First operand has 88 places, 111 transitions, 934 flow. Second operand 8 states and 209 transitions. [2025-03-09 01:24:47,348 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 296 transitions, 2638 flow [2025-03-09 01:24:47,627 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 296 transitions, 2587 flow, removed 20 selfloop flow, removed 2 redundant places. [2025-03-09 01:24:47,629 INFO L231 Difference]: Finished difference. Result has 95 places, 129 transitions, 1220 flow [2025-03-09 01:24:47,629 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=923, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1220, PETRI_PLACES=95, PETRI_TRANSITIONS=129} [2025-03-09 01:24:47,630 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 49 predicate places. [2025-03-09 01:24:47,630 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 129 transitions, 1220 flow [2025-03-09 01:24:47,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 0 states 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:24:47,630 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:24:47,630 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] [2025-03-09 01:24:47,635 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-09 01:24:47,830 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:24:47,831 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-09 01:24:47,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:24:47,831 INFO L85 PathProgramCache]: Analyzing trace with hash -315360165, now seen corresponding path program 4 times [2025-03-09 01:24:47,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:24:47,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609192558] [2025-03-09 01:24:47,831 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 01:24:47,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:24:47,835 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 26 statements into 2 equivalence classes. [2025-03-09 01:24:47,840 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 25 of 26 statements. [2025-03-09 01:24:47,840 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-09 01:24:47,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:24:47,871 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:24:47,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:24:47,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609192558] [2025-03-09 01:24:47,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609192558] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:24:47,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:24:47,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 01:24:47,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98796389] [2025-03-09 01:24:47,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:24:47,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:24:47,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:24:47,872 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:24:47,873 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:24:47,877 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 42 [2025-03-09 01:24:47,877 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 129 transitions, 1220 flow. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states 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:24:47,877 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:24:47,877 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 42 [2025-03-09 01:24:47,877 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:24:50,106 INFO L124 PetriNetUnfolderBase]: 34620/45788 cut-off events. [2025-03-09 01:24:50,106 INFO L125 PetriNetUnfolderBase]: For 173533/173533 co-relation queries the response was YES. [2025-03-09 01:24:50,304 INFO L83 FinitePrefix]: Finished finitePrefix Result has 185746 conditions, 45788 events. 34620/45788 cut-off events. For 173533/173533 co-relation queries the response was YES. Maximal size of possible extension queue 1139. Compared 240929 event pairs, 2792 based on Foata normal form. 408/46196 useless extension candidates. Maximal degree in co-relation 163231. Up to 15466 conditions per place. [2025-03-09 01:24:50,453 INFO L140 encePairwiseOnDemand]: 35/42 looper letters, 344 selfloop transitions, 88 changer transitions 13/446 dead transitions. [2025-03-09 01:24:50,453 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 446 transitions, 4805 flow [2025-03-09 01:24:50,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-09 01:24:50,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-09 01:24:50,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 208 transitions. [2025-03-09 01:24:50,454 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5502645502645502 [2025-03-09 01:24:50,454 INFO L175 Difference]: Start difference. First operand has 95 places, 129 transitions, 1220 flow. Second operand 9 states and 208 transitions. [2025-03-09 01:24:50,454 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 446 transitions, 4805 flow [2025-03-09 01:24:50,825 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 446 transitions, 4583 flow, removed 63 selfloop flow, removed 1 redundant places. [2025-03-09 01:24:50,829 INFO L231 Difference]: Finished difference. Result has 108 places, 184 transitions, 2146 flow [2025-03-09 01:24:50,829 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1171, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2146, PETRI_PLACES=108, PETRI_TRANSITIONS=184} [2025-03-09 01:24:50,829 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 62 predicate places. [2025-03-09 01:24:50,829 INFO L471 AbstractCegarLoop]: Abstraction has has 108 places, 184 transitions, 2146 flow [2025-03-09 01:24:50,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states 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:24:50,829 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:24:50,829 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] [2025-03-09 01:24:50,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-09 01:24:50,830 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-09 01:24:50,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:24:50,830 INFO L85 PathProgramCache]: Analyzing trace with hash 1820189259, now seen corresponding path program 5 times [2025-03-09 01:24:50,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:24:50,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664044064] [2025-03-09 01:24:50,830 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-09 01:24:50,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:24:50,835 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-03-09 01:24:50,838 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-09 01:24:50,838 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:24:50,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:24:50,878 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:24:50,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:24:50,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664044064] [2025-03-09 01:24:50,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664044064] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:24:50,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1679423695] [2025-03-09 01:24:50,879 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-09 01:24:50,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:24:50,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:24:50,888 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:24:50,889 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:24:50,925 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-03-09 01:24:50,938 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-09 01:24:50,938 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:24:50,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:24:50,939 INFO L256 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 01:24:50,940 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:24:50,967 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:24:50,967 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:24:50,988 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:24:50,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1679423695] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:24:50,988 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:24:50,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-03-09 01:24:50,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612544832] [2025-03-09 01:24:50,989 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:24:50,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-09 01:24:50,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:24:50,989 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-09 01:24:50,990 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-03-09 01:24:50,997 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 42 [2025-03-09 01:24:50,997 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 184 transitions, 2146 flow. Second operand has 9 states, 9 states have (on average 11.11111111111111) internal successors, (100), 9 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:24:50,997 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:24:50,997 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 42 [2025-03-09 01:24:50,997 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:24:53,490 INFO L124 PetriNetUnfolderBase]: 31493/42477 cut-off events. [2025-03-09 01:24:53,490 INFO L125 PetriNetUnfolderBase]: For 196082/197500 co-relation queries the response was YES. [2025-03-09 01:24:53,700 INFO L83 FinitePrefix]: Finished finitePrefix Result has 183983 conditions, 42477 events. 31493/42477 cut-off events. For 196082/197500 co-relation queries the response was YES. Maximal size of possible extension queue 1219. Compared 240102 event pairs, 4440 based on Foata normal form. 754/43187 useless extension candidates. Maximal degree in co-relation 167828. Up to 11593 conditions per place. [2025-03-09 01:24:53,845 INFO L140 encePairwiseOnDemand]: 35/42 looper letters, 290 selfloop transitions, 72 changer transitions 0/368 dead transitions. [2025-03-09 01:24:53,845 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 368 transitions, 4115 flow [2025-03-09 01:24:53,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 01:24:53,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-09 01:24:53,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 204 transitions. [2025-03-09 01:24:53,846 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6071428571428571 [2025-03-09 01:24:53,847 INFO L175 Difference]: Start difference. First operand has 108 places, 184 transitions, 2146 flow. Second operand 8 states and 204 transitions. [2025-03-09 01:24:53,847 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 368 transitions, 4115 flow [2025-03-09 01:24:54,790 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 368 transitions, 3999 flow, removed 58 selfloop flow, removed 0 redundant places. [2025-03-09 01:24:54,794 INFO L231 Difference]: Finished difference. Result has 119 places, 193 transitions, 2408 flow [2025-03-09 01:24:54,794 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1962, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=176, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2408, PETRI_PLACES=119, PETRI_TRANSITIONS=193} [2025-03-09 01:24:54,794 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 73 predicate places. [2025-03-09 01:24:54,794 INFO L471 AbstractCegarLoop]: Abstraction has has 119 places, 193 transitions, 2408 flow [2025-03-09 01:24:54,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.11111111111111) internal successors, (100), 9 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:24:54,794 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:24:54,794 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] [2025-03-09 01:24:54,800 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:24:54,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:24:54,995 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-09 01:24:54,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:24:54,995 INFO L85 PathProgramCache]: Analyzing trace with hash -1390632555, now seen corresponding path program 5 times [2025-03-09 01:24:54,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:24:54,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230799486] [2025-03-09 01:24:54,996 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-09 01:24:54,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:24:54,999 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-03-09 01:24:55,002 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-09 01:24:55,002 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:24:55,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:24:55,049 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:24:55,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:24:55,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230799486] [2025-03-09 01:24:55,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230799486] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:24:55,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1781445185] [2025-03-09 01:24:55,049 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-09 01:24:55,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:24:55,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:24:55,051 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:24:55,053 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:24:55,082 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-03-09 01:24:55,096 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-09 01:24:55,096 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:24:55,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:24:55,097 INFO L256 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 01:24:55,097 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:24:55,126 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:24:55,126 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:24:55,148 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:24:55,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1781445185] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:24:55,148 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:24:55,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-09 01:24:55,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395263187] [2025-03-09 01:24:55,150 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:24:55,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-09 01:24:55,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:24:55,150 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-09 01:24:55,150 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-09 01:24:55,153 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 42 [2025-03-09 01:24:55,153 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 193 transitions, 2408 flow. Second operand has 10 states, 10 states have (on average 9.6) internal successors, (96), 10 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:24:55,153 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:24:55,153 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 42 [2025-03-09 01:24:55,153 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:24:58,588 INFO L124 PetriNetUnfolderBase]: 38430/50953 cut-off events. [2025-03-09 01:24:58,589 INFO L125 PetriNetUnfolderBase]: For 308941/308941 co-relation queries the response was YES. [2025-03-09 01:24:58,903 INFO L83 FinitePrefix]: Finished finitePrefix Result has 235247 conditions, 50953 events. 38430/50953 cut-off events. For 308941/308941 co-relation queries the response was YES. Maximal size of possible extension queue 1304. Compared 275705 event pairs, 11047 based on Foata normal form. 288/51241 useless extension candidates. Maximal degree in co-relation 213304. Up to 21759 conditions per place. [2025-03-09 01:24:59,092 INFO L140 encePairwiseOnDemand]: 35/42 looper letters, 202 selfloop transitions, 112 changer transitions 2/317 dead transitions. [2025-03-09 01:24:59,092 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 317 transitions, 3913 flow [2025-03-09 01:24:59,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 01:24:59,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-09 01:24:59,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 177 transitions. [2025-03-09 01:24:59,093 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6020408163265306 [2025-03-09 01:24:59,093 INFO L175 Difference]: Start difference. First operand has 119 places, 193 transitions, 2408 flow. Second operand 7 states and 177 transitions. [2025-03-09 01:24:59,093 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 317 transitions, 3913 flow [2025-03-09 01:25:00,498 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 317 transitions, 3859 flow, removed 27 selfloop flow, removed 0 redundant places. [2025-03-09 01:25:00,501 INFO L231 Difference]: Finished difference. Result has 127 places, 206 transitions, 2871 flow [2025-03-09 01:25:00,501 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2366, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=193, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=99, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2871, PETRI_PLACES=127, PETRI_TRANSITIONS=206} [2025-03-09 01:25:00,501 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 81 predicate places. [2025-03-09 01:25:00,501 INFO L471 AbstractCegarLoop]: Abstraction has has 127 places, 206 transitions, 2871 flow [2025-03-09 01:25:00,502 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.6) internal successors, (96), 10 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:25:00,502 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:25:00,502 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] [2025-03-09 01:25:00,507 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-09 01:25:00,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:25:00,702 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-09 01:25:00,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:25:00,703 INFO L85 PathProgramCache]: Analyzing trace with hash -1738210921, now seen corresponding path program 6 times [2025-03-09 01:25:00,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:25:00,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679194075] [2025-03-09 01:25:00,703 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-09 01:25:00,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:25:00,708 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 26 statements into 1 equivalence classes. [2025-03-09 01:25:00,711 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-09 01:25:00,711 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-09 01:25:00,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:25:00,753 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:25:00,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:25:00,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679194075] [2025-03-09 01:25:00,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679194075] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:25:00,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:25:00,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 01:25:00,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192048372] [2025-03-09 01:25:00,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:25:00,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:25:00,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:25:00,754 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:25:00,755 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:25:00,761 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 42 [2025-03-09 01:25:00,761 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 206 transitions, 2871 flow. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states 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:25:00,761 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:25:00,761 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 42 [2025-03-09 01:25:00,761 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:25:03,580 INFO L124 PetriNetUnfolderBase]: 35966/48172 cut-off events. [2025-03-09 01:25:03,581 INFO L125 PetriNetUnfolderBase]: For 306947/307161 co-relation queries the response was YES. [2025-03-09 01:25:03,922 INFO L83 FinitePrefix]: Finished finitePrefix Result has 229239 conditions, 48172 events. 35966/48172 cut-off events. For 306947/307161 co-relation queries the response was YES. Maximal size of possible extension queue 1350. Compared 265878 event pairs, 16983 based on Foata normal form. 98/48123 useless extension candidates. Maximal degree in co-relation 209696. Up to 32407 conditions per place. [2025-03-09 01:25:04,094 INFO L140 encePairwiseOnDemand]: 35/42 looper letters, 142 selfloop transitions, 71 changer transitions 17/266 dead transitions. [2025-03-09 01:25:04,095 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 266 transitions, 3707 flow [2025-03-09 01:25:04,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:25:04,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:25:04,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 124 transitions. [2025-03-09 01:25:04,095 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5904761904761905 [2025-03-09 01:25:04,095 INFO L175 Difference]: Start difference. First operand has 127 places, 206 transitions, 2871 flow. Second operand 5 states and 124 transitions. [2025-03-09 01:25:04,096 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 266 transitions, 3707 flow [2025-03-09 01:25:05,508 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 266 transitions, 3619 flow, removed 17 selfloop flow, removed 1 redundant places. [2025-03-09 01:25:05,511 INFO L231 Difference]: Finished difference. Result has 131 places, 200 transitions, 2815 flow [2025-03-09 01:25:05,511 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2783, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=206, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=71, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2815, PETRI_PLACES=131, PETRI_TRANSITIONS=200} [2025-03-09 01:25:05,511 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 85 predicate places. [2025-03-09 01:25:05,511 INFO L471 AbstractCegarLoop]: Abstraction has has 131 places, 200 transitions, 2815 flow [2025-03-09 01:25:05,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states 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:25:05,512 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:25:05,512 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:25:05,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-09 01:25:05,513 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-09 01:25:05,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:25:05,513 INFO L85 PathProgramCache]: Analyzing trace with hash -1851950085, now seen corresponding path program 6 times [2025-03-09 01:25:05,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:25:05,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112945843] [2025-03-09 01:25:05,513 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-09 01:25:05,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:25:05,516 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 26 statements into 2 equivalence classes. [2025-03-09 01:25:05,519 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-09 01:25:05,522 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-03-09 01:25:05,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:25:05,554 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:25:05,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:25:05,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112945843] [2025-03-09 01:25:05,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112945843] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:25:05,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:25:05,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 01:25:05,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111223772] [2025-03-09 01:25:05,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:25:05,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:25:05,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:25:05,555 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:25:05,556 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:25:05,560 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 42 [2025-03-09 01:25:05,560 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 200 transitions, 2815 flow. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states 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:25:05,560 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:25:05,560 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 42 [2025-03-09 01:25:05,560 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:25:08,166 INFO L124 PetriNetUnfolderBase]: 32442/43404 cut-off events. [2025-03-09 01:25:08,167 INFO L125 PetriNetUnfolderBase]: For 306225/308297 co-relation queries the response was YES. [2025-03-09 01:25:08,435 INFO L83 FinitePrefix]: Finished finitePrefix Result has 207075 conditions, 43404 events. 32442/43404 cut-off events. For 306225/308297 co-relation queries the response was YES. Maximal size of possible extension queue 1286. Compared 240064 event pairs, 9711 based on Foata normal form. 516/43838 useless extension candidates. Maximal degree in co-relation 188334. Up to 23189 conditions per place. [2025-03-09 01:25:08,588 INFO L140 encePairwiseOnDemand]: 35/42 looper letters, 256 selfloop transitions, 45 changer transitions 8/315 dead transitions. [2025-03-09 01:25:08,589 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 315 transitions, 4520 flow [2025-03-09 01:25:08,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:25:08,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:25:08,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 130 transitions. [2025-03-09 01:25:08,590 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6190476190476191 [2025-03-09 01:25:08,590 INFO L175 Difference]: Start difference. First operand has 131 places, 200 transitions, 2815 flow. Second operand 5 states and 130 transitions. [2025-03-09 01:25:08,590 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 315 transitions, 4520 flow [2025-03-09 01:25:09,695 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 315 transitions, 4170 flow, removed 14 selfloop flow, removed 6 redundant places. [2025-03-09 01:25:09,698 INFO L231 Difference]: Finished difference. Result has 130 places, 220 transitions, 3056 flow [2025-03-09 01:25:09,698 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2563, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=200, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=155, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=3056, PETRI_PLACES=130, PETRI_TRANSITIONS=220} [2025-03-09 01:25:09,698 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 84 predicate places. [2025-03-09 01:25:09,698 INFO L471 AbstractCegarLoop]: Abstraction has has 130 places, 220 transitions, 3056 flow [2025-03-09 01:25:09,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states 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:25:09,698 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:25:09,698 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] [2025-03-09 01:25:09,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-09 01:25:09,699 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-09 01:25:09,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:25:09,699 INFO L85 PathProgramCache]: Analyzing trace with hash -1894917639, now seen corresponding path program 7 times [2025-03-09 01:25:09,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:25:09,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906536572] [2025-03-09 01:25:09,699 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-09 01:25:09,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:25:09,702 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-09 01:25:09,704 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-09 01:25:09,704 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:25:09,704 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:25:09,741 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:25:09,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:25:09,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906536572] [2025-03-09 01:25:09,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906536572] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:25:09,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:25:09,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 01:25:09,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009776499] [2025-03-09 01:25:09,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:25:09,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:25:09,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:25:09,742 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:25:09,742 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:25:09,748 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 42 [2025-03-09 01:25:09,749 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 220 transitions, 3056 flow. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states 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:25:09,749 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:25:09,749 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 42 [2025-03-09 01:25:09,749 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:25:12,682 INFO L124 PetriNetUnfolderBase]: 37190/49503 cut-off events. [2025-03-09 01:25:12,682 INFO L125 PetriNetUnfolderBase]: For 341516/342096 co-relation queries the response was YES. [2025-03-09 01:25:13,008 INFO L83 FinitePrefix]: Finished finitePrefix Result has 234357 conditions, 49503 events. 37190/49503 cut-off events. For 341516/342096 co-relation queries the response was YES. Maximal size of possible extension queue 1372. Compared 274389 event pairs, 12649 based on Foata normal form. 610/49974 useless extension candidates. Maximal degree in co-relation 211914. Up to 32042 conditions per place. [2025-03-09 01:25:13,184 INFO L140 encePairwiseOnDemand]: 35/42 looper letters, 356 selfloop transitions, 24 changer transitions 6/422 dead transitions. [2025-03-09 01:25:13,184 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 422 transitions, 6082 flow [2025-03-09 01:25:13,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:25:13,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:25:13,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 125 transitions. [2025-03-09 01:25:13,185 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5952380952380952 [2025-03-09 01:25:13,185 INFO L175 Difference]: Start difference. First operand has 130 places, 220 transitions, 3056 flow. Second operand 5 states and 125 transitions. [2025-03-09 01:25:13,185 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 422 transitions, 6082 flow [2025-03-09 01:25:14,488 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 422 transitions, 5990 flow, removed 10 selfloop flow, removed 1 redundant places. [2025-03-09 01:25:14,491 INFO L231 Difference]: Finished difference. Result has 135 places, 226 transitions, 3125 flow [2025-03-09 01:25:14,491 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3025, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=220, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=200, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=3125, PETRI_PLACES=135, PETRI_TRANSITIONS=226} [2025-03-09 01:25:14,492 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 89 predicate places. [2025-03-09 01:25:14,492 INFO L471 AbstractCegarLoop]: Abstraction has has 135 places, 226 transitions, 3125 flow [2025-03-09 01:25:14,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states 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:25:14,492 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:25:14,492 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] [2025-03-09 01:25:14,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-09 01:25:14,492 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-09 01:25:14,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:25:14,492 INFO L85 PathProgramCache]: Analyzing trace with hash -1437436089, now seen corresponding path program 8 times [2025-03-09 01:25:14,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:25:14,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697052441] [2025-03-09 01:25:14,493 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:25:14,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:25:14,497 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-03-09 01:25:14,500 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-09 01:25:14,500 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:25:14,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:25:14,544 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:25:14,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:25:14,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697052441] [2025-03-09 01:25:14,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697052441] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:25:14,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [625186161] [2025-03-09 01:25:14,545 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:25:14,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:25:14,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:25:14,548 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:25:14,549 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:25:14,582 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-03-09 01:25:14,595 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-09 01:25:14,595 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:25:14,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:25:14,596 INFO L256 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 01:25:14,597 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:25:14,624 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:25:14,624 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:25:14,645 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:25:14,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [625186161] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:25:14,645 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:25:14,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2025-03-09 01:25:14,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839664110] [2025-03-09 01:25:14,646 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:25:14,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-09 01:25:14,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:25:14,646 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-09 01:25:14,646 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2025-03-09 01:25:14,649 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 42 [2025-03-09 01:25:14,650 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 226 transitions, 3125 flow. Second operand has 11 states, 11 states have (on average 9.272727272727273) internal successors, (102), 11 states have internal predecessors, (102), 0 states have call successors, (0), 0 states 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:25:14,650 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:25:14,650 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 42 [2025-03-09 01:25:14,650 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:25:18,339 INFO L124 PetriNetUnfolderBase]: 43923/58088 cut-off events. [2025-03-09 01:25:18,340 INFO L125 PetriNetUnfolderBase]: For 415515/415515 co-relation queries the response was YES. [2025-03-09 01:25:18,752 INFO L83 FinitePrefix]: Finished finitePrefix Result has 289130 conditions, 58088 events. 43923/58088 cut-off events. For 415515/415515 co-relation queries the response was YES. Maximal size of possible extension queue 1524. Compared 320111 event pairs, 3743 based on Foata normal form. 600/58688 useless extension candidates. Maximal degree in co-relation 269216. Up to 10733 conditions per place. [2025-03-09 01:25:18,958 INFO L140 encePairwiseOnDemand]: 34/42 looper letters, 436 selfloop transitions, 172 changer transitions 36/645 dead transitions. [2025-03-09 01:25:18,958 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 645 transitions, 8209 flow [2025-03-09 01:25:18,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-09 01:25:18,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-09 01:25:18,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 365 transitions. [2025-03-09 01:25:18,959 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5793650793650794 [2025-03-09 01:25:18,959 INFO L175 Difference]: Start difference. First operand has 135 places, 226 transitions, 3125 flow. Second operand 15 states and 365 transitions. [2025-03-09 01:25:18,959 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 645 transitions, 8209 flow [2025-03-09 01:25:21,354 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 645 transitions, 8161 flow, removed 6 selfloop flow, removed 2 redundant places. [2025-03-09 01:25:21,359 INFO L231 Difference]: Finished difference. Result has 151 places, 264 transitions, 3979 flow [2025-03-09 01:25:21,360 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3067, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=223, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=118, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=3979, PETRI_PLACES=151, PETRI_TRANSITIONS=264} [2025-03-09 01:25:21,360 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 105 predicate places. [2025-03-09 01:25:21,360 INFO L471 AbstractCegarLoop]: Abstraction has has 151 places, 264 transitions, 3979 flow [2025-03-09 01:25:21,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.272727272727273) internal successors, (102), 11 states have internal predecessors, (102), 0 states have call successors, (0), 0 states 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:25:21,360 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:25:21,360 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] [2025-03-09 01:25:21,366 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:25:21,560 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,SelfDestructingSolverStorable16 [2025-03-09 01:25:21,561 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-09 01:25:21,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:25:21,561 INFO L85 PathProgramCache]: Analyzing trace with hash -2016901758, now seen corresponding path program 1 times [2025-03-09 01:25:21,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:25:21,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954784523] [2025-03-09 01:25:21,561 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:25:21,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:25:21,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-09 01:25:21,566 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-09 01:25:21,566 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:25:21,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:25:21,610 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:25:21,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:25:21,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954784523] [2025-03-09 01:25:21,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954784523] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:25:21,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:25:21,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 01:25:21,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658178172] [2025-03-09 01:25:21,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:25:21,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 01:25:21,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:25:21,612 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 01:25:21,612 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-09 01:25:21,615 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 42 [2025-03-09 01:25:21,615 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 264 transitions, 3979 flow. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:25:21,615 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:25:21,615 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 42 [2025-03-09 01:25:21,616 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:25:26,577 INFO L124 PetriNetUnfolderBase]: 44238/59842 cut-off events. [2025-03-09 01:25:26,577 INFO L125 PetriNetUnfolderBase]: For 453737/454773 co-relation queries the response was YES. [2025-03-09 01:25:26,955 INFO L83 FinitePrefix]: Finished finitePrefix Result has 306088 conditions, 59842 events. 44238/59842 cut-off events. For 453737/454773 co-relation queries the response was YES. Maximal size of possible extension queue 1865. Compared 356208 event pairs, 6818 based on Foata normal form. 754/60308 useless extension candidates. Maximal degree in co-relation 287569. Up to 29840 conditions per place. [2025-03-09 01:25:27,384 INFO L140 encePairwiseOnDemand]: 36/42 looper letters, 248 selfloop transitions, 156 changer transitions 0/413 dead transitions. [2025-03-09 01:25:27,385 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 413 transitions, 5873 flow [2025-03-09 01:25:27,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 01:25:27,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-09 01:25:27,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 180 transitions. [2025-03-09 01:25:27,386 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6122448979591837 [2025-03-09 01:25:27,386 INFO L175 Difference]: Start difference. First operand has 151 places, 264 transitions, 3979 flow. Second operand 7 states and 180 transitions. [2025-03-09 01:25:27,386 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 413 transitions, 5873 flow [2025-03-09 01:25:30,575 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 413 transitions, 5271 flow, removed 100 selfloop flow, removed 18 redundant places. [2025-03-09 01:25:30,579 INFO L231 Difference]: Finished difference. Result has 136 places, 277 transitions, 4079 flow [2025-03-09 01:25:30,579 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3435, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=263, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=142, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=4079, PETRI_PLACES=136, PETRI_TRANSITIONS=277} [2025-03-09 01:25:30,580 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 90 predicate places. [2025-03-09 01:25:30,580 INFO L471 AbstractCegarLoop]: Abstraction has has 136 places, 277 transitions, 4079 flow [2025-03-09 01:25:30,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:25:30,580 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:25:30,580 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] [2025-03-09 01:25:30,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-09 01:25:30,580 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-09 01:25:30,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:25:30,581 INFO L85 PathProgramCache]: Analyzing trace with hash -1975541120, now seen corresponding path program 2 times [2025-03-09 01:25:30,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:25:30,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407633925] [2025-03-09 01:25:30,581 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:25:30,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:25:30,584 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-03-09 01:25:30,586 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 26 of 29 statements. [2025-03-09 01:25:30,586 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 01:25:30,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:25:30,611 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:25:30,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:25:30,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407633925] [2025-03-09 01:25:30,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407633925] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:25:30,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:25:30,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 01:25:30,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994711223] [2025-03-09 01:25:30,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:25:30,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:25:30,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:25:30,612 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:25:30,612 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:25:30,615 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 42 [2025-03-09 01:25:30,616 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 277 transitions, 4079 flow. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 0 states 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:25:30,616 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:25:30,616 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 42 [2025-03-09 01:25:30,616 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:25:35,401 INFO L124 PetriNetUnfolderBase]: 45780/61562 cut-off events. [2025-03-09 01:25:35,401 INFO L125 PetriNetUnfolderBase]: For 470082/471330 co-relation queries the response was YES. [2025-03-09 01:25:35,679 INFO L83 FinitePrefix]: Finished finitePrefix Result has 302198 conditions, 61562 events. 45780/61562 cut-off events. For 470082/471330 co-relation queries the response was YES. Maximal size of possible extension queue 1947. Compared 363194 event pairs, 14484 based on Foata normal form. 102/61346 useless extension candidates. Maximal degree in co-relation 249935. Up to 33490 conditions per place. [2025-03-09 01:25:35,891 INFO L140 encePairwiseOnDemand]: 37/42 looper letters, 365 selfloop transitions, 27 changer transitions 9/410 dead transitions. [2025-03-09 01:25:35,892 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 410 transitions, 6119 flow [2025-03-09 01:25:35,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:25:35,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:25:35,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 118 transitions. [2025-03-09 01:25:35,892 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5619047619047619 [2025-03-09 01:25:35,892 INFO L175 Difference]: Start difference. First operand has 136 places, 277 transitions, 4079 flow. Second operand 5 states and 118 transitions. [2025-03-09 01:25:35,892 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 410 transitions, 6119 flow [2025-03-09 01:25:37,883 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 410 transitions, 6038 flow, removed 6 selfloop flow, removed 2 redundant places. [2025-03-09 01:25:37,887 INFO L231 Difference]: Finished difference. Result has 140 places, 277 transitions, 4076 flow [2025-03-09 01:25:37,887 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=4008, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=277, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=250, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=4076, PETRI_PLACES=140, PETRI_TRANSITIONS=277} [2025-03-09 01:25:37,888 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 94 predicate places. [2025-03-09 01:25:37,888 INFO L471 AbstractCegarLoop]: Abstraction has has 140 places, 277 transitions, 4076 flow [2025-03-09 01:25:37,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 0 states 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:25:37,888 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:25:37,888 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] [2025-03-09 01:25:37,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-09 01:25:37,888 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-09 01:25:37,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:25:37,889 INFO L85 PathProgramCache]: Analyzing trace with hash 211687150, now seen corresponding path program 3 times [2025-03-09 01:25:37,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:25:37,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483865363] [2025-03-09 01:25:37,889 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 01:25:37,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:25:37,892 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 3 equivalence classes. [2025-03-09 01:25:37,895 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 26 of 29 statements. [2025-03-09 01:25:37,895 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-09 01:25:37,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:25:37,931 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:25:37,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:25:37,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483865363] [2025-03-09 01:25:37,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483865363] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:25:37,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:25:37,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 01:25:37,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529685450] [2025-03-09 01:25:37,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:25:37,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:25:37,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:25:37,932 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:25:37,932 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:25:37,937 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 42 [2025-03-09 01:25:37,937 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 277 transitions, 4076 flow. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 0 states 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:25:37,937 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:25:37,937 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 42 [2025-03-09 01:25:37,937 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:25:44,113 INFO L124 PetriNetUnfolderBase]: 57046/76687 cut-off events. [2025-03-09 01:25:44,113 INFO L125 PetriNetUnfolderBase]: For 687423/688781 co-relation queries the response was YES. [2025-03-09 01:25:44,504 INFO L83 FinitePrefix]: Finished finitePrefix Result has 385434 conditions, 76687 events. 57046/76687 cut-off events. For 687423/688781 co-relation queries the response was YES. Maximal size of possible extension queue 2562. Compared 464240 event pairs, 17262 based on Foata normal form. 352/76866 useless extension candidates. Maximal degree in co-relation 311193. Up to 42829 conditions per place. [2025-03-09 01:25:44,993 INFO L140 encePairwiseOnDemand]: 36/42 looper letters, 282 selfloop transitions, 309 changer transitions 7/607 dead transitions. [2025-03-09 01:25:44,994 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 607 transitions, 10664 flow [2025-03-09 01:25:44,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:25:44,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:25:44,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 122 transitions. [2025-03-09 01:25:44,994 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.580952380952381 [2025-03-09 01:25:44,994 INFO L175 Difference]: Start difference. First operand has 140 places, 277 transitions, 4076 flow. Second operand 5 states and 122 transitions. [2025-03-09 01:25:44,994 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 607 transitions, 10664 flow [2025-03-09 01:25:47,410 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 607 transitions, 10570 flow, removed 6 selfloop flow, removed 3 redundant places. [2025-03-09 01:25:47,417 INFO L231 Difference]: Finished difference. Result has 143 places, 478 transitions, 8908 flow [2025-03-09 01:25:47,417 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=4020, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=277, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=108, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=164, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=8908, PETRI_PLACES=143, PETRI_TRANSITIONS=478} [2025-03-09 01:25:47,417 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 97 predicate places. [2025-03-09 01:25:47,417 INFO L471 AbstractCegarLoop]: Abstraction has has 143 places, 478 transitions, 8908 flow [2025-03-09 01:25:47,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 0 states 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:25:47,418 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:25:47,418 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] [2025-03-09 01:25:47,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-09 01:25:47,418 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-09 01:25:47,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:25:47,418 INFO L85 PathProgramCache]: Analyzing trace with hash 1498087148, now seen corresponding path program 4 times [2025-03-09 01:25:47,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:25:47,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127572589] [2025-03-09 01:25:47,418 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 01:25:47,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:25:47,422 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 29 statements into 2 equivalence classes. [2025-03-09 01:25:47,425 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 28 of 29 statements. [2025-03-09 01:25:47,425 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-09 01:25:47,425 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:25:47,450 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:25:47,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:25:47,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127572589] [2025-03-09 01:25:47,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127572589] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:25:47,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:25:47,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 01:25:47,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638359281] [2025-03-09 01:25:47,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:25:47,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:25:47,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:25:47,452 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:25:47,452 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:25:47,453 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 42 [2025-03-09 01:25:47,453 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 478 transitions, 8908 flow. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:25:47,453 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:25:47,453 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 42 [2025-03-09 01:25:47,453 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand