./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-wmm/safe035_power.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread-wmm/safe035_power.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 6415bffc70cf05f8f6460106962f2f9c59b321fd2fc94a45894cc3c1f3d85b66 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 00:52:44,528 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 00:52:44,581 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-01-10 00:52:44,584 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 00:52:44,584 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 00:52:44,605 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 00:52:44,606 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 00:52:44,606 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 00:52:44,606 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 00:52:44,606 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 00:52:44,606 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 00:52:44,609 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 00:52:44,610 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 00:52:44,610 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 00:52:44,610 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 00:52:44,610 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 00:52:44,610 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 00:52:44,610 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 00:52:44,610 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 00:52:44,611 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 00:52:44,611 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-10 00:52:44,611 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-10 00:52:44,611 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-10 00:52:44,611 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 00:52:44,611 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-10 00:52:44,611 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 00:52:44,611 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 00:52:44,611 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 00:52:44,611 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 00:52:44,611 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 00:52:44,611 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 00:52:44,612 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 00:52:44,612 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 00:52:44,612 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:52:44,612 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 00:52:44,612 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 00:52:44,612 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 00:52:44,612 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 00:52:44,612 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:52:44,612 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 00:52:44,612 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 00:52:44,612 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 00:52:44,612 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 00:52:44,612 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 00:52:44,613 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 00:52:44,613 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 00:52:44,613 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 00:52:44,613 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-jdk21/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 -> 6415bffc70cf05f8f6460106962f2f9c59b321fd2fc94a45894cc3c1f3d85b66 [2025-01-10 00:52:44,849 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 00:52:44,856 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 00:52:44,858 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 00:52:44,859 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 00:52:44,859 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 00:52:44,860 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/safe035_power.i [2025-01-10 00:52:46,013 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6093d1b3c/8c05ab288b6f4bc6a54fa634d97a1bb6/FLAG3e600c6f2 [2025-01-10 00:52:46,325 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 00:52:46,326 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe035_power.i [2025-01-10 00:52:46,340 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6093d1b3c/8c05ab288b6f4bc6a54fa634d97a1bb6/FLAG3e600c6f2 [2025-01-10 00:52:46,356 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6093d1b3c/8c05ab288b6f4bc6a54fa634d97a1bb6 [2025-01-10 00:52:46,357 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 00:52:46,358 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 00:52:46,360 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 00:52:46,360 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 00:52:46,362 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 00:52:46,363 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:52:46" (1/1) ... [2025-01-10 00:52:46,364 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c2b9dc3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:52:46, skipping insertion in model container [2025-01-10 00:52:46,364 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:52:46" (1/1) ... [2025-01-10 00:52:46,396 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 00:52:46,712 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 00:52:46,723 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 00:52:46,790 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 00:52:46,817 INFO L204 MainTranslator]: Completed translation [2025-01-10 00:52:46,818 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:52:46 WrapperNode [2025-01-10 00:52:46,819 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 00:52:46,820 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 00:52:46,820 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 00:52:46,820 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 00:52:46,824 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:52:46" (1/1) ... [2025-01-10 00:52:46,835 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:52:46" (1/1) ... [2025-01-10 00:52:46,862 INFO L138 Inliner]: procedures = 175, calls = 49, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 169 [2025-01-10 00:52:46,862 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 00:52:46,863 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 00:52:46,863 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 00:52:46,863 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 00:52:46,869 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:52:46" (1/1) ... [2025-01-10 00:52:46,869 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:52:46" (1/1) ... [2025-01-10 00:52:46,877 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:52:46" (1/1) ... [2025-01-10 00:52:46,901 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-01-10 00:52:46,901 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:52:46" (1/1) ... [2025-01-10 00:52:46,901 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:52:46" (1/1) ... [2025-01-10 00:52:46,915 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:52:46" (1/1) ... [2025-01-10 00:52:46,916 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:52:46" (1/1) ... [2025-01-10 00:52:46,920 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:52:46" (1/1) ... [2025-01-10 00:52:46,922 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:52:46" (1/1) ... [2025-01-10 00:52:46,923 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:52:46" (1/1) ... [2025-01-10 00:52:46,928 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 00:52:46,929 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 00:52:46,929 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 00:52:46,929 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 00:52:46,930 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:52:46" (1/1) ... [2025-01-10 00:52:46,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:52:46,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:52:46,955 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-10 00:52:46,957 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-10 00:52:46,974 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-01-10 00:52:46,974 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 00:52:46,974 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-01-10 00:52:46,974 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-01-10 00:52:46,974 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-01-10 00:52:46,974 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-01-10 00:52:46,975 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2025-01-10 00:52:46,975 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2025-01-10 00:52:46,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 00:52:46,975 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-01-10 00:52:46,975 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 00:52:46,975 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 00:52:46,976 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-10 00:52:47,083 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 00:52:47,085 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 00:52:47,439 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 00:52:47,439 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 00:52:47,686 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 00:52:47,687 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 00:52:47,687 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:52:47 BoogieIcfgContainer [2025-01-10 00:52:47,687 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 00:52:47,689 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 00:52:47,689 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 00:52:47,692 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 00:52:47,692 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 12:52:46" (1/3) ... [2025-01-10 00:52:47,693 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@792324e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:52:47, skipping insertion in model container [2025-01-10 00:52:47,694 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:52:46" (2/3) ... [2025-01-10 00:52:47,694 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@792324e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:52:47, skipping insertion in model container [2025-01-10 00:52:47,694 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:52:47" (3/3) ... [2025-01-10 00:52:47,695 INFO L128 eAbstractionObserver]: Analyzing ICFG safe035_power.i [2025-01-10 00:52:47,706 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 00:52:47,707 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG safe035_power.i that has 4 procedures, 46 locations, 1 initial locations, 0 loop locations, and 3 error locations. [2025-01-10 00:52:47,707 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 00:52:47,760 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-10 00:52:47,785 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 47 transitions, 106 flow [2025-01-10 00:52:47,815 INFO L124 PetriNetUnfolderBase]: 2/44 cut-off events. [2025-01-10 00:52:47,818 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:52:47,820 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54 conditions, 44 events. 2/44 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 92 event pairs, 0 based on Foata normal form. 0/39 useless extension candidates. Maximal degree in co-relation 46. Up to 2 conditions per place. [2025-01-10 00:52:47,822 INFO L82 GeneralOperation]: Start removeDead. Operand has 55 places, 47 transitions, 106 flow [2025-01-10 00:52:47,825 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 52 places, 44 transitions, 97 flow [2025-01-10 00:52:47,831 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 00:52:47,841 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;@6049132a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 00:52:47,841 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-01-10 00:52:47,848 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 00:52:47,849 INFO L124 PetriNetUnfolderBase]: 0/18 cut-off events. [2025-01-10 00:52:47,849 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:52:47,849 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:52:47,850 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:52:47,850 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-01-10 00:52:47,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:52:47,855 INFO L85 PathProgramCache]: Analyzing trace with hash 807765749, now seen corresponding path program 1 times [2025-01-10 00:52:47,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:52:47,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216751630] [2025-01-10 00:52:47,861 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:52:47,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:52:47,925 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 00:52:47,962 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 00:52:47,962 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:52:47,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:52:48,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:52:48,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:52:48,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216751630] [2025-01-10 00:52:48,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216751630] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:52:48,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:52:48,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 00:52:48,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641665831] [2025-01-10 00:52:48,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:52:48,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:52:48,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:52:48,347 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:52:48,347 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:52:48,349 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 47 [2025-01-10 00:52:48,351 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 44 transitions, 97 flow. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 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-01-10 00:52:48,352 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:52:48,352 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 47 [2025-01-10 00:52:48,353 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:52:49,112 INFO L124 PetriNetUnfolderBase]: 2523/3960 cut-off events. [2025-01-10 00:52:49,112 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2025-01-10 00:52:49,126 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7667 conditions, 3960 events. 2523/3960 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 215. Compared 25048 event pairs, 328 based on Foata normal form. 240/4184 useless extension candidates. Maximal degree in co-relation 7656. Up to 3096 conditions per place. [2025-01-10 00:52:49,145 INFO L140 encePairwiseOnDemand]: 42/47 looper letters, 37 selfloop transitions, 2 changer transitions 2/55 dead transitions. [2025-01-10 00:52:49,146 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 55 transitions, 201 flow [2025-01-10 00:52:49,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:52:49,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:52:49,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 97 transitions. [2025-01-10 00:52:49,158 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6879432624113475 [2025-01-10 00:52:49,159 INFO L175 Difference]: Start difference. First operand has 52 places, 44 transitions, 97 flow. Second operand 3 states and 97 transitions. [2025-01-10 00:52:49,159 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 55 transitions, 201 flow [2025-01-10 00:52:49,163 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 55 transitions, 198 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 00:52:49,167 INFO L231 Difference]: Finished difference. Result has 49 places, 39 transitions, 88 flow [2025-01-10 00:52:49,169 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=88, PETRI_PLACES=49, PETRI_TRANSITIONS=39} [2025-01-10 00:52:49,172 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, -3 predicate places. [2025-01-10 00:52:49,173 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 39 transitions, 88 flow [2025-01-10 00:52:49,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 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-01-10 00:52:49,173 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:52:49,173 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:52:49,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 00:52:49,174 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-01-10 00:52:49,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:52:49,175 INFO L85 PathProgramCache]: Analyzing trace with hash -1292564532, now seen corresponding path program 1 times [2025-01-10 00:52:49,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:52:49,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752792846] [2025-01-10 00:52:49,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:52:49,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:52:49,190 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 00:52:49,209 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 00:52:49,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:52:49,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:52:49,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:52:49,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:52:49,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752792846] [2025-01-10 00:52:49,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752792846] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:52:49,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:52:49,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 00:52:49,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138457611] [2025-01-10 00:52:49,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:52:49,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:52:49,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:52:49,283 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:52:49,283 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:52:49,286 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 47 [2025-01-10 00:52:49,287 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 39 transitions, 88 flow. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:52:49,287 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:52:49,287 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 47 [2025-01-10 00:52:49,287 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:52:49,685 INFO L124 PetriNetUnfolderBase]: 2237/3766 cut-off events. [2025-01-10 00:52:49,685 INFO L125 PetriNetUnfolderBase]: For 160/160 co-relation queries the response was YES. [2025-01-10 00:52:49,692 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7226 conditions, 3766 events. 2237/3766 cut-off events. For 160/160 co-relation queries the response was YES. Maximal size of possible extension queue 214. Compared 24897 event pairs, 2237 based on Foata normal form. 120/3830 useless extension candidates. Maximal degree in co-relation 7216. Up to 3246 conditions per place. [2025-01-10 00:52:49,704 INFO L140 encePairwiseOnDemand]: 45/47 looper letters, 23 selfloop transitions, 1 changer transitions 1/38 dead transitions. [2025-01-10 00:52:49,704 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 38 transitions, 136 flow [2025-01-10 00:52:49,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:52:49,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:52:49,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 74 transitions. [2025-01-10 00:52:49,706 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.524822695035461 [2025-01-10 00:52:49,706 INFO L175 Difference]: Start difference. First operand has 49 places, 39 transitions, 88 flow. Second operand 3 states and 74 transitions. [2025-01-10 00:52:49,707 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 38 transitions, 136 flow [2025-01-10 00:52:49,708 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 38 transitions, 132 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 00:52:49,708 INFO L231 Difference]: Finished difference. Result has 47 places, 37 transitions, 82 flow [2025-01-10 00:52:49,708 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=82, PETRI_PLACES=47, PETRI_TRANSITIONS=37} [2025-01-10 00:52:49,709 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, -5 predicate places. [2025-01-10 00:52:49,709 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 37 transitions, 82 flow [2025-01-10 00:52:49,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:52:49,709 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:52:49,709 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:52:49,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 00:52:49,709 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-01-10 00:52:49,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:52:49,711 INFO L85 PathProgramCache]: Analyzing trace with hash -1292563015, now seen corresponding path program 1 times [2025-01-10 00:52:49,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:52:49,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616232951] [2025-01-10 00:52:49,711 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:52:49,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:52:49,724 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 00:52:49,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 00:52:49,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:52:49,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:52:49,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:52:49,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:52:49,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616232951] [2025-01-10 00:52:49,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616232951] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:52:49,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:52:49,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 00:52:49,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441044572] [2025-01-10 00:52:49,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:52:49,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 00:52:49,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:52:49,952 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 00:52:49,952 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 00:52:49,954 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 47 [2025-01-10 00:52:49,954 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 37 transitions, 82 flow. Second operand has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:52:49,954 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:52:49,954 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 47 [2025-01-10 00:52:49,954 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:52:50,545 INFO L124 PetriNetUnfolderBase]: 2423/3892 cut-off events. [2025-01-10 00:52:50,545 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:52:50,550 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7498 conditions, 3892 events. 2423/3892 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 222. Compared 24907 event pairs, 661 based on Foata normal form. 0/3808 useless extension candidates. Maximal degree in co-relation 7492. Up to 1372 conditions per place. [2025-01-10 00:52:50,561 INFO L140 encePairwiseOnDemand]: 41/47 looper letters, 32 selfloop transitions, 2 changer transitions 53/99 dead transitions. [2025-01-10 00:52:50,562 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 99 transitions, 380 flow [2025-01-10 00:52:50,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 00:52:50,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-10 00:52:50,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 217 transitions. [2025-01-10 00:52:50,565 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5771276595744681 [2025-01-10 00:52:50,565 INFO L175 Difference]: Start difference. First operand has 47 places, 37 transitions, 82 flow. Second operand 8 states and 217 transitions. [2025-01-10 00:52:50,565 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 99 transitions, 380 flow [2025-01-10 00:52:50,566 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 99 transitions, 379 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 00:52:50,568 INFO L231 Difference]: Finished difference. Result has 57 places, 36 transitions, 95 flow [2025-01-10 00:52:50,568 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=81, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=95, PETRI_PLACES=57, PETRI_TRANSITIONS=36} [2025-01-10 00:52:50,569 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 5 predicate places. [2025-01-10 00:52:50,569 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 36 transitions, 95 flow [2025-01-10 00:52:50,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:52:50,570 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:52:50,570 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:52:50,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 00:52:50,570 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-01-10 00:52:50,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:52:50,571 INFO L85 PathProgramCache]: Analyzing trace with hash -1422718442, now seen corresponding path program 1 times [2025-01-10 00:52:50,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:52:50,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921473750] [2025-01-10 00:52:50,571 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:52:50,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:52:50,588 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-10 00:52:50,663 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-10 00:52:50,663 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:52:50,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:52:51,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:52:51,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:52:51,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921473750] [2025-01-10 00:52:51,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921473750] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:52:51,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:52:51,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-10 00:52:51,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321334213] [2025-01-10 00:52:51,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:52:51,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-10 00:52:51,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:52:51,638 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-10 00:52:51,638 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-01-10 00:52:51,645 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 47 [2025-01-10 00:52:51,646 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 36 transitions, 95 flow. Second operand has 9 states, 9 states have (on average 16.666666666666668) internal successors, (150), 9 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:52:51,646 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:52:51,646 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 47 [2025-01-10 00:52:51,646 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:52:52,430 INFO L124 PetriNetUnfolderBase]: 2862/4608 cut-off events. [2025-01-10 00:52:52,431 INFO L125 PetriNetUnfolderBase]: For 546/546 co-relation queries the response was YES. [2025-01-10 00:52:52,438 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9805 conditions, 4608 events. 2862/4608 cut-off events. For 546/546 co-relation queries the response was YES. Maximal size of possible extension queue 228. Compared 28473 event pairs, 299 based on Foata normal form. 75/4665 useless extension candidates. Maximal degree in co-relation 9793. Up to 2719 conditions per place. [2025-01-10 00:52:52,453 INFO L140 encePairwiseOnDemand]: 32/47 looper letters, 49 selfloop transitions, 23 changer transitions 22/105 dead transitions. [2025-01-10 00:52:52,453 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 105 transitions, 430 flow [2025-01-10 00:52:52,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 00:52:52,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-10 00:52:52,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 215 transitions. [2025-01-10 00:52:52,455 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5718085106382979 [2025-01-10 00:52:52,455 INFO L175 Difference]: Start difference. First operand has 57 places, 36 transitions, 95 flow. Second operand 8 states and 215 transitions. [2025-01-10 00:52:52,455 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 105 transitions, 430 flow [2025-01-10 00:52:52,476 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 105 transitions, 412 flow, removed 6 selfloop flow, removed 6 redundant places. [2025-01-10 00:52:52,477 INFO L231 Difference]: Finished difference. Result has 57 places, 62 transitions, 244 flow [2025-01-10 00:52:52,477 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=83, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=244, PETRI_PLACES=57, PETRI_TRANSITIONS=62} [2025-01-10 00:52:52,477 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 5 predicate places. [2025-01-10 00:52:52,477 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 62 transitions, 244 flow [2025-01-10 00:52:52,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 16.666666666666668) internal successors, (150), 9 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:52:52,478 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:52:52,478 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:52:52,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 00:52:52,478 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-01-10 00:52:52,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:52:52,478 INFO L85 PathProgramCache]: Analyzing trace with hash -493432102, now seen corresponding path program 2 times [2025-01-10 00:52:52,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:52:52,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513210598] [2025-01-10 00:52:52,478 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 00:52:52,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:52:52,486 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 1 equivalence classes. [2025-01-10 00:52:52,512 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-10 00:52:52,512 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 00:52:52,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:52:53,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:52:53,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:52:53,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513210598] [2025-01-10 00:52:53,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513210598] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:52:53,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:52:53,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-10 00:52:53,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525763697] [2025-01-10 00:52:53,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:52:53,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-10 00:52:53,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:52:53,879 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-10 00:52:53,879 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-01-10 00:52:53,881 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 47 [2025-01-10 00:52:53,881 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 62 transitions, 244 flow. Second operand has 9 states, 9 states have (on average 16.666666666666668) internal successors, (150), 9 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:52:53,882 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:52:53,882 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 47 [2025-01-10 00:52:53,882 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:52:54,943 INFO L124 PetriNetUnfolderBase]: 3224/5191 cut-off events. [2025-01-10 00:52:54,943 INFO L125 PetriNetUnfolderBase]: For 2104/2114 co-relation queries the response was YES. [2025-01-10 00:52:54,954 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14699 conditions, 5191 events. 3224/5191 cut-off events. For 2104/2114 co-relation queries the response was YES. Maximal size of possible extension queue 259. Compared 32368 event pairs, 320 based on Foata normal form. 75/5248 useless extension candidates. Maximal degree in co-relation 14686. Up to 2967 conditions per place. [2025-01-10 00:52:54,970 INFO L140 encePairwiseOnDemand]: 32/47 looper letters, 60 selfloop transitions, 44 changer transitions 22/137 dead transitions. [2025-01-10 00:52:54,971 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 137 transitions, 780 flow [2025-01-10 00:52:54,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 00:52:54,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-10 00:52:54,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 241 transitions. [2025-01-10 00:52:54,972 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5697399527186762 [2025-01-10 00:52:54,972 INFO L175 Difference]: Start difference. First operand has 57 places, 62 transitions, 244 flow. Second operand 9 states and 241 transitions. [2025-01-10 00:52:54,972 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 137 transitions, 780 flow [2025-01-10 00:52:54,979 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 137 transitions, 774 flow, removed 3 selfloop flow, removed 2 redundant places. [2025-01-10 00:52:54,981 INFO L231 Difference]: Finished difference. Result has 66 places, 91 transitions, 557 flow [2025-01-10 00:52:54,981 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=240, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=557, PETRI_PLACES=66, PETRI_TRANSITIONS=91} [2025-01-10 00:52:54,981 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 14 predicate places. [2025-01-10 00:52:54,982 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 91 transitions, 557 flow [2025-01-10 00:52:54,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 16.666666666666668) internal successors, (150), 9 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:52:54,982 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:52:54,982 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] [2025-01-10 00:52:54,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 00:52:54,982 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-01-10 00:52:54,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:52:54,983 INFO L85 PathProgramCache]: Analyzing trace with hash -1077433384, now seen corresponding path program 1 times [2025-01-10 00:52:54,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:52:54,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071034704] [2025-01-10 00:52:54,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:52:54,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:52:54,991 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-10 00:52:55,017 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-10 00:52:55,017 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:52:55,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:52:55,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:52:55,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:52:55,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071034704] [2025-01-10 00:52:55,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071034704] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:52:55,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:52:55,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-10 00:52:55,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583861761] [2025-01-10 00:52:55,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:52:55,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-10 00:52:55,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:52:55,543 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-10 00:52:55,543 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-01-10 00:52:55,546 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 47 [2025-01-10 00:52:55,547 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 91 transitions, 557 flow. Second operand has 9 states, 9 states have (on average 16.77777777777778) internal successors, (151), 9 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:52:55,547 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:52:55,547 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 47 [2025-01-10 00:52:55,547 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:52:56,546 INFO L124 PetriNetUnfolderBase]: 4360/6972 cut-off events. [2025-01-10 00:52:56,546 INFO L125 PetriNetUnfolderBase]: For 8299/8309 co-relation queries the response was YES. [2025-01-10 00:52:56,561 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24961 conditions, 6972 events. 4360/6972 cut-off events. For 8299/8309 co-relation queries the response was YES. Maximal size of possible extension queue 366. Compared 46017 event pairs, 394 based on Foata normal form. 129/7083 useless extension candidates. Maximal degree in co-relation 24943. Up to 3183 conditions per place. [2025-01-10 00:52:56,578 INFO L140 encePairwiseOnDemand]: 32/47 looper letters, 107 selfloop transitions, 33 changer transitions 46/197 dead transitions. [2025-01-10 00:52:56,578 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 197 transitions, 1514 flow [2025-01-10 00:52:56,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-10 00:52:56,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-01-10 00:52:56,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 294 transitions. [2025-01-10 00:52:56,579 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5686653771760155 [2025-01-10 00:52:56,579 INFO L175 Difference]: Start difference. First operand has 66 places, 91 transitions, 557 flow. Second operand 11 states and 294 transitions. [2025-01-10 00:52:56,579 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 197 transitions, 1514 flow [2025-01-10 00:52:56,610 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 197 transitions, 1417 flow, removed 8 selfloop flow, removed 5 redundant places. [2025-01-10 00:52:56,613 INFO L231 Difference]: Finished difference. Result has 77 places, 118 transitions, 878 flow [2025-01-10 00:52:56,613 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=500, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=878, PETRI_PLACES=77, PETRI_TRANSITIONS=118} [2025-01-10 00:52:56,615 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 25 predicate places. [2025-01-10 00:52:56,615 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 118 transitions, 878 flow [2025-01-10 00:52:56,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 16.77777777777778) internal successors, (151), 9 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:52:56,615 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:52:56,615 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] [2025-01-10 00:52:56,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 00:52:56,616 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-01-10 00:52:56,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:52:56,616 INFO L85 PathProgramCache]: Analyzing trace with hash -434974154, now seen corresponding path program 2 times [2025-01-10 00:52:56,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:52:56,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111899489] [2025-01-10 00:52:56,617 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 00:52:56,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:52:56,625 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 1 equivalence classes. [2025-01-10 00:52:56,654 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-10 00:52:56,655 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 00:52:56,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:52:57,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:52:57,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:52:57,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111899489] [2025-01-10 00:52:57,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111899489] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:52:57,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:52:57,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-10 00:52:57,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787062485] [2025-01-10 00:52:57,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:52:57,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-10 00:52:57,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:52:57,644 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-10 00:52:57,644 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-01-10 00:52:57,647 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 47 [2025-01-10 00:52:57,647 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 118 transitions, 878 flow. Second operand has 10 states, 10 states have (on average 16.6) internal successors, (166), 10 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:52:57,647 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:52:57,647 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 47 [2025-01-10 00:52:57,647 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:52:58,668 INFO L124 PetriNetUnfolderBase]: 4283/6888 cut-off events. [2025-01-10 00:52:58,669 INFO L125 PetriNetUnfolderBase]: For 14688/14688 co-relation queries the response was YES. [2025-01-10 00:52:58,689 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27465 conditions, 6888 events. 4283/6888 cut-off events. For 14688/14688 co-relation queries the response was YES. Maximal size of possible extension queue 375. Compared 45840 event pairs, 982 based on Foata normal form. 70/6934 useless extension candidates. Maximal degree in co-relation 27441. Up to 5544 conditions per place. [2025-01-10 00:52:58,709 INFO L140 encePairwiseOnDemand]: 39/47 looper letters, 147 selfloop transitions, 16 changer transitions 35/209 dead transitions. [2025-01-10 00:52:58,709 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 209 transitions, 1910 flow [2025-01-10 00:52:58,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 00:52:58,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-10 00:52:58,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 204 transitions. [2025-01-10 00:52:58,711 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5425531914893617 [2025-01-10 00:52:58,711 INFO L175 Difference]: Start difference. First operand has 77 places, 118 transitions, 878 flow. Second operand 8 states and 204 transitions. [2025-01-10 00:52:58,711 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 209 transitions, 1910 flow [2025-01-10 00:52:58,746 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 209 transitions, 1864 flow, removed 8 selfloop flow, removed 4 redundant places. [2025-01-10 00:52:58,748 INFO L231 Difference]: Finished difference. Result has 82 places, 133 transitions, 1078 flow [2025-01-10 00:52:58,748 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=850, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1078, PETRI_PLACES=82, PETRI_TRANSITIONS=133} [2025-01-10 00:52:58,749 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 30 predicate places. [2025-01-10 00:52:58,749 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 133 transitions, 1078 flow [2025-01-10 00:52:58,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 16.6) internal successors, (166), 10 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:52:58,750 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:52:58,750 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] [2025-01-10 00:52:58,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 00:52:58,751 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-01-10 00:52:58,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:52:58,751 INFO L85 PathProgramCache]: Analyzing trace with hash -735675559, now seen corresponding path program 1 times [2025-01-10 00:52:58,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:52:58,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077651700] [2025-01-10 00:52:58,751 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:52:58,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:52:58,760 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-10 00:52:58,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-10 00:52:58,776 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:52:58,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:52:59,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:52:59,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:52:59,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077651700] [2025-01-10 00:52:59,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077651700] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:52:59,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:52:59,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-10 00:52:59,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569264241] [2025-01-10 00:52:59,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:52:59,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-10 00:52:59,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:52:59,267 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-10 00:52:59,267 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-01-10 00:52:59,272 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 47 [2025-01-10 00:52:59,273 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 133 transitions, 1078 flow. Second operand has 10 states, 10 states have (on average 16.6) internal successors, (166), 10 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:52:59,274 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:52:59,274 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 47 [2025-01-10 00:52:59,274 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:53:00,879 INFO L124 PetriNetUnfolderBase]: 6419/10453 cut-off events. [2025-01-10 00:53:00,879 INFO L125 PetriNetUnfolderBase]: For 27826/27830 co-relation queries the response was YES. [2025-01-10 00:53:00,905 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40711 conditions, 10453 events. 6419/10453 cut-off events. For 27826/27830 co-relation queries the response was YES. Maximal size of possible extension queue 573. Compared 75745 event pairs, 1785 based on Foata normal form. 66/10508 useless extension candidates. Maximal degree in co-relation 40683. Up to 4629 conditions per place. [2025-01-10 00:53:00,936 INFO L140 encePairwiseOnDemand]: 33/47 looper letters, 117 selfloop transitions, 52 changer transitions 58/238 dead transitions. [2025-01-10 00:53:00,937 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 238 transitions, 2111 flow [2025-01-10 00:53:00,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-10 00:53:00,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-01-10 00:53:00,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 310 transitions. [2025-01-10 00:53:00,938 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.549645390070922 [2025-01-10 00:53:00,938 INFO L175 Difference]: Start difference. First operand has 82 places, 133 transitions, 1078 flow. Second operand 12 states and 310 transitions. [2025-01-10 00:53:00,939 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 238 transitions, 2111 flow [2025-01-10 00:53:01,013 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 238 transitions, 2049 flow, removed 31 selfloop flow, removed 4 redundant places. [2025-01-10 00:53:01,015 INFO L231 Difference]: Finished difference. Result has 93 places, 143 transitions, 1345 flow [2025-01-10 00:53:01,016 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=1044, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1345, PETRI_PLACES=93, PETRI_TRANSITIONS=143} [2025-01-10 00:53:01,018 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 41 predicate places. [2025-01-10 00:53:01,018 INFO L471 AbstractCegarLoop]: Abstraction has has 93 places, 143 transitions, 1345 flow [2025-01-10 00:53:01,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 16.6) internal successors, (166), 10 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:53:01,018 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:53:01,018 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] [2025-01-10 00:53:01,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 00:53:01,018 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-01-10 00:53:01,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:53:01,018 INFO L85 PathProgramCache]: Analyzing trace with hash -1300750051, now seen corresponding path program 2 times [2025-01-10 00:53:01,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:53:01,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393318595] [2025-01-10 00:53:01,019 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 00:53:01,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:53:01,030 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 1 equivalence classes. [2025-01-10 00:53:01,071 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-10 00:53:01,072 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 00:53:01,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:53:01,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:53:01,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:53:01,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393318595] [2025-01-10 00:53:01,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393318595] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:53:01,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:53:01,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:53:01,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023765243] [2025-01-10 00:53:01,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:53:01,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:53:01,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:53:01,193 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:53:01,193 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:53:01,199 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 47 [2025-01-10 00:53:01,200 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 143 transitions, 1345 flow. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:53:01,200 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:53:01,200 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 47 [2025-01-10 00:53:01,200 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:53:02,869 INFO L124 PetriNetUnfolderBase]: 9948/15419 cut-off events. [2025-01-10 00:53:02,869 INFO L125 PetriNetUnfolderBase]: For 77011/77309 co-relation queries the response was YES. [2025-01-10 00:53:02,920 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64782 conditions, 15419 events. 9948/15419 cut-off events. For 77011/77309 co-relation queries the response was YES. Maximal size of possible extension queue 666. Compared 103758 event pairs, 1088 based on Foata normal form. 917/16280 useless extension candidates. Maximal degree in co-relation 64748. Up to 7730 conditions per place. [2025-01-10 00:53:02,966 INFO L140 encePairwiseOnDemand]: 41/47 looper letters, 201 selfloop transitions, 5 changer transitions 6/239 dead transitions. [2025-01-10 00:53:02,966 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 239 transitions, 2572 flow [2025-01-10 00:53:02,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 00:53:02,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 00:53:02,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 115 transitions. [2025-01-10 00:53:02,967 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6117021276595744 [2025-01-10 00:53:02,967 INFO L175 Difference]: Start difference. First operand has 93 places, 143 transitions, 1345 flow. Second operand 4 states and 115 transitions. [2025-01-10 00:53:02,967 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 239 transitions, 2572 flow [2025-01-10 00:53:03,164 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 239 transitions, 2493 flow, removed 18 selfloop flow, removed 6 redundant places. [2025-01-10 00:53:03,166 INFO L231 Difference]: Finished difference. Result has 86 places, 138 transitions, 1229 flow [2025-01-10 00:53:03,166 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=1191, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1229, PETRI_PLACES=86, PETRI_TRANSITIONS=138} [2025-01-10 00:53:03,167 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 34 predicate places. [2025-01-10 00:53:03,167 INFO L471 AbstractCegarLoop]: Abstraction has has 86 places, 138 transitions, 1229 flow [2025-01-10 00:53:03,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:53:03,168 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:53:03,168 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-01-10 00:53:03,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-10 00:53:03,168 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-01-10 00:53:03,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:53:03,168 INFO L85 PathProgramCache]: Analyzing trace with hash 1636569368, now seen corresponding path program 1 times [2025-01-10 00:53:03,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:53:03,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450869526] [2025-01-10 00:53:03,169 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:53:03,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:53:03,181 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-10 00:53:03,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-10 00:53:03,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:53:03,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:53:03,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:53:03,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:53:03,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450869526] [2025-01-10 00:53:03,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450869526] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:53:03,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:53:03,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 00:53:03,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399243618] [2025-01-10 00:53:03,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:53:03,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 00:53:03,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:53:03,328 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 00:53:03,329 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 00:53:03,338 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 47 [2025-01-10 00:53:03,338 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 138 transitions, 1229 flow. Second operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:53:03,339 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:53:03,339 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 47 [2025-01-10 00:53:03,339 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:53:04,665 INFO L124 PetriNetUnfolderBase]: 7215/11376 cut-off events. [2025-01-10 00:53:04,665 INFO L125 PetriNetUnfolderBase]: For 44695/44909 co-relation queries the response was YES. [2025-01-10 00:53:04,704 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47684 conditions, 11376 events. 7215/11376 cut-off events. For 44695/44909 co-relation queries the response was YES. Maximal size of possible extension queue 484. Compared 74697 event pairs, 818 based on Foata normal form. 662/12006 useless extension candidates. Maximal degree in co-relation 47651. Up to 4065 conditions per place. [2025-01-10 00:53:04,734 INFO L140 encePairwiseOnDemand]: 41/47 looper letters, 163 selfloop transitions, 8 changer transitions 9/202 dead transitions. [2025-01-10 00:53:04,734 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 202 transitions, 2063 flow [2025-01-10 00:53:04,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 00:53:04,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 00:53:04,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 147 transitions. [2025-01-10 00:53:04,735 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.625531914893617 [2025-01-10 00:53:04,735 INFO L175 Difference]: Start difference. First operand has 86 places, 138 transitions, 1229 flow. Second operand 5 states and 147 transitions. [2025-01-10 00:53:04,735 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 202 transitions, 2063 flow [2025-01-10 00:53:04,809 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 202 transitions, 2060 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 00:53:04,811 INFO L231 Difference]: Finished difference. Result has 91 places, 108 transitions, 957 flow [2025-01-10 00:53:04,811 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=918, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=957, PETRI_PLACES=91, PETRI_TRANSITIONS=108} [2025-01-10 00:53:04,811 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 39 predicate places. [2025-01-10 00:53:04,811 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 108 transitions, 957 flow [2025-01-10 00:53:04,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:53:04,812 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:53:04,812 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:53:04,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-10 00:53:04,812 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-01-10 00:53:04,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:53:04,812 INFO L85 PathProgramCache]: Analyzing trace with hash 1705949052, now seen corresponding path program 1 times [2025-01-10 00:53:04,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:53:04,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200556810] [2025-01-10 00:53:04,813 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:53:04,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:53:04,821 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-10 00:53:04,855 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-10 00:53:04,855 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:53:04,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:53:06,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:53:06,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:53:06,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200556810] [2025-01-10 00:53:06,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200556810] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:53:06,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:53:06,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-10 00:53:06,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830972026] [2025-01-10 00:53:06,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:53:06,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-10 00:53:06,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:53:06,602 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-10 00:53:06,602 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-01-10 00:53:06,607 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 47 [2025-01-10 00:53:06,607 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 108 transitions, 957 flow. Second operand has 11 states, 11 states have (on average 16.727272727272727) internal successors, (184), 11 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:53:06,607 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:53:06,607 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 47 [2025-01-10 00:53:06,607 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:53:08,119 INFO L124 PetriNetUnfolderBase]: 6166/11210 cut-off events. [2025-01-10 00:53:08,119 INFO L125 PetriNetUnfolderBase]: For 46111/47787 co-relation queries the response was YES. [2025-01-10 00:53:08,183 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47547 conditions, 11210 events. 6166/11210 cut-off events. For 46111/47787 co-relation queries the response was YES. Maximal size of possible extension queue 682. Compared 91312 event pairs, 1055 based on Foata normal form. 349/10907 useless extension candidates. Maximal degree in co-relation 47511. Up to 4942 conditions per place. [2025-01-10 00:53:08,215 INFO L140 encePairwiseOnDemand]: 33/47 looper letters, 83 selfloop transitions, 41 changer transitions 45/188 dead transitions. [2025-01-10 00:53:08,215 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 188 transitions, 2042 flow [2025-01-10 00:53:08,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 00:53:08,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-01-10 00:53:08,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 246 transitions. [2025-01-10 00:53:08,216 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5234042553191489 [2025-01-10 00:53:08,217 INFO L175 Difference]: Start difference. First operand has 91 places, 108 transitions, 957 flow. Second operand 10 states and 246 transitions. [2025-01-10 00:53:08,217 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 188 transitions, 2042 flow [2025-01-10 00:53:08,303 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 188 transitions, 2030 flow, removed 3 selfloop flow, removed 2 redundant places. [2025-01-10 00:53:08,305 INFO L231 Difference]: Finished difference. Result has 104 places, 119 transitions, 1305 flow [2025-01-10 00:53:08,306 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=945, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1305, PETRI_PLACES=104, PETRI_TRANSITIONS=119} [2025-01-10 00:53:08,306 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 52 predicate places. [2025-01-10 00:53:08,306 INFO L471 AbstractCegarLoop]: Abstraction has has 104 places, 119 transitions, 1305 flow [2025-01-10 00:53:08,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 16.727272727272727) internal successors, (184), 11 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:53:08,306 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:53:08,306 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:53:08,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-10 00:53:08,307 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-01-10 00:53:08,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:53:08,307 INFO L85 PathProgramCache]: Analyzing trace with hash 1291562878, now seen corresponding path program 2 times [2025-01-10 00:53:08,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:53:08,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361821269] [2025-01-10 00:53:08,307 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 00:53:08,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:53:08,313 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 1 equivalence classes. [2025-01-10 00:53:08,338 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-10 00:53:08,338 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 00:53:08,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:53:09,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:53:09,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:53:09,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361821269] [2025-01-10 00:53:09,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361821269] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:53:09,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:53:09,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-10 00:53:09,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670597680] [2025-01-10 00:53:09,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:53:09,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-10 00:53:09,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:53:09,466 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-10 00:53:09,467 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-01-10 00:53:09,468 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 47 [2025-01-10 00:53:09,468 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 119 transitions, 1305 flow. Second operand has 11 states, 11 states have (on average 16.727272727272727) internal successors, (184), 11 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:53:09,468 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:53:09,468 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 47 [2025-01-10 00:53:09,468 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:53:11,374 INFO L124 PetriNetUnfolderBase]: 9097/16587 cut-off events. [2025-01-10 00:53:11,374 INFO L125 PetriNetUnfolderBase]: For 81460/83523 co-relation queries the response was YES. [2025-01-10 00:53:11,480 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73635 conditions, 16587 events. 9097/16587 cut-off events. For 81460/83523 co-relation queries the response was YES. Maximal size of possible extension queue 1116. Compared 147671 event pairs, 3206 based on Foata normal form. 501/15883 useless extension candidates. Maximal degree in co-relation 73593. Up to 7163 conditions per place. [2025-01-10 00:53:11,515 INFO L140 encePairwiseOnDemand]: 36/47 looper letters, 116 selfloop transitions, 45 changer transitions 58/238 dead transitions. [2025-01-10 00:53:11,515 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 238 transitions, 2848 flow [2025-01-10 00:53:11,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-10 00:53:11,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-01-10 00:53:11,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 282 transitions. [2025-01-10 00:53:11,517 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5454545454545454 [2025-01-10 00:53:11,517 INFO L175 Difference]: Start difference. First operand has 104 places, 119 transitions, 1305 flow. Second operand 11 states and 282 transitions. [2025-01-10 00:53:11,517 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 238 transitions, 2848 flow [2025-01-10 00:53:11,754 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 238 transitions, 2573 flow, removed 84 selfloop flow, removed 12 redundant places. [2025-01-10 00:53:11,756 INFO L231 Difference]: Finished difference. Result has 105 places, 134 transitions, 1472 flow [2025-01-10 00:53:11,756 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=1136, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1472, PETRI_PLACES=105, PETRI_TRANSITIONS=134} [2025-01-10 00:53:11,757 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 53 predicate places. [2025-01-10 00:53:11,757 INFO L471 AbstractCegarLoop]: Abstraction has has 105 places, 134 transitions, 1472 flow [2025-01-10 00:53:11,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 16.727272727272727) internal successors, (184), 11 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:53:11,757 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:53:11,757 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:53:11,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-10 00:53:11,757 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-01-10 00:53:11,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:53:11,758 INFO L85 PathProgramCache]: Analyzing trace with hash -1330810326, now seen corresponding path program 3 times [2025-01-10 00:53:11,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:53:11,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495630272] [2025-01-10 00:53:11,758 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 00:53:11,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:53:11,765 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 27 statements into 1 equivalence classes. [2025-01-10 00:53:11,804 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-10 00:53:11,804 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-10 00:53:11,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:53:13,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:53:13,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:53:13,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495630272] [2025-01-10 00:53:13,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495630272] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:53:13,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:53:13,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-10 00:53:13,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529698946] [2025-01-10 00:53:13,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:53:13,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-10 00:53:13,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:53:13,304 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-10 00:53:13,304 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-01-10 00:53:13,315 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 47 [2025-01-10 00:53:13,315 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 134 transitions, 1472 flow. Second operand has 12 states, 12 states have (on average 16.583333333333332) internal successors, (199), 12 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:53:13,315 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:53:13,315 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 47 [2025-01-10 00:53:13,315 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:53:15,545 INFO L124 PetriNetUnfolderBase]: 8246/14998 cut-off events. [2025-01-10 00:53:15,545 INFO L125 PetriNetUnfolderBase]: For 79583/81650 co-relation queries the response was YES. [2025-01-10 00:53:15,648 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67879 conditions, 14998 events. 8246/14998 cut-off events. For 79583/81650 co-relation queries the response was YES. Maximal size of possible extension queue 1009. Compared 129759 event pairs, 890 based on Foata normal form. 428/14501 useless extension candidates. Maximal degree in co-relation 67836. Up to 4810 conditions per place. [2025-01-10 00:53:15,689 INFO L140 encePairwiseOnDemand]: 33/47 looper letters, 108 selfloop transitions, 74 changer transitions 20/221 dead transitions. [2025-01-10 00:53:15,689 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 221 transitions, 2741 flow [2025-01-10 00:53:15,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 00:53:15,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-01-10 00:53:15,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 258 transitions. [2025-01-10 00:53:15,691 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.548936170212766 [2025-01-10 00:53:15,691 INFO L175 Difference]: Start difference. First operand has 105 places, 134 transitions, 1472 flow. Second operand 10 states and 258 transitions. [2025-01-10 00:53:15,691 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 221 transitions, 2741 flow [2025-01-10 00:53:15,840 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 221 transitions, 2623 flow, removed 38 selfloop flow, removed 7 redundant places. [2025-01-10 00:53:15,843 INFO L231 Difference]: Finished difference. Result has 107 places, 163 transitions, 2015 flow [2025-01-10 00:53:15,843 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=1378, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2015, PETRI_PLACES=107, PETRI_TRANSITIONS=163} [2025-01-10 00:53:15,843 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 55 predicate places. [2025-01-10 00:53:15,843 INFO L471 AbstractCegarLoop]: Abstraction has has 107 places, 163 transitions, 2015 flow [2025-01-10 00:53:15,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 16.583333333333332) internal successors, (199), 12 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:53:15,844 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:53:15,844 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:53:15,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-10 00:53:15,844 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-01-10 00:53:15,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:53:15,844 INFO L85 PathProgramCache]: Analyzing trace with hash -707507542, now seen corresponding path program 4 times [2025-01-10 00:53:15,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:53:15,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654934990] [2025-01-10 00:53:15,844 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 00:53:15,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:53:15,851 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 27 statements into 2 equivalence classes. [2025-01-10 00:53:15,889 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-01-10 00:53:15,890 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 00:53:15,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:53:15,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:53:15,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:53:15,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654934990] [2025-01-10 00:53:15,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654934990] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:53:15,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:53:15,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 00:53:15,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209658244] [2025-01-10 00:53:15,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:53:15,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 00:53:15,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:53:15,999 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 00:53:15,999 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-10 00:53:16,000 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 47 [2025-01-10 00:53:16,001 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 163 transitions, 2015 flow. Second operand has 6 states, 6 states have (on average 16.5) internal successors, (99), 6 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:53:16,001 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:53:16,001 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 47 [2025-01-10 00:53:16,001 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:53:18,080 INFO L124 PetriNetUnfolderBase]: 12911/20480 cut-off events. [2025-01-10 00:53:18,081 INFO L125 PetriNetUnfolderBase]: For 167323/167871 co-relation queries the response was YES. [2025-01-10 00:53:18,215 INFO L83 FinitePrefix]: Finished finitePrefix Result has 103913 conditions, 20480 events. 12911/20480 cut-off events. For 167323/167871 co-relation queries the response was YES. Maximal size of possible extension queue 1079. Compared 151798 event pairs, 1550 based on Foata normal form. 864/21318 useless extension candidates. Maximal degree in co-relation 103871. Up to 8293 conditions per place. [2025-01-10 00:53:18,243 INFO L140 encePairwiseOnDemand]: 41/47 looper letters, 122 selfloop transitions, 11 changer transitions 107/277 dead transitions. [2025-01-10 00:53:18,244 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 277 transitions, 3727 flow [2025-01-10 00:53:18,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 00:53:18,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 00:53:18,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 153 transitions. [2025-01-10 00:53:18,244 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5425531914893617 [2025-01-10 00:53:18,244 INFO L175 Difference]: Start difference. First operand has 107 places, 163 transitions, 2015 flow. Second operand 6 states and 153 transitions. [2025-01-10 00:53:18,244 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 277 transitions, 3727 flow [2025-01-10 00:53:18,890 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 277 transitions, 3326 flow, removed 142 selfloop flow, removed 8 redundant places. [2025-01-10 00:53:18,892 INFO L231 Difference]: Finished difference. Result has 104 places, 114 transitions, 1324 flow [2025-01-10 00:53:18,892 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=1709, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1324, PETRI_PLACES=104, PETRI_TRANSITIONS=114} [2025-01-10 00:53:18,892 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 52 predicate places. [2025-01-10 00:53:18,892 INFO L471 AbstractCegarLoop]: Abstraction has has 104 places, 114 transitions, 1324 flow [2025-01-10 00:53:18,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 6 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:53:18,893 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:53:18,893 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:53:18,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-10 00:53:18,893 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-01-10 00:53:18,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:53:18,893 INFO L85 PathProgramCache]: Analyzing trace with hash -1223552245, now seen corresponding path program 1 times [2025-01-10 00:53:18,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:53:18,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30936640] [2025-01-10 00:53:18,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:53:18,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:53:18,900 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-01-10 00:53:18,911 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-01-10 00:53:18,911 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:53:18,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:53:19,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:53:19,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:53:19,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30936640] [2025-01-10 00:53:19,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30936640] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:53:19,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:53:19,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 00:53:19,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962369937] [2025-01-10 00:53:19,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:53:19,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 00:53:19,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:53:19,094 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 00:53:19,094 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-10 00:53:19,095 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 47 [2025-01-10 00:53:19,095 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 114 transitions, 1324 flow. Second operand has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 6 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:53:19,095 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:53:19,095 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 47 [2025-01-10 00:53:19,095 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:53:19,736 INFO L124 PetriNetUnfolderBase]: 3241/6421 cut-off events. [2025-01-10 00:53:19,737 INFO L125 PetriNetUnfolderBase]: For 34562/36149 co-relation queries the response was YES. [2025-01-10 00:53:19,766 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27931 conditions, 6421 events. 3241/6421 cut-off events. For 34562/36149 co-relation queries the response was YES. Maximal size of possible extension queue 553. Compared 53712 event pairs, 416 based on Foata normal form. 272/6136 useless extension candidates. Maximal degree in co-relation 27893. Up to 2388 conditions per place. [2025-01-10 00:53:19,774 INFO L140 encePairwiseOnDemand]: 42/47 looper letters, 35 selfloop transitions, 1 changer transitions 95/152 dead transitions. [2025-01-10 00:53:19,774 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 152 transitions, 1827 flow [2025-01-10 00:53:19,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 00:53:19,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 00:53:19,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 142 transitions. [2025-01-10 00:53:19,775 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5035460992907801 [2025-01-10 00:53:19,775 INFO L175 Difference]: Start difference. First operand has 104 places, 114 transitions, 1324 flow. Second operand 6 states and 142 transitions. [2025-01-10 00:53:19,775 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 152 transitions, 1827 flow [2025-01-10 00:53:19,943 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 152 transitions, 1653 flow, removed 65 selfloop flow, removed 6 redundant places. [2025-01-10 00:53:19,944 INFO L231 Difference]: Finished difference. Result has 105 places, 52 transitions, 410 flow [2025-01-10 00:53:19,944 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=1175, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=410, PETRI_PLACES=105, PETRI_TRANSITIONS=52} [2025-01-10 00:53:19,944 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 53 predicate places. [2025-01-10 00:53:19,944 INFO L471 AbstractCegarLoop]: Abstraction has has 105 places, 52 transitions, 410 flow [2025-01-10 00:53:19,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 6 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:53:19,944 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:53:19,944 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:53:19,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-10 00:53:19,945 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-01-10 00:53:19,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:53:19,945 INFO L85 PathProgramCache]: Analyzing trace with hash -1808653159, now seen corresponding path program 2 times [2025-01-10 00:53:19,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:53:19,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101569480] [2025-01-10 00:53:19,945 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 00:53:19,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:53:19,951 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 1 equivalence classes. [2025-01-10 00:53:19,994 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-01-10 00:53:19,994 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 00:53:19,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:53:21,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:53:21,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:53:21,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101569480] [2025-01-10 00:53:21,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101569480] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:53:21,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:53:21,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-10 00:53:21,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349323571] [2025-01-10 00:53:21,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:53:21,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-10 00:53:21,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:53:21,863 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-10 00:53:21,863 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2025-01-10 00:53:21,865 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 47 [2025-01-10 00:53:21,866 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 52 transitions, 410 flow. Second operand has 12 states, 12 states have (on average 16.833333333333332) internal successors, (202), 12 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:53:21,866 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:53:21,866 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 47 [2025-01-10 00:53:21,866 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:53:22,490 INFO L124 PetriNetUnfolderBase]: 843/1753 cut-off events. [2025-01-10 00:53:22,491 INFO L125 PetriNetUnfolderBase]: For 4691/5260 co-relation queries the response was YES. [2025-01-10 00:53:22,499 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6995 conditions, 1753 events. 843/1753 cut-off events. For 4691/5260 co-relation queries the response was YES. Maximal size of possible extension queue 188. Compared 12275 event pairs, 65 based on Foata normal form. 55/1641 useless extension candidates. Maximal degree in co-relation 6964. Up to 442 conditions per place. [2025-01-10 00:53:22,501 INFO L140 encePairwiseOnDemand]: 37/47 looper letters, 0 selfloop transitions, 0 changer transitions 80/80 dead transitions. [2025-01-10 00:53:22,501 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 80 transitions, 681 flow [2025-01-10 00:53:22,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 00:53:22,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-01-10 00:53:22,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 210 transitions. [2025-01-10 00:53:22,502 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.44680851063829785 [2025-01-10 00:53:22,502 INFO L175 Difference]: Start difference. First operand has 105 places, 52 transitions, 410 flow. Second operand 10 states and 210 transitions. [2025-01-10 00:53:22,502 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 80 transitions, 681 flow [2025-01-10 00:53:22,512 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 80 transitions, 565 flow, removed 10 selfloop flow, removed 27 redundant places. [2025-01-10 00:53:22,512 INFO L231 Difference]: Finished difference. Result has 78 places, 0 transitions, 0 flow [2025-01-10 00:53:22,512 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=302, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=0, PETRI_PLACES=78, PETRI_TRANSITIONS=0} [2025-01-10 00:53:22,513 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 26 predicate places. [2025-01-10 00:53:22,513 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 0 transitions, 0 flow [2025-01-10 00:53:22,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 16.833333333333332) internal successors, (202), 12 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:53:22,515 INFO L782 garLoopResultBuilder]: Registering result SAFE for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (6 of 7 remaining) [2025-01-10 00:53:22,516 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (5 of 7 remaining) [2025-01-10 00:53:22,516 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (4 of 7 remaining) [2025-01-10 00:53:22,516 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2025-01-10 00:53:22,516 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2025-01-10 00:53:22,516 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2025-01-10 00:53:22,516 INFO L782 garLoopResultBuilder]: Registering result SAFE for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2025-01-10 00:53:22,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-10 00:53:22,516 INFO L422 BasicCegarLoop]: Path program histogram: [4, 2, 2, 2, 2, 1, 1, 1, 1] [2025-01-10 00:53:22,520 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-01-10 00:53:22,520 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-10 00:53:22,523 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 12:53:22 BasicIcfg [2025-01-10 00:53:22,523 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-10 00:53:22,524 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-10 00:53:22,524 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-10 00:53:22,524 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-10 00:53:22,524 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:52:47" (3/4) ... [2025-01-10 00:53:22,525 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-10 00:53:22,527 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure P0 [2025-01-10 00:53:22,527 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure P1 [2025-01-10 00:53:22,527 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure P2 [2025-01-10 00:53:22,535 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 92 nodes and edges [2025-01-10 00:53:22,535 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2025-01-10 00:53:22,535 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-01-10 00:53:22,535 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-10 00:53:22,596 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-10 00:53:22,597 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-10 00:53:22,597 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-10 00:53:22,597 INFO L158 Benchmark]: Toolchain (without parser) took 36238.91ms. Allocated memory was 167.8MB in the beginning and 3.2GB in the end (delta: 3.0GB). Free memory was 121.2MB in the beginning and 2.5GB in the end (delta: -2.4GB). Peak memory consumption was 660.6MB. Max. memory is 16.1GB. [2025-01-10 00:53:22,598 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 201.3MB. Free memory is still 116.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 00:53:22,598 INFO L158 Benchmark]: CACSL2BoogieTranslator took 459.64ms. Allocated memory is still 167.8MB. Free memory was 121.2MB in the beginning and 93.7MB in the end (delta: 27.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-10 00:53:22,598 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.50ms. Allocated memory is still 167.8MB. Free memory was 93.7MB in the beginning and 90.2MB in the end (delta: 3.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 00:53:22,598 INFO L158 Benchmark]: Boogie Preprocessor took 66.06ms. Allocated memory is still 167.8MB. Free memory was 90.2MB in the beginning and 84.8MB in the end (delta: 5.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 00:53:22,598 INFO L158 Benchmark]: RCFGBuilder took 758.35ms. Allocated memory is still 167.8MB. Free memory was 84.8MB in the beginning and 83.1MB in the end (delta: 1.7MB). Peak memory consumption was 66.1MB. Max. memory is 16.1GB. [2025-01-10 00:53:22,599 INFO L158 Benchmark]: TraceAbstraction took 34834.48ms. Allocated memory was 167.8MB in the beginning and 3.2GB in the end (delta: 3.0GB). Free memory was 83.1MB in the beginning and 2.5GB in the end (delta: -2.4GB). Peak memory consumption was 619.7MB. Max. memory is 16.1GB. [2025-01-10 00:53:22,599 INFO L158 Benchmark]: Witness Printer took 73.09ms. Allocated memory is still 3.2GB. Free memory was 2.5GB in the beginning and 2.5GB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 00:53:22,600 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.26ms. Allocated memory is still 201.3MB. Free memory is still 116.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 459.64ms. Allocated memory is still 167.8MB. Free memory was 121.2MB in the beginning and 93.7MB in the end (delta: 27.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.50ms. Allocated memory is still 167.8MB. Free memory was 93.7MB in the beginning and 90.2MB in the end (delta: 3.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 66.06ms. Allocated memory is still 167.8MB. Free memory was 90.2MB in the beginning and 84.8MB in the end (delta: 5.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 758.35ms. Allocated memory is still 167.8MB. Free memory was 84.8MB in the beginning and 83.1MB in the end (delta: 1.7MB). Peak memory consumption was 66.1MB. Max. memory is 16.1GB. * TraceAbstraction took 34834.48ms. Allocated memory was 167.8MB in the beginning and 3.2GB in the end (delta: 3.0GB). Free memory was 83.1MB in the beginning and 2.5GB in the end (delta: -2.4GB). Peak memory consumption was 619.7MB. Max. memory is 16.1GB. * Witness Printer took 73.09ms. Allocated memory is still 3.2GB. Free memory was 2.5GB in the beginning and 2.5GB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 17]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 866]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 17]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 74 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 34.7s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 22.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1080 SdHoareTripleChecker+Valid, 4.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1064 mSDsluCounter, 182 SdHoareTripleChecker+Invalid, 4.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 144 mSDsCounter, 321 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4312 IncrementalHoareTripleChecker+Invalid, 4633 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 321 mSolverCounterUnsat, 38 mSDtfsCounter, 4312 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 163 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2015occurred in iteration=13, InterpolantAutomatonStates: 124, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 11.7s InterpolantComputationTime, 355 NumberOfCodeBlocks, 355 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 339 ConstructedInterpolants, 0 QuantifiedInterpolants, 3302 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 3 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-01-10 00:53:22,614 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE