./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test9-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test9-1.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6698dfe763688c38a478c53cfe3bc6bac092e445bf13ef44be53eb6068218c93 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 05:52:49,383 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 05:52:49,457 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2025-02-08 05:52:49,460 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 05:52:49,460 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 05:52:49,474 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 05:52:49,474 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 05:52:49,475 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 05:52:49,475 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 05:52:49,475 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 05:52:49,476 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 05:52:49,476 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 05:52:49,476 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 05:52:49,476 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 05:52:49,476 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 05:52:49,476 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 05:52:49,476 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 05:52:49,476 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 05:52:49,476 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 05:52:49,476 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 05:52:49,476 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 05:52:49,476 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 05:52:49,476 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-08 05:52:49,476 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-08 05:52:49,476 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 05:52:49,476 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 05:52:49,477 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-08 05:52:49,477 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 05:52:49,477 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 05:52:49,477 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 05:52:49,477 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 05:52:49,477 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 05:52:49,477 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 05:52:49,477 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 05:52:49,477 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 05:52:49,477 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 05:52:49,477 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:52:49,477 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 05:52:49,477 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 05:52:49,477 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 05:52:49,477 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 05:52:49,477 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 05:52:49,477 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 05:52:49,477 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 05:52:49,477 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 05:52:49,477 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-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 -> 6698dfe763688c38a478c53cfe3bc6bac092e445bf13ef44be53eb6068218c93 [2025-02-08 05:52:49,701 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 05:52:49,710 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 05:52:49,713 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 05:52:49,714 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 05:52:49,715 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 05:52:49,716 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test9-1.i [2025-02-08 05:52:50,944 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0c56add4b/50159fad60bc4c00bda630fd49fc46c5/FLAG2030a5055 [2025-02-08 05:52:51,361 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 05:52:51,364 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test9-1.i [2025-02-08 05:52:51,381 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0c56add4b/50159fad60bc4c00bda630fd49fc46c5/FLAG2030a5055 [2025-02-08 05:52:51,499 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0c56add4b/50159fad60bc4c00bda630fd49fc46c5 [2025-02-08 05:52:51,501 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 05:52:51,502 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 05:52:51,503 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 05:52:51,503 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 05:52:51,506 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 05:52:51,507 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:52:51" (1/1) ... [2025-02-08 05:52:51,507 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c621b36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:52:51, skipping insertion in model container [2025-02-08 05:52:51,509 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:52:51" (1/1) ... [2025-02-08 05:52:51,550 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 05:52:51,957 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 05:52:51,973 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 05:52:51,975 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 05:52:51,977 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 05:52:51,980 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 05:52:52,001 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 05:52:52,001 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 05:52:52,003 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 05:52:52,003 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 05:52:52,005 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:52:52,015 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 05:52:52,132 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:52:52,167 INFO L204 MainTranslator]: Completed translation [2025-02-08 05:52:52,167 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:52:52 WrapperNode [2025-02-08 05:52:52,168 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 05:52:52,169 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 05:52:52,169 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 05:52:52,169 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 05:52:52,173 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:52:52" (1/1) ... [2025-02-08 05:52:52,201 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:52:52" (1/1) ... [2025-02-08 05:52:52,278 INFO L138 Inliner]: procedures = 177, calls = 724, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 3244 [2025-02-08 05:52:52,278 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 05:52:52,279 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 05:52:52,279 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 05:52:52,279 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 05:52:52,285 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:52:52" (1/1) ... [2025-02-08 05:52:52,286 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:52:52" (1/1) ... [2025-02-08 05:52:52,300 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:52:52" (1/1) ... [2025-02-08 05:52:52,362 INFO L175 MemorySlicer]: Split 208 memory accesses to 3 slices as follows [2, 34, 172]. 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, 4, 42]. [2025-02-08 05:52:52,362 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:52:52" (1/1) ... [2025-02-08 05:52:52,362 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:52:52" (1/1) ... [2025-02-08 05:52:52,414 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:52:52" (1/1) ... [2025-02-08 05:52:52,419 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:52:52" (1/1) ... [2025-02-08 05:52:52,456 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:52:52" (1/1) ... [2025-02-08 05:52:52,462 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:52:52" (1/1) ... [2025-02-08 05:52:52,476 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 05:52:52,477 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 05:52:52,478 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 05:52:52,478 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 05:52:52,478 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:52:52" (1/1) ... [2025-02-08 05:52:52,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:52:52,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:52:52,506 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 05:52:52,509 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 05:52:52,526 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2025-02-08 05:52:52,526 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2025-02-08 05:52:52,526 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 05:52:52,526 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 05:52:52,527 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-08 05:52:52,527 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-02-08 05:52:52,527 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-02-08 05:52:52,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 05:52:52,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 05:52:52,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-08 05:52:52,528 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-02-08 05:52:52,528 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-02-08 05:52:52,528 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-02-08 05:52:52,528 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-02-08 05:52:52,528 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-02-08 05:52:52,529 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-02-08 05:52:52,529 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 05:52:52,529 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 05:52:52,529 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-08 05:52:52,529 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-08 05:52:52,529 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-08 05:52:52,529 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 05:52:52,529 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-08 05:52:52,529 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-08 05:52:52,530 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-08 05:52:52,530 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 05:52:52,530 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 05:52:52,530 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 05:52:52,530 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-08 05:52:52,530 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 05:52:52,530 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 05:52:52,674 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 05:52:52,676 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 05:52:54,718 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2218: 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-02-08 05:52:54,908 INFO L? ?]: Removed 798 outVars from TransFormulas that were not future-live. [2025-02-08 05:52:54,908 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 05:52:54,977 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 05:52:54,981 INFO L337 CfgBuilder]: Removed 1 assume(true) statements. [2025-02-08 05:52:54,981 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:52:54 BoogieIcfgContainer [2025-02-08 05:52:54,981 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 05:52:54,983 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 05:52:54,984 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 05:52:54,987 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 05:52:54,988 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 05:52:51" (1/3) ... [2025-02-08 05:52:54,989 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68d9aa19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:52:54, skipping insertion in model container [2025-02-08 05:52:54,989 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:52:52" (2/3) ... [2025-02-08 05:52:54,989 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68d9aa19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:52:54, skipping insertion in model container [2025-02-08 05:52:54,989 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:52:54" (3/3) ... [2025-02-08 05:52:54,990 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_BER_test9-1.i [2025-02-08 05:52:55,001 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 05:52:55,002 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_BER_test9-1.i that has 6 procedures, 1378 locations, 1 initial locations, 33 loop locations, and 2 error locations. [2025-02-08 05:52:55,061 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:52:55,071 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;@bd484f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:52:55,071 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-02-08 05:52:55,079 INFO L276 IsEmpty]: Start isEmpty. Operand has 1370 states, 858 states have (on average 1.8403263403263403) internal successors, (1579), 1362 states have internal predecessors, (1579), 505 states have call successors, (505), 3 states have call predecessors, (505), 3 states have return successors, (505), 6 states have call predecessors, (505), 505 states have call successors, (505) [2025-02-08 05:52:55,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-02-08 05:52:55,083 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 05:52:55,083 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-08 05:52:55,084 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-08 05:52:55,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:52:55,089 INFO L85 PathProgramCache]: Analyzing trace with hash 949030012, now seen corresponding path program 1 times [2025-02-08 05:52:55,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:52:55,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054811753] [2025-02-08 05:52:55,094 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:52:55,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:52:55,152 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 05:52:55,162 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 05:52:55,163 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:52:55,163 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:52:55,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:52:55,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:52:55,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054811753] [2025-02-08 05:52:55,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054811753] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:52:55,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:52:55,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:52:55,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523070951] [2025-02-08 05:52:55,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:52:55,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-08 05:52:55,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:52:55,213 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-08 05:52:55,213 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 05:52:55,217 INFO L87 Difference]: Start difference. First operand has 1370 states, 858 states have (on average 1.8403263403263403) internal successors, (1579), 1362 states have internal predecessors, (1579), 505 states have call successors, (505), 3 states have call predecessors, (505), 3 states have return successors, (505), 6 states have call predecessors, (505), 505 states have call successors, (505) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:52:55,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 05:52:55,356 INFO L93 Difference]: Finished difference Result 1368 states and 2530 transitions. [2025-02-08 05:52:55,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-08 05:52:55,357 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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 6 [2025-02-08 05:52:55,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 05:52:55,369 INFO L225 Difference]: With dead ends: 1368 [2025-02-08 05:52:55,370 INFO L226 Difference]: Without dead ends: 1363 [2025-02-08 05:52:55,371 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 05:52:55,373 INFO L435 NwaCegarLoop]: 2489 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2489 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 05:52:55,374 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2489 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 05:52:55,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1363 states. [2025-02-08 05:52:55,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1363 to 1363. [2025-02-08 05:52:55,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1363 states, 855 states have (on average 1.775438596491228) internal successors, (1518), 1356 states have internal predecessors, (1518), 505 states have call successors, (505), 3 states have call predecessors, (505), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 05:52:55,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1363 states to 1363 states and 2026 transitions. [2025-02-08 05:52:55,473 INFO L78 Accepts]: Start accepts. Automaton has 1363 states and 2026 transitions. Word has length 6 [2025-02-08 05:52:55,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 05:52:55,473 INFO L471 AbstractCegarLoop]: Abstraction has 1363 states and 2026 transitions. [2025-02-08 05:52:55,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:52:55,473 INFO L276 IsEmpty]: Start isEmpty. Operand 1363 states and 2026 transitions. [2025-02-08 05:52:55,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-08 05:52:55,473 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 05:52:55,474 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:52:55,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 05:52:55,474 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-08 05:52:55,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:52:55,475 INFO L85 PathProgramCache]: Analyzing trace with hash 1642390446, now seen corresponding path program 1 times [2025-02-08 05:52:55,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:52:55,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738057877] [2025-02-08 05:52:55,475 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:52:55,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:52:55,488 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 05:52:55,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 05:52:55,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:52:55,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:52:55,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:52:55,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:52:55,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738057877] [2025-02-08 05:52:55,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738057877] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:52:55,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:52:55,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 05:52:55,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143801930] [2025-02-08 05:52:55,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:52:55,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 05:52:55,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:52:55,622 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 05:52:55,622 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 05:52:55,622 INFO L87 Difference]: Start difference. First operand 1363 states and 2026 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:52:56,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 05:52:56,395 INFO L93 Difference]: Finished difference Result 2712 states and 4039 transitions. [2025-02-08 05:52:56,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 05:52:56,396 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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 8 [2025-02-08 05:52:56,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 05:52:56,449 INFO L225 Difference]: With dead ends: 2712 [2025-02-08 05:52:56,452 INFO L226 Difference]: Without dead ends: 2712 [2025-02-08 05:52:56,455 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-02-08 05:52:56,458 INFO L435 NwaCegarLoop]: 2004 mSDtfsCounter, 1503 mSDsluCounter, 3462 mSDsCounter, 0 mSdLazyCounter, 694 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1506 SdHoareTripleChecker+Valid, 5466 SdHoareTripleChecker+Invalid, 695 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 694 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-08 05:52:56,459 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1506 Valid, 5466 Invalid, 695 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 694 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-08 05:52:56,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2712 states. [2025-02-08 05:52:56,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2712 to 1365. [2025-02-08 05:52:56,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1365 states, 857 states have (on average 1.7736289381563595) internal successors, (1520), 1358 states have internal predecessors, (1520), 505 states have call successors, (505), 3 states have call predecessors, (505), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 05:52:56,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1365 states to 1365 states and 2028 transitions. [2025-02-08 05:52:56,494 INFO L78 Accepts]: Start accepts. Automaton has 1365 states and 2028 transitions. Word has length 8 [2025-02-08 05:52:56,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 05:52:56,494 INFO L471 AbstractCegarLoop]: Abstraction has 1365 states and 2028 transitions. [2025-02-08 05:52:56,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:52:56,495 INFO L276 IsEmpty]: Start isEmpty. Operand 1365 states and 2028 transitions. [2025-02-08 05:52:56,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-02-08 05:52:56,496 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 05:52:56,497 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] [2025-02-08 05:52:56,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 05:52:56,497 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-08 05:52:56,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:52:56,498 INFO L85 PathProgramCache]: Analyzing trace with hash -1401442470, now seen corresponding path program 1 times [2025-02-08 05:52:56,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:52:56,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785542321] [2025-02-08 05:52:56,498 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:52:56,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:52:56,532 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-02-08 05:52:56,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-02-08 05:52:56,547 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:52:56,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:52:56,805 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:52:56,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:52:56,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785542321] [2025-02-08 05:52:56,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785542321] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:52:56,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:52:56,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 05:52:56,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52391294] [2025-02-08 05:52:56,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:52:56,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 05:52:56,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:52:56,806 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 05:52:56,806 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 05:52:56,806 INFO L87 Difference]: Start difference. First operand 1365 states and 2028 transitions. Second operand has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:52:56,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 05:52:56,928 INFO L93 Difference]: Finished difference Result 1323 states and 1951 transitions. [2025-02-08 05:52:56,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 05:52:56,929 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83 [2025-02-08 05:52:56,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 05:52:56,933 INFO L225 Difference]: With dead ends: 1323 [2025-02-08 05:52:56,933 INFO L226 Difference]: Without dead ends: 1323 [2025-02-08 05:52:56,933 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-02-08 05:52:56,935 INFO L435 NwaCegarLoop]: 1891 mSDtfsCounter, 33 mSDsluCounter, 3766 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 5657 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 05:52:56,936 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 5657 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 05:52:56,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1323 states. [2025-02-08 05:52:56,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1323 to 1323. [2025-02-08 05:52:56,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1323 states, 815 states have (on average 1.7705521472392638) internal successors, (1443), 1316 states have internal predecessors, (1443), 505 states have call successors, (505), 3 states have call predecessors, (505), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 05:52:56,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1323 states to 1323 states and 1951 transitions. [2025-02-08 05:52:56,959 INFO L78 Accepts]: Start accepts. Automaton has 1323 states and 1951 transitions. Word has length 83 [2025-02-08 05:52:56,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 05:52:56,959 INFO L471 AbstractCegarLoop]: Abstraction has 1323 states and 1951 transitions. [2025-02-08 05:52:56,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:52:56,959 INFO L276 IsEmpty]: Start isEmpty. Operand 1323 states and 1951 transitions. [2025-02-08 05:52:56,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-02-08 05:52:56,961 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 05:52:56,961 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] [2025-02-08 05:52:56,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 05:52:56,962 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-08 05:52:56,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:52:56,962 INFO L85 PathProgramCache]: Analyzing trace with hash -1230862479, now seen corresponding path program 1 times [2025-02-08 05:52:56,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:52:56,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201131039] [2025-02-08 05:52:56,962 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:52:56,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:52:56,993 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-02-08 05:52:57,001 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-02-08 05:52:57,002 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:52:57,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:52:57,100 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:52:57,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:52:57,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201131039] [2025-02-08 05:52:57,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201131039] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:52:57,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:52:57,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 05:52:57,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609379959] [2025-02-08 05:52:57,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:52:57,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:52:57,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:52:57,103 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:52:57,103 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:52:57,103 INFO L87 Difference]: Start difference. First operand 1323 states and 1951 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:52:57,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 05:52:57,186 INFO L93 Difference]: Finished difference Result 1323 states and 1948 transitions. [2025-02-08 05:52:57,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:52:57,187 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83 [2025-02-08 05:52:57,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 05:52:57,191 INFO L225 Difference]: With dead ends: 1323 [2025-02-08 05:52:57,191 INFO L226 Difference]: Without dead ends: 1323 [2025-02-08 05:52:57,192 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-02-08 05:52:57,193 INFO L435 NwaCegarLoop]: 1905 mSDtfsCounter, 2 mSDsluCounter, 1883 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 3788 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 05:52:57,194 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 3788 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 05:52:57,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1323 states. [2025-02-08 05:52:57,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1323 to 1323. [2025-02-08 05:52:57,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1323 states, 815 states have (on average 1.7668711656441718) internal successors, (1440), 1316 states have internal predecessors, (1440), 505 states have call successors, (505), 3 states have call predecessors, (505), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 05:52:57,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1323 states to 1323 states and 1948 transitions. [2025-02-08 05:52:57,218 INFO L78 Accepts]: Start accepts. Automaton has 1323 states and 1948 transitions. Word has length 83 [2025-02-08 05:52:57,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 05:52:57,219 INFO L471 AbstractCegarLoop]: Abstraction has 1323 states and 1948 transitions. [2025-02-08 05:52:57,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:52:57,219 INFO L276 IsEmpty]: Start isEmpty. Operand 1323 states and 1948 transitions. [2025-02-08 05:52:57,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-02-08 05:52:57,223 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 05:52:57,223 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] [2025-02-08 05:52:57,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 05:52:57,224 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-08 05:52:57,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:52:57,224 INFO L85 PathProgramCache]: Analyzing trace with hash 241409748, now seen corresponding path program 1 times [2025-02-08 05:52:57,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:52:57,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988917734] [2025-02-08 05:52:57,224 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:52:57,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:52:57,275 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-02-08 05:52:57,287 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-02-08 05:52:57,287 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:52:57,287 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:52:57,381 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:52:57,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:52:57,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988917734] [2025-02-08 05:52:57,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988917734] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:52:57,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:52:57,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:52:57,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834030448] [2025-02-08 05:52:57,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:52:57,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:52:57,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:52:57,383 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:52:57,383 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:52:57,383 INFO L87 Difference]: Start difference. First operand 1323 states and 1948 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 2 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:52:57,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 05:52:57,515 INFO L93 Difference]: Finished difference Result 2546 states and 3766 transitions. [2025-02-08 05:52:57,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:52:57,515 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 2 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83 [2025-02-08 05:52:57,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 05:52:57,527 INFO L225 Difference]: With dead ends: 2546 [2025-02-08 05:52:57,527 INFO L226 Difference]: Without dead ends: 2546 [2025-02-08 05:52:57,527 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-02-08 05:52:57,528 INFO L435 NwaCegarLoop]: 2088 mSDtfsCounter, 1260 mSDsluCounter, 1897 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1260 SdHoareTripleChecker+Valid, 3985 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 05:52:57,528 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1260 Valid, 3985 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 05:52:57,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2546 states. [2025-02-08 05:52:57,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2546 to 2042. [2025-02-08 05:52:57,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2042 states, 1534 states have (on average 1.7959582790091264) internal successors, (2755), 2035 states have internal predecessors, (2755), 505 states have call successors, (505), 3 states have call predecessors, (505), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 05:52:57,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2042 states to 2042 states and 3263 transitions. [2025-02-08 05:52:57,579 INFO L78 Accepts]: Start accepts. Automaton has 2042 states and 3263 transitions. Word has length 83 [2025-02-08 05:52:57,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 05:52:57,580 INFO L471 AbstractCegarLoop]: Abstraction has 2042 states and 3263 transitions. [2025-02-08 05:52:57,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 2 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:52:57,580 INFO L276 IsEmpty]: Start isEmpty. Operand 2042 states and 3263 transitions. [2025-02-08 05:52:57,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-02-08 05:52:57,581 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 05:52:57,582 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] [2025-02-08 05:52:57,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 05:52:57,582 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-08 05:52:57,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:52:57,582 INFO L85 PathProgramCache]: Analyzing trace with hash -926442018, now seen corresponding path program 1 times [2025-02-08 05:52:57,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:52:57,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118656707] [2025-02-08 05:52:57,583 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:52:57,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:52:57,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-02-08 05:52:57,677 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-02-08 05:52:57,677 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:52:57,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:52:57,934 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-08 05:52:57,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:52:57,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118656707] [2025-02-08 05:52:57,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118656707] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:52:57,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:52:57,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 05:52:57,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733574057] [2025-02-08 05:52:57,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:52:57,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 05:52:57,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:52:57,936 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 05:52:57,936 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 05:52:57,936 INFO L87 Difference]: Start difference. First operand 2042 states and 3263 transitions. Second operand has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 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-02-08 05:52:58,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 05:52:58,565 INFO L93 Difference]: Finished difference Result 3763 states and 6081 transitions. [2025-02-08 05:52:58,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 05:52:58,565 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 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 98 [2025-02-08 05:52:58,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 05:52:58,576 INFO L225 Difference]: With dead ends: 3763 [2025-02-08 05:52:58,577 INFO L226 Difference]: Without dead ends: 3763 [2025-02-08 05:52:58,577 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-02-08 05:52:58,577 INFO L435 NwaCegarLoop]: 1931 mSDtfsCounter, 1416 mSDsluCounter, 3315 mSDsCounter, 0 mSdLazyCounter, 665 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1419 SdHoareTripleChecker+Valid, 5246 SdHoareTripleChecker+Invalid, 666 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 665 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-08 05:52:58,577 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1419 Valid, 5246 Invalid, 666 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 665 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-08 05:52:58,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3763 states. [2025-02-08 05:52:58,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3763 to 2044. [2025-02-08 05:52:58,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2044 states, 1536 states have (on average 1.794921875) internal successors, (2757), 2037 states have internal predecessors, (2757), 505 states have call successors, (505), 3 states have call predecessors, (505), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 05:52:58,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2044 states to 2044 states and 3265 transitions. [2025-02-08 05:52:58,620 INFO L78 Accepts]: Start accepts. Automaton has 2044 states and 3265 transitions. Word has length 98 [2025-02-08 05:52:58,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 05:52:58,621 INFO L471 AbstractCegarLoop]: Abstraction has 2044 states and 3265 transitions. [2025-02-08 05:52:58,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 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-02-08 05:52:58,621 INFO L276 IsEmpty]: Start isEmpty. Operand 2044 states and 3265 transitions. [2025-02-08 05:52:58,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-02-08 05:52:58,625 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 05:52:58,625 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] [2025-02-08 05:52:58,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 05:52:58,625 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-08 05:52:58,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:52:58,626 INFO L85 PathProgramCache]: Analyzing trace with hash -604348945, now seen corresponding path program 1 times [2025-02-08 05:52:58,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:52:58,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670288449] [2025-02-08 05:52:58,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:52:58,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:52:58,672 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-02-08 05:52:58,695 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-02-08 05:52:58,696 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:52:58,696 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:52:58,813 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-08 05:52:58,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:52:58,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670288449] [2025-02-08 05:52:58,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670288449] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:52:58,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:52:58,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 05:52:58,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173424757] [2025-02-08 05:52:58,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:52:58,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:52:58,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:52:58,815 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:52:58,815 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:52:58,815 INFO L87 Difference]: Start difference. First operand 2044 states and 3265 transitions. Second operand has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 05:52:58,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 05:52:58,912 INFO L93 Difference]: Finished difference Result 2084 states and 3305 transitions. [2025-02-08 05:52:58,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:52:58,912 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 154 [2025-02-08 05:52:58,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 05:52:58,918 INFO L225 Difference]: With dead ends: 2084 [2025-02-08 05:52:58,918 INFO L226 Difference]: Without dead ends: 2084 [2025-02-08 05:52:58,919 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-02-08 05:52:58,919 INFO L435 NwaCegarLoop]: 1891 mSDtfsCounter, 8 mSDsluCounter, 1876 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 3767 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 05:52:58,919 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 3767 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 05:52:58,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2084 states. [2025-02-08 05:52:58,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2084 to 2084. [2025-02-08 05:52:58,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2084 states, 1576 states have (on average 1.774746192893401) internal successors, (2797), 2077 states have internal predecessors, (2797), 505 states have call successors, (505), 3 states have call predecessors, (505), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 05:52:58,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2084 states to 2084 states and 3305 transitions. [2025-02-08 05:52:58,978 INFO L78 Accepts]: Start accepts. Automaton has 2084 states and 3305 transitions. Word has length 154 [2025-02-08 05:52:58,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 05:52:58,978 INFO L471 AbstractCegarLoop]: Abstraction has 2084 states and 3305 transitions. [2025-02-08 05:52:58,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 05:52:58,978 INFO L276 IsEmpty]: Start isEmpty. Operand 2084 states and 3305 transitions. [2025-02-08 05:52:58,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-02-08 05:52:58,979 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 05:52:58,979 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] [2025-02-08 05:52:58,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 05:52:58,980 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-08 05:52:58,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:52:58,980 INFO L85 PathProgramCache]: Analyzing trace with hash 578998352, now seen corresponding path program 1 times [2025-02-08 05:52:58,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:52:58,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975203347] [2025-02-08 05:52:58,980 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:52:58,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:52:59,017 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-02-08 05:52:59,038 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-02-08 05:52:59,038 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:52:59,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:52:59,207 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-08 05:52:59,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:52:59,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975203347] [2025-02-08 05:52:59,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975203347] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:52:59,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:52:59,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 05:52:59,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275927100] [2025-02-08 05:52:59,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:52:59,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 05:52:59,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:52:59,208 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 05:52:59,209 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 05:52:59,209 INFO L87 Difference]: Start difference. First operand 2084 states and 3305 transitions. Second operand has 4 states, 4 states have (on average 36.25) internal successors, (145), 4 states have internal predecessors, (145), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 05:52:59,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 05:52:59,297 INFO L93 Difference]: Finished difference Result 1960 states and 3105 transitions. [2025-02-08 05:52:59,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 05:52:59,297 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.25) internal successors, (145), 4 states have internal predecessors, (145), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 154 [2025-02-08 05:52:59,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 05:52:59,303 INFO L225 Difference]: With dead ends: 1960 [2025-02-08 05:52:59,303 INFO L226 Difference]: Without dead ends: 1960 [2025-02-08 05:52:59,303 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-02-08 05:52:59,304 INFO L435 NwaCegarLoop]: 1816 mSDtfsCounter, 32 mSDsluCounter, 3618 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 5434 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 05:52:59,304 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 5434 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 05:52:59,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1960 states. [2025-02-08 05:52:59,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1960 to 1960. [2025-02-08 05:52:59,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1960 states, 1452 states have (on average 1.7885674931129476) internal successors, (2597), 1953 states have internal predecessors, (2597), 505 states have call successors, (505), 3 states have call predecessors, (505), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 05:52:59,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1960 states to 1960 states and 3105 transitions. [2025-02-08 05:52:59,331 INFO L78 Accepts]: Start accepts. Automaton has 1960 states and 3105 transitions. Word has length 154 [2025-02-08 05:52:59,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 05:52:59,331 INFO L471 AbstractCegarLoop]: Abstraction has 1960 states and 3105 transitions. [2025-02-08 05:52:59,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.25) internal successors, (145), 4 states have internal predecessors, (145), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 05:52:59,331 INFO L276 IsEmpty]: Start isEmpty. Operand 1960 states and 3105 transitions. [2025-02-08 05:52:59,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-02-08 05:52:59,332 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 05:52:59,332 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] [2025-02-08 05:52:59,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 05:52:59,332 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-08 05:52:59,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:52:59,333 INFO L85 PathProgramCache]: Analyzing trace with hash 431250793, now seen corresponding path program 1 times [2025-02-08 05:52:59,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:52:59,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564744268] [2025-02-08 05:52:59,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:52:59,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:52:59,364 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-02-08 05:52:59,381 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-02-08 05:52:59,382 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:52:59,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:52:59,524 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 05:52:59,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:52:59,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564744268] [2025-02-08 05:52:59,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564744268] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:52:59,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:52:59,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:52:59,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875516387] [2025-02-08 05:52:59,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:52:59,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 05:52:59,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:52:59,526 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 05:52:59,526 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 05:52:59,526 INFO L87 Difference]: Start difference. First operand 1960 states and 3105 transitions. Second operand has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 05:52:59,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 05:52:59,912 INFO L93 Difference]: Finished difference Result 2542 states and 3711 transitions. [2025-02-08 05:52:59,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 05:52:59,912 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 154 [2025-02-08 05:52:59,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 05:52:59,919 INFO L225 Difference]: With dead ends: 2542 [2025-02-08 05:52:59,919 INFO L226 Difference]: Without dead ends: 2542 [2025-02-08 05:52:59,919 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-02-08 05:52:59,920 INFO L435 NwaCegarLoop]: 1898 mSDtfsCounter, 4976 mSDsluCounter, 2508 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4977 SdHoareTripleChecker+Valid, 4406 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 05:52:59,920 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4977 Valid, 4406 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 05:52:59,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2542 states. [2025-02-08 05:52:59,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2542 to 1369. [2025-02-08 05:52:59,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1369 states, 861 states have (on average 1.7119628339140534) internal successors, (1474), 1362 states have internal predecessors, (1474), 505 states have call successors, (505), 3 states have call predecessors, (505), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 05:52:59,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1369 states to 1369 states and 1982 transitions. [2025-02-08 05:52:59,942 INFO L78 Accepts]: Start accepts. Automaton has 1369 states and 1982 transitions. Word has length 154 [2025-02-08 05:52:59,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 05:52:59,943 INFO L471 AbstractCegarLoop]: Abstraction has 1369 states and 1982 transitions. [2025-02-08 05:52:59,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 05:52:59,943 INFO L276 IsEmpty]: Start isEmpty. Operand 1369 states and 1982 transitions. [2025-02-08 05:52:59,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-02-08 05:52:59,944 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 05:52:59,944 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] [2025-02-08 05:52:59,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 05:52:59,944 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-08 05:52:59,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:52:59,947 INFO L85 PathProgramCache]: Analyzing trace with hash 773101595, now seen corresponding path program 1 times [2025-02-08 05:52:59,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:52:59,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803570472] [2025-02-08 05:52:59,947 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:52:59,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:52:59,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-02-08 05:53:00,022 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-02-08 05:53:00,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:53:00,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:53:00,502 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 05:53:00,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:53:00,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803570472] [2025-02-08 05:53:00,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803570472] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 05:53:00,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [25110612] [2025-02-08 05:53:00,503 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:53:00,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:53:00,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:53:00,505 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 05:53:00,507 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-08 05:53:00,677 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-02-08 05:53:00,754 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-02-08 05:53:00,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:53:00,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:53:00,759 INFO L256 TraceCheckSpWp]: Trace formula consists of 772 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-08 05:53:00,766 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 05:53:00,784 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-08 05:53:00,970 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2025-02-08 05:53:00,978 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-02-08 05:53:00,984 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 05:53:00,987 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 05:53:01,143 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 05:53:01,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [25110612] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 05:53:01,143 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 05:53:01,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 11 [2025-02-08 05:53:01,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004762250] [2025-02-08 05:53:01,144 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 05:53:01,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-08 05:53:01,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:53:01,145 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-08 05:53:01,145 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2025-02-08 05:53:01,145 INFO L87 Difference]: Start difference. First operand 1369 states and 1982 transitions. Second operand has 11 states, 11 states have (on average 29.272727272727273) internal successors, (322), 11 states have internal predecessors, (322), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-02-08 05:53:02,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 05:53:02,634 INFO L93 Difference]: Finished difference Result 4082 states and 5925 transitions. [2025-02-08 05:53:02,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-08 05:53:02,634 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 29.272727272727273) internal successors, (322), 11 states have internal predecessors, (322), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 164 [2025-02-08 05:53:02,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 05:53:02,644 INFO L225 Difference]: With dead ends: 4082 [2025-02-08 05:53:02,645 INFO L226 Difference]: Without dead ends: 4082 [2025-02-08 05:53:02,645 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 321 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2025-02-08 05:53:02,645 INFO L435 NwaCegarLoop]: 1860 mSDtfsCounter, 6713 mSDsluCounter, 8531 mSDsCounter, 0 mSdLazyCounter, 1286 mSolverCounterSat, 511 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6717 SdHoareTripleChecker+Valid, 10391 SdHoareTripleChecker+Invalid, 1797 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 511 IncrementalHoareTripleChecker+Valid, 1286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-02-08 05:53:02,646 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6717 Valid, 10391 Invalid, 1797 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [511 Valid, 1286 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-02-08 05:53:02,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4082 states. [2025-02-08 05:53:02,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4082 to 1711. [2025-02-08 05:53:02,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1711 states, 1199 states have (on average 1.6013344453711427) internal successors, (1920), 1700 states have internal predecessors, (1920), 508 states have call successors, (508), 4 states have call predecessors, (508), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 05:53:02,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1711 states to 1711 states and 2434 transitions. [2025-02-08 05:53:02,682 INFO L78 Accepts]: Start accepts. Automaton has 1711 states and 2434 transitions. Word has length 164 [2025-02-08 05:53:02,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 05:53:02,683 INFO L471 AbstractCegarLoop]: Abstraction has 1711 states and 2434 transitions. [2025-02-08 05:53:02,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 29.272727272727273) internal successors, (322), 11 states have internal predecessors, (322), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-02-08 05:53:02,683 INFO L276 IsEmpty]: Start isEmpty. Operand 1711 states and 2434 transitions. [2025-02-08 05:53:02,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 390 [2025-02-08 05:53:02,686 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 05:53:02,686 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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] [2025-02-08 05:53:02,695 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-08 05:53:02,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-02-08 05:53:02,887 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-08 05:53:02,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:53:02,888 INFO L85 PathProgramCache]: Analyzing trace with hash 171386657, now seen corresponding path program 1 times [2025-02-08 05:53:02,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:53:02,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686555297] [2025-02-08 05:53:02,888 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:53:02,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:53:02,977 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 389 statements into 1 equivalence classes. [2025-02-08 05:53:03,092 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 389 of 389 statements. [2025-02-08 05:53:03,092 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:53:03,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:53:05,259 INFO L134 CoverageAnalysis]: Checked inductivity of 456 backedges. 0 proven. 452 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 05:53:05,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:53:05,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686555297] [2025-02-08 05:53:05,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686555297] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 05:53:05,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1455160336] [2025-02-08 05:53:05,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:53:05,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:53:05,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:53:05,264 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 05:53:05,264 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-08 05:53:05,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 389 statements into 1 equivalence classes. [2025-02-08 05:53:05,758 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 389 of 389 statements. [2025-02-08 05:53:05,758 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:53:05,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:53:05,770 INFO L256 TraceCheckSpWp]: Trace formula consists of 1903 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-08 05:53:05,783 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 05:53:05,791 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-08 05:53:05,932 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2025-02-08 05:53:06,046 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-02-08 05:53:06,146 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-02-08 05:53:06,240 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-02-08 05:53:06,247 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-02-08 05:53:06,253 INFO L134 CoverageAnalysis]: Checked inductivity of 456 backedges. 0 proven. 452 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 05:53:06,254 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 05:53:06,720 INFO L134 CoverageAnalysis]: Checked inductivity of 456 backedges. 0 proven. 452 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 05:53:06,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1455160336] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 05:53:06,720 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 05:53:06,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8, 8] total 20 [2025-02-08 05:53:06,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960991441] [2025-02-08 05:53:06,720 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 05:53:06,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-02-08 05:53:06,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:53:06,722 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-02-08 05:53:06,724 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=236, Unknown=0, NotChecked=0, Total=380 [2025-02-08 05:53:06,725 INFO L87 Difference]: Start difference. First operand 1711 states and 2434 transitions. Second operand has 20 states, 20 states have (on average 38.9) internal successors, (778), 20 states have internal predecessors, (778), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-02-08 05:53:09,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 05:53:09,054 INFO L93 Difference]: Finished difference Result 9390 states and 13661 transitions. [2025-02-08 05:53:09,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-02-08 05:53:09,055 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 38.9) internal successors, (778), 20 states have internal predecessors, (778), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 389 [2025-02-08 05:53:09,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 05:53:09,076 INFO L225 Difference]: With dead ends: 9390 [2025-02-08 05:53:09,077 INFO L226 Difference]: Without dead ends: 9390 [2025-02-08 05:53:09,077 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 798 GetRequests, 771 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=223, Invalid=427, Unknown=0, NotChecked=0, Total=650 [2025-02-08 05:53:09,077 INFO L435 NwaCegarLoop]: 1860 mSDtfsCounter, 15960 mSDsluCounter, 15251 mSDsCounter, 0 mSdLazyCounter, 3507 mSolverCounterSat, 524 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15970 SdHoareTripleChecker+Valid, 17111 SdHoareTripleChecker+Invalid, 4031 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 524 IncrementalHoareTripleChecker+Valid, 3507 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-02-08 05:53:09,077 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15970 Valid, 17111 Invalid, 4031 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [524 Valid, 3507 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-02-08 05:53:09,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9390 states. [2025-02-08 05:53:09,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9390 to 2563. [2025-02-08 05:53:09,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2563 states, 2045 states have (on average 1.484596577017115) internal successors, (3036), 2546 states have internal predecessors, (3036), 514 states have call successors, (514), 4 states have call predecessors, (514), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-02-08 05:53:09,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2563 states to 2563 states and 3562 transitions. [2025-02-08 05:53:09,135 INFO L78 Accepts]: Start accepts. Automaton has 2563 states and 3562 transitions. Word has length 389 [2025-02-08 05:53:09,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 05:53:09,135 INFO L471 AbstractCegarLoop]: Abstraction has 2563 states and 3562 transitions. [2025-02-08 05:53:09,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 38.9) internal successors, (778), 20 states have internal predecessors, (778), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-02-08 05:53:09,136 INFO L276 IsEmpty]: Start isEmpty. Operand 2563 states and 3562 transitions. [2025-02-08 05:53:09,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 840 [2025-02-08 05:53:09,147 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 05:53:09,147 INFO L218 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 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] [2025-02-08 05:53:09,157 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-08 05:53:09,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:53:09,348 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-08 05:53:09,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:53:09,348 INFO L85 PathProgramCache]: Analyzing trace with hash -128895391, now seen corresponding path program 2 times [2025-02-08 05:53:09,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:53:09,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163862914] [2025-02-08 05:53:09,348 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 05:53:09,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:53:09,541 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 839 statements into 2 equivalence classes. [2025-02-08 05:53:09,553 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 74 of 839 statements. [2025-02-08 05:53:09,554 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 05:53:09,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:53:09,705 INFO L134 CoverageAnalysis]: Checked inductivity of 3381 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3381 trivial. 0 not checked. [2025-02-08 05:53:09,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:53:09,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163862914] [2025-02-08 05:53:09,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163862914] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:53:09,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:53:09,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 05:53:09,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955697529] [2025-02-08 05:53:09,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:53:09,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:53:09,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:53:09,706 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:53:09,706 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:53:09,707 INFO L87 Difference]: Start difference. First operand 2563 states and 3562 transitions. Second operand has 6 states, 6 states have (on average 26.333333333333332) internal successors, (158), 6 states have internal predecessors, (158), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 05:53:09,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 05:53:09,982 INFO L93 Difference]: Finished difference Result 2568 states and 3569 transitions. [2025-02-08 05:53:09,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:53:09,983 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.333333333333332) internal successors, (158), 6 states have internal predecessors, (158), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 839 [2025-02-08 05:53:09,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 05:53:09,988 INFO L225 Difference]: With dead ends: 2568 [2025-02-08 05:53:09,988 INFO L226 Difference]: Without dead ends: 2568 [2025-02-08 05:53:09,988 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-08 05:53:09,988 INFO L435 NwaCegarLoop]: 1823 mSDtfsCounter, 14 mSDsluCounter, 7028 mSDsCounter, 0 mSdLazyCounter, 407 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 8851 SdHoareTripleChecker+Invalid, 407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 05:53:09,989 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 8851 Invalid, 407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 407 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 05:53:09,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2568 states. [2025-02-08 05:53:10,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2568 to 2565. [2025-02-08 05:53:10,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2565 states, 2047 states have (on average 1.484123106985833) internal successors, (3038), 2548 states have internal predecessors, (3038), 514 states have call successors, (514), 4 states have call predecessors, (514), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-02-08 05:53:10,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2565 states to 2565 states and 3564 transitions. [2025-02-08 05:53:10,015 INFO L78 Accepts]: Start accepts. Automaton has 2565 states and 3564 transitions. Word has length 839 [2025-02-08 05:53:10,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 05:53:10,016 INFO L471 AbstractCegarLoop]: Abstraction has 2565 states and 3564 transitions. [2025-02-08 05:53:10,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.333333333333332) internal successors, (158), 6 states have internal predecessors, (158), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 05:53:10,017 INFO L276 IsEmpty]: Start isEmpty. Operand 2565 states and 3564 transitions. [2025-02-08 05:53:10,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 841 [2025-02-08 05:53:10,029 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 05:53:10,030 INFO L218 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 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] [2025-02-08 05:53:10,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 05:53:10,030 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-08 05:53:10,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:53:10,031 INFO L85 PathProgramCache]: Analyzing trace with hash -405925648, now seen corresponding path program 1 times [2025-02-08 05:53:10,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:53:10,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487654250] [2025-02-08 05:53:10,031 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:53:10,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:53:10,203 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 840 statements into 1 equivalence classes. [2025-02-08 05:53:10,479 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 840 of 840 statements. [2025-02-08 05:53:10,479 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:53:10,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:53:11,741 INFO L134 CoverageAnalysis]: Checked inductivity of 3381 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3381 trivial. 0 not checked. [2025-02-08 05:53:11,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:53:11,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487654250] [2025-02-08 05:53:11,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487654250] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:53:11,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:53:11,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 05:53:11,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87161878] [2025-02-08 05:53:11,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:53:11,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 05:53:11,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:53:11,743 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 05:53:11,743 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-08 05:53:11,743 INFO L87 Difference]: Start difference. First operand 2565 states and 3564 transitions. Second operand has 7 states, 7 states have (on average 22.714285714285715) internal successors, (159), 7 states have internal predecessors, (159), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 05:53:12,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 05:53:12,030 INFO L93 Difference]: Finished difference Result 2570 states and 3570 transitions. [2025-02-08 05:53:12,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 05:53:12,031 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 22.714285714285715) internal successors, (159), 7 states have internal predecessors, (159), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 840 [2025-02-08 05:53:12,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 05:53:12,041 INFO L225 Difference]: With dead ends: 2570 [2025-02-08 05:53:12,041 INFO L226 Difference]: Without dead ends: 2570 [2025-02-08 05:53:12,041 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-02-08 05:53:12,041 INFO L435 NwaCegarLoop]: 1818 mSDtfsCounter, 15 mSDsluCounter, 8804 mSDsCounter, 0 mSdLazyCounter, 491 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 10622 SdHoareTripleChecker+Invalid, 492 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 05:53:12,042 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 10622 Invalid, 492 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 491 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 05:53:12,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2570 states. [2025-02-08 05:53:12,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2570 to 2569. [2025-02-08 05:53:12,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2569 states, 2051 states have (on average 1.4836665041443198) internal successors, (3043), 2552 states have internal predecessors, (3043), 514 states have call successors, (514), 4 states have call predecessors, (514), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-02-08 05:53:12,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2569 states to 2569 states and 3569 transitions. [2025-02-08 05:53:12,098 INFO L78 Accepts]: Start accepts. Automaton has 2569 states and 3569 transitions. Word has length 840 [2025-02-08 05:53:12,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 05:53:12,099 INFO L471 AbstractCegarLoop]: Abstraction has 2569 states and 3569 transitions. [2025-02-08 05:53:12,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.714285714285715) internal successors, (159), 7 states have internal predecessors, (159), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 05:53:12,099 INFO L276 IsEmpty]: Start isEmpty. Operand 2569 states and 3569 transitions. [2025-02-08 05:53:12,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 841 [2025-02-08 05:53:12,114 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 05:53:12,114 INFO L218 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 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] [2025-02-08 05:53:12,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 05:53:12,115 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-08 05:53:12,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:53:12,116 INFO L85 PathProgramCache]: Analyzing trace with hash -1024469911, now seen corresponding path program 1 times [2025-02-08 05:53:12,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:53:12,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943315590] [2025-02-08 05:53:12,116 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:53:12,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:53:12,380 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 840 statements into 1 equivalence classes. [2025-02-08 05:53:12,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 840 of 840 statements. [2025-02-08 05:53:12,663 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:53:12,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:53:21,622 INFO L134 CoverageAnalysis]: Checked inductivity of 3381 backedges. 0 proven. 3377 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 05:53:21,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:53:21,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943315590] [2025-02-08 05:53:21,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943315590] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 05:53:21,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1404530723] [2025-02-08 05:53:21,623 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:53:21,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:53:21,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:53:21,625 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 05:53:21,627 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-08 05:53:22,231 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 840 statements into 1 equivalence classes. [2025-02-08 05:53:22,718 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 840 of 840 statements. [2025-02-08 05:53:22,718 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:53:22,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:53:22,737 INFO L256 TraceCheckSpWp]: Trace formula consists of 4166 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-02-08 05:53:22,758 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 05:53:22,764 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-08 05:53:22,941 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2025-02-08 05:53:23,028 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-02-08 05:53:23,100 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-02-08 05:53:23,179 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-02-08 05:53:23,260 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-02-08 05:53:23,334 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-02-08 05:53:23,421 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-02-08 05:53:23,501 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-02-08 05:53:23,588 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-02-08 05:53:23,662 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-02-08 05:53:23,669 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-02-08 05:53:23,681 INFO L134 CoverageAnalysis]: Checked inductivity of 3381 backedges. 0 proven. 3377 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 05:53:23,681 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 05:53:24,548 INFO L134 CoverageAnalysis]: Checked inductivity of 3381 backedges. 0 proven. 3377 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 05:53:24,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1404530723] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 05:53:24,548 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 05:53:24,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 14, 14] total 38 [2025-02-08 05:53:24,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532567699] [2025-02-08 05:53:24,548 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 05:53:24,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-02-08 05:53:24,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:53:24,552 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-02-08 05:53:24,552 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=570, Invalid=836, Unknown=0, NotChecked=0, Total=1406 [2025-02-08 05:53:24,552 INFO L87 Difference]: Start difference. First operand 2569 states and 3569 transitions. Second operand has 38 states, 38 states have (on average 44.5) internal successors, (1691), 38 states have internal predecessors, (1691), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-02-08 05:53:28,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 05:53:28,525 INFO L93 Difference]: Finished difference Result 17856 states and 25920 transitions. [2025-02-08 05:53:28,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2025-02-08 05:53:28,526 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 44.5) internal successors, (1691), 38 states have internal predecessors, (1691), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 840 [2025-02-08 05:53:28,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 05:53:28,583 INFO L225 Difference]: With dead ends: 17856 [2025-02-08 05:53:28,583 INFO L226 Difference]: Without dead ends: 17856 [2025-02-08 05:53:28,584 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1719 GetRequests, 1668 SyntacticMatches, 3 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 802 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=871, Invalid=1579, Unknown=0, NotChecked=0, Total=2450 [2025-02-08 05:53:28,585 INFO L435 NwaCegarLoop]: 1860 mSDtfsCounter, 56447 mSDsluCounter, 29417 mSDsCounter, 0 mSdLazyCounter, 2422 mSolverCounterSat, 561 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56469 SdHoareTripleChecker+Valid, 31277 SdHoareTripleChecker+Invalid, 2983 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 561 IncrementalHoareTripleChecker+Valid, 2422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-02-08 05:53:28,585 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56469 Valid, 31277 Invalid, 2983 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [561 Valid, 2422 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-02-08 05:53:28,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17856 states. [2025-02-08 05:53:28,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17856 to 4273. [2025-02-08 05:53:28,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4273 states, 3743 states have (on average 1.4092973550627839) internal successors, (5275), 4244 states have internal predecessors, (5275), 526 states have call successors, (526), 4 states have call predecessors, (526), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-02-08 05:53:28,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4273 states to 4273 states and 5825 transitions. [2025-02-08 05:53:28,664 INFO L78 Accepts]: Start accepts. Automaton has 4273 states and 5825 transitions. Word has length 840 [2025-02-08 05:53:28,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 05:53:28,665 INFO L471 AbstractCegarLoop]: Abstraction has 4273 states and 5825 transitions. [2025-02-08 05:53:28,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 44.5) internal successors, (1691), 38 states have internal predecessors, (1691), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-02-08 05:53:28,665 INFO L276 IsEmpty]: Start isEmpty. Operand 4273 states and 5825 transitions. [2025-02-08 05:53:28,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1741 [2025-02-08 05:53:28,687 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 05:53:28,687 INFO L218 NwaCegarLoop]: trace histogram [23, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 21, 21, 21, 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] [2025-02-08 05:53:28,702 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-08 05:53:28,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:53:28,888 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-08 05:53:28,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:53:28,889 INFO L85 PathProgramCache]: Analyzing trace with hash 1341388265, now seen corresponding path program 2 times [2025-02-08 05:53:28,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:53:28,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948670344] [2025-02-08 05:53:28,889 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 05:53:28,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:53:29,295 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1740 statements into 2 equivalence classes. [2025-02-08 05:53:29,307 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 75 of 1740 statements. [2025-02-08 05:53:29,307 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 05:53:29,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:53:29,415 INFO L134 CoverageAnalysis]: Checked inductivity of 17331 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17331 trivial. 0 not checked. [2025-02-08 05:53:29,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:53:29,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948670344] [2025-02-08 05:53:29,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948670344] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:53:29,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:53:29,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 05:53:29,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577242879] [2025-02-08 05:53:29,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:53:29,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 05:53:29,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:53:29,417 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 05:53:29,417 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 05:53:29,417 INFO L87 Difference]: Start difference. First operand 4273 states and 5825 transitions. Second operand has 4 states, 4 states have (on average 39.75) internal successors, (159), 4 states have internal predecessors, (159), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 05:53:29,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 05:53:29,532 INFO L93 Difference]: Finished difference Result 4273 states and 5824 transitions. [2025-02-08 05:53:29,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 05:53:29,533 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.75) internal successors, (159), 4 states have internal predecessors, (159), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 1740 [2025-02-08 05:53:29,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 05:53:29,541 INFO L225 Difference]: With dead ends: 4273 [2025-02-08 05:53:29,541 INFO L226 Difference]: Without dead ends: 4273 [2025-02-08 05:53:29,543 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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-02-08 05:53:29,546 INFO L435 NwaCegarLoop]: 1827 mSDtfsCounter, 17 mSDsluCounter, 3539 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 5366 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 05:53:29,546 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 5366 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 05:53:29,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4273 states. [2025-02-08 05:53:29,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4273 to 4273. [2025-02-08 05:53:29,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4273 states, 3743 states have (on average 1.4090301896874164) internal successors, (5274), 4244 states have internal predecessors, (5274), 526 states have call successors, (526), 4 states have call predecessors, (526), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-02-08 05:53:29,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4273 states to 4273 states and 5824 transitions. [2025-02-08 05:53:29,585 INFO L78 Accepts]: Start accepts. Automaton has 4273 states and 5824 transitions. Word has length 1740 [2025-02-08 05:53:29,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 05:53:29,587 INFO L471 AbstractCegarLoop]: Abstraction has 4273 states and 5824 transitions. [2025-02-08 05:53:29,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.75) internal successors, (159), 4 states have internal predecessors, (159), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 05:53:29,587 INFO L276 IsEmpty]: Start isEmpty. Operand 4273 states and 5824 transitions. [2025-02-08 05:53:29,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1742 [2025-02-08 05:53:29,602 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 05:53:29,602 INFO L218 NwaCegarLoop]: trace histogram [23, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 21, 21, 21, 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] [2025-02-08 05:53:29,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-08 05:53:29,603 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-08 05:53:29,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:53:29,604 INFO L85 PathProgramCache]: Analyzing trace with hash -1175566072, now seen corresponding path program 1 times [2025-02-08 05:53:29,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:53:29,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431619073] [2025-02-08 05:53:29,604 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:53:29,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:53:29,983 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1741 statements into 1 equivalence classes. [2025-02-08 05:53:30,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1741 of 1741 statements. [2025-02-08 05:53:30,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:53:30,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:53:33,962 INFO L134 CoverageAnalysis]: Checked inductivity of 17331 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17331 trivial. 0 not checked. [2025-02-08 05:53:33,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:53:33,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431619073] [2025-02-08 05:53:33,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431619073] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:53:33,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:53:33,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-08 05:53:33,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831982255] [2025-02-08 05:53:33,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:53:33,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-08 05:53:33,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:53:33,966 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-08 05:53:33,966 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-08 05:53:33,966 INFO L87 Difference]: Start difference. First operand 4273 states and 5824 transitions. Second operand has 9 states, 9 states have (on average 17.77777777777778) internal successors, (160), 9 states have internal predecessors, (160), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 05:53:34,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 05:53:34,306 INFO L93 Difference]: Finished difference Result 4286 states and 5842 transitions. [2025-02-08 05:53:34,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 05:53:34,306 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 17.77777777777778) internal successors, (160), 9 states have internal predecessors, (160), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 1741 [2025-02-08 05:53:34,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 05:53:34,316 INFO L225 Difference]: With dead ends: 4286 [2025-02-08 05:53:34,316 INFO L226 Difference]: Without dead ends: 4286 [2025-02-08 05:53:34,317 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-02-08 05:53:34,318 INFO L435 NwaCegarLoop]: 1819 mSDtfsCounter, 33 mSDsluCounter, 12387 mSDsCounter, 0 mSdLazyCounter, 657 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 14206 SdHoareTripleChecker+Invalid, 660 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 657 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 05:53:34,318 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 14206 Invalid, 660 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 657 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 05:53:34,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4286 states. [2025-02-08 05:53:34,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4286 to 4283. [2025-02-08 05:53:34,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4283 states, 3753 states have (on average 1.4090061284305888) internal successors, (5288), 4254 states have internal predecessors, (5288), 526 states have call successors, (526), 4 states have call predecessors, (526), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-02-08 05:53:34,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4283 states to 4283 states and 5838 transitions. [2025-02-08 05:53:34,354 INFO L78 Accepts]: Start accepts. Automaton has 4283 states and 5838 transitions. Word has length 1741 [2025-02-08 05:53:34,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 05:53:34,356 INFO L471 AbstractCegarLoop]: Abstraction has 4283 states and 5838 transitions. [2025-02-08 05:53:34,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 17.77777777777778) internal successors, (160), 9 states have internal predecessors, (160), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 05:53:34,356 INFO L276 IsEmpty]: Start isEmpty. Operand 4283 states and 5838 transitions. [2025-02-08 05:53:34,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1742 [2025-02-08 05:53:34,371 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 05:53:34,372 INFO L218 NwaCegarLoop]: trace histogram [23, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 21, 21, 21, 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] [2025-02-08 05:53:34,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-08 05:53:34,372 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-08 05:53:34,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:53:34,374 INFO L85 PathProgramCache]: Analyzing trace with hash 372354116, now seen corresponding path program 1 times [2025-02-08 05:53:34,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:53:34,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119894383] [2025-02-08 05:53:34,374 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:53:34,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:53:34,755 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1741 statements into 1 equivalence classes. [2025-02-08 05:53:35,276 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1741 of 1741 statements. [2025-02-08 05:53:35,277 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:53:35,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat