./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_nondet_test2-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_nondet_test2-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e277983cfe4b30513b023d34f2b840358d8a25fd7a5c39241cadd105379bfb92 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 07:11:16,189 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 07:11:16,235 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2025-03-04 07:11:16,240 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 07:11:16,240 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 07:11:16,254 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 07:11:16,254 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 07:11:16,254 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 07:11:16,256 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 07:11:16,256 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 07:11:16,256 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 07:11:16,257 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 07:11:16,257 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 07:11:16,257 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 07:11:16,257 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 07:11:16,258 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 07:11:16,258 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 07:11:16,258 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 07:11:16,258 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 07:11:16,258 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 07:11:16,258 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 07:11:16,258 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 07:11:16,258 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 07:11:16,258 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 07:11:16,258 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 07:11:16,258 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 07:11:16,258 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 07:11:16,258 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 07:11:16,258 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 07:11:16,258 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 07:11:16,259 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 07:11:16,259 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 07:11:16,259 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 07:11:16,259 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 07:11:16,259 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 07:11:16,259 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 07:11:16,259 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 07:11:16,259 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 07:11:16,259 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 07:11:16,259 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 07:11:16,259 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 07:11:16,260 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 07:11:16,260 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 07:11:16,260 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 07:11:16,260 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 07:11:16,260 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-memcleanup) ) 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 -> e277983cfe4b30513b023d34f2b840358d8a25fd7a5c39241cadd105379bfb92 [2025-03-04 07:11:16,480 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 07:11:16,489 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 07:11:16,491 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 07:11:16,492 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 07:11:16,492 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 07:11:16,493 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_nondet_test2-1.i [2025-03-04 07:11:17,677 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79c462329/7c3671ae3bda4d50982d4414ddf42d41/FLAGcac24eb6c [2025-03-04 07:11:17,999 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 07:11:18,000 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_nondet_test2-1.i [2025-03-04 07:11:18,017 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79c462329/7c3671ae3bda4d50982d4414ddf42d41/FLAGcac24eb6c [2025-03-04 07:11:18,029 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79c462329/7c3671ae3bda4d50982d4414ddf42d41 [2025-03-04 07:11:18,031 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 07:11:18,032 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 07:11:18,035 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 07:11:18,035 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 07:11:18,038 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 07:11:18,039 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 07:11:18" (1/1) ... [2025-03-04 07:11:18,041 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1fde3d63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:11:18, skipping insertion in model container [2025-03-04 07:11:18,041 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 07:11:18" (1/1) ... [2025-03-04 07:11:18,075 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 07:11:18,310 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 07:11:18,341 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 07:11:18,343 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 07:11:18,348 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 07:11:18,356 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 07:11:18,383 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 07:11:18,383 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 07:11:18,384 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 07:11:18,385 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 07:11:18,389 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 07:11:18,400 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 07:11:18,474 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 07:11:18,501 INFO L204 MainTranslator]: Completed translation [2025-03-04 07:11:18,501 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:11:18 WrapperNode [2025-03-04 07:11:18,502 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 07:11:18,503 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 07:11:18,503 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 07:11:18,503 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 07:11:18,507 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:11:18" (1/1) ... [2025-03-04 07:11:18,527 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:11:18" (1/1) ... [2025-03-04 07:11:18,573 INFO L138 Inliner]: procedures = 207, calls = 222, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1241 [2025-03-04 07:11:18,573 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 07:11:18,574 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 07:11:18,574 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 07:11:18,574 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 07:11:18,584 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:11:18" (1/1) ... [2025-03-04 07:11:18,584 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:11:18" (1/1) ... [2025-03-04 07:11:18,595 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:11:18" (1/1) ... [2025-03-04 07:11:18,636 INFO L175 MemorySlicer]: Split 206 memory accesses to 3 slices as follows [2, 170, 34]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 46 writes are split as follows [0, 42, 4]. [2025-03-04 07:11:18,636 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:11:18" (1/1) ... [2025-03-04 07:11:18,636 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:11:18" (1/1) ... [2025-03-04 07:11:18,668 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:11:18" (1/1) ... [2025-03-04 07:11:18,670 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:11:18" (1/1) ... [2025-03-04 07:11:18,673 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:11:18" (1/1) ... [2025-03-04 07:11:18,675 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:11:18" (1/1) ... [2025-03-04 07:11:18,691 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 07:11:18,691 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 07:11:18,691 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 07:11:18,691 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 07:11:18,692 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:11:18" (1/1) ... [2025-03-04 07:11:18,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 07:11:18,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:11:18,719 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 07:11:18,722 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 07:11:18,743 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-03-04 07:11:18,743 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-03-04 07:11:18,743 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-03-04 07:11:18,743 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-03-04 07:11:18,744 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-03-04 07:11:18,744 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-03-04 07:11:18,744 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 07:11:18,744 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-04 07:11:18,744 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-04 07:11:18,744 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-04 07:11:18,744 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 07:11:18,744 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 07:11:18,745 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 07:11:18,745 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 07:11:18,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 07:11:18,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 07:11:18,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 07:11:18,745 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 07:11:18,745 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 07:11:18,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-04 07:11:18,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-04 07:11:18,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-04 07:11:18,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 07:11:18,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 07:11:18,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 07:11:18,745 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 07:11:18,745 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 07:11:18,905 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 07:11:18,906 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 07:11:19,861 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L812: call ULTIMATE.dealloc(main_~#i~0#1.base, main_~#i~0#1.offset);havoc main_~#i~0#1.base, main_~#i~0#1.offset; [2025-03-04 07:11:19,933 INFO L? ?]: Removed 296 outVars from TransFormulas that were not future-live. [2025-03-04 07:11:19,934 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 07:11:19,977 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 07:11:19,980 INFO L336 CfgBuilder]: Removed 1 assume(true) statements. [2025-03-04 07:11:19,980 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 07:11:19 BoogieIcfgContainer [2025-03-04 07:11:19,980 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 07:11:19,982 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 07:11:19,982 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 07:11:19,985 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 07:11:19,986 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 07:11:18" (1/3) ... [2025-03-04 07:11:19,986 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@785d695a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 07:11:19, skipping insertion in model container [2025-03-04 07:11:19,987 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:11:18" (2/3) ... [2025-03-04 07:11:19,987 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@785d695a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 07:11:19, skipping insertion in model container [2025-03-04 07:11:19,987 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 07:11:19" (3/3) ... [2025-03-04 07:11:19,989 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_JEN_nondet_test2-1.i [2025-03-04 07:11:19,998 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 07:11:19,999 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_JEN_nondet_test2-1.i that has 4 procedures, 371 locations, 1 initial locations, 31 loop locations, and 2 error locations. [2025-03-04 07:11:20,033 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 07:11:20,040 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;@68406a56, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 07:11:20,040 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-04 07:11:20,044 INFO L276 IsEmpty]: Start isEmpty. Operand has 363 states, 356 states have (on average 1.6207865168539326) internal successors, (577), 358 states have internal predecessors, (577), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 07:11:20,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-04 07:11:20,047 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:11:20,047 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-04 07:11:20,047 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-04 07:11:20,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:11:20,051 INFO L85 PathProgramCache]: Analyzing trace with hash 20500437, now seen corresponding path program 1 times [2025-03-04 07:11:20,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:11:20,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629887086] [2025-03-04 07:11:20,056 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:11:20,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:11:20,111 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 07:11:20,124 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 07:11:20,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:11:20,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:11:20,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:11:20,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:11:20,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629887086] [2025-03-04 07:11:20,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629887086] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:11:20,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:11:20,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 07:11:20,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575154819] [2025-03-04 07:11:20,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:11:20,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 07:11:20,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:11:20,246 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 07:11:20,246 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 07:11:20,248 INFO L87 Difference]: Start difference. First operand has 363 states, 356 states have (on average 1.6207865168539326) internal successors, (577), 358 states have internal predecessors, (577), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:11:20,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:11:20,530 INFO L93 Difference]: Finished difference Result 524 states and 765 transitions. [2025-03-04 07:11:20,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 07:11:20,533 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 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) Word has length 4 [2025-03-04 07:11:20,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:11:20,542 INFO L225 Difference]: With dead ends: 524 [2025-03-04 07:11:20,542 INFO L226 Difference]: Without dead ends: 520 [2025-03-04 07:11:20,544 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 07:11:20,545 INFO L435 NwaCegarLoop]: 475 mSDtfsCounter, 237 mSDsluCounter, 934 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 1409 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:11:20,549 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 1409 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:11:20,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2025-03-04 07:11:20,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 517. [2025-03-04 07:11:20,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 517 states, 511 states have (on average 1.4696673189823874) internal successors, (751), 512 states have internal predecessors, (751), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 07:11:20,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 757 transitions. [2025-03-04 07:11:20,593 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 757 transitions. Word has length 4 [2025-03-04 07:11:20,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:11:20,593 INFO L471 AbstractCegarLoop]: Abstraction has 517 states and 757 transitions. [2025-03-04 07:11:20,594 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:11:20,594 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 757 transitions. [2025-03-04 07:11:20,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-04 07:11:20,596 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:11:20,596 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:11:20,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 07:11:20,597 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-04 07:11:20,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:11:20,597 INFO L85 PathProgramCache]: Analyzing trace with hash 1027857270, now seen corresponding path program 1 times [2025-03-04 07:11:20,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:11:20,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830621262] [2025-03-04 07:11:20,597 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:11:20,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:11:20,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-04 07:11:20,638 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-04 07:11:20,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:11:20,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:11:20,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:11:20,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:11:20,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830621262] [2025-03-04 07:11:20,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830621262] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:11:20,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:11:20,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 07:11:20,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393617807] [2025-03-04 07:11:20,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:11:20,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 07:11:20,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:11:20,849 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 07:11:20,849 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 07:11:20,850 INFO L87 Difference]: Start difference. First operand 517 states and 757 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:11:21,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:11:21,008 INFO L93 Difference]: Finished difference Result 523 states and 749 transitions. [2025-03-04 07:11:21,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 07:11:21,009 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 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) Word has length 65 [2025-03-04 07:11:21,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:11:21,011 INFO L225 Difference]: With dead ends: 523 [2025-03-04 07:11:21,011 INFO L226 Difference]: Without dead ends: 523 [2025-03-04 07:11:21,012 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:11:21,013 INFO L435 NwaCegarLoop]: 455 mSDtfsCounter, 105 mSDsluCounter, 826 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 1281 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:11:21,013 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 1281 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:11:21,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2025-03-04 07:11:21,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 517. [2025-03-04 07:11:21,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 517 states, 511 states have (on average 1.442270058708415) internal successors, (737), 512 states have internal predecessors, (737), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 07:11:21,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 743 transitions. [2025-03-04 07:11:21,040 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 743 transitions. Word has length 65 [2025-03-04 07:11:21,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:11:21,041 INFO L471 AbstractCegarLoop]: Abstraction has 517 states and 743 transitions. [2025-03-04 07:11:21,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:11:21,041 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 743 transitions. [2025-03-04 07:11:21,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-04 07:11:21,043 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:11:21,043 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:11:21,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 07:11:21,043 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-04 07:11:21,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:11:21,043 INFO L85 PathProgramCache]: Analyzing trace with hash 880109711, now seen corresponding path program 1 times [2025-03-04 07:11:21,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:11:21,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887360379] [2025-03-04 07:11:21,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:11:21,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:11:21,057 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-04 07:11:21,107 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-04 07:11:21,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:11:21,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:11:21,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:11:21,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:11:21,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887360379] [2025-03-04 07:11:21,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887360379] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:11:21,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:11:21,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 07:11:21,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521395065] [2025-03-04 07:11:21,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:11:21,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 07:11:21,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:11:21,540 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 07:11:21,540 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-04 07:11:21,540 INFO L87 Difference]: Start difference. First operand 517 states and 743 transitions. Second operand has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:11:21,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:11:21,768 INFO L93 Difference]: Finished difference Result 713 states and 1025 transitions. [2025-03-04 07:11:21,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 07:11:21,768 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 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) Word has length 65 [2025-03-04 07:11:21,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:11:21,771 INFO L225 Difference]: With dead ends: 713 [2025-03-04 07:11:21,771 INFO L226 Difference]: Without dead ends: 710 [2025-03-04 07:11:21,772 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-04 07:11:21,772 INFO L435 NwaCegarLoop]: 499 mSDtfsCounter, 500 mSDsluCounter, 1451 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 503 SdHoareTripleChecker+Valid, 1950 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:11:21,772 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [503 Valid, 1950 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:11:21,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 710 states. [2025-03-04 07:11:21,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 710 to 362. [2025-03-04 07:11:21,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 356 states have (on average 1.4382022471910112) internal successors, (512), 357 states have internal predecessors, (512), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 07:11:21,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 518 transitions. [2025-03-04 07:11:21,786 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 518 transitions. Word has length 65 [2025-03-04 07:11:21,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:11:21,787 INFO L471 AbstractCegarLoop]: Abstraction has 362 states and 518 transitions. [2025-03-04 07:11:21,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:11:21,787 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 518 transitions. [2025-03-04 07:11:21,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-03-04 07:11:21,789 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:11:21,789 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:11:21,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 07:11:21,789 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-04 07:11:21,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:11:21,791 INFO L85 PathProgramCache]: Analyzing trace with hash -980671067, now seen corresponding path program 1 times [2025-03-04 07:11:21,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:11:21,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102384205] [2025-03-04 07:11:21,791 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:11:21,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:11:21,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-04 07:11:21,857 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-04 07:11:21,858 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:11:21,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:11:22,012 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:11:22,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:11:22,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102384205] [2025-03-04 07:11:22,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102384205] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:11:22,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:11:22,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 07:11:22,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130970454] [2025-03-04 07:11:22,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:11:22,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 07:11:22,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:11:22,015 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 07:11:22,015 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 07:11:22,015 INFO L87 Difference]: Start difference. First operand 362 states and 518 transitions. Second operand has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:11:22,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:11:22,150 INFO L93 Difference]: Finished difference Result 365 states and 514 transitions. [2025-03-04 07:11:22,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 07:11:22,150 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 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) Word has length 84 [2025-03-04 07:11:22,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:11:22,152 INFO L225 Difference]: With dead ends: 365 [2025-03-04 07:11:22,152 INFO L226 Difference]: Without dead ends: 365 [2025-03-04 07:11:22,152 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:11:22,153 INFO L435 NwaCegarLoop]: 448 mSDtfsCounter, 105 mSDsluCounter, 812 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 1260 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:11:22,154 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 1260 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:11:22,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2025-03-04 07:11:22,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 362. [2025-03-04 07:11:22,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 356 states have (on average 1.4185393258426966) internal successors, (505), 357 states have internal predecessors, (505), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 07:11:22,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 511 transitions. [2025-03-04 07:11:22,166 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 511 transitions. Word has length 84 [2025-03-04 07:11:22,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:11:22,166 INFO L471 AbstractCegarLoop]: Abstraction has 362 states and 511 transitions. [2025-03-04 07:11:22,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:11:22,167 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 511 transitions. [2025-03-04 07:11:22,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-03-04 07:11:22,169 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:11:22,169 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:11:22,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 07:11:22,170 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-04 07:11:22,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:11:22,170 INFO L85 PathProgramCache]: Analyzing trace with hash 906242143, now seen corresponding path program 1 times [2025-03-04 07:11:22,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:11:22,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469917588] [2025-03-04 07:11:22,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:11:22,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:11:22,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-04 07:11:22,215 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-04 07:11:22,216 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:11:22,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:11:22,313 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:11:22,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:11:22,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469917588] [2025-03-04 07:11:22,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469917588] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:11:22,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:11:22,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 07:11:22,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19863492] [2025-03-04 07:11:22,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:11:22,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:11:22,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:11:22,314 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:11:22,314 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:11:22,314 INFO L87 Difference]: Start difference. First operand 362 states and 511 transitions. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:11:22,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:11:22,438 INFO L93 Difference]: Finished difference Result 628 states and 895 transitions. [2025-03-04 07:11:22,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:11:22,439 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 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) Word has length 84 [2025-03-04 07:11:22,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:11:22,441 INFO L225 Difference]: With dead ends: 628 [2025-03-04 07:11:22,443 INFO L226 Difference]: Without dead ends: 628 [2025-03-04 07:11:22,443 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:11:22,444 INFO L435 NwaCegarLoop]: 637 mSDtfsCounter, 331 mSDsluCounter, 453 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 331 SdHoareTripleChecker+Valid, 1090 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:11:22,447 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [331 Valid, 1090 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:11:22,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 628 states. [2025-03-04 07:11:22,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 628 to 622. [2025-03-04 07:11:22,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 622 states, 616 states have (on average 1.4366883116883118) internal successors, (885), 617 states have internal predecessors, (885), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 07:11:22,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 622 states to 622 states and 891 transitions. [2025-03-04 07:11:22,462 INFO L78 Accepts]: Start accepts. Automaton has 622 states and 891 transitions. Word has length 84 [2025-03-04 07:11:22,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:11:22,462 INFO L471 AbstractCegarLoop]: Abstraction has 622 states and 891 transitions. [2025-03-04 07:11:22,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:11:22,462 INFO L276 IsEmpty]: Start isEmpty. Operand 622 states and 891 transitions. [2025-03-04 07:11:22,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-04 07:11:22,464 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:11:22,464 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:11:22,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 07:11:22,464 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-04 07:11:22,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:11:22,465 INFO L85 PathProgramCache]: Analyzing trace with hash -1403427332, now seen corresponding path program 1 times [2025-03-04 07:11:22,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:11:22,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435123280] [2025-03-04 07:11:22,465 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:11:22,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:11:22,506 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-04 07:11:22,699 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-04 07:11:22,702 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:11:22,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:11:22,873 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:11:22,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:11:22,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435123280] [2025-03-04 07:11:22,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435123280] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:11:22,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [975399037] [2025-03-04 07:11:22,873 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:11:22,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:11:22,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:11:22,875 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:11:22,877 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 07:11:23,017 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-04 07:11:23,094 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-04 07:11:23,094 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:11:23,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:11:23,098 INFO L256 TraceCheckSpWp]: Trace formula consists of 579 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-04 07:11:23,106 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:11:23,125 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-03-04 07:11:23,148 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 16 treesize of output 17 [2025-03-04 07:11:23,850 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 07:11:23,851 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:11:23,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [975399037] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:11:23,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 07:11:23,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [4] total 13 [2025-03-04 07:11:23,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118292952] [2025-03-04 07:11:23,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:11:23,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 07:11:23,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:11:23,852 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 07:11:23,852 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2025-03-04 07:11:23,853 INFO L87 Difference]: Start difference. First operand 622 states and 891 transitions. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 07:11:25,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:11:25,493 INFO L93 Difference]: Finished difference Result 895 states and 1267 transitions. [2025-03-04 07:11:25,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 07:11:25,494 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 99 [2025-03-04 07:11:25,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:11:25,496 INFO L225 Difference]: With dead ends: 895 [2025-03-04 07:11:25,497 INFO L226 Difference]: Without dead ends: 895 [2025-03-04 07:11:25,497 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=99, Invalid=321, Unknown=0, NotChecked=0, Total=420 [2025-03-04 07:11:25,497 INFO L435 NwaCegarLoop]: 495 mSDtfsCounter, 763 mSDsluCounter, 2284 mSDsCounter, 0 mSdLazyCounter, 1153 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 765 SdHoareTripleChecker+Valid, 2779 SdHoareTripleChecker+Invalid, 1158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-04 07:11:25,497 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [765 Valid, 2779 Invalid, 1158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1153 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-04 07:11:25,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 895 states. [2025-03-04 07:11:25,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 895 to 647. [2025-03-04 07:11:25,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 647 states, 641 states have (on average 1.4274570982839314) internal successors, (915), 642 states have internal predecessors, (915), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 07:11:25,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 647 states and 921 transitions. [2025-03-04 07:11:25,509 INFO L78 Accepts]: Start accepts. Automaton has 647 states and 921 transitions. Word has length 99 [2025-03-04 07:11:25,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:11:25,509 INFO L471 AbstractCegarLoop]: Abstraction has 647 states and 921 transitions. [2025-03-04 07:11:25,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 07:11:25,510 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 921 transitions. [2025-03-04 07:11:25,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-04 07:11:25,510 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:11:25,510 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:11:25,522 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 07:11:25,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-04 07:11:25,713 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-04 07:11:25,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:11:25,713 INFO L85 PathProgramCache]: Analyzing trace with hash -2007076447, now seen corresponding path program 1 times [2025-03-04 07:11:25,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:11:25,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280685770] [2025-03-04 07:11:25,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:11:25,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:11:25,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-04 07:11:25,833 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-04 07:11:25,833 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:11:25,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:11:25,957 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:11:25,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:11:25,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280685770] [2025-03-04 07:11:25,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280685770] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:11:25,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [10653884] [2025-03-04 07:11:25,958 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:11:25,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:11:25,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:11:25,960 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:11:25,961 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 07:11:26,117 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-04 07:11:26,189 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-04 07:11:26,189 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:11:26,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:11:26,191 INFO L256 TraceCheckSpWp]: Trace formula consists of 580 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 07:11:26,194 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:11:26,342 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-03-04 07:11:26,363 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 07:11:26,363 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:11:26,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [10653884] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:11:26,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 07:11:26,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4] total 7 [2025-03-04 07:11:26,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171713224] [2025-03-04 07:11:26,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:11:26,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 07:11:26,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:11:26,364 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 07:11:26,364 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-04 07:11:26,365 INFO L87 Difference]: Start difference. First operand 647 states and 921 transitions. Second operand has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 07:11:26,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:11:26,511 INFO L93 Difference]: Finished difference Result 810 states and 1153 transitions. [2025-03-04 07:11:26,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 07:11:26,512 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 100 [2025-03-04 07:11:26,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:11:26,514 INFO L225 Difference]: With dead ends: 810 [2025-03-04 07:11:26,514 INFO L226 Difference]: Without dead ends: 810 [2025-03-04 07:11:26,515 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-04 07:11:26,515 INFO L435 NwaCegarLoop]: 458 mSDtfsCounter, 859 mSDsluCounter, 900 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 860 SdHoareTripleChecker+Valid, 1358 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:11:26,515 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [860 Valid, 1358 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:11:26,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 810 states. [2025-03-04 07:11:26,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 810 to 649. [2025-03-04 07:11:26,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 649 states, 643 states have (on average 1.4261275272161742) internal successors, (917), 644 states have internal predecessors, (917), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 07:11:26,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 649 states to 649 states and 923 transitions. [2025-03-04 07:11:26,525 INFO L78 Accepts]: Start accepts. Automaton has 649 states and 923 transitions. Word has length 100 [2025-03-04 07:11:26,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:11:26,525 INFO L471 AbstractCegarLoop]: Abstraction has 649 states and 923 transitions. [2025-03-04 07:11:26,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 07:11:26,526 INFO L276 IsEmpty]: Start isEmpty. Operand 649 states and 923 transitions. [2025-03-04 07:11:26,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-03-04 07:11:26,527 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:11:26,527 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:11:26,534 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 07:11:26,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2025-03-04 07:11:26,727 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-04 07:11:26,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:11:26,728 INFO L85 PathProgramCache]: Analyzing trace with hash 1797042616, now seen corresponding path program 1 times [2025-03-04 07:11:26,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:11:26,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290373906] [2025-03-04 07:11:26,728 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:11:26,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:11:26,759 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-04 07:11:26,778 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-04 07:11:26,778 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:11:26,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:11:26,897 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 07:11:26,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:11:26,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290373906] [2025-03-04 07:11:26,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290373906] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:11:26,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:11:26,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 07:11:26,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725133028] [2025-03-04 07:11:26,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:11:26,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 07:11:26,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:11:26,900 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 07:11:26,900 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:11:26,900 INFO L87 Difference]: Start difference. First operand 649 states and 923 transitions. Second operand has 5 states, 5 states have (on average 29.6) internal successors, (148), 5 states have internal predecessors, (148), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 07:11:27,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:11:27,260 INFO L93 Difference]: Finished difference Result 733 states and 1030 transitions. [2025-03-04 07:11:27,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 07:11:27,261 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.6) internal successors, (148), 5 states have internal predecessors, (148), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 155 [2025-03-04 07:11:27,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:11:27,264 INFO L225 Difference]: With dead ends: 733 [2025-03-04 07:11:27,264 INFO L226 Difference]: Without dead ends: 733 [2025-03-04 07:11:27,264 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:11:27,265 INFO L435 NwaCegarLoop]: 595 mSDtfsCounter, 1149 mSDsluCounter, 777 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1150 SdHoareTripleChecker+Valid, 1372 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 07:11:27,265 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1150 Valid, 1372 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 07:11:27,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 733 states. [2025-03-04 07:11:27,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 733 to 516. [2025-03-04 07:11:27,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 516 states, 510 states have (on average 1.4137254901960785) internal successors, (721), 511 states have internal predecessors, (721), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 07:11:27,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 727 transitions. [2025-03-04 07:11:27,274 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 727 transitions. Word has length 155 [2025-03-04 07:11:27,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:11:27,275 INFO L471 AbstractCegarLoop]: Abstraction has 516 states and 727 transitions. [2025-03-04 07:11:27,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.6) internal successors, (148), 5 states have internal predecessors, (148), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 07:11:27,275 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 727 transitions. [2025-03-04 07:11:27,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-04 07:11:27,279 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:11:27,279 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:11:27,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 07:11:27,280 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-04 07:11:27,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:11:27,280 INFO L85 PathProgramCache]: Analyzing trace with hash -1419585878, now seen corresponding path program 1 times [2025-03-04 07:11:27,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:11:27,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545182259] [2025-03-04 07:11:27,280 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:11:27,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:11:27,318 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-04 07:11:27,424 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-04 07:11:27,424 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:11:27,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:11:27,621 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:11:27,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:11:27,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545182259] [2025-03-04 07:11:27,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545182259] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:11:27,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1995257127] [2025-03-04 07:11:27,622 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:11:27,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:11:27,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:11:27,624 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:11:27,625 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 07:11:27,790 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-04 07:11:27,882 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-04 07:11:27,882 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:11:27,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:11:27,886 INFO L256 TraceCheckSpWp]: Trace formula consists of 760 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-04 07:11:27,889 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:11:27,924 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 07:11:27,924 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:11:27,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1995257127] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:11:27,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 07:11:27,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-03-04 07:11:27,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644293652] [2025-03-04 07:11:27,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:11:27,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 07:11:27,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:11:27,925 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 07:11:27,926 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:11:27,926 INFO L87 Difference]: Start difference. First operand 516 states and 727 transitions. Second operand has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 07:11:28,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:11:28,128 INFO L93 Difference]: Finished difference Result 559 states and 784 transitions. [2025-03-04 07:11:28,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 07:11:28,128 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 165 [2025-03-04 07:11:28,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:11:28,130 INFO L225 Difference]: With dead ends: 559 [2025-03-04 07:11:28,130 INFO L226 Difference]: Without dead ends: 559 [2025-03-04 07:11:28,130 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:11:28,131 INFO L435 NwaCegarLoop]: 459 mSDtfsCounter, 17 mSDsluCounter, 752 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 1211 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:11:28,131 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 1211 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 314 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:11:28,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2025-03-04 07:11:28,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 543. [2025-03-04 07:11:28,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 543 states, 537 states have (on average 1.404096834264432) internal successors, (754), 538 states have internal predecessors, (754), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 07:11:28,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 760 transitions. [2025-03-04 07:11:28,140 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 760 transitions. Word has length 165 [2025-03-04 07:11:28,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:11:28,140 INFO L471 AbstractCegarLoop]: Abstraction has 543 states and 760 transitions. [2025-03-04 07:11:28,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 07:11:28,140 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 760 transitions. [2025-03-04 07:11:28,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-03-04 07:11:28,143 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:11:28,144 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:11:28,152 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 07:11:28,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:11:28,345 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-04 07:11:28,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:11:28,345 INFO L85 PathProgramCache]: Analyzing trace with hash -994455534, now seen corresponding path program 1 times [2025-03-04 07:11:28,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:11:28,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621124597] [2025-03-04 07:11:28,346 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:11:28,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:11:28,379 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-04 07:11:28,407 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-04 07:11:28,407 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:11:28,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:11:28,692 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 07:11:28,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:11:28,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621124597] [2025-03-04 07:11:28,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621124597] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:11:28,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:11:28,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 07:11:28,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939603444] [2025-03-04 07:11:28,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:11:28,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 07:11:28,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:11:28,694 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 07:11:28,694 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:11:28,694 INFO L87 Difference]: Start difference. First operand 543 states and 760 transitions. Second operand has 6 states, 6 states have (on average 26.5) internal successors, (159), 6 states have internal predecessors, (159), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 07:11:29,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:11:29,120 INFO L93 Difference]: Finished difference Result 555 states and 774 transitions. [2025-03-04 07:11:29,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 07:11:29,120 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.5) internal successors, (159), 6 states have internal predecessors, (159), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 166 [2025-03-04 07:11:29,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:11:29,122 INFO L225 Difference]: With dead ends: 555 [2025-03-04 07:11:29,122 INFO L226 Difference]: Without dead ends: 555 [2025-03-04 07:11:29,122 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:11:29,122 INFO L435 NwaCegarLoop]: 458 mSDtfsCounter, 8 mSDsluCounter, 1360 mSDsCounter, 0 mSdLazyCounter, 725 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 1818 SdHoareTripleChecker+Invalid, 726 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 725 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 07:11:29,123 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 1818 Invalid, 726 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 725 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 07:11:29,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2025-03-04 07:11:29,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 551. [2025-03-04 07:11:29,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 551 states, 545 states have (on average 1.4018348623853212) internal successors, (764), 546 states have internal predecessors, (764), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 07:11:29,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 770 transitions. [2025-03-04 07:11:29,133 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 770 transitions. Word has length 166 [2025-03-04 07:11:29,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:11:29,134 INFO L471 AbstractCegarLoop]: Abstraction has 551 states and 770 transitions. [2025-03-04 07:11:29,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.5) internal successors, (159), 6 states have internal predecessors, (159), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 07:11:29,134 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 770 transitions. [2025-03-04 07:11:29,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-03-04 07:11:29,135 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:11:29,135 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:11:29,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 07:11:29,135 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-04 07:11:29,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:11:29,136 INFO L85 PathProgramCache]: Analyzing trace with hash 730821230, now seen corresponding path program 1 times [2025-03-04 07:11:29,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:11:29,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088194163] [2025-03-04 07:11:29,136 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:11:29,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:11:29,168 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-04 07:11:29,195 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-04 07:11:29,195 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:11:29,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:11:29,430 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 07:11:29,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:11:29,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088194163] [2025-03-04 07:11:29,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088194163] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:11:29,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:11:29,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 07:11:29,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563360656] [2025-03-04 07:11:29,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:11:29,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 07:11:29,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:11:29,432 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 07:11:29,432 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 07:11:29,432 INFO L87 Difference]: Start difference. First operand 551 states and 770 transitions. Second operand has 7 states, 7 states have (on average 22.857142857142858) internal successors, (160), 7 states have internal predecessors, (160), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 07:11:29,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:11:29,924 INFO L93 Difference]: Finished difference Result 573 states and 800 transitions. [2025-03-04 07:11:29,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 07:11:29,925 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 22.857142857142858) internal successors, (160), 7 states have internal predecessors, (160), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 167 [2025-03-04 07:11:29,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:11:29,926 INFO L225 Difference]: With dead ends: 573 [2025-03-04 07:11:29,927 INFO L226 Difference]: Without dead ends: 573 [2025-03-04 07:11:29,927 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 07:11:29,927 INFO L435 NwaCegarLoop]: 450 mSDtfsCounter, 12 mSDsluCounter, 1703 mSDsCounter, 0 mSdLazyCounter, 899 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 2153 SdHoareTripleChecker+Invalid, 900 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 899 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 07:11:29,928 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 2153 Invalid, 900 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 899 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 07:11:29,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2025-03-04 07:11:29,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 567. [2025-03-04 07:11:29,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 567 states, 561 states have (on average 1.4010695187165776) internal successors, (786), 562 states have internal predecessors, (786), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 07:11:29,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 792 transitions. [2025-03-04 07:11:29,938 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 792 transitions. Word has length 167 [2025-03-04 07:11:29,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:11:29,938 INFO L471 AbstractCegarLoop]: Abstraction has 567 states and 792 transitions. [2025-03-04 07:11:29,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.857142857142858) internal successors, (160), 7 states have internal predecessors, (160), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 07:11:29,938 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 792 transitions. [2025-03-04 07:11:29,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-03-04 07:11:29,940 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:11:29,941 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:11:29,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 07:11:29,941 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-04 07:11:29,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:11:29,941 INFO L85 PathProgramCache]: Analyzing trace with hash -2029731987, now seen corresponding path program 1 times [2025-03-04 07:11:29,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:11:29,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350950845] [2025-03-04 07:11:29,941 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:11:29,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:11:29,975 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-04 07:11:30,056 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-04 07:11:30,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:11:30,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:11:30,225 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:11:30,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:11:30,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350950845] [2025-03-04 07:11:30,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350950845] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:11:30,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1177826919] [2025-03-04 07:11:30,226 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:11:30,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:11:30,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:11:30,232 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:11:30,233 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 07:11:30,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-04 07:11:30,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-04 07:11:30,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:11:30,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:11:30,519 INFO L256 TraceCheckSpWp]: Trace formula consists of 759 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-04 07:11:30,523 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:11:30,534 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-03-04 07:11:30,976 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 07:11:30,976 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:11:30,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1177826919] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:11:30,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 07:11:30,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [4] total 12 [2025-03-04 07:11:30,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194050318] [2025-03-04 07:11:30,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:11:30,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 07:11:30,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:11:30,978 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 07:11:30,978 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2025-03-04 07:11:30,979 INFO L87 Difference]: Start difference. First operand 567 states and 792 transitions. Second operand has 10 states, 10 states have (on average 15.9) internal successors, (159), 10 states have internal predecessors, (159), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 07:11:31,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:11:31,991 INFO L93 Difference]: Finished difference Result 822 states and 1145 transitions. [2025-03-04 07:11:31,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 07:11:31,991 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 15.9) internal successors, (159), 10 states have internal predecessors, (159), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 167 [2025-03-04 07:11:31,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:11:31,993 INFO L225 Difference]: With dead ends: 822 [2025-03-04 07:11:31,994 INFO L226 Difference]: Without dead ends: 822 [2025-03-04 07:11:31,994 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2025-03-04 07:11:31,995 INFO L435 NwaCegarLoop]: 466 mSDtfsCounter, 544 mSDsluCounter, 1804 mSDsCounter, 0 mSdLazyCounter, 892 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 547 SdHoareTripleChecker+Valid, 2270 SdHoareTripleChecker+Invalid, 893 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 892 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-04 07:11:31,995 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [547 Valid, 2270 Invalid, 893 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 892 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-04 07:11:31,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 822 states. [2025-03-04 07:11:32,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 822 to 594. [2025-03-04 07:11:32,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 594 states, 588 states have (on average 1.3911564625850341) internal successors, (818), 589 states have internal predecessors, (818), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 07:11:32,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 824 transitions. [2025-03-04 07:11:32,006 INFO L78 Accepts]: Start accepts. Automaton has 594 states and 824 transitions. Word has length 167 [2025-03-04 07:11:32,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:11:32,007 INFO L471 AbstractCegarLoop]: Abstraction has 594 states and 824 transitions. [2025-03-04 07:11:32,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 15.9) internal successors, (159), 10 states have internal predecessors, (159), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 07:11:32,007 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 824 transitions. [2025-03-04 07:11:32,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-03-04 07:11:32,008 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:11:32,008 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:11:32,017 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-04 07:11:32,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:11:32,209 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-04 07:11:32,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:11:32,209 INFO L85 PathProgramCache]: Analyzing trace with hash 222825797, now seen corresponding path program 1 times [2025-03-04 07:11:32,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:11:32,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526350258] [2025-03-04 07:11:32,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:11:32,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:11:32,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-04 07:11:32,333 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-04 07:11:32,334 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:11:32,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:11:32,545 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:11:32,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:11:32,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526350258] [2025-03-04 07:11:32,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526350258] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:11:32,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1027092470] [2025-03-04 07:11:32,546 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:11:32,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:11:32,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:11:32,548 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:11:32,550 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 07:11:32,757 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-04 07:11:32,831 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-04 07:11:32,831 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:11:32,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:11:32,835 INFO L256 TraceCheckSpWp]: Trace formula consists of 760 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 07:11:32,838 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:11:32,909 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 07:11:32,909 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:11:32,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1027092470] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:11:32,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 07:11:32,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [4] total 8 [2025-03-04 07:11:32,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716026463] [2025-03-04 07:11:32,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:11:32,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 07:11:32,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:11:32,911 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 07:11:32,911 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-04 07:11:32,912 INFO L87 Difference]: Start difference. First operand 594 states and 824 transitions. Second operand has 6 states, 6 states have (on average 26.666666666666668) internal successors, (160), 6 states have internal predecessors, (160), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 07:11:33,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:11:33,262 INFO L93 Difference]: Finished difference Result 634 states and 876 transitions. [2025-03-04 07:11:33,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 07:11:33,263 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.666666666666668) internal successors, (160), 6 states have internal predecessors, (160), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 168 [2025-03-04 07:11:33,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:11:33,265 INFO L225 Difference]: With dead ends: 634 [2025-03-04 07:11:33,266 INFO L226 Difference]: Without dead ends: 634 [2025-03-04 07:11:33,266 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-04 07:11:33,267 INFO L435 NwaCegarLoop]: 451 mSDtfsCounter, 34 mSDsluCounter, 1472 mSDsCounter, 0 mSdLazyCounter, 623 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 1923 SdHoareTripleChecker+Invalid, 623 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 07:11:33,267 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 1923 Invalid, 623 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 623 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 07:11:33,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2025-03-04 07:11:33,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 620. [2025-03-04 07:11:33,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 620 states, 614 states have (on average 1.3843648208469055) internal successors, (850), 615 states have internal predecessors, (850), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 07:11:33,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 856 transitions. [2025-03-04 07:11:33,276 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 856 transitions. Word has length 168 [2025-03-04 07:11:33,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:11:33,276 INFO L471 AbstractCegarLoop]: Abstraction has 620 states and 856 transitions. [2025-03-04 07:11:33,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.666666666666668) internal successors, (160), 6 states have internal predecessors, (160), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 07:11:33,276 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 856 transitions. [2025-03-04 07:11:33,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-03-04 07:11:33,277 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:11:33,278 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:11:33,286 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-04 07:11:33,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-04 07:11:33,482 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-04 07:11:33,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:11:33,483 INFO L85 PathProgramCache]: Analyzing trace with hash -851166416, now seen corresponding path program 1 times [2025-03-04 07:11:33,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:11:33,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915597587] [2025-03-04 07:11:33,483 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:11:33,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:11:33,513 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-03-04 07:11:33,531 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-03-04 07:11:33,531 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:11:33,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:11:33,769 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 07:11:33,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:11:33,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915597587] [2025-03-04 07:11:33,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915597587] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:11:33,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:11:33,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 07:11:33,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646322221] [2025-03-04 07:11:33,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:11:33,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 07:11:33,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:11:33,771 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 07:11:33,771 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:11:33,771 INFO L87 Difference]: Start difference. First operand 620 states and 856 transitions. Second operand has 6 states, 6 states have (on average 26.833333333333332) internal successors, (161), 6 states have internal predecessors, (161), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 07:11:34,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:11:34,161 INFO L93 Difference]: Finished difference Result 626 states and 863 transitions. [2025-03-04 07:11:34,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 07:11:34,161 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.833333333333332) internal successors, (161), 6 states have internal predecessors, (161), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 169 [2025-03-04 07:11:34,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:11:34,164 INFO L225 Difference]: With dead ends: 626 [2025-03-04 07:11:34,164 INFO L226 Difference]: Without dead ends: 626 [2025-03-04 07:11:34,164 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:11:34,164 INFO L435 NwaCegarLoop]: 458 mSDtfsCounter, 8 mSDsluCounter, 1360 mSDsCounter, 0 mSdLazyCounter, 725 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 1818 SdHoareTripleChecker+Invalid, 726 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 725 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 07:11:34,164 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 1818 Invalid, 726 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 725 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 07:11:34,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2025-03-04 07:11:34,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 624. [2025-03-04 07:11:34,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 624 states, 618 states have (on average 1.383495145631068) internal successors, (855), 619 states have internal predecessors, (855), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 07:11:34,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 624 states to 624 states and 861 transitions. [2025-03-04 07:11:34,173 INFO L78 Accepts]: Start accepts. Automaton has 624 states and 861 transitions. Word has length 169 [2025-03-04 07:11:34,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:11:34,173 INFO L471 AbstractCegarLoop]: Abstraction has 624 states and 861 transitions. [2025-03-04 07:11:34,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.833333333333332) internal successors, (161), 6 states have internal predecessors, (161), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 07:11:34,173 INFO L276 IsEmpty]: Start isEmpty. Operand 624 states and 861 transitions. [2025-03-04 07:11:34,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-03-04 07:11:34,175 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:11:34,175 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:11:34,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 07:11:34,175 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-04 07:11:34,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:11:34,175 INFO L85 PathProgramCache]: Analyzing trace with hash -1277802903, now seen corresponding path program 1 times [2025-03-04 07:11:34,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:11:34,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883093595] [2025-03-04 07:11:34,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:11:34,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:11:34,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-04 07:11:34,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-04 07:11:34,224 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:11:34,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:11:34,454 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 07:11:34,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:11:34,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883093595] [2025-03-04 07:11:34,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883093595] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:11:34,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:11:34,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 07:11:34,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685352209] [2025-03-04 07:11:34,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:11:34,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 07:11:34,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:11:34,455 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 07:11:34,455 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 07:11:34,455 INFO L87 Difference]: Start difference. First operand 624 states and 861 transitions. Second operand has 7 states, 7 states have (on average 23.142857142857142) internal successors, (162), 7 states have internal predecessors, (162), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 07:11:34,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:11:34,923 INFO L93 Difference]: Finished difference Result 635 states and 876 transitions. [2025-03-04 07:11:34,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 07:11:34,923 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.142857142857142) internal successors, (162), 7 states have internal predecessors, (162), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 170 [2025-03-04 07:11:34,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:11:34,925 INFO L225 Difference]: With dead ends: 635 [2025-03-04 07:11:34,926 INFO L226 Difference]: Without dead ends: 635 [2025-03-04 07:11:34,927 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 07:11:34,927 INFO L435 NwaCegarLoop]: 450 mSDtfsCounter, 12 mSDsluCounter, 1703 mSDsCounter, 0 mSdLazyCounter, 899 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 2153 SdHoareTripleChecker+Invalid, 900 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 899 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 07:11:34,927 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 2153 Invalid, 900 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 899 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 07:11:34,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2025-03-04 07:11:34,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 632. [2025-03-04 07:11:34,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 632 states, 626 states have (on average 1.3833865814696487) internal successors, (866), 627 states have internal predecessors, (866), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 07:11:34,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 632 states and 872 transitions. [2025-03-04 07:11:34,937 INFO L78 Accepts]: Start accepts. Automaton has 632 states and 872 transitions. Word has length 170 [2025-03-04 07:11:34,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:11:34,938 INFO L471 AbstractCegarLoop]: Abstraction has 632 states and 872 transitions. [2025-03-04 07:11:34,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.142857142857142) internal successors, (162), 7 states have internal predecessors, (162), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 07:11:34,938 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 872 transitions. [2025-03-04 07:11:34,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-03-04 07:11:34,939 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:11:34,939 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:11:34,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 07:11:34,940 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-04 07:11:34,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:11:34,940 INFO L85 PathProgramCache]: Analyzing trace with hash 1951838807, now seen corresponding path program 1 times [2025-03-04 07:11:34,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:11:34,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369344536] [2025-03-04 07:11:34,940 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:11:34,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:11:34,970 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-04 07:11:35,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-04 07:11:35,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:11:35,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:11:35,159 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:11:35,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:11:35,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369344536] [2025-03-04 07:11:35,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369344536] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:11:35,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2005199308] [2025-03-04 07:11:35,159 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:11:35,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:11:35,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:11:35,161 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:11:35,163 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 07:11:35,380 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-04 07:11:35,501 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-04 07:11:35,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:11:35,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:11:35,505 INFO L256 TraceCheckSpWp]: Trace formula consists of 759 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 07:11:35,507 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:11:35,521 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:11:35,521 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:11:35,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2005199308] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:11:35,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 07:11:35,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2025-03-04 07:11:35,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941806994] [2025-03-04 07:11:35,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:11:35,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 07:11:35,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:11:35,522 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 07:11:35,522 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:11:35,522 INFO L87 Difference]: Start difference. First operand 632 states and 872 transitions. Second operand has 4 states, 4 states have (on average 41.5) internal successors, (166), 4 states have internal predecessors, (166), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 07:11:35,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:11:35,600 INFO L93 Difference]: Finished difference Result 635 states and 876 transitions. [2025-03-04 07:11:35,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 07:11:35,601 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 41.5) internal successors, (166), 4 states have internal predecessors, (166), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 170 [2025-03-04 07:11:35,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:11:35,604 INFO L225 Difference]: With dead ends: 635 [2025-03-04 07:11:35,604 INFO L226 Difference]: Without dead ends: 635 [2025-03-04 07:11:35,604 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:11:35,604 INFO L435 NwaCegarLoop]: 464 mSDtfsCounter, 0 mSDsluCounter, 924 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1388 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:11:35,604 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1388 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:11:35,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2025-03-04 07:11:35,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 635. [2025-03-04 07:11:35,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 635 states, 628 states have (on average 1.3837579617834395) internal successors, (869), 630 states have internal predecessors, (869), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-04 07:11:35,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 876 transitions. [2025-03-04 07:11:35,616 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 876 transitions. Word has length 170 [2025-03-04 07:11:35,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:11:35,616 INFO L471 AbstractCegarLoop]: Abstraction has 635 states and 876 transitions. [2025-03-04 07:11:35,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 41.5) internal successors, (166), 4 states have internal predecessors, (166), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 07:11:35,617 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 876 transitions. [2025-03-04 07:11:35,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2025-03-04 07:11:35,618 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:11:35,618 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:11:35,627 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-04 07:11:35,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-04 07:11:35,819 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-04 07:11:35,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:11:35,819 INFO L85 PathProgramCache]: Analyzing trace with hash -1840142821, now seen corresponding path program 1 times [2025-03-04 07:11:35,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:11:35,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960885188] [2025-03-04 07:11:35,819 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:11:35,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:11:35,850 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-03-04 07:11:35,904 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-03-04 07:11:35,904 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:11:35,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:11:36,092 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 07:11:36,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:11:36,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960885188] [2025-03-04 07:11:36,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960885188] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:11:36,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1409656337] [2025-03-04 07:11:36,093 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:11:36,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:11:36,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:11:36,095 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:11:36,096 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 07:11:36,336 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-03-04 07:11:36,472 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-03-04 07:11:36,472 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:11:36,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:11:36,477 INFO L256 TraceCheckSpWp]: Trace formula consists of 789 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-04 07:11:36,480 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:11:41,421 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-04 07:11:41,421 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:11:41,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1409656337] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:11:41,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 07:11:41,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [5] total 10 [2025-03-04 07:11:41,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077748559] [2025-03-04 07:11:41,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:11:41,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 07:11:41,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:11:41,423 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 07:11:41,423 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-04 07:11:41,423 INFO L87 Difference]: Start difference. First operand 635 states and 876 transitions. Second operand has 7 states, 7 states have (on average 23.285714285714285) internal successors, (163), 7 states have internal predecessors, (163), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 07:11:45,936 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-04 07:11:49,811 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.15s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-04 07:11:52,580 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.77s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-04 07:11:56,851 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-04 07:11:57,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:11:57,051 INFO L93 Difference]: Finished difference Result 642 states and 885 transitions. [2025-03-04 07:11:57,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 07:11:57,052 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.285714285714285) internal successors, (163), 7 states have internal predecessors, (163), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 172 [2025-03-04 07:11:57,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:11:57,054 INFO L225 Difference]: With dead ends: 642 [2025-03-04 07:11:57,054 INFO L226 Difference]: Without dead ends: 642 [2025-03-04 07:11:57,054 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-04 07:11:57,054 INFO L435 NwaCegarLoop]: 455 mSDtfsCounter, 12 mSDsluCounter, 1704 mSDsCounter, 0 mSdLazyCounter, 923 mSolverCounterSat, 1 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 2159 SdHoareTripleChecker+Invalid, 926 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 923 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.6s IncrementalHoareTripleChecker+Time [2025-03-04 07:11:57,055 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 2159 Invalid, 926 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 923 Invalid, 2 Unknown, 0 Unchecked, 15.6s Time] [2025-03-04 07:11:57,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2025-03-04 07:11:57,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 635. [2025-03-04 07:11:57,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 635 states, 628 states have (on average 1.3837579617834395) internal successors, (869), 630 states have internal predecessors, (869), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-04 07:11:57,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 876 transitions. [2025-03-04 07:11:57,064 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 876 transitions. Word has length 172 [2025-03-04 07:11:57,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:11:57,064 INFO L471 AbstractCegarLoop]: Abstraction has 635 states and 876 transitions. [2025-03-04 07:11:57,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.285714285714285) internal successors, (163), 7 states have internal predecessors, (163), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 07:11:57,065 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 876 transitions. [2025-03-04 07:11:57,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-03-04 07:11:57,066 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:11:57,066 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:11:57,078 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-04 07:11:57,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:11:57,268 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-04 07:11:57,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:11:57,269 INFO L85 PathProgramCache]: Analyzing trace with hash -9774765, now seen corresponding path program 1 times [2025-03-04 07:11:57,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:11:57,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179922829] [2025-03-04 07:11:57,270 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:11:57,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:11:57,300 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-03-04 07:11:57,323 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-03-04 07:11:57,323 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:11:57,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:11:57,576 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-04 07:11:57,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:11:57,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179922829] [2025-03-04 07:11:57,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179922829] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:11:57,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:11:57,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 07:11:57,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646731429] [2025-03-04 07:11:57,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:11:57,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 07:11:57,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:11:57,578 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 07:11:57,578 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-04 07:11:57,578 INFO L87 Difference]: Start difference. First operand 635 states and 876 transitions. Second operand has 9 states, 9 states have (on average 18.22222222222222) internal successors, (164), 9 states have internal predecessors, (164), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 07:11:58,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:11:58,165 INFO L93 Difference]: Finished difference Result 648 states and 892 transitions. [2025-03-04 07:11:58,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 07:11:58,165 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 18.22222222222222) internal successors, (164), 9 states have internal predecessors, (164), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 173 [2025-03-04 07:11:58,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:11:58,167 INFO L225 Difference]: With dead ends: 648 [2025-03-04 07:11:58,167 INFO L226 Difference]: Without dead ends: 648 [2025-03-04 07:11:58,167 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-04 07:11:58,168 INFO L435 NwaCegarLoop]: 450 mSDtfsCounter, 20 mSDsluCounter, 2494 mSDsCounter, 0 mSdLazyCounter, 1126 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 2944 SdHoareTripleChecker+Invalid, 1127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 07:11:58,168 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 2944 Invalid, 1127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1126 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 07:11:58,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648 states. [2025-03-04 07:11:58,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648 to 642. [2025-03-04 07:11:58,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 642 states, 635 states have (on average 1.3826771653543306) internal successors, (878), 637 states have internal predecessors, (878), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-04 07:11:58,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 885 transitions. [2025-03-04 07:11:58,176 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 885 transitions. Word has length 173 [2025-03-04 07:11:58,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:11:58,176 INFO L471 AbstractCegarLoop]: Abstraction has 642 states and 885 transitions. [2025-03-04 07:11:58,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 18.22222222222222) internal successors, (164), 9 states have internal predecessors, (164), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 07:11:58,176 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 885 transitions. [2025-03-04 07:11:58,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-03-04 07:11:58,178 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:11:58,178 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:11:58,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-04 07:11:58,178 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-04 07:11:58,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:11:58,179 INFO L85 PathProgramCache]: Analyzing trace with hash 1324870437, now seen corresponding path program 1 times [2025-03-04 07:11:58,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:11:58,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330576785] [2025-03-04 07:11:58,179 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:11:58,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:11:58,208 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-03-04 07:11:58,280 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-03-04 07:11:58,280 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:11:58,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:11:58,435 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 07:11:58,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:11:58,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330576785] [2025-03-04 07:11:58,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330576785] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:11:58,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [186854535] [2025-03-04 07:11:58,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:11:58,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:11:58,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:11:58,437 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:11:58,439 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 07:11:58,682 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-03-04 07:11:58,785 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-03-04 07:11:58,785 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:11:58,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:11:58,788 INFO L256 TraceCheckSpWp]: Trace formula consists of 790 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-04 07:11:58,790 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:11:58,896 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-04 07:11:58,896 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:11:58,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [186854535] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:11:58,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 07:11:58,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [5] total 11 [2025-03-04 07:11:58,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277534241] [2025-03-04 07:11:58,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:11:58,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 07:11:58,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:11:58,897 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 07:11:58,897 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-03-04 07:11:58,897 INFO L87 Difference]: Start difference. First operand 642 states and 885 transitions. Second operand has 8 states, 8 states have (on average 20.5) internal successors, (164), 8 states have internal predecessors, (164), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 07:11:59,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:11:59,415 INFO L93 Difference]: Finished difference Result 659 states and 906 transitions. [2025-03-04 07:11:59,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 07:11:59,416 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 20.5) internal successors, (164), 8 states have internal predecessors, (164), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 173 [2025-03-04 07:11:59,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:11:59,418 INFO L225 Difference]: With dead ends: 659 [2025-03-04 07:11:59,418 INFO L226 Difference]: Without dead ends: 659 [2025-03-04 07:11:59,418 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2025-03-04 07:11:59,418 INFO L435 NwaCegarLoop]: 456 mSDtfsCounter, 40 mSDsluCounter, 1822 mSDsCounter, 0 mSdLazyCounter, 888 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 2278 SdHoareTripleChecker+Invalid, 892 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 888 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 07:11:59,418 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 2278 Invalid, 892 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 888 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 07:11:59,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2025-03-04 07:11:59,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 647. [2025-03-04 07:11:59,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 647 states, 640 states have (on average 1.38125) internal successors, (884), 642 states have internal predecessors, (884), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-04 07:11:59,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 647 states and 891 transitions. [2025-03-04 07:11:59,425 INFO L78 Accepts]: Start accepts. Automaton has 647 states and 891 transitions. Word has length 173 [2025-03-04 07:11:59,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:11:59,426 INFO L471 AbstractCegarLoop]: Abstraction has 647 states and 891 transitions. [2025-03-04 07:11:59,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 20.5) internal successors, (164), 8 states have internal predecessors, (164), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 07:11:59,426 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 891 transitions. [2025-03-04 07:11:59,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-03-04 07:11:59,427 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:11:59,427 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:11:59,437 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-04 07:11:59,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:11:59,628 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-04 07:11:59,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:11:59,629 INFO L85 PathProgramCache]: Analyzing trace with hash -1492338956, now seen corresponding path program 1 times [2025-03-04 07:11:59,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:11:59,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532270746] [2025-03-04 07:11:59,629 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:11:59,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:11:59,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-03-04 07:11:59,680 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-03-04 07:11:59,681 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:11:59,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:11:59,943 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-04 07:11:59,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:11:59,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532270746] [2025-03-04 07:11:59,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532270746] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:11:59,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:11:59,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 07:11:59,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686475768] [2025-03-04 07:11:59,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:11:59,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 07:11:59,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:11:59,945 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 07:11:59,945 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-04 07:11:59,945 INFO L87 Difference]: Start difference. First operand 647 states and 891 transitions. Second operand has 10 states, 10 states have (on average 16.5) internal successors, (165), 10 states have internal predecessors, (165), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 07:12:00,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:12:00,543 INFO L93 Difference]: Finished difference Result 656 states and 903 transitions. [2025-03-04 07:12:00,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 07:12:00,544 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 16.5) internal successors, (165), 10 states have internal predecessors, (165), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 174 [2025-03-04 07:12:00,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:12:00,545 INFO L225 Difference]: With dead ends: 656 [2025-03-04 07:12:00,545 INFO L226 Difference]: Without dead ends: 656 [2025-03-04 07:12:00,546 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-03-04 07:12:00,546 INFO L435 NwaCegarLoop]: 456 mSDtfsCounter, 26 mSDsluCounter, 2440 mSDsCounter, 0 mSdLazyCounter, 1297 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 2896 SdHoareTripleChecker+Invalid, 1298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 07:12:00,546 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 2896 Invalid, 1298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1297 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 07:12:00,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2025-03-04 07:12:00,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 650. [2025-03-04 07:12:00,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 650 states, 643 states have (on average 1.3794712286158632) internal successors, (887), 645 states have internal predecessors, (887), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-04 07:12:00,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 650 states and 894 transitions. [2025-03-04 07:12:00,554 INFO L78 Accepts]: Start accepts. Automaton has 650 states and 894 transitions. Word has length 174 [2025-03-04 07:12:00,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:12:00,554 INFO L471 AbstractCegarLoop]: Abstraction has 650 states and 894 transitions. [2025-03-04 07:12:00,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 16.5) internal successors, (165), 10 states have internal predecessors, (165), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 07:12:00,555 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 894 transitions. [2025-03-04 07:12:00,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-03-04 07:12:00,556 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:12:00,557 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:12:00,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-04 07:12:00,557 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-04 07:12:00,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:12:00,558 INFO L85 PathProgramCache]: Analyzing trace with hash 1226956642, now seen corresponding path program 1 times [2025-03-04 07:12:00,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:12:00,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893070875] [2025-03-04 07:12:00,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:12:00,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:12:00,588 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-03-04 07:12:00,688 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-03-04 07:12:00,688 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:12:00,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:12:00,860 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 07:12:00,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:12:00,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893070875] [2025-03-04 07:12:00,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1893070875] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:12:00,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1461436480] [2025-03-04 07:12:00,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:12:00,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:12:00,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:12:00,862 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:12:00,864 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-04 07:12:01,129 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-03-04 07:12:01,280 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-03-04 07:12:01,280 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:12:01,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:12:01,283 INFO L256 TraceCheckSpWp]: Trace formula consists of 791 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-04 07:12:01,285 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:12:01,448 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-04 07:12:01,448 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:12:01,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1461436480] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:12:01,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 07:12:01,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [5] total 10 [2025-03-04 07:12:01,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345894439] [2025-03-04 07:12:01,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:12:01,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 07:12:01,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:12:01,449 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 07:12:01,449 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-04 07:12:01,449 INFO L87 Difference]: Start difference. First operand 650 states and 894 transitions. Second operand has 7 states, 7 states have (on average 23.714285714285715) internal successors, (166), 7 states have internal predecessors, (166), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 07:12:01,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:12:01,971 INFO L93 Difference]: Finished difference Result 664 states and 912 transitions. [2025-03-04 07:12:01,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 07:12:01,972 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.714285714285715) internal successors, (166), 7 states have internal predecessors, (166), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 174 [2025-03-04 07:12:01,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:12:01,973 INFO L225 Difference]: With dead ends: 664 [2025-03-04 07:12:01,973 INFO L226 Difference]: Without dead ends: 664 [2025-03-04 07:12:01,974 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-04 07:12:01,974 INFO L435 NwaCegarLoop]: 455 mSDtfsCounter, 12 mSDsluCounter, 1704 mSDsCounter, 0 mSdLazyCounter, 925 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 2159 SdHoareTripleChecker+Invalid, 926 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 925 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 07:12:01,974 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 2159 Invalid, 926 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 925 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 07:12:01,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 664 states. [2025-03-04 07:12:01,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 664 to 650. [2025-03-04 07:12:01,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 650 states, 643 states have (on average 1.3794712286158632) internal successors, (887), 645 states have internal predecessors, (887), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-04 07:12:01,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 650 states and 894 transitions. [2025-03-04 07:12:01,980 INFO L78 Accepts]: Start accepts. Automaton has 650 states and 894 transitions. Word has length 174 [2025-03-04 07:12:01,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:12:01,981 INFO L471 AbstractCegarLoop]: Abstraction has 650 states and 894 transitions. [2025-03-04 07:12:01,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.714285714285715) internal successors, (166), 7 states have internal predecessors, (166), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 07:12:01,981 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 894 transitions. [2025-03-04 07:12:01,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-03-04 07:12:01,982 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:12:01,982 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:12:01,991 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-04 07:12:02,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:12:02,182 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-04 07:12:02,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:12:02,183 INFO L85 PathProgramCache]: Analyzing trace with hash 116337206, now seen corresponding path program 1 times [2025-03-04 07:12:02,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:12:02,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385449427] [2025-03-04 07:12:02,183 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:12:02,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:12:02,215 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-03-04 07:12:02,232 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-03-04 07:12:02,233 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:12:02,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:12:02,447 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-04 07:12:02,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:12:02,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385449427] [2025-03-04 07:12:02,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385449427] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:12:02,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:12:02,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 07:12:02,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298204559] [2025-03-04 07:12:02,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:12:02,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 07:12:02,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:12:02,449 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 07:12:02,449 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-04 07:12:02,449 INFO L87 Difference]: Start difference. First operand 650 states and 894 transitions. Second operand has 9 states, 9 states have (on average 18.555555555555557) internal successors, (167), 9 states have internal predecessors, (167), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 07:12:03,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:12:03,024 INFO L93 Difference]: Finished difference Result 676 states and 926 transitions. [2025-03-04 07:12:03,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 07:12:03,027 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 18.555555555555557) internal successors, (167), 9 states have internal predecessors, (167), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 175 [2025-03-04 07:12:03,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:12:03,028 INFO L225 Difference]: With dead ends: 676 [2025-03-04 07:12:03,028 INFO L226 Difference]: Without dead ends: 676 [2025-03-04 07:12:03,028 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-04 07:12:03,032 INFO L435 NwaCegarLoop]: 450 mSDtfsCounter, 20 mSDsluCounter, 2494 mSDsCounter, 0 mSdLazyCounter, 1126 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 2944 SdHoareTripleChecker+Invalid, 1127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 07:12:03,032 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 2944 Invalid, 1127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1126 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 07:12:03,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 676 states. [2025-03-04 07:12:03,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 676 to 664. [2025-03-04 07:12:03,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 664 states, 657 states have (on average 1.3774733637747336) internal successors, (905), 659 states have internal predecessors, (905), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-04 07:12:03,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 664 states to 664 states and 912 transitions. [2025-03-04 07:12:03,039 INFO L78 Accepts]: Start accepts. Automaton has 664 states and 912 transitions. Word has length 175 [2025-03-04 07:12:03,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:12:03,040 INFO L471 AbstractCegarLoop]: Abstraction has 664 states and 912 transitions. [2025-03-04 07:12:03,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 18.555555555555557) internal successors, (167), 9 states have internal predecessors, (167), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 07:12:03,040 INFO L276 IsEmpty]: Start isEmpty. Operand 664 states and 912 transitions. [2025-03-04 07:12:03,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-03-04 07:12:03,041 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:12:03,041 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:12:03,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-04 07:12:03,041 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-04 07:12:03,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:12:03,042 INFO L85 PathProgramCache]: Analyzing trace with hash 511903797, now seen corresponding path program 1 times [2025-03-04 07:12:03,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:12:03,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323307104] [2025-03-04 07:12:03,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:12:03,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:12:03,084 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-03-04 07:12:03,266 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-03-04 07:12:03,267 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:12:03,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:12:03,440 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 07:12:03,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:12:03,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323307104] [2025-03-04 07:12:03,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323307104] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:12:03,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [503497475] [2025-03-04 07:12:03,441 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:12:03,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:12:03,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:12:03,443 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:12:03,444 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-04 07:12:03,703 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-03-04 07:12:03,803 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-03-04 07:12:03,804 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:12:03,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:12:03,807 INFO L256 TraceCheckSpWp]: Trace formula consists of 792 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-04 07:12:03,810 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:12:03,886 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-04 07:12:03,886 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:12:03,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [503497475] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:12:03,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 07:12:03,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [5] total 10 [2025-03-04 07:12:03,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897218615] [2025-03-04 07:12:03,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:12:03,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 07:12:03,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:12:03,888 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 07:12:03,888 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-04 07:12:03,888 INFO L87 Difference]: Start difference. First operand 664 states and 912 transitions. Second operand has 7 states, 7 states have (on average 23.857142857142858) internal successors, (167), 7 states have internal predecessors, (167), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 07:12:04,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:12:04,289 INFO L93 Difference]: Finished difference Result 688 states and 948 transitions. [2025-03-04 07:12:04,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 07:12:04,289 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.857142857142858) internal successors, (167), 7 states have internal predecessors, (167), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 175 [2025-03-04 07:12:04,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:12:04,291 INFO L225 Difference]: With dead ends: 688 [2025-03-04 07:12:04,291 INFO L226 Difference]: Without dead ends: 688 [2025-03-04 07:12:04,291 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-04 07:12:04,291 INFO L435 NwaCegarLoop]: 447 mSDtfsCounter, 17 mSDsluCounter, 1735 mSDsCounter, 0 mSdLazyCounter, 870 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 2182 SdHoareTripleChecker+Invalid, 870 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 870 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 07:12:04,291 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 2182 Invalid, 870 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 870 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 07:12:04,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 688 states. [2025-03-04 07:12:04,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 688 to 678. [2025-03-04 07:12:04,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 678 states, 671 states have (on average 1.3785394932935917) internal successors, (925), 673 states have internal predecessors, (925), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-04 07:12:04,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 678 states to 678 states and 932 transitions. [2025-03-04 07:12:04,297 INFO L78 Accepts]: Start accepts. Automaton has 678 states and 932 transitions. Word has length 175 [2025-03-04 07:12:04,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:12:04,297 INFO L471 AbstractCegarLoop]: Abstraction has 678 states and 932 transitions. [2025-03-04 07:12:04,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.857142857142858) internal successors, (167), 7 states have internal predecessors, (167), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 07:12:04,297 INFO L276 IsEmpty]: Start isEmpty. Operand 678 states and 932 transitions. [2025-03-04 07:12:04,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-03-04 07:12:04,299 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:12:04,299 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:12:04,309 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-04 07:12:04,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-03-04 07:12:04,500 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-04 07:12:04,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:12:04,500 INFO L85 PathProgramCache]: Analyzing trace with hash -726297414, now seen corresponding path program 1 times [2025-03-04 07:12:04,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:12:04,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417910928] [2025-03-04 07:12:04,500 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:12:04,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:12:04,529 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-03-04 07:12:04,563 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-03-04 07:12:04,563 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:12:04,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:12:04,946 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-04 07:12:04,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:12:04,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417910928] [2025-03-04 07:12:04,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417910928] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:12:04,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:12:04,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 07:12:04,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29131851] [2025-03-04 07:12:04,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:12:04,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 07:12:04,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:12:04,949 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 07:12:04,949 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-04 07:12:04,949 INFO L87 Difference]: Start difference. First operand 678 states and 932 transitions. Second operand has 10 states, 10 states have (on average 16.8) internal successors, (168), 10 states have internal predecessors, (168), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 07:12:05,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:12:05,500 INFO L93 Difference]: Finished difference Result 696 states and 956 transitions. [2025-03-04 07:12:05,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 07:12:05,501 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 16.8) internal successors, (168), 10 states have internal predecessors, (168), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 176 [2025-03-04 07:12:05,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:12:05,502 INFO L225 Difference]: With dead ends: 696 [2025-03-04 07:12:05,502 INFO L226 Difference]: Without dead ends: 696 [2025-03-04 07:12:05,502 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-03-04 07:12:05,503 INFO L435 NwaCegarLoop]: 456 mSDtfsCounter, 26 mSDsluCounter, 2127 mSDsCounter, 0 mSdLazyCounter, 1118 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 2583 SdHoareTripleChecker+Invalid, 1119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 07:12:05,503 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 2583 Invalid, 1119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1118 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 07:12:05,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 696 states. [2025-03-04 07:12:05,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 696 to 684. [2025-03-04 07:12:05,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 684 states, 677 states have (on average 1.3751846381093058) internal successors, (931), 679 states have internal predecessors, (931), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-04 07:12:05,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 684 states to 684 states and 938 transitions. [2025-03-04 07:12:05,509 INFO L78 Accepts]: Start accepts. Automaton has 684 states and 938 transitions. Word has length 176 [2025-03-04 07:12:05,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:12:05,509 INFO L471 AbstractCegarLoop]: Abstraction has 684 states and 938 transitions. [2025-03-04 07:12:05,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 16.8) internal successors, (168), 10 states have internal predecessors, (168), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 07:12:05,509 INFO L276 IsEmpty]: Start isEmpty. Operand 684 states and 938 transitions. [2025-03-04 07:12:05,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-03-04 07:12:05,510 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:12:05,510 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:12:05,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-04 07:12:05,510 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-04 07:12:05,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:12:05,511 INFO L85 PathProgramCache]: Analyzing trace with hash -1472256641, now seen corresponding path program 1 times [2025-03-04 07:12:05,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:12:05,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354355571] [2025-03-04 07:12:05,511 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:12:05,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:12:05,540 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-03-04 07:12:05,612 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-03-04 07:12:05,613 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:12:05,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:12:05,834 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 07:12:05,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:12:05,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354355571] [2025-03-04 07:12:05,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354355571] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:12:05,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [698895325] [2025-03-04 07:12:05,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:12:05,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:12:05,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:12:05,837 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:12:05,839 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-04 07:12:06,118 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-03-04 07:12:06,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-03-04 07:12:06,223 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:12:06,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:12:06,227 INFO L256 TraceCheckSpWp]: Trace formula consists of 793 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-04 07:12:06,229 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:12:06,711 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-04 07:12:06,712 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:12:06,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [698895325] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:12:06,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 07:12:06,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [5] total 13 [2025-03-04 07:12:06,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496366734] [2025-03-04 07:12:06,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:12:06,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 07:12:06,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:12:06,713 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 07:12:06,713 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2025-03-04 07:12:06,713 INFO L87 Difference]: Start difference. First operand 684 states and 938 transitions. Second operand has 10 states, 10 states have (on average 16.7) internal successors, (167), 10 states have internal predecessors, (167), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 07:12:08,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:12:08,204 INFO L93 Difference]: Finished difference Result 696 states and 954 transitions. [2025-03-04 07:12:08,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 07:12:08,205 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 16.7) internal successors, (167), 10 states have internal predecessors, (167), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 176 [2025-03-04 07:12:08,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:12:08,207 INFO L225 Difference]: With dead ends: 696 [2025-03-04 07:12:08,207 INFO L226 Difference]: Without dead ends: 696 [2025-03-04 07:12:08,207 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2025-03-04 07:12:08,207 INFO L435 NwaCegarLoop]: 456 mSDtfsCounter, 17 mSDsluCounter, 2787 mSDsCounter, 0 mSdLazyCounter, 1493 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 3243 SdHoareTripleChecker+Invalid, 1495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1493 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-04 07:12:08,207 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 3243 Invalid, 1495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1493 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-04 07:12:08,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 696 states. [2025-03-04 07:12:08,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 696 to 691. [2025-03-04 07:12:08,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 691 states, 684 states have (on average 1.3742690058479532) internal successors, (940), 686 states have internal predecessors, (940), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-04 07:12:08,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 691 states to 691 states and 947 transitions. [2025-03-04 07:12:08,215 INFO L78 Accepts]: Start accepts. Automaton has 691 states and 947 transitions. Word has length 176 [2025-03-04 07:12:08,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:12:08,215 INFO L471 AbstractCegarLoop]: Abstraction has 691 states and 947 transitions. [2025-03-04 07:12:08,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 16.7) internal successors, (167), 10 states have internal predecessors, (167), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 07:12:08,215 INFO L276 IsEmpty]: Start isEmpty. Operand 691 states and 947 transitions. [2025-03-04 07:12:08,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-03-04 07:12:08,219 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:12:08,219 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:12:08,229 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-04 07:12:08,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2025-03-04 07:12:08,420 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-04 07:12:08,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:12:08,420 INFO L85 PathProgramCache]: Analyzing trace with hash 1954739935, now seen corresponding path program 1 times [2025-03-04 07:12:08,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:12:08,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477300451] [2025-03-04 07:12:08,421 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:12:08,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:12:08,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-03-04 07:12:08,574 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-03-04 07:12:08,574 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:12:08,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:12:08,748 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 07:12:08,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:12:08,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477300451] [2025-03-04 07:12:08,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477300451] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:12:08,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [76114438] [2025-03-04 07:12:08,749 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:12:08,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:12:08,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:12:08,751 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:12:08,753 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-04 07:12:09,033 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-03-04 07:12:09,118 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-03-04 07:12:09,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:12:09,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:12:09,121 INFO L256 TraceCheckSpWp]: Trace formula consists of 793 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-04 07:12:09,124 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:12:09,190 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-04 07:12:09,190 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:12:09,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [76114438] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:12:09,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 07:12:09,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [5] total 10 [2025-03-04 07:12:09,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715385726] [2025-03-04 07:12:09,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:12:09,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 07:12:09,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:12:09,191 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 07:12:09,191 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-04 07:12:09,191 INFO L87 Difference]: Start difference. First operand 691 states and 947 transitions. Second operand has 7 states, 7 states have (on average 23.857142857142858) internal successors, (167), 7 states have internal predecessors, (167), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 07:12:09,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:12:09,590 INFO L93 Difference]: Finished difference Result 707 states and 969 transitions. [2025-03-04 07:12:09,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 07:12:09,590 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.857142857142858) internal successors, (167), 7 states have internal predecessors, (167), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 176 [2025-03-04 07:12:09,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:12:09,593 INFO L225 Difference]: With dead ends: 707 [2025-03-04 07:12:09,593 INFO L226 Difference]: Without dead ends: 707 [2025-03-04 07:12:09,593 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-03-04 07:12:09,594 INFO L435 NwaCegarLoop]: 445 mSDtfsCounter, 39 mSDsluCounter, 1786 mSDsCounter, 0 mSdLazyCounter, 829 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 2231 SdHoareTripleChecker+Invalid, 833 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 829 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 07:12:09,594 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 2231 Invalid, 833 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 829 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 07:12:09,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 707 states. [2025-03-04 07:12:09,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 707 to 698. [2025-03-04 07:12:09,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 698 states, 691 states have (on average 1.3748191027496381) internal successors, (950), 693 states have internal predecessors, (950), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-04 07:12:09,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 698 states and 957 transitions. [2025-03-04 07:12:09,611 INFO L78 Accepts]: Start accepts. Automaton has 698 states and 957 transitions. Word has length 176 [2025-03-04 07:12:09,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:12:09,611 INFO L471 AbstractCegarLoop]: Abstraction has 698 states and 957 transitions. [2025-03-04 07:12:09,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.857142857142858) internal successors, (167), 7 states have internal predecessors, (167), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 07:12:09,611 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 957 transitions. [2025-03-04 07:12:09,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-03-04 07:12:09,614 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:12:09,614 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:12:09,629 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-03-04 07:12:09,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-03-04 07:12:09,815 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-04 07:12:09,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:12:09,815 INFO L85 PathProgramCache]: Analyzing trace with hash -792307173, now seen corresponding path program 1 times [2025-03-04 07:12:09,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:12:09,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339939638] [2025-03-04 07:12:09,815 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:12:09,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:12:09,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-03-04 07:12:09,912 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-03-04 07:12:09,913 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:12:09,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:12:10,083 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 07:12:10,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:12:10,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339939638] [2025-03-04 07:12:10,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339939638] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:12:10,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [158053859] [2025-03-04 07:12:10,084 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:12:10,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:12:10,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:12:10,086 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:12:10,087 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-04 07:12:10,396 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-03-04 07:12:10,520 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-03-04 07:12:10,520 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:12:10,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:12:10,524 INFO L256 TraceCheckSpWp]: Trace formula consists of 793 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-04 07:12:10,527 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:12:10,531 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-03-04 07:12:10,632 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:12:10,632 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:12:10,699 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 07:12:10,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [158053859] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:12:10,699 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:12:10,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 5] total 12 [2025-03-04 07:12:10,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196279035] [2025-03-04 07:12:10,699 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:12:10,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 07:12:10,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:12:10,700 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 07:12:10,700 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2025-03-04 07:12:10,700 INFO L87 Difference]: Start difference. First operand 698 states and 957 transitions. Second operand has 12 states, 12 states have (on average 20.416666666666668) internal successors, (245), 11 states have internal predecessors, (245), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-04 07:12:11,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:12:11,052 INFO L93 Difference]: Finished difference Result 963 states and 1325 transitions. [2025-03-04 07:12:11,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 07:12:11,053 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 20.416666666666668) internal successors, (245), 11 states have internal predecessors, (245), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 3 states have call successors, (4) Word has length 176 [2025-03-04 07:12:11,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:12:11,055 INFO L225 Difference]: With dead ends: 963 [2025-03-04 07:12:11,055 INFO L226 Difference]: Without dead ends: 963 [2025-03-04 07:12:11,056 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 362 GetRequests, 346 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=205, Unknown=0, NotChecked=0, Total=306 [2025-03-04 07:12:11,056 INFO L435 NwaCegarLoop]: 490 mSDtfsCounter, 868 mSDsluCounter, 1906 mSDsCounter, 0 mSdLazyCounter, 351 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 872 SdHoareTripleChecker+Valid, 2396 SdHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 07:12:11,056 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [872 Valid, 2396 Invalid, 368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 351 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 07:12:11,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 963 states. [2025-03-04 07:12:11,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 963 to 726. [2025-03-04 07:12:11,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 726 states, 716 states have (on average 1.3784916201117319) internal successors, (987), 719 states have internal predecessors, (987), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2025-03-04 07:12:11,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 726 states to 726 states and 996 transitions. [2025-03-04 07:12:11,069 INFO L78 Accepts]: Start accepts. Automaton has 726 states and 996 transitions. Word has length 176 [2025-03-04 07:12:11,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:12:11,069 INFO L471 AbstractCegarLoop]: Abstraction has 726 states and 996 transitions. [2025-03-04 07:12:11,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 20.416666666666668) internal successors, (245), 11 states have internal predecessors, (245), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-04 07:12:11,069 INFO L276 IsEmpty]: Start isEmpty. Operand 726 states and 996 transitions. [2025-03-04 07:12:11,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-03-04 07:12:11,071 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:12:11,071 INFO L218 NwaCegarLoop]: trace histogram [6, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:12:11,084 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-03-04 07:12:11,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-03-04 07:12:11,272 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-04 07:12:11,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:12:11,272 INFO L85 PathProgramCache]: Analyzing trace with hash -794500969, now seen corresponding path program 2 times [2025-03-04 07:12:11,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:12:11,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639991692] [2025-03-04 07:12:11,273 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 07:12:11,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:12:11,317 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 180 statements into 2 equivalence classes. [2025-03-04 07:12:11,329 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 80 of 180 statements. [2025-03-04 07:12:11,330 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 07:12:11,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:12:11,457 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-04 07:12:11,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:12:11,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639991692] [2025-03-04 07:12:11,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639991692] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:12:11,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:12:11,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 07:12:11,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62684378] [2025-03-04 07:12:11,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:12:11,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 07:12:11,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:12:11,458 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 07:12:11,459 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:12:11,459 INFO L87 Difference]: Start difference. First operand 726 states and 996 transitions. Second operand has 6 states, 6 states have (on average 27.833333333333332) internal successors, (167), 6 states have internal predecessors, (167), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 07:12:11,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:12:11,841 INFO L93 Difference]: Finished difference Result 729 states and 999 transitions. [2025-03-04 07:12:11,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 07:12:11,841 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 27.833333333333332) internal successors, (167), 6 states have internal predecessors, (167), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 180 [2025-03-04 07:12:11,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:12:11,843 INFO L225 Difference]: With dead ends: 729 [2025-03-04 07:12:11,844 INFO L226 Difference]: Without dead ends: 729 [2025-03-04 07:12:11,844 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:12:11,844 INFO L435 NwaCegarLoop]: 459 mSDtfsCounter, 8 mSDsluCounter, 1379 mSDsCounter, 0 mSdLazyCounter, 718 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 1838 SdHoareTripleChecker+Invalid, 719 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 718 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 07:12:11,844 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 1838 Invalid, 719 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 718 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 07:12:11,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 729 states. [2025-03-04 07:12:11,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 729 to 729. [2025-03-04 07:12:11,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 729 states, 719 states have (on average 1.376912378303199) internal successors, (990), 722 states have internal predecessors, (990), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2025-03-04 07:12:11,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 729 states to 729 states and 999 transitions. [2025-03-04 07:12:11,855 INFO L78 Accepts]: Start accepts. Automaton has 729 states and 999 transitions. Word has length 180 [2025-03-04 07:12:11,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:12:11,856 INFO L471 AbstractCegarLoop]: Abstraction has 729 states and 999 transitions. [2025-03-04 07:12:11,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.833333333333332) internal successors, (167), 6 states have internal predecessors, (167), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 07:12:11,856 INFO L276 IsEmpty]: Start isEmpty. Operand 729 states and 999 transitions. [2025-03-04 07:12:11,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2025-03-04 07:12:11,857 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:12:11,857 INFO L218 NwaCegarLoop]: trace histogram [6, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:12:11,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-04 07:12:11,857 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-04 07:12:11,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:12:11,858 INFO L85 PathProgramCache]: Analyzing trace with hash -1187594950, now seen corresponding path program 1 times [2025-03-04 07:12:11,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:12:11,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504405807] [2025-03-04 07:12:11,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:12:11,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:12:11,908 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-03-04 07:12:12,010 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-03-04 07:12:12,011 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:12:12,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:12:12,220 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 2 proven. 27 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 07:12:12,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:12:12,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504405807] [2025-03-04 07:12:12,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504405807] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:12:12,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [973968342] [2025-03-04 07:12:12,220 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:12:12,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:12:12,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:12:12,222 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:12:12,224 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-04 07:12:12,542 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-03-04 07:12:12,684 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-03-04 07:12:12,684 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:12:12,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:12:12,688 INFO L256 TraceCheckSpWp]: Trace formula consists of 854 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-04 07:12:12,691 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:12:12,695 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-03-04 07:12:13,115 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 5 proven. 25 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 07:12:13,115 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:12:13,333 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 19 proven. 3 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-04 07:12:13,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [973968342] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:12:13,333 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:12:13,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 13, 9] total 26 [2025-03-04 07:12:13,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262213368] [2025-03-04 07:12:13,333 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:12:13,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-04 07:12:13,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:12:13,334 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-04 07:12:13,334 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=531, Unknown=0, NotChecked=0, Total=650 [2025-03-04 07:12:13,334 INFO L87 Difference]: Start difference. First operand 729 states and 999 transitions. Second operand has 26 states, 26 states have (on average 10.76923076923077) internal successors, (280), 26 states have internal predecessors, (280), 3 states have call successors, (5), 2 states have call predecessors, (5), 5 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-04 07:12:14,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:12:14,291 INFO L93 Difference]: Finished difference Result 909 states and 1242 transitions. [2025-03-04 07:12:14,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-03-04 07:12:14,291 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 10.76923076923077) internal successors, (280), 26 states have internal predecessors, (280), 3 states have call successors, (5), 2 states have call predecessors, (5), 5 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 181 [2025-03-04 07:12:14,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:12:14,293 INFO L225 Difference]: With dead ends: 909 [2025-03-04 07:12:14,293 INFO L226 Difference]: Without dead ends: 905 [2025-03-04 07:12:14,294 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 381 GetRequests, 342 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 374 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=321, Invalid=1161, Unknown=0, NotChecked=0, Total=1482 [2025-03-04 07:12:14,294 INFO L435 NwaCegarLoop]: 480 mSDtfsCounter, 1074 mSDsluCounter, 6216 mSDsCounter, 0 mSdLazyCounter, 1219 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1077 SdHoareTripleChecker+Valid, 6696 SdHoareTripleChecker+Invalid, 1237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 1219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-04 07:12:14,294 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1077 Valid, 6696 Invalid, 1237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 1219 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-04 07:12:14,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 905 states. [2025-03-04 07:12:14,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 905 to 652. [2025-03-04 07:12:14,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 652 states, 642 states have (on average 1.3644859813084111) internal successors, (876), 645 states have internal predecessors, (876), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2025-03-04 07:12:14,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 652 states to 652 states and 885 transitions. [2025-03-04 07:12:14,303 INFO L78 Accepts]: Start accepts. Automaton has 652 states and 885 transitions. Word has length 181 [2025-03-04 07:12:14,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:12:14,303 INFO L471 AbstractCegarLoop]: Abstraction has 652 states and 885 transitions. [2025-03-04 07:12:14,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 10.76923076923077) internal successors, (280), 26 states have internal predecessors, (280), 3 states have call successors, (5), 2 states have call predecessors, (5), 5 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-04 07:12:14,303 INFO L276 IsEmpty]: Start isEmpty. Operand 652 states and 885 transitions. [2025-03-04 07:12:14,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2025-03-04 07:12:14,304 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:12:14,304 INFO L218 NwaCegarLoop]: trace histogram [13, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:12:14,314 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-03-04 07:12:14,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:12:14,505 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-04 07:12:14,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:12:14,505 INFO L85 PathProgramCache]: Analyzing trace with hash 1511739094, now seen corresponding path program 2 times [2025-03-04 07:12:14,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:12:14,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657485823] [2025-03-04 07:12:14,506 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 07:12:14,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:12:14,548 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 188 statements into 2 equivalence classes. [2025-03-04 07:12:14,567 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 81 of 188 statements. [2025-03-04 07:12:14,567 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 07:12:14,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:12:14,756 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2025-03-04 07:12:14,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:12:14,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657485823] [2025-03-04 07:12:14,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657485823] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:12:14,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:12:14,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-04 07:12:14,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663493318] [2025-03-04 07:12:14,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:12:14,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 07:12:14,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:12:14,757 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 07:12:14,757 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2025-03-04 07:12:14,757 INFO L87 Difference]: Start difference. First operand 652 states and 885 transitions. Second operand has 12 states, 12 states have (on average 14.0) internal successors, (168), 12 states have internal predecessors, (168), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 07:12:16,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:12:16,058 INFO L93 Difference]: Finished difference Result 709 states and 969 transitions. [2025-03-04 07:12:16,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 07:12:16,058 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 14.0) internal successors, (168), 12 states have internal predecessors, (168), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 188 [2025-03-04 07:12:16,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:12:16,060 INFO L225 Difference]: With dead ends: 709 [2025-03-04 07:12:16,060 INFO L226 Difference]: Without dead ends: 709 [2025-03-04 07:12:16,060 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2025-03-04 07:12:16,061 INFO L435 NwaCegarLoop]: 462 mSDtfsCounter, 89 mSDsluCounter, 3126 mSDsCounter, 0 mSdLazyCounter, 1981 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 3588 SdHoareTripleChecker+Invalid, 1989 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1981 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:12:16,061 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 3588 Invalid, 1989 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1981 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-04 07:12:16,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 709 states. [2025-03-04 07:12:16,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 709 to 656. [2025-03-04 07:12:16,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 656 states, 646 states have (on average 1.3637770897832817) internal successors, (881), 649 states have internal predecessors, (881), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2025-03-04 07:12:16,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 656 states and 890 transitions. [2025-03-04 07:12:16,067 INFO L78 Accepts]: Start accepts. Automaton has 656 states and 890 transitions. Word has length 188 [2025-03-04 07:12:16,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:12:16,067 INFO L471 AbstractCegarLoop]: Abstraction has 656 states and 890 transitions. [2025-03-04 07:12:16,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 14.0) internal successors, (168), 12 states have internal predecessors, (168), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 07:12:16,068 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 890 transitions. [2025-03-04 07:12:16,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2025-03-04 07:12:16,068 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:12:16,069 INFO L218 NwaCegarLoop]: trace histogram [13, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:12:16,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-04 07:12:16,069 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-04 07:12:16,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:12:16,069 INFO L85 PathProgramCache]: Analyzing trace with hash -89443288, now seen corresponding path program 1 times [2025-03-04 07:12:16,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:12:16,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878166619] [2025-03-04 07:12:16,069 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:12:16,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:12:16,105 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-03-04 07:12:16,197 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-03-04 07:12:16,197 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:12:16,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:12:16,492 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 2 proven. 71 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-03-04 07:12:16,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:12:16,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878166619] [2025-03-04 07:12:16,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878166619] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:12:16,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1449351119] [2025-03-04 07:12:16,493 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:12:16,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:12:16,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:12:16,495 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:12:16,496 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-04 07:12:16,848 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-03-04 07:12:17,410 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-03-04 07:12:17,410 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:12:17,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:12:17,417 INFO L256 TraceCheckSpWp]: Trace formula consists of 956 conjuncts, 158 conjuncts are in the unsatisfiable core [2025-03-04 07:12:17,424 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:12:17,429 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-04 07:12:17,616 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 07:12:17,619 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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-03-04 07:12:17,650 INFO L349 Elim1Store]: treesize reduction 26, result has 35.0 percent of original size [2025-03-04 07:12:17,650 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 29 [2025-03-04 07:12:17,735 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2025-03-04 07:12:17,737 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-03-04 07:12:17,943 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-04 07:12:17,943 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2025-03-04 07:12:17,950 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11