./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/goblint-regression/13-privatized_68-pfscan_protected_loop_minimal_interval_true.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 48c9605d 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/goblint-regression/13-privatized_68-pfscan_protected_loop_minimal_interval_true.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 6aeaf730cbe4eb831d189bfd9925d1660c7714b9e685f389bc2495c0943d6472 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 08:30:13,639 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 08:30:13,678 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-02-08 08:30:13,683 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 08:30:13,683 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 08:30:13,702 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 08:30:13,702 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 08:30:13,702 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 08:30:13,703 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 08:30:13,703 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 08:30:13,703 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 08:30:13,703 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 08:30:13,703 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 08:30:13,703 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 08:30:13,703 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 08:30:13,703 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 08:30:13,703 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 08:30:13,704 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 08:30:13,704 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 08:30:13,704 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 08:30:13,704 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-08 08:30:13,704 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-08 08:30:13,704 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-08 08:30:13,704 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 08:30:13,704 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-08 08:30:13,704 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 08:30:13,704 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 08:30:13,704 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 08:30:13,704 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 08:30:13,705 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 08:30:13,705 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 08:30:13,705 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 08:30:13,705 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 08:30:13,705 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 08:30:13,705 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 08:30:13,705 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 08:30:13,705 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 08:30:13,705 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 08:30:13,705 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 08:30:13,706 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 08:30:13,706 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 08:30:13,706 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 08:30:13,706 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 -> 6aeaf730cbe4eb831d189bfd9925d1660c7714b9e685f389bc2495c0943d6472 [2025-02-08 08:30:13,900 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 08:30:13,908 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 08:30:13,910 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 08:30:13,910 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 08:30:13,911 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 08:30:13,912 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/13-privatized_68-pfscan_protected_loop_minimal_interval_true.i [2025-02-08 08:30:15,229 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9aee1b875/cd55e428eba54c74a36067fc14ff9113/FLAG174c07683 [2025-02-08 08:30:15,558 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 08:30:15,559 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/13-privatized_68-pfscan_protected_loop_minimal_interval_true.i [2025-02-08 08:30:15,573 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9aee1b875/cd55e428eba54c74a36067fc14ff9113/FLAG174c07683 [2025-02-08 08:30:15,804 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9aee1b875/cd55e428eba54c74a36067fc14ff9113 [2025-02-08 08:30:15,806 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 08:30:15,807 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 08:30:15,808 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 08:30:15,808 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 08:30:15,811 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 08:30:15,811 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 08:30:15" (1/1) ... [2025-02-08 08:30:15,812 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@322b4289 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:30:15, skipping insertion in model container [2025-02-08 08:30:15,812 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 08:30:15" (1/1) ... [2025-02-08 08:30:15,845 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 08:30:16,135 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 08:30:16,144 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 08:30:16,181 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 08:30:16,205 INFO L204 MainTranslator]: Completed translation [2025-02-08 08:30:16,206 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:30:16 WrapperNode [2025-02-08 08:30:16,206 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 08:30:16,207 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 08:30:16,207 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 08:30:16,207 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 08:30:16,211 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:30:16" (1/1) ... [2025-02-08 08:30:16,223 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:30:16" (1/1) ... [2025-02-08 08:30:16,239 INFO L138 Inliner]: procedures = 165, calls = 35, calls flagged for inlining = 8, calls inlined = 9, statements flattened = 116 [2025-02-08 08:30:16,239 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 08:30:16,240 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 08:30:16,241 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 08:30:16,241 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 08:30:16,246 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:30:16" (1/1) ... [2025-02-08 08:30:16,246 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:30:16" (1/1) ... [2025-02-08 08:30:16,252 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:30:16" (1/1) ... [2025-02-08 08:30:16,264 INFO L175 MemorySlicer]: Split 18 memory accesses to 2 slices as follows [2, 16]. 89 percent of accesses are in the largest equivalence class. The 8 initializations are split as follows [2, 6]. The 3 writes are split as follows [0, 3]. [2025-02-08 08:30:16,264 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:30:16" (1/1) ... [2025-02-08 08:30:16,265 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:30:16" (1/1) ... [2025-02-08 08:30:16,273 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:30:16" (1/1) ... [2025-02-08 08:30:16,274 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:30:16" (1/1) ... [2025-02-08 08:30:16,274 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:30:16" (1/1) ... [2025-02-08 08:30:16,275 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:30:16" (1/1) ... [2025-02-08 08:30:16,281 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 08:30:16,281 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 08:30:16,281 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 08:30:16,281 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 08:30:16,282 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:30:16" (1/1) ... [2025-02-08 08:30:16,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 08:30:16,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:30:16,307 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-02-08 08:30:16,309 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-02-08 08:30:16,327 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 08:30:16,327 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 08:30:16,327 INFO L130 BoogieDeclarations]: Found specification of procedure worker [2025-02-08 08:30:16,327 INFO L138 BoogieDeclarations]: Found implementation of procedure worker [2025-02-08 08:30:16,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 08:30:16,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 08:30:16,328 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-02-08 08:30:16,328 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 08:30:16,328 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 08:30:16,328 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 08:30:16,328 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-02-08 08:30:16,328 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 08:30:16,328 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 08:30:16,329 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-08 08:30:16,434 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 08:30:16,435 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 08:30:16,561 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L750: havoc main_#t~ret19#1; [2025-02-08 08:30:16,561 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L750-1: assume { :end_inline_pqueue_put } true;assume -2147483648 <= main_#t~ret19#1 && main_#t~ret19#1 <= 2147483647; [2025-02-08 08:30:16,561 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L750-2: havoc pqueue_put_#in~qp#1.base, pqueue_put_#in~qp#1.offset; [2025-02-08 08:30:16,561 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L750-3: havoc pqueue_put_#t~ret1#1, pqueue_put_#t~mem2#1, pqueue_put_#t~mem3#1, pqueue_put_#t~post4#1, pqueue_put_#t~ret5#1, pqueue_put_~qp#1.base, pqueue_put_~qp#1.offset; [2025-02-08 08:30:16,561 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L750-4: main_#t~ret19#1 := pqueue_put_#res#1; [2025-02-08 08:30:16,561 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L749-1: havoc main_#t~post20#1; [2025-02-08 08:30:16,561 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L749-2: main_~i~0#1 := 1 + main_#t~post20#1; [2025-02-08 08:30:16,562 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L749-3: main_#t~post20#1 := main_~i~0#1; [2025-02-08 08:30:16,636 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L739: havoc #t~ret15#1; [2025-02-08 08:30:16,636 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L739-1: assume { :end_inline_pqueue_get } true;assume -2147483648 <= #t~ret15#1 && #t~ret15#1 <= 2147483647; [2025-02-08 08:30:16,636 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L739-2: havoc pqueue_get_#in~qp#1.base, pqueue_get_#in~qp#1.offset; [2025-02-08 08:30:16,636 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L739-3: havoc pqueue_get_#t~ret6#1, pqueue_get_#t~mem7#1, pqueue_get_#t~mem8#1, pqueue_get_#t~mem9#1, pqueue_get_#t~mem10#1, pqueue_get_#t~mem11#1, pqueue_get_#t~post12#1, pqueue_get_#t~ret13#1, pqueue_get_#t~ret14#1, pqueue_get_~qp#1.base, pqueue_get_~qp#1.offset, pqueue_get_~got~0#1; [2025-02-08 08:30:16,636 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L739-4: #t~ret15#1 := pqueue_get_#res#1; [2025-02-08 08:30:16,637 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 08:30:16,637 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 08:30:16,748 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 08:30:16,748 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 08:30:16,749 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:30:16 BoogieIcfgContainer [2025-02-08 08:30:16,749 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 08:30:16,755 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 08:30:16,755 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 08:30:16,762 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 08:30:16,762 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 08:30:15" (1/3) ... [2025-02-08 08:30:16,762 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17d5ab33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 08:30:16, skipping insertion in model container [2025-02-08 08:30:16,762 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:30:16" (2/3) ... [2025-02-08 08:30:16,762 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17d5ab33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 08:30:16, skipping insertion in model container [2025-02-08 08:30:16,762 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:30:16" (3/3) ... [2025-02-08 08:30:16,763 INFO L128 eAbstractionObserver]: Analyzing ICFG 13-privatized_68-pfscan_protected_loop_minimal_interval_true.i [2025-02-08 08:30:16,774 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 08:30:16,776 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 13-privatized_68-pfscan_protected_loop_minimal_interval_true.i that has 2 procedures, 69 locations, 1 initial locations, 3 loop locations, and 23 error locations. [2025-02-08 08:30:16,776 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 08:30:16,842 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 08:30:16,882 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 72 places, 76 transitions, 156 flow [2025-02-08 08:30:16,927 INFO L124 PetriNetUnfolderBase]: 8/75 cut-off events. [2025-02-08 08:30:16,928 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 08:30:16,931 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79 conditions, 75 events. 8/75 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 228 event pairs, 0 based on Foata normal form. 0/42 useless extension candidates. Maximal degree in co-relation 70. Up to 2 conditions per place. [2025-02-08 08:30:16,931 INFO L82 GeneralOperation]: Start removeDead. Operand has 72 places, 76 transitions, 156 flow [2025-02-08 08:30:16,933 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 71 places, 75 transitions, 153 flow [2025-02-08 08:30:16,938 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 08:30:16,946 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;@16296a74, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 08:30:16,946 INFO L334 AbstractCegarLoop]: Starting to check reachability of 38 error locations. [2025-02-08 08:30:16,948 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 08:30:16,948 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2025-02-08 08:30:16,948 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 08:30:16,948 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:30:16,949 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1] [2025-02-08 08:30:16,949 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 35 more)] === [2025-02-08 08:30:16,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:30:16,953 INFO L85 PathProgramCache]: Analyzing trace with hash 11459, now seen corresponding path program 1 times [2025-02-08 08:30:16,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:30:16,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280690240] [2025-02-08 08:30:16,958 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:30:16,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:30:17,008 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-08 08:30:17,014 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-08 08:30:17,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:30:17,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:30:17,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:30:17,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:30:17,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280690240] [2025-02-08 08:30:17,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280690240] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:30:17,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:30:17,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 08:30:17,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067612340] [2025-02-08 08:30:17,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:30:17,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:30:17,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:30:17,139 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:30:17,141 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:30:17,173 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 76 [2025-02-08 08:30:17,175 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 75 transitions, 153 flow. Second operand has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:30:17,175 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:30:17,175 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 76 [2025-02-08 08:30:17,176 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:30:17,304 INFO L124 PetriNetUnfolderBase]: 181/637 cut-off events. [2025-02-08 08:30:17,307 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 08:30:17,308 INFO L83 FinitePrefix]: Finished finitePrefix Result has 988 conditions, 637 events. 181/637 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 4223 event pairs, 151 based on Foata normal form. 58/535 useless extension candidates. Maximal degree in co-relation 976. Up to 346 conditions per place. [2025-02-08 08:30:17,313 INFO L140 encePairwiseOnDemand]: 67/76 looper letters, 27 selfloop transitions, 2 changer transitions 0/66 dead transitions. [2025-02-08 08:30:17,314 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 66 transitions, 193 flow [2025-02-08 08:30:17,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:30:17,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:30:17,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 150 transitions. [2025-02-08 08:30:17,325 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6578947368421053 [2025-02-08 08:30:17,326 INFO L175 Difference]: Start difference. First operand has 71 places, 75 transitions, 153 flow. Second operand 3 states and 150 transitions. [2025-02-08 08:30:17,326 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 66 transitions, 193 flow [2025-02-08 08:30:17,329 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 66 transitions, 192 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 08:30:17,332 INFO L231 Difference]: Finished difference. Result has 68 places, 66 transitions, 138 flow [2025-02-08 08:30:17,334 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=76, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=138, PETRI_PLACES=68, PETRI_TRANSITIONS=66} [2025-02-08 08:30:17,337 INFO L279 CegarLoopForPetriNet]: 71 programPoint places, -3 predicate places. [2025-02-08 08:30:17,338 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 66 transitions, 138 flow [2025-02-08 08:30:17,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:30:17,338 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:30:17,338 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1] [2025-02-08 08:30:17,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 08:30:17,339 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 35 more)] === [2025-02-08 08:30:17,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:30:17,340 INFO L85 PathProgramCache]: Analyzing trace with hash 11460, now seen corresponding path program 1 times [2025-02-08 08:30:17,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:30:17,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438046205] [2025-02-08 08:30:17,340 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:30:17,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:30:17,352 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-08 08:30:17,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-08 08:30:17,363 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:30:17,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:30:17,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:30:17,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:30:17,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438046205] [2025-02-08 08:30:17,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438046205] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:30:17,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:30:17,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 08:30:17,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244879365] [2025-02-08 08:30:17,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:30:17,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:30:17,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:30:17,446 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:30:17,446 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:30:17,471 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 76 [2025-02-08 08:30:17,471 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 66 transitions, 138 flow. Second operand has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:30:17,471 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:30:17,471 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 76 [2025-02-08 08:30:17,472 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:30:17,575 INFO L124 PetriNetUnfolderBase]: 181/636 cut-off events. [2025-02-08 08:30:17,576 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 08:30:17,577 INFO L83 FinitePrefix]: Finished finitePrefix Result has 989 conditions, 636 events. 181/636 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 4193 event pairs, 151 based on Foata normal form. 1/477 useless extension candidates. Maximal degree in co-relation 980. Up to 346 conditions per place. [2025-02-08 08:30:17,579 INFO L140 encePairwiseOnDemand]: 73/76 looper letters, 27 selfloop transitions, 2 changer transitions 0/65 dead transitions. [2025-02-08 08:30:17,579 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 65 transitions, 194 flow [2025-02-08 08:30:17,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:30:17,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:30:17,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 144 transitions. [2025-02-08 08:30:17,580 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.631578947368421 [2025-02-08 08:30:17,580 INFO L175 Difference]: Start difference. First operand has 68 places, 66 transitions, 138 flow. Second operand 3 states and 144 transitions. [2025-02-08 08:30:17,580 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 65 transitions, 194 flow [2025-02-08 08:30:17,581 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 65 transitions, 190 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 08:30:17,581 INFO L231 Difference]: Finished difference. Result has 67 places, 65 transitions, 136 flow [2025-02-08 08:30:17,582 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=76, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=136, PETRI_PLACES=67, PETRI_TRANSITIONS=65} [2025-02-08 08:30:17,582 INFO L279 CegarLoopForPetriNet]: 71 programPoint places, -4 predicate places. [2025-02-08 08:30:17,582 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 65 transitions, 136 flow [2025-02-08 08:30:17,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:30:17,582 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:30:17,582 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-08 08:30:17,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 08:30:17,583 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 35 more)] === [2025-02-08 08:30:17,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:30:17,583 INFO L85 PathProgramCache]: Analyzing trace with hash 2006579266, now seen corresponding path program 1 times [2025-02-08 08:30:17,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:30:17,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696086559] [2025-02-08 08:30:17,584 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:30:17,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:30:17,591 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 08:30:17,596 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 08:30:17,596 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:30:17,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:30:17,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:30:17,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:30:17,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696086559] [2025-02-08 08:30:17,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696086559] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:30:17,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:30:17,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 08:30:17,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182385149] [2025-02-08 08:30:17,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:30:17,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:30:17,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:30:17,615 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:30:17,615 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:30:17,635 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 76 [2025-02-08 08:30:17,635 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 65 transitions, 136 flow. Second operand has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:30:17,636 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:30:17,636 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 76 [2025-02-08 08:30:17,636 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:30:17,694 INFO L124 PetriNetUnfolderBase]: 181/634 cut-off events. [2025-02-08 08:30:17,694 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 08:30:17,695 INFO L83 FinitePrefix]: Finished finitePrefix Result has 987 conditions, 634 events. 181/634 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 4196 event pairs, 151 based on Foata normal form. 0/474 useless extension candidates. Maximal degree in co-relation 978. Up to 346 conditions per place. [2025-02-08 08:30:17,697 INFO L140 encePairwiseOnDemand]: 74/76 looper letters, 28 selfloop transitions, 1 changer transitions 0/64 dead transitions. [2025-02-08 08:30:17,697 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 64 transitions, 192 flow [2025-02-08 08:30:17,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:30:17,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:30:17,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 144 transitions. [2025-02-08 08:30:17,698 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.631578947368421 [2025-02-08 08:30:17,698 INFO L175 Difference]: Start difference. First operand has 67 places, 65 transitions, 136 flow. Second operand 3 states and 144 transitions. [2025-02-08 08:30:17,698 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 64 transitions, 192 flow [2025-02-08 08:30:17,699 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 64 transitions, 188 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 08:30:17,699 INFO L231 Difference]: Finished difference. Result has 66 places, 64 transitions, 132 flow [2025-02-08 08:30:17,699 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=76, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=132, PETRI_PLACES=66, PETRI_TRANSITIONS=64} [2025-02-08 08:30:17,700 INFO L279 CegarLoopForPetriNet]: 71 programPoint places, -5 predicate places. [2025-02-08 08:30:17,700 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 64 transitions, 132 flow [2025-02-08 08:30:17,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:30:17,700 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:30:17,700 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:30:17,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 08:30:17,700 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 35 more)] === [2025-02-08 08:30:17,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:30:17,701 INFO L85 PathProgramCache]: Analyzing trace with hash -117677182, now seen corresponding path program 1 times [2025-02-08 08:30:17,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:30:17,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746850499] [2025-02-08 08:30:17,701 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:30:17,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:30:17,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 08:30:17,718 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 08:30:17,718 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:30:17,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:30:17,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:30:17,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:30:17,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746850499] [2025-02-08 08:30:17,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746850499] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:30:17,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:30:17,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:30:17,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605162295] [2025-02-08 08:30:17,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:30:17,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:30:17,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:30:17,769 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:30:17,769 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:30:17,813 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 76 [2025-02-08 08:30:17,814 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 64 transitions, 132 flow. Second operand has 4 states, 4 states have (on average 37.75) internal successors, (151), 4 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-02-08 08:30:17,814 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:30:17,814 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 76 [2025-02-08 08:30:17,814 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:30:17,925 INFO L124 PetriNetUnfolderBase]: 194/584 cut-off events. [2025-02-08 08:30:17,925 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 08:30:17,926 INFO L83 FinitePrefix]: Finished finitePrefix Result has 949 conditions, 584 events. 194/584 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 3655 event pairs, 51 based on Foata normal form. 34/476 useless extension candidates. Maximal degree in co-relation 943. Up to 244 conditions per place. [2025-02-08 08:30:17,927 INFO L140 encePairwiseOnDemand]: 71/76 looper letters, 43 selfloop transitions, 2 changer transitions 0/77 dead transitions. [2025-02-08 08:30:17,927 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 77 transitions, 248 flow [2025-02-08 08:30:17,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:30:17,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 08:30:17,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 192 transitions. [2025-02-08 08:30:17,928 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.631578947368421 [2025-02-08 08:30:17,928 INFO L175 Difference]: Start difference. First operand has 66 places, 64 transitions, 132 flow. Second operand 4 states and 192 transitions. [2025-02-08 08:30:17,928 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 77 transitions, 248 flow [2025-02-08 08:30:17,929 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 77 transitions, 247 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 08:30:17,930 INFO L231 Difference]: Finished difference. Result has 65 places, 61 transitions, 129 flow [2025-02-08 08:30:17,930 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=76, PETRI_DIFFERENCE_MINUEND_FLOW=125, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=129, PETRI_PLACES=65, PETRI_TRANSITIONS=61} [2025-02-08 08:30:17,930 INFO L279 CegarLoopForPetriNet]: 71 programPoint places, -6 predicate places. [2025-02-08 08:30:17,930 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 61 transitions, 129 flow [2025-02-08 08:30:17,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.75) internal successors, (151), 4 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-02-08 08:30:17,930 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:30:17,930 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:30:17,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 08:30:17,931 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 35 more)] === [2025-02-08 08:30:17,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:30:17,931 INFO L85 PathProgramCache]: Analyzing trace with hash -117677181, now seen corresponding path program 1 times [2025-02-08 08:30:17,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:30:17,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729890745] [2025-02-08 08:30:17,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:30:17,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:30:17,937 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 08:30:17,940 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 08:30:17,940 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:30:17,940 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:30:18,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:30:18,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:30:18,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729890745] [2025-02-08 08:30:18,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729890745] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:30:18,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:30:18,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:30:18,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247230793] [2025-02-08 08:30:18,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:30:18,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:30:18,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:30:18,011 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:30:18,011 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:30:18,057 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 76 [2025-02-08 08:30:18,058 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 61 transitions, 129 flow. Second operand has 4 states, 4 states have (on average 37.75) internal successors, (151), 4 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-02-08 08:30:18,058 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:30:18,058 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 76 [2025-02-08 08:30:18,058 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:30:18,143 INFO L124 PetriNetUnfolderBase]: 194/536 cut-off events. [2025-02-08 08:30:18,143 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2025-02-08 08:30:18,144 INFO L83 FinitePrefix]: Finished finitePrefix Result has 918 conditions, 536 events. 194/536 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 3170 event pairs, 51 based on Foata normal form. 34/476 useless extension candidates. Maximal degree in co-relation 911. Up to 244 conditions per place. [2025-02-08 08:30:18,145 INFO L140 encePairwiseOnDemand]: 71/76 looper letters, 37 selfloop transitions, 2 changer transitions 9/74 dead transitions. [2025-02-08 08:30:18,145 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 74 transitions, 245 flow [2025-02-08 08:30:18,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:30:18,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 08:30:18,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 192 transitions. [2025-02-08 08:30:18,146 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.631578947368421 [2025-02-08 08:30:18,146 INFO L175 Difference]: Start difference. First operand has 65 places, 61 transitions, 129 flow. Second operand 4 states and 192 transitions. [2025-02-08 08:30:18,146 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 74 transitions, 245 flow [2025-02-08 08:30:18,146 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 74 transitions, 242 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 08:30:18,147 INFO L231 Difference]: Finished difference. Result has 63 places, 53 transitions, 114 flow [2025-02-08 08:30:18,147 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=76, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=114, PETRI_PLACES=63, PETRI_TRANSITIONS=53} [2025-02-08 08:30:18,147 INFO L279 CegarLoopForPetriNet]: 71 programPoint places, -8 predicate places. [2025-02-08 08:30:18,148 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 53 transitions, 114 flow [2025-02-08 08:30:18,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.75) internal successors, (151), 4 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-02-08 08:30:18,148 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:30:18,148 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:30:18,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 08:30:18,148 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting workerErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 35 more)] === [2025-02-08 08:30:18,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:30:18,148 INFO L85 PathProgramCache]: Analyzing trace with hash 1798662794, now seen corresponding path program 1 times [2025-02-08 08:30:18,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:30:18,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127517531] [2025-02-08 08:30:18,149 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:30:18,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:30:18,154 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-08 08:30:18,157 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-08 08:30:18,157 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:30:18,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:30:18,198 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:30:18,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:30:18,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127517531] [2025-02-08 08:30:18,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127517531] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:30:18,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:30:18,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:30:18,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913904592] [2025-02-08 08:30:18,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:30:18,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:30:18,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:30:18,200 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:30:18,200 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:30:18,245 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 76 [2025-02-08 08:30:18,245 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 53 transitions, 114 flow. Second operand has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:30:18,245 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:30:18,246 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 76 [2025-02-08 08:30:18,246 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:30:18,314 INFO L124 PetriNetUnfolderBase]: 155/465 cut-off events. [2025-02-08 08:30:18,314 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2025-02-08 08:30:18,315 INFO L83 FinitePrefix]: Finished finitePrefix Result has 804 conditions, 465 events. 155/465 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2689 event pairs, 61 based on Foata normal form. 23/420 useless extension candidates. Maximal degree in co-relation 797. Up to 291 conditions per place. [2025-02-08 08:30:18,316 INFO L140 encePairwiseOnDemand]: 68/76 looper letters, 35 selfloop transitions, 2 changer transitions 0/57 dead transitions. [2025-02-08 08:30:18,316 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 57 transitions, 199 flow [2025-02-08 08:30:18,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:30:18,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 08:30:18,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 175 transitions. [2025-02-08 08:30:18,317 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5756578947368421 [2025-02-08 08:30:18,317 INFO L175 Difference]: Start difference. First operand has 63 places, 53 transitions, 114 flow. Second operand 4 states and 175 transitions. [2025-02-08 08:30:18,317 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 57 transitions, 199 flow [2025-02-08 08:30:18,318 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 57 transitions, 195 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 08:30:18,318 INFO L231 Difference]: Finished difference. Result has 54 places, 47 transitions, 103 flow [2025-02-08 08:30:18,319 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=76, PETRI_DIFFERENCE_MINUEND_FLOW=99, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=103, PETRI_PLACES=54, PETRI_TRANSITIONS=47} [2025-02-08 08:30:18,319 INFO L279 CegarLoopForPetriNet]: 71 programPoint places, -17 predicate places. [2025-02-08 08:30:18,319 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 47 transitions, 103 flow [2025-02-08 08:30:18,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:30:18,319 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:30:18,319 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:30:18,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 08:30:18,320 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting workerErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 35 more)] === [2025-02-08 08:30:18,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:30:18,320 INFO L85 PathProgramCache]: Analyzing trace with hash 1798662795, now seen corresponding path program 1 times [2025-02-08 08:30:18,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:30:18,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976291745] [2025-02-08 08:30:18,320 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:30:18,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:30:18,326 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-08 08:30:18,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-08 08:30:18,329 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:30:18,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:30:18,394 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:30:18,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:30:18,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976291745] [2025-02-08 08:30:18,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976291745] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:30:18,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:30:18,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:30:18,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803937821] [2025-02-08 08:30:18,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:30:18,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:30:18,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:30:18,395 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:30:18,395 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:30:18,440 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 76 [2025-02-08 08:30:18,441 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 47 transitions, 103 flow. Second operand has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:30:18,441 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:30:18,441 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 76 [2025-02-08 08:30:18,441 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:30:18,533 INFO L124 PetriNetUnfolderBase]: 142/411 cut-off events. [2025-02-08 08:30:18,533 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2025-02-08 08:30:18,535 INFO L83 FinitePrefix]: Finished finitePrefix Result has 754 conditions, 411 events. 142/411 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 2200 event pairs, 0 based on Foata normal form. 22/382 useless extension candidates. Maximal degree in co-relation 747. Up to 284 conditions per place. [2025-02-08 08:30:18,536 INFO L140 encePairwiseOnDemand]: 68/76 looper letters, 35 selfloop transitions, 2 changer transitions 0/51 dead transitions. [2025-02-08 08:30:18,537 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 51 transitions, 187 flow [2025-02-08 08:30:18,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:30:18,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 08:30:18,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 175 transitions. [2025-02-08 08:30:18,538 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5756578947368421 [2025-02-08 08:30:18,538 INFO L175 Difference]: Start difference. First operand has 54 places, 47 transitions, 103 flow. Second operand 4 states and 175 transitions. [2025-02-08 08:30:18,538 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 51 transitions, 187 flow [2025-02-08 08:30:18,539 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 51 transitions, 184 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 08:30:18,539 INFO L231 Difference]: Finished difference. Result has 49 places, 41 transitions, 92 flow [2025-02-08 08:30:18,540 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=76, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=92, PETRI_PLACES=49, PETRI_TRANSITIONS=41} [2025-02-08 08:30:18,540 INFO L279 CegarLoopForPetriNet]: 71 programPoint places, -22 predicate places. [2025-02-08 08:30:18,540 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 92 flow [2025-02-08 08:30:18,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:30:18,541 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:30:18,541 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:30:18,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 08:30:18,542 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting workerErr9ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 35 more)] === [2025-02-08 08:30:18,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:30:18,542 INFO L85 PathProgramCache]: Analyzing trace with hash 765956485, now seen corresponding path program 1 times [2025-02-08 08:30:18,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:30:18,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940507422] [2025-02-08 08:30:18,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:30:18,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:30:18,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-08 08:30:18,558 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-08 08:30:18,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:30:18,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:30:18,684 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:30:18,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:30:18,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940507422] [2025-02-08 08:30:18,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940507422] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:30:18,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:30:18,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 08:30:18,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873384141] [2025-02-08 08:30:18,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:30:18,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 08:30:18,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:30:18,686 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 08:30:18,686 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 08:30:18,753 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 76 [2025-02-08 08:30:18,754 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 92 flow. Second operand has 6 states, 6 states have (on average 37.333333333333336) internal successors, (224), 6 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:30:18,754 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:30:18,754 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 76 [2025-02-08 08:30:18,755 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:30:18,940 INFO L124 PetriNetUnfolderBase]: 206/501 cut-off events. [2025-02-08 08:30:18,940 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2025-02-08 08:30:18,941 INFO L83 FinitePrefix]: Finished finitePrefix Result has 990 conditions, 501 events. 206/501 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 2581 event pairs, 4 based on Foata normal form. 0/420 useless extension candidates. Maximal degree in co-relation 983. Up to 221 conditions per place. [2025-02-08 08:30:18,942 INFO L140 encePairwiseOnDemand]: 65/76 looper letters, 50 selfloop transitions, 10 changer transitions 22/92 dead transitions. [2025-02-08 08:30:18,942 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 92 transitions, 365 flow [2025-02-08 08:30:18,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 08:30:18,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-08 08:30:18,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 335 transitions. [2025-02-08 08:30:18,943 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6296992481203008 [2025-02-08 08:30:18,944 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 92 flow. Second operand 7 states and 335 transitions. [2025-02-08 08:30:18,944 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 92 transitions, 365 flow [2025-02-08 08:30:18,944 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 92 transitions, 361 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 08:30:18,947 INFO L231 Difference]: Finished difference. Result has 58 places, 40 transitions, 137 flow [2025-02-08 08:30:18,947 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=76, PETRI_DIFFERENCE_MINUEND_FLOW=89, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=137, PETRI_PLACES=58, PETRI_TRANSITIONS=40} [2025-02-08 08:30:18,948 INFO L279 CegarLoopForPetriNet]: 71 programPoint places, -13 predicate places. [2025-02-08 08:30:18,948 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 40 transitions, 137 flow [2025-02-08 08:30:18,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 37.333333333333336) internal successors, (224), 6 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:30:18,948 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:30:18,948 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:30:18,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 08:30:18,949 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting workerErr6ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 35 more)] === [2025-02-08 08:30:18,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:30:18,949 INFO L85 PathProgramCache]: Analyzing trace with hash 766663432, now seen corresponding path program 1 times [2025-02-08 08:30:18,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:30:18,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725387449] [2025-02-08 08:30:18,949 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:30:18,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:30:18,955 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-08 08:30:18,958 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-08 08:30:18,959 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:30:18,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:30:19,009 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 08:30:19,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:30:19,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725387449] [2025-02-08 08:30:19,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725387449] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:30:19,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:30:19,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 08:30:19,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559948024] [2025-02-08 08:30:19,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:30:19,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 08:30:19,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:30:19,011 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 08:30:19,011 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 08:30:19,058 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 76 [2025-02-08 08:30:19,059 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 40 transitions, 137 flow. Second operand has 5 states, 5 states have (on average 36.8) internal successors, (184), 5 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-02-08 08:30:19,059 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:30:19,059 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 76 [2025-02-08 08:30:19,059 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:30:19,191 INFO L124 PetriNetUnfolderBase]: 133/324 cut-off events. [2025-02-08 08:30:19,191 INFO L125 PetriNetUnfolderBase]: For 92/92 co-relation queries the response was YES. [2025-02-08 08:30:19,192 INFO L83 FinitePrefix]: Finished finitePrefix Result has 795 conditions, 324 events. 133/324 cut-off events. For 92/92 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1419 event pairs, 55 based on Foata normal form. 17/302 useless extension candidates. Maximal degree in co-relation 783. Up to 172 conditions per place. [2025-02-08 08:30:19,193 INFO L140 encePairwiseOnDemand]: 68/76 looper letters, 43 selfloop transitions, 9 changer transitions 26/87 dead transitions. [2025-02-08 08:30:19,193 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 87 transitions, 411 flow [2025-02-08 08:30:19,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 08:30:19,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 08:30:19,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 284 transitions. [2025-02-08 08:30:19,194 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6228070175438597 [2025-02-08 08:30:19,194 INFO L175 Difference]: Start difference. First operand has 58 places, 40 transitions, 137 flow. Second operand 6 states and 284 transitions. [2025-02-08 08:30:19,194 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 87 transitions, 411 flow [2025-02-08 08:30:19,196 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 87 transitions, 409 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 08:30:19,197 INFO L231 Difference]: Finished difference. Result has 59 places, 41 transitions, 185 flow [2025-02-08 08:30:19,197 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=76, PETRI_DIFFERENCE_MINUEND_FLOW=135, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=185, PETRI_PLACES=59, PETRI_TRANSITIONS=41} [2025-02-08 08:30:19,197 INFO L279 CegarLoopForPetriNet]: 71 programPoint places, -12 predicate places. [2025-02-08 08:30:19,197 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 41 transitions, 185 flow [2025-02-08 08:30:19,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 36.8) internal successors, (184), 5 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-02-08 08:30:19,198 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:30:19,198 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:30:19,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 08:30:19,198 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting workerErr9ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 35 more)] === [2025-02-08 08:30:19,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:30:19,198 INFO L85 PathProgramCache]: Analyzing trace with hash 1646859039, now seen corresponding path program 1 times [2025-02-08 08:30:19,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:30:19,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361690138] [2025-02-08 08:30:19,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:30:19,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:30:19,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-08 08:30:19,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-08 08:30:19,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:30:19,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:30:19,524 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:30:19,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:30:19,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361690138] [2025-02-08 08:30:19,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361690138] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:30:19,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:30:19,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 08:30:19,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520928212] [2025-02-08 08:30:19,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:30:19,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-08 08:30:19,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:30:19,526 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-08 08:30:19,526 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-02-08 08:30:19,741 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 76 [2025-02-08 08:30:19,742 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 41 transitions, 185 flow. Second operand has 9 states, 9 states have (on average 37.55555555555556) internal successors, (338), 9 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:30:19,742 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:30:19,742 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 76 [2025-02-08 08:30:19,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:30:19,977 INFO L124 PetriNetUnfolderBase]: 101/270 cut-off events. [2025-02-08 08:30:19,980 INFO L125 PetriNetUnfolderBase]: For 237/241 co-relation queries the response was YES. [2025-02-08 08:30:19,981 INFO L83 FinitePrefix]: Finished finitePrefix Result has 825 conditions, 270 events. 101/270 cut-off events. For 237/241 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1183 event pairs, 10 based on Foata normal form. 12/273 useless extension candidates. Maximal degree in co-relation 809. Up to 71 conditions per place. [2025-02-08 08:30:19,982 INFO L140 encePairwiseOnDemand]: 66/76 looper letters, 42 selfloop transitions, 24 changer transitions 2/78 dead transitions. [2025-02-08 08:30:19,982 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 78 transitions, 481 flow [2025-02-08 08:30:19,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-08 08:30:19,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-02-08 08:30:19,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 461 transitions. [2025-02-08 08:30:19,984 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5514354066985646 [2025-02-08 08:30:19,985 INFO L175 Difference]: Start difference. First operand has 59 places, 41 transitions, 185 flow. Second operand 11 states and 461 transitions. [2025-02-08 08:30:19,985 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 78 transitions, 481 flow [2025-02-08 08:30:19,986 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 78 transitions, 459 flow, removed 2 selfloop flow, removed 3 redundant places. [2025-02-08 08:30:19,991 INFO L231 Difference]: Finished difference. Result has 67 places, 53 transitions, 323 flow [2025-02-08 08:30:19,993 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=76, PETRI_DIFFERENCE_MINUEND_FLOW=173, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=323, PETRI_PLACES=67, PETRI_TRANSITIONS=53} [2025-02-08 08:30:19,994 INFO L279 CegarLoopForPetriNet]: 71 programPoint places, -4 predicate places. [2025-02-08 08:30:19,994 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 53 transitions, 323 flow [2025-02-08 08:30:19,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 37.55555555555556) internal successors, (338), 9 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:30:19,994 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:30:19,994 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:30:19,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 08:30:19,994 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting workerErr9ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 35 more)] === [2025-02-08 08:30:19,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:30:19,995 INFO L85 PathProgramCache]: Analyzing trace with hash -2014846465, now seen corresponding path program 2 times [2025-02-08 08:30:19,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:30:19,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630750072] [2025-02-08 08:30:19,996 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 08:30:19,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:30:20,006 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-02-08 08:30:20,013 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 21 of 22 statements. [2025-02-08 08:30:20,014 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 08:30:20,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:30:20,114 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 08:30:20,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:30:20,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630750072] [2025-02-08 08:30:20,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630750072] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:30:20,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:30:20,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 08:30:20,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918097268] [2025-02-08 08:30:20,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:30:20,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 08:30:20,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:30:20,116 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 08:30:20,117 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 08:30:20,201 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 76 [2025-02-08 08:30:20,202 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 53 transitions, 323 flow. Second operand has 5 states, 5 states have (on average 41.6) internal successors, (208), 5 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:30:20,202 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:30:20,202 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 76 [2025-02-08 08:30:20,202 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:30:20,292 INFO L124 PetriNetUnfolderBase]: 96/258 cut-off events. [2025-02-08 08:30:20,293 INFO L125 PetriNetUnfolderBase]: For 437/446 co-relation queries the response was YES. [2025-02-08 08:30:20,294 INFO L83 FinitePrefix]: Finished finitePrefix Result has 884 conditions, 258 events. 96/258 cut-off events. For 437/446 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1145 event pairs, 18 based on Foata normal form. 9/260 useless extension candidates. Maximal degree in co-relation 864. Up to 87 conditions per place. [2025-02-08 08:30:20,295 INFO L140 encePairwiseOnDemand]: 71/76 looper letters, 45 selfloop transitions, 10 changer transitions 0/76 dead transitions. [2025-02-08 08:30:20,295 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 76 transitions, 566 flow [2025-02-08 08:30:20,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 08:30:20,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 08:30:20,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 233 transitions. [2025-02-08 08:30:20,297 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6131578947368421 [2025-02-08 08:30:20,297 INFO L175 Difference]: Start difference. First operand has 67 places, 53 transitions, 323 flow. Second operand 5 states and 233 transitions. [2025-02-08 08:30:20,297 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 76 transitions, 566 flow [2025-02-08 08:30:20,299 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 76 transitions, 506 flow, removed 1 selfloop flow, removed 7 redundant places. [2025-02-08 08:30:20,300 INFO L231 Difference]: Finished difference. Result has 66 places, 56 transitions, 328 flow [2025-02-08 08:30:20,300 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=76, PETRI_DIFFERENCE_MINUEND_FLOW=277, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=328, PETRI_PLACES=66, PETRI_TRANSITIONS=56} [2025-02-08 08:30:20,302 INFO L279 CegarLoopForPetriNet]: 71 programPoint places, -5 predicate places. [2025-02-08 08:30:20,302 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 56 transitions, 328 flow [2025-02-08 08:30:20,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 41.6) internal successors, (208), 5 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:30:20,302 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:30:20,302 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:30:20,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 08:30:20,303 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting workerErr9ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 35 more)] === [2025-02-08 08:30:20,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:30:20,303 INFO L85 PathProgramCache]: Analyzing trace with hash -992559029, now seen corresponding path program 3 times [2025-02-08 08:30:20,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:30:20,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144903678] [2025-02-08 08:30:20,303 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 08:30:20,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:30:20,312 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 2 equivalence classes. [2025-02-08 08:30:20,318 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 21 of 22 statements. [2025-02-08 08:30:20,319 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-08 08:30:20,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:30:20,422 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 08:30:20,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:30:20,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144903678] [2025-02-08 08:30:20,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144903678] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:30:20,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:30:20,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 08:30:20,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851627377] [2025-02-08 08:30:20,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:30:20,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 08:30:20,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:30:20,423 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 08:30:20,424 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 08:30:20,514 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 76 [2025-02-08 08:30:20,515 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 56 transitions, 328 flow. Second operand has 5 states, 5 states have (on average 41.6) internal successors, (208), 5 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:30:20,515 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:30:20,515 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 76 [2025-02-08 08:30:20,515 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:30:20,604 INFO L124 PetriNetUnfolderBase]: 74/241 cut-off events. [2025-02-08 08:30:20,604 INFO L125 PetriNetUnfolderBase]: For 385/392 co-relation queries the response was YES. [2025-02-08 08:30:20,604 INFO L83 FinitePrefix]: Finished finitePrefix Result has 798 conditions, 241 events. 74/241 cut-off events. For 385/392 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1089 event pairs, 17 based on Foata normal form. 11/239 useless extension candidates. Maximal degree in co-relation 778. Up to 110 conditions per place. [2025-02-08 08:30:20,605 INFO L140 encePairwiseOnDemand]: 71/76 looper letters, 42 selfloop transitions, 10 changer transitions 3/73 dead transitions. [2025-02-08 08:30:20,605 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 73 transitions, 520 flow [2025-02-08 08:30:20,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 08:30:20,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 08:30:20,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 237 transitions. [2025-02-08 08:30:20,609 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6236842105263158 [2025-02-08 08:30:20,609 INFO L175 Difference]: Start difference. First operand has 66 places, 56 transitions, 328 flow. Second operand 5 states and 237 transitions. [2025-02-08 08:30:20,609 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 73 transitions, 520 flow [2025-02-08 08:30:20,611 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 73 transitions, 507 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 08:30:20,612 INFO L231 Difference]: Finished difference. Result has 71 places, 57 transitions, 374 flow [2025-02-08 08:30:20,612 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=76, PETRI_DIFFERENCE_MINUEND_FLOW=293, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=374, PETRI_PLACES=71, PETRI_TRANSITIONS=57} [2025-02-08 08:30:20,613 INFO L279 CegarLoopForPetriNet]: 71 programPoint places, 0 predicate places. [2025-02-08 08:30:20,613 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 57 transitions, 374 flow [2025-02-08 08:30:20,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 41.6) internal successors, (208), 5 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:30:20,614 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:30:20,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, 1, 1] [2025-02-08 08:30:20,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 08:30:20,615 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting workerErr9ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 35 more)] === [2025-02-08 08:30:20,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:30:20,615 INFO L85 PathProgramCache]: Analyzing trace with hash 1990488785, now seen corresponding path program 4 times [2025-02-08 08:30:20,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:30:20,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663057042] [2025-02-08 08:30:20,615 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 08:30:20,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:30:20,626 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 22 statements into 2 equivalence classes. [2025-02-08 08:30:20,631 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 19 of 22 statements. [2025-02-08 08:30:20,631 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-08 08:30:20,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:30:20,723 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 08:30:20,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:30:20,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663057042] [2025-02-08 08:30:20,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663057042] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:30:20,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:30:20,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 08:30:20,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104666576] [2025-02-08 08:30:20,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:30:20,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 08:30:20,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:30:20,724 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 08:30:20,724 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 08:30:20,820 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 76 [2025-02-08 08:30:20,820 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 57 transitions, 374 flow. Second operand has 5 states, 5 states have (on average 41.6) internal successors, (208), 5 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:30:20,821 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:30:20,821 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 76 [2025-02-08 08:30:20,821 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:30:20,906 INFO L124 PetriNetUnfolderBase]: 47/188 cut-off events. [2025-02-08 08:30:20,906 INFO L125 PetriNetUnfolderBase]: For 384/384 co-relation queries the response was YES. [2025-02-08 08:30:20,907 INFO L83 FinitePrefix]: Finished finitePrefix Result has 656 conditions, 188 events. 47/188 cut-off events. For 384/384 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 777 event pairs, 1 based on Foata normal form. 5/190 useless extension candidates. Maximal degree in co-relation 633. Up to 59 conditions per place. [2025-02-08 08:30:20,907 INFO L140 encePairwiseOnDemand]: 71/76 looper letters, 29 selfloop transitions, 8 changer transitions 12/61 dead transitions. [2025-02-08 08:30:20,907 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 61 transitions, 477 flow [2025-02-08 08:30:20,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 08:30:20,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 08:30:20,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 233 transitions. [2025-02-08 08:30:20,909 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6131578947368421 [2025-02-08 08:30:20,909 INFO L175 Difference]: Start difference. First operand has 71 places, 57 transitions, 374 flow. Second operand 5 states and 233 transitions. [2025-02-08 08:30:20,909 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 61 transitions, 477 flow [2025-02-08 08:30:20,911 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 61 transitions, 423 flow, removed 10 selfloop flow, removed 6 redundant places. [2025-02-08 08:30:20,912 INFO L231 Difference]: Finished difference. Result has 66 places, 39 transitions, 258 flow [2025-02-08 08:30:20,912 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=76, PETRI_DIFFERENCE_MINUEND_FLOW=271, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=258, PETRI_PLACES=66, PETRI_TRANSITIONS=39} [2025-02-08 08:30:20,912 INFO L279 CegarLoopForPetriNet]: 71 programPoint places, -5 predicate places. [2025-02-08 08:30:20,913 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 39 transitions, 258 flow [2025-02-08 08:30:20,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 41.6) internal successors, (208), 5 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:30:20,914 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:30:20,914 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:30:20,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 08:30:20,914 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting workerErr9ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 35 more)] === [2025-02-08 08:30:20,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:30:20,914 INFO L85 PathProgramCache]: Analyzing trace with hash -62038137, now seen corresponding path program 5 times [2025-02-08 08:30:20,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:30:20,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010568247] [2025-02-08 08:30:20,914 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-08 08:30:20,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:30:20,921 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-02-08 08:30:20,927 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-02-08 08:30:20,928 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 08:30:20,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:30:21,156 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:30:21,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:30:21,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010568247] [2025-02-08 08:30:21,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010568247] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:30:21,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:30:21,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-08 08:30:21,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713083596] [2025-02-08 08:30:21,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:30:21,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-08 08:30:21,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:30:21,158 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-08 08:30:21,158 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-02-08 08:30:21,511 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 76 [2025-02-08 08:30:21,512 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 39 transitions, 258 flow. Second operand has 11 states, 11 states have (on average 37.45454545454545) internal successors, (412), 11 states have internal predecessors, (412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:30:21,512 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:30:21,513 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 76 [2025-02-08 08:30:21,513 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:30:21,689 INFO L124 PetriNetUnfolderBase]: 22/110 cut-off events. [2025-02-08 08:30:21,690 INFO L125 PetriNetUnfolderBase]: For 312/312 co-relation queries the response was YES. [2025-02-08 08:30:21,690 INFO L83 FinitePrefix]: Finished finitePrefix Result has 394 conditions, 110 events. 22/110 cut-off events. For 312/312 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 349 event pairs, 6 based on Foata normal form. 5/112 useless extension candidates. Maximal degree in co-relation 373. Up to 29 conditions per place. [2025-02-08 08:30:21,690 INFO L140 encePairwiseOnDemand]: 66/76 looper letters, 23 selfloop transitions, 6 changer transitions 19/55 dead transitions. [2025-02-08 08:30:21,690 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 55 transitions, 419 flow [2025-02-08 08:30:21,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 08:30:21,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-02-08 08:30:21,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 402 transitions. [2025-02-08 08:30:21,692 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5289473684210526 [2025-02-08 08:30:21,692 INFO L175 Difference]: Start difference. First operand has 66 places, 39 transitions, 258 flow. Second operand 10 states and 402 transitions. [2025-02-08 08:30:21,692 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 55 transitions, 419 flow [2025-02-08 08:30:21,693 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 55 transitions, 381 flow, removed 4 selfloop flow, removed 8 redundant places. [2025-02-08 08:30:21,694 INFO L231 Difference]: Finished difference. Result has 66 places, 33 transitions, 189 flow [2025-02-08 08:30:21,694 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=76, PETRI_DIFFERENCE_MINUEND_FLOW=223, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=189, PETRI_PLACES=66, PETRI_TRANSITIONS=33} [2025-02-08 08:30:21,695 INFO L279 CegarLoopForPetriNet]: 71 programPoint places, -5 predicate places. [2025-02-08 08:30:21,695 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 33 transitions, 189 flow [2025-02-08 08:30:21,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 37.45454545454545) internal successors, (412), 11 states have internal predecessors, (412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:30:21,695 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:30:21,695 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-02-08 08:30:21,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-08 08:30:21,696 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting workerErr9ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 35 more)] === [2025-02-08 08:30:21,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:30:21,696 INFO L85 PathProgramCache]: Analyzing trace with hash -931836120, now seen corresponding path program 1 times [2025-02-08 08:30:21,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:30:21,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101989819] [2025-02-08 08:30:21,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:30:21,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:30:21,703 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-08 08:30:21,706 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-08 08:30:21,706 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:30:21,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:30:21,920 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:30:21,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:30:21,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101989819] [2025-02-08 08:30:21,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101989819] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:30:21,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:30:21,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-08 08:30:21,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949458797] [2025-02-08 08:30:21,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:30:21,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-08 08:30:21,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:30:21,922 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-08 08:30:21,922 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-02-08 08:30:22,285 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 76 [2025-02-08 08:30:22,286 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 33 transitions, 189 flow. Second operand has 12 states, 12 states have (on average 37.416666666666664) internal successors, (449), 12 states have internal predecessors, (449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:30:22,286 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:30:22,286 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 76 [2025-02-08 08:30:22,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:30:22,464 INFO L124 PetriNetUnfolderBase]: 15/81 cut-off events. [2025-02-08 08:30:22,464 INFO L125 PetriNetUnfolderBase]: For 197/197 co-relation queries the response was YES. [2025-02-08 08:30:22,465 INFO L83 FinitePrefix]: Finished finitePrefix Result has 296 conditions, 81 events. 15/81 cut-off events. For 197/197 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 188 event pairs, 6 based on Foata normal form. 2/83 useless extension candidates. Maximal degree in co-relation 279. Up to 27 conditions per place. [2025-02-08 08:30:22,465 INFO L140 encePairwiseOnDemand]: 66/76 looper letters, 17 selfloop transitions, 6 changer transitions 16/46 dead transitions. [2025-02-08 08:30:22,465 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 46 transitions, 329 flow [2025-02-08 08:30:22,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 08:30:22,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-02-08 08:30:22,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 396 transitions. [2025-02-08 08:30:22,467 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5210526315789473 [2025-02-08 08:30:22,467 INFO L175 Difference]: Start difference. First operand has 66 places, 33 transitions, 189 flow. Second operand 10 states and 396 transitions. [2025-02-08 08:30:22,467 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 46 transitions, 329 flow [2025-02-08 08:30:22,468 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 46 transitions, 270 flow, removed 15 selfloop flow, removed 12 redundant places. [2025-02-08 08:30:22,469 INFO L231 Difference]: Finished difference. Result has 60 places, 30 transitions, 146 flow [2025-02-08 08:30:22,469 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=76, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=146, PETRI_PLACES=60, PETRI_TRANSITIONS=30} [2025-02-08 08:30:22,469 INFO L279 CegarLoopForPetriNet]: 71 programPoint places, -11 predicate places. [2025-02-08 08:30:22,469 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 30 transitions, 146 flow [2025-02-08 08:30:22,469 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 37.416666666666664) internal successors, (449), 12 states have internal predecessors, (449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:30:22,469 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:30:22,470 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-02-08 08:30:22,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-08 08:30:22,470 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting workerErr9ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 35 more)] === [2025-02-08 08:30:22,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:30:22,470 INFO L85 PathProgramCache]: Analyzing trace with hash 2073709894, now seen corresponding path program 2 times [2025-02-08 08:30:22,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:30:22,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364375671] [2025-02-08 08:30:22,470 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 08:30:22,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:30:22,477 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-02-08 08:30:22,482 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-02-08 08:30:22,482 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 08:30:22,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:30:22,686 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:30:22,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:30:22,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364375671] [2025-02-08 08:30:22,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364375671] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:30:22,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:30:22,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-08 08:30:22,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319012543] [2025-02-08 08:30:22,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:30:22,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-08 08:30:22,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:30:22,688 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-08 08:30:22,688 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-02-08 08:30:23,037 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 76 [2025-02-08 08:30:23,038 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 30 transitions, 146 flow. Second operand has 12 states, 12 states have (on average 37.416666666666664) internal successors, (449), 12 states have internal predecessors, (449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:30:23,038 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:30:23,038 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 76 [2025-02-08 08:30:23,038 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:30:23,218 INFO L124 PetriNetUnfolderBase]: 12/64 cut-off events. [2025-02-08 08:30:23,219 INFO L125 PetriNetUnfolderBase]: For 158/158 co-relation queries the response was YES. [2025-02-08 08:30:23,219 INFO L83 FinitePrefix]: Finished finitePrefix Result has 217 conditions, 64 events. 12/64 cut-off events. For 158/158 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 110 event pairs, 6 based on Foata normal form. 2/66 useless extension candidates. Maximal degree in co-relation 203. Up to 22 conditions per place. [2025-02-08 08:30:23,219 INFO L140 encePairwiseOnDemand]: 66/76 looper letters, 13 selfloop transitions, 9 changer transitions 9/38 dead transitions. [2025-02-08 08:30:23,219 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 38 transitions, 264 flow [2025-02-08 08:30:23,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-08 08:30:23,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-02-08 08:30:23,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 463 transitions. [2025-02-08 08:30:23,221 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5076754385964912 [2025-02-08 08:30:23,221 INFO L175 Difference]: Start difference. First operand has 60 places, 30 transitions, 146 flow. Second operand 12 states and 463 transitions. [2025-02-08 08:30:23,221 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 38 transitions, 264 flow [2025-02-08 08:30:23,222 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 38 transitions, 226 flow, removed 8 selfloop flow, removed 10 redundant places. [2025-02-08 08:30:23,223 INFO L231 Difference]: Finished difference. Result has 59 places, 28 transitions, 121 flow [2025-02-08 08:30:23,223 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=76, PETRI_DIFFERENCE_MINUEND_FLOW=117, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=121, PETRI_PLACES=59, PETRI_TRANSITIONS=28} [2025-02-08 08:30:23,223 INFO L279 CegarLoopForPetriNet]: 71 programPoint places, -12 predicate places. [2025-02-08 08:30:23,223 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 28 transitions, 121 flow [2025-02-08 08:30:23,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 37.416666666666664) internal successors, (449), 12 states have internal predecessors, (449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:30:23,224 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:30:23,224 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:30:23,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-08 08:30:23,224 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting workerErr9ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 35 more)] === [2025-02-08 08:30:23,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:30:23,226 INFO L85 PathProgramCache]: Analyzing trace with hash -1583942232, now seen corresponding path program 3 times [2025-02-08 08:30:23,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:30:23,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574890472] [2025-02-08 08:30:23,226 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 08:30:23,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:30:23,233 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 23 statements into 2 equivalence classes. [2025-02-08 08:30:23,238 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-02-08 08:30:23,238 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-02-08 08:30:23,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:30:23,405 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:30:23,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:30:23,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574890472] [2025-02-08 08:30:23,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574890472] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:30:23,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [942239671] [2025-02-08 08:30:23,406 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 08:30:23,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:30:23,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:30:23,412 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:30:23,413 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-08 08:30:23,460 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 23 statements into 2 equivalence classes. [2025-02-08 08:30:23,481 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-02-08 08:30:23,482 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-02-08 08:30:23,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:30:23,484 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-02-08 08:30:23,487 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:30:23,537 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-08 08:30:23,654 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2025-02-08 08:30:23,733 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:30:23,734 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 08:30:23,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [942239671] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:30:23,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 08:30:23,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 16 [2025-02-08 08:30:23,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231818312] [2025-02-08 08:30:23,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:30:23,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-08 08:30:23,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:30:23,735 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-08 08:30:23,735 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2025-02-08 08:30:23,889 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 76 [2025-02-08 08:30:23,889 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 28 transitions, 121 flow. Second operand has 9 states, 9 states have (on average 38.77777777777778) internal successors, (349), 9 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:30:23,889 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:30:23,889 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 76 [2025-02-08 08:30:23,889 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:30:23,964 INFO L124 PetriNetUnfolderBase]: 4/29 cut-off events. [2025-02-08 08:30:23,965 INFO L125 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES. [2025-02-08 08:30:23,965 INFO L83 FinitePrefix]: Finished finitePrefix Result has 108 conditions, 29 events. 4/29 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 20 event pairs, 1 based on Foata normal form. 2/31 useless extension candidates. Maximal degree in co-relation 97. Up to 8 conditions per place. [2025-02-08 08:30:23,965 INFO L140 encePairwiseOnDemand]: 68/76 looper letters, 0 selfloop transitions, 0 changer transitions 23/23 dead transitions. [2025-02-08 08:30:23,965 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 23 transitions, 145 flow [2025-02-08 08:30:23,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 08:30:23,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-08 08:30:23,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 351 transitions. [2025-02-08 08:30:23,966 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5131578947368421 [2025-02-08 08:30:23,967 INFO L175 Difference]: Start difference. First operand has 59 places, 28 transitions, 121 flow. Second operand 9 states and 351 transitions. [2025-02-08 08:30:23,967 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 23 transitions, 145 flow [2025-02-08 08:30:23,967 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 23 transitions, 112 flow, removed 5 selfloop flow, removed 12 redundant places. [2025-02-08 08:30:23,967 INFO L231 Difference]: Finished difference. Result has 45 places, 0 transitions, 0 flow [2025-02-08 08:30:23,967 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=76, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=0, PETRI_PLACES=45, PETRI_TRANSITIONS=0} [2025-02-08 08:30:23,968 INFO L279 CegarLoopForPetriNet]: 71 programPoint places, -26 predicate places. [2025-02-08 08:30:23,968 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 0 transitions, 0 flow [2025-02-08 08:30:23,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 38.77777777777778) internal successors, (349), 9 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:30:23,970 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 38 remaining) [2025-02-08 08:30:23,970 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 38 remaining) [2025-02-08 08:30:23,970 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (35 of 38 remaining) [2025-02-08 08:30:23,970 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 38 remaining) [2025-02-08 08:30:23,970 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 38 remaining) [2025-02-08 08:30:23,970 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 38 remaining) [2025-02-08 08:30:23,970 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 38 remaining) [2025-02-08 08:30:23,970 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 38 remaining) [2025-02-08 08:30:23,970 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 38 remaining) [2025-02-08 08:30:23,970 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (28 of 38 remaining) [2025-02-08 08:30:23,970 INFO L782 garLoopResultBuilder]: Registering result SAFE for location workerErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 38 remaining) [2025-02-08 08:30:23,971 INFO L782 garLoopResultBuilder]: Registering result SAFE for location workerErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 38 remaining) [2025-02-08 08:30:23,971 INFO L782 garLoopResultBuilder]: Registering result SAFE for location workerErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 38 remaining) [2025-02-08 08:30:23,971 INFO L782 garLoopResultBuilder]: Registering result SAFE for location workerErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 38 remaining) [2025-02-08 08:30:23,971 INFO L782 garLoopResultBuilder]: Registering result SAFE for location workerErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 38 remaining) [2025-02-08 08:30:23,971 INFO L782 garLoopResultBuilder]: Registering result SAFE for location workerErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 38 remaining) [2025-02-08 08:30:23,971 INFO L782 garLoopResultBuilder]: Registering result SAFE for location workerErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 38 remaining) [2025-02-08 08:30:23,971 INFO L782 garLoopResultBuilder]: Registering result SAFE for location workerErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 38 remaining) [2025-02-08 08:30:23,971 INFO L782 garLoopResultBuilder]: Registering result SAFE for location workerErr6ASSERT_VIOLATIONMEMORY_LEAK (19 of 38 remaining) [2025-02-08 08:30:23,971 INFO L782 garLoopResultBuilder]: Registering result SAFE for location workerErr9ASSERT_VIOLATIONMEMORY_LEAK (18 of 38 remaining) [2025-02-08 08:30:23,971 INFO L782 garLoopResultBuilder]: Registering result SAFE for location workerErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 38 remaining) [2025-02-08 08:30:23,971 INFO L782 garLoopResultBuilder]: Registering result SAFE for location workerErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 38 remaining) [2025-02-08 08:30:23,971 INFO L782 garLoopResultBuilder]: Registering result SAFE for location workerErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 38 remaining) [2025-02-08 08:30:23,971 INFO L782 garLoopResultBuilder]: Registering result SAFE for location workerErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 38 remaining) [2025-02-08 08:30:23,971 INFO L782 garLoopResultBuilder]: Registering result SAFE for location workerErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 38 remaining) [2025-02-08 08:30:23,971 INFO L782 garLoopResultBuilder]: Registering result SAFE for location workerErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 38 remaining) [2025-02-08 08:30:23,971 INFO L782 garLoopResultBuilder]: Registering result SAFE for location workerErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 38 remaining) [2025-02-08 08:30:23,971 INFO L782 garLoopResultBuilder]: Registering result SAFE for location workerErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 38 remaining) [2025-02-08 08:30:23,971 INFO L782 garLoopResultBuilder]: Registering result SAFE for location workerErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 38 remaining) [2025-02-08 08:30:23,971 INFO L782 garLoopResultBuilder]: Registering result SAFE for location workerErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 38 remaining) [2025-02-08 08:30:23,971 INFO L782 garLoopResultBuilder]: Registering result SAFE for location workerErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 38 remaining) [2025-02-08 08:30:23,971 INFO L782 garLoopResultBuilder]: Registering result SAFE for location workerErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 38 remaining) [2025-02-08 08:30:23,971 INFO L782 garLoopResultBuilder]: Registering result SAFE for location workerErr6ASSERT_VIOLATIONMEMORY_LEAK (5 of 38 remaining) [2025-02-08 08:30:23,971 INFO L782 garLoopResultBuilder]: Registering result SAFE for location workerErr9ASSERT_VIOLATIONMEMORY_LEAK (4 of 38 remaining) [2025-02-08 08:30:23,971 INFO L782 garLoopResultBuilder]: Registering result SAFE for location workerErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 38 remaining) [2025-02-08 08:30:23,971 INFO L782 garLoopResultBuilder]: Registering result SAFE for location workerErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 38 remaining) [2025-02-08 08:30:23,971 INFO L782 garLoopResultBuilder]: Registering result SAFE for location workerErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 38 remaining) [2025-02-08 08:30:23,971 INFO L782 garLoopResultBuilder]: Registering result SAFE for location workerErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 38 remaining) [2025-02-08 08:30:23,979 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-08 08:30:24,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-02-08 08:30:24,173 INFO L422 BasicCegarLoop]: Path program histogram: [5, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:30:24,177 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-08 08:30:24,177 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 08:30:24,180 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 08:30:24 BasicIcfg [2025-02-08 08:30:24,180 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 08:30:24,180 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 08:30:24,180 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 08:30:24,181 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 08:30:24,181 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:30:16" (3/4) ... [2025-02-08 08:30:24,182 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-08 08:30:24,184 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure worker [2025-02-08 08:30:24,187 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 42 nodes and edges [2025-02-08 08:30:24,187 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2025-02-08 08:30:24,188 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2025-02-08 08:30:24,188 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-02-08 08:30:24,188 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-08 08:30:24,245 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 08:30:24,246 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 08:30:24,246 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 08:30:24,247 INFO L158 Benchmark]: Toolchain (without parser) took 8439.80ms. Allocated memory was 142.6MB in the beginning and 369.1MB in the end (delta: 226.5MB). Free memory was 103.7MB in the beginning and 156.2MB in the end (delta: -52.5MB). Peak memory consumption was 171.4MB. Max. memory is 16.1GB. [2025-02-08 08:30:24,247 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 125.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 08:30:24,247 INFO L158 Benchmark]: CACSL2BoogieTranslator took 399.06ms. Allocated memory is still 142.6MB. Free memory was 103.7MB in the beginning and 82.9MB in the end (delta: 20.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-08 08:30:24,248 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.96ms. Allocated memory is still 142.6MB. Free memory was 82.9MB in the beginning and 80.9MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 08:30:24,248 INFO L158 Benchmark]: Boogie Preprocessor took 40.38ms. Allocated memory is still 142.6MB. Free memory was 80.9MB in the beginning and 79.9MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 08:30:24,248 INFO L158 Benchmark]: IcfgBuilder took 467.50ms. Allocated memory is still 142.6MB. Free memory was 79.9MB in the beginning and 47.4MB in the end (delta: 32.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-08 08:30:24,249 INFO L158 Benchmark]: TraceAbstraction took 7425.42ms. Allocated memory was 142.6MB in the beginning and 369.1MB in the end (delta: 226.5MB). Free memory was 46.4MB in the beginning and 164.4MB in the end (delta: -118.0MB). Peak memory consumption was 112.7MB. Max. memory is 16.1GB. [2025-02-08 08:30:24,249 INFO L158 Benchmark]: Witness Printer took 65.58ms. Allocated memory is still 369.1MB. Free memory was 164.4MB in the beginning and 156.2MB in the end (delta: 8.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 08:30:24,250 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.20ms. Allocated memory is still 201.3MB. Free memory is still 125.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 399.06ms. Allocated memory is still 142.6MB. Free memory was 103.7MB in the beginning and 82.9MB in the end (delta: 20.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.96ms. Allocated memory is still 142.6MB. Free memory was 82.9MB in the beginning and 80.9MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 40.38ms. Allocated memory is still 142.6MB. Free memory was 80.9MB in the beginning and 79.9MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 467.50ms. Allocated memory is still 142.6MB. Free memory was 79.9MB in the beginning and 47.4MB in the end (delta: 32.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 7425.42ms. Allocated memory was 142.6MB in the beginning and 369.1MB in the end (delta: 226.5MB). Free memory was 46.4MB in the beginning and 164.4MB in the end (delta: -118.0MB). Peak memory consumption was 112.7MB. Max. memory is 16.1GB. * Witness Printer took 65.58ms. Allocated memory is still 369.1MB. Free memory was 164.4MB in the beginning and 156.2MB in the end (delta: 8.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 743]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 18]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 18]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 114 locations, 38 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: 7.3s, OverallIterations: 17, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 4.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2620 SdHoareTripleChecker+Valid, 3.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1984 mSDsluCounter, 1765 SdHoareTripleChecker+Invalid, 2.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1632 mSDsCounter, 46 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6136 IncrementalHoareTripleChecker+Invalid, 6182 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 46 mSolverCounterUnsat, 133 mSDtfsCounter, 6136 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 149 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=374occurred in iteration=12, InterpolantAutomatonStates: 105, 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.1s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 274 NumberOfCodeBlocks, 269 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 256 ConstructedInterpolants, 0 QuantifiedInterpolants, 1953 SizeOfPredicates, 12 NumberOfNonLiveVariables, 182 ConjunctsInSsa, 40 ConjunctsInUnsatCore, 18 InterpolantComputations, 17 PerfectInterpolantSequences, 14/15 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 23 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-08 08:30:24,268 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