./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test2-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test2-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 dbea62dc4a872959247118f049e63d406eb1e848bb1ed8397f1082fdec77074c --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 21:59:11,309 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 21:59:11,357 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2025-01-09 21:59:11,364 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 21:59:11,367 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 21:59:11,383 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 21:59:11,383 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 21:59:11,384 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 21:59:11,384 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 21:59:11,384 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 21:59:11,384 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 21:59:11,385 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 21:59:11,385 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 21:59:11,385 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 21:59:11,385 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 21:59:11,385 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 21:59:11,386 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 21:59:11,386 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 21:59:11,386 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 21:59:11,386 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 21:59:11,386 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 21:59:11,386 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 21:59:11,386 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-09 21:59:11,386 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-09 21:59:11,387 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 21:59:11,387 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 21:59:11,387 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 21:59:11,387 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 21:59:11,387 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 21:59:11,387 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 21:59:11,387 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 21:59:11,387 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 21:59:11,387 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 21:59:11,387 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:59:11,387 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 21:59:11,387 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:59:11,388 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:59:11,388 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 21:59:11,388 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:59:11,388 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 21:59:11,388 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:59:11,388 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:59:11,388 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 21:59:11,388 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 21:59:11,389 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 21:59:11,389 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 21:59:11,389 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 21:59:11,389 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 21:59:11,389 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 21:59:11,389 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 21:59:11,389 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 -> dbea62dc4a872959247118f049e63d406eb1e848bb1ed8397f1082fdec77074c [2025-01-09 21:59:11,599 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 21:59:11,608 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 21:59:11,609 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 21:59:11,610 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 21:59:11,610 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 21:59:11,611 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_SAX_test2-1.i [2025-01-09 21:59:12,732 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/df3d408b2/579e67b0ccff4eb3ace835de49c158ad/FLAGed4d8dcd8 [2025-01-09 21:59:13,065 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 21:59:13,066 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test2-1.i [2025-01-09 21:59:13,075 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/df3d408b2/579e67b0ccff4eb3ace835de49c158ad/FLAGed4d8dcd8 [2025-01-09 21:59:13,320 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/df3d408b2/579e67b0ccff4eb3ace835de49c158ad [2025-01-09 21:59:13,322 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 21:59:13,327 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 21:59:13,328 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 21:59:13,332 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 21:59:13,335 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 21:59:13,336 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:59:13" (1/1) ... [2025-01-09 21:59:13,337 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@298f6692 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:59:13, skipping insertion in model container [2025-01-09 21:59:13,338 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:59:13" (1/1) ... [2025-01-09 21:59:13,370 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 21:59:13,668 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-09 21:59:13,698 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-09 21:59:13,702 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-09 21:59:13,705 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-09 21:59:13,708 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-09 21:59:13,726 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-09 21:59:13,727 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-09 21:59:13,728 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-09 21:59:13,728 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-09 21:59:13,732 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:59:13,740 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 21:59:13,796 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:59:13,823 INFO L204 MainTranslator]: Completed translation [2025-01-09 21:59:13,824 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:59:13 WrapperNode [2025-01-09 21:59:13,824 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 21:59:13,825 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 21:59:13,825 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 21:59:13,825 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 21:59:13,829 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:59:13" (1/1) ... [2025-01-09 21:59:13,843 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:59:13" (1/1) ... [2025-01-09 21:59:13,886 INFO L138 Inliner]: procedures = 208, calls = 229, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1264 [2025-01-09 21:59:13,887 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 21:59:13,887 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 21:59:13,887 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 21:59:13,887 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 21:59:13,894 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:59:13" (1/1) ... [2025-01-09 21:59:13,896 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:59:13" (1/1) ... [2025-01-09 21:59:13,902 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:59:13" (1/1) ... [2025-01-09 21:59:13,951 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-01-09 21:59:13,954 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:59:13" (1/1) ... [2025-01-09 21:59:13,954 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:59:13" (1/1) ... [2025-01-09 21:59:13,984 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:59:13" (1/1) ... [2025-01-09 21:59:13,989 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:59:13" (1/1) ... [2025-01-09 21:59:14,001 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:59:13" (1/1) ... [2025-01-09 21:59:14,007 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:59:13" (1/1) ... [2025-01-09 21:59:14,009 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:59:13" (1/1) ... [2025-01-09 21:59:14,014 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 21:59:14,014 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 21:59:14,014 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 21:59:14,014 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 21:59:14,015 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:59:13" (1/1) ... [2025-01-09 21:59:14,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:59:14,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:59:14,042 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 21:59:14,045 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 21:59:14,065 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2025-01-09 21:59:14,065 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2025-01-09 21:59:14,065 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-01-09 21:59:14,065 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-01-09 21:59:14,065 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-01-09 21:59:14,065 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-01-09 21:59:14,065 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-01-09 21:59:14,065 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-01-09 21:59:14,065 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-09 21:59:14,065 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-09 21:59:14,067 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-09 21:59:14,067 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-01-09 21:59:14,067 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 21:59:14,067 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 21:59:14,067 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 21:59:14,067 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-09 21:59:14,067 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-01-09 21:59:14,067 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-01-09 21:59:14,067 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 21:59:14,067 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 21:59:14,067 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-09 21:59:14,067 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 21:59:14,067 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 21:59:14,067 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-09 21:59:14,067 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-09 21:59:14,067 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-01-09 21:59:14,067 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 21:59:14,067 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 21:59:14,067 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 21:59:14,067 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 21:59:14,067 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 21:59:14,225 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 21:59:14,226 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 21:59:15,236 INFO L? ?]: Removed 304 outVars from TransFormulas that were not future-live. [2025-01-09 21:59:15,236 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 21:59:15,246 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 21:59:15,247 INFO L312 CfgBuilder]: Removed 27 assume(true) statements. [2025-01-09 21:59:15,247 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:59:15 BoogieIcfgContainer [2025-01-09 21:59:15,247 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 21:59:15,248 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 21:59:15,249 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 21:59:15,252 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 21:59:15,252 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:59:13" (1/3) ... [2025-01-09 21:59:15,253 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38f0991c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:59:15, skipping insertion in model container [2025-01-09 21:59:15,253 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:59:13" (2/3) ... [2025-01-09 21:59:15,253 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38f0991c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:59:15, skipping insertion in model container [2025-01-09 21:59:15,253 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:59:15" (3/3) ... [2025-01-09 21:59:15,254 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_SAX_test2-1.i [2025-01-09 21:59:15,264 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 21:59:15,265 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_SAX_test2-1.i that has 6 procedures, 392 locations, 1 initial locations, 33 loop locations, and 2 error locations. [2025-01-09 21:59:15,303 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:59:15,313 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;@4924dc33, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:59:15,313 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-01-09 21:59:15,318 INFO L276 IsEmpty]: Start isEmpty. Operand has 384 states, 368 states have (on average 1.6141304347826086) internal successors, (594), 377 states have internal predecessors, (594), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 6 states have call predecessors, (10), 10 states have call successors, (10) [2025-01-09 21:59:15,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-01-09 21:59:15,321 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 21:59:15,323 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:59:15,323 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 21:59:15,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:59:15,326 INFO L85 PathProgramCache]: Analyzing trace with hash -1579356390, now seen corresponding path program 1 times [2025-01-09 21:59:15,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:59:15,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491455007] [2025-01-09 21:59:15,331 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:59:15,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:59:15,385 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-09 21:59:15,393 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-09 21:59:15,393 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:59:15,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:59:15,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:59:15,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:59:15,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491455007] [2025-01-09 21:59:15,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491455007] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:59:15,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:59:15,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:59:15,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023583586] [2025-01-09 21:59:15,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:59:15,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 21:59:15,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:59:15,435 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 21:59:15,436 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 21:59:15,438 INFO L87 Difference]: Start difference. First operand has 384 states, 368 states have (on average 1.6141304347826086) internal successors, (594), 377 states have internal predecessors, (594), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 6 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:59:15,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 21:59:15,463 INFO L93 Difference]: Finished difference Result 382 states and 555 transitions. [2025-01-09 21:59:15,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 21:59:15,464 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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 7 [2025-01-09 21:59:15,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 21:59:15,470 INFO L225 Difference]: With dead ends: 382 [2025-01-09 21:59:15,471 INFO L226 Difference]: Without dead ends: 380 [2025-01-09 21:59:15,472 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-01-09 21:59:15,474 INFO L435 NwaCegarLoop]: 555 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 555 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 21:59:15,474 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 555 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 21:59:15,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2025-01-09 21:59:15,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 380. [2025-01-09 21:59:15,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 380 states, 366 states have (on average 1.4617486338797814) internal successors, (535), 373 states have internal predecessors, (535), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2025-01-09 21:59:15,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 553 transitions. [2025-01-09 21:59:15,512 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 553 transitions. Word has length 7 [2025-01-09 21:59:15,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 21:59:15,513 INFO L471 AbstractCegarLoop]: Abstraction has 380 states and 553 transitions. [2025-01-09 21:59:15,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:59:15,513 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 553 transitions. [2025-01-09 21:59:15,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-01-09 21:59:15,513 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 21:59:15,513 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:59:15,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 21:59:15,514 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 21:59:15,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:59:15,514 INFO L85 PathProgramCache]: Analyzing trace with hash -877250352, now seen corresponding path program 1 times [2025-01-09 21:59:15,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:59:15,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780053650] [2025-01-09 21:59:15,514 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:59:15,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:59:15,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-09 21:59:15,529 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-09 21:59:15,530 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:59:15,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:59:15,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:59:15,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:59:15,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780053650] [2025-01-09 21:59:15,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1780053650] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:59:15,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:59:15,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 21:59:15,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168141051] [2025-01-09 21:59:15,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:59:15,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 21:59:15,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:59:15,666 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 21:59:15,666 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 21:59:15,666 INFO L87 Difference]: Start difference. First operand 380 states and 553 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:59:15,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 21:59:15,828 INFO L93 Difference]: Finished difference Result 743 states and 1090 transitions. [2025-01-09 21:59:15,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 21:59:15,829 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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 9 [2025-01-09 21:59:15,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 21:59:15,832 INFO L225 Difference]: With dead ends: 743 [2025-01-09 21:59:15,832 INFO L226 Difference]: Without dead ends: 743 [2025-01-09 21:59:15,832 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-01-09 21:59:15,836 INFO L435 NwaCegarLoop]: 535 mSDtfsCounter, 517 mSDsluCounter, 1056 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 525 SdHoareTripleChecker+Valid, 1591 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 21:59:15,837 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [525 Valid, 1591 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 21:59:15,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 743 states. [2025-01-09 21:59:15,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 743 to 382. [2025-01-09 21:59:15,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 382 states, 368 states have (on average 1.4592391304347827) internal successors, (537), 375 states have internal predecessors, (537), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2025-01-09 21:59:15,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 555 transitions. [2025-01-09 21:59:15,859 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 555 transitions. Word has length 9 [2025-01-09 21:59:15,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 21:59:15,860 INFO L471 AbstractCegarLoop]: Abstraction has 382 states and 555 transitions. [2025-01-09 21:59:15,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:59:15,860 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 555 transitions. [2025-01-09 21:59:15,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-01-09 21:59:15,862 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 21:59:15,862 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:59:15,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 21:59:15,862 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 21:59:15,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:59:15,865 INFO L85 PathProgramCache]: Analyzing trace with hash 1909968268, now seen corresponding path program 1 times [2025-01-09 21:59:15,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:59:15,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307887920] [2025-01-09 21:59:15,865 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:59:15,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:59:15,916 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-01-09 21:59:15,955 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-01-09 21:59:15,961 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:59:15,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:59:16,160 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:59:16,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:59:16,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307887920] [2025-01-09 21:59:16,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307887920] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:59:16,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:59:16,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 21:59:16,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903298573] [2025-01-09 21:59:16,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:59:16,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 21:59:16,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:59:16,162 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 21:59:16,162 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 21:59:16,162 INFO L87 Difference]: Start difference. First operand 382 states and 555 transitions. Second operand has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:59:16,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 21:59:16,219 INFO L93 Difference]: Finished difference Result 385 states and 551 transitions. [2025-01-09 21:59:16,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 21:59:16,220 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 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 85 [2025-01-09 21:59:16,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 21:59:16,221 INFO L225 Difference]: With dead ends: 385 [2025-01-09 21:59:16,221 INFO L226 Difference]: Without dead ends: 385 [2025-01-09 21:59:16,221 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-01-09 21:59:16,222 INFO L435 NwaCegarLoop]: 526 mSDtfsCounter, 105 mSDsluCounter, 959 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 1485 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 21:59:16,222 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 1485 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 21:59:16,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2025-01-09 21:59:16,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 382. [2025-01-09 21:59:16,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 382 states, 368 states have (on average 1.440217391304348) internal successors, (530), 375 states have internal predecessors, (530), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2025-01-09 21:59:16,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 548 transitions. [2025-01-09 21:59:16,240 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 548 transitions. Word has length 85 [2025-01-09 21:59:16,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 21:59:16,240 INFO L471 AbstractCegarLoop]: Abstraction has 382 states and 548 transitions. [2025-01-09 21:59:16,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:59:16,240 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 548 transitions. [2025-01-09 21:59:16,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-01-09 21:59:16,242 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 21:59:16,242 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:59:16,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 21:59:16,242 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 21:59:16,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:59:16,243 INFO L85 PathProgramCache]: Analyzing trace with hash 380494336, now seen corresponding path program 1 times [2025-01-09 21:59:16,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:59:16,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035482572] [2025-01-09 21:59:16,243 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:59:16,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:59:16,272 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-01-09 21:59:16,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-01-09 21:59:16,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:59:16,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:59:16,396 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:59:16,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:59:16,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035482572] [2025-01-09 21:59:16,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035482572] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:59:16,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:59:16,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 21:59:16,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479314361] [2025-01-09 21:59:16,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:59:16,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:59:16,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:59:16,398 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:59:16,398 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:59:16,398 INFO L87 Difference]: Start difference. First operand 382 states and 548 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:59:16,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 21:59:16,441 INFO L93 Difference]: Finished difference Result 660 states and 962 transitions. [2025-01-09 21:59:16,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:59:16,443 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 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 85 [2025-01-09 21:59:16,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 21:59:16,445 INFO L225 Difference]: With dead ends: 660 [2025-01-09 21:59:16,446 INFO L226 Difference]: Without dead ends: 660 [2025-01-09 21:59:16,446 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:59:16,446 INFO L435 NwaCegarLoop]: 743 mSDtfsCounter, 348 mSDsluCounter, 532 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 353 SdHoareTripleChecker+Valid, 1275 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 21:59:16,446 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [353 Valid, 1275 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 21:59:16,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states. [2025-01-09 21:59:16,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 656. [2025-01-09 21:59:16,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 656 states, 637 states have (on average 1.4615384615384615) internal successors, (931), 649 states have internal predecessors, (931), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2025-01-09 21:59:16,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 656 states and 959 transitions. [2025-01-09 21:59:16,458 INFO L78 Accepts]: Start accepts. Automaton has 656 states and 959 transitions. Word has length 85 [2025-01-09 21:59:16,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 21:59:16,459 INFO L471 AbstractCegarLoop]: Abstraction has 656 states and 959 transitions. [2025-01-09 21:59:16,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:59:16,459 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 959 transitions. [2025-01-09 21:59:16,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-01-09 21:59:16,461 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 21:59:16,461 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:59:16,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 21:59:16,461 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 21:59:16,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:59:16,462 INFO L85 PathProgramCache]: Analyzing trace with hash 209796900, now seen corresponding path program 1 times [2025-01-09 21:59:16,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:59:16,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314000122] [2025-01-09 21:59:16,462 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:59:16,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:59:16,507 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-01-09 21:59:16,526 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-01-09 21:59:16,529 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:59:16,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:59:16,648 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 21:59:16,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:59:16,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314000122] [2025-01-09 21:59:16,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314000122] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:59:16,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:59:16,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 21:59:16,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572540329] [2025-01-09 21:59:16,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:59:16,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:59:16,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:59:16,650 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:59:16,650 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:59:16,650 INFO L87 Difference]: Start difference. First operand 656 states and 959 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 21:59:16,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 21:59:16,690 INFO L93 Difference]: Finished difference Result 668 states and 971 transitions. [2025-01-09 21:59:16,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:59:16,691 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 100 [2025-01-09 21:59:16,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 21:59:16,694 INFO L225 Difference]: With dead ends: 668 [2025-01-09 21:59:16,694 INFO L226 Difference]: Without dead ends: 668 [2025-01-09 21:59:16,694 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-01-09 21:59:16,696 INFO L435 NwaCegarLoop]: 540 mSDtfsCounter, 1 mSDsluCounter, 518 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1058 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 21:59:16,697 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1058 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 21:59:16,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 668 states. [2025-01-09 21:59:16,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 668 to 668. [2025-01-09 21:59:16,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 668 states, 649 states have (on average 1.453004622496148) internal successors, (943), 661 states have internal predecessors, (943), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2025-01-09 21:59:16,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 668 states to 668 states and 971 transitions. [2025-01-09 21:59:16,734 INFO L78 Accepts]: Start accepts. Automaton has 668 states and 971 transitions. Word has length 100 [2025-01-09 21:59:16,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 21:59:16,734 INFO L471 AbstractCegarLoop]: Abstraction has 668 states and 971 transitions. [2025-01-09 21:59:16,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 21:59:16,735 INFO L276 IsEmpty]: Start isEmpty. Operand 668 states and 971 transitions. [2025-01-09 21:59:16,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-01-09 21:59:16,736 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 21:59:16,737 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:59:16,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 21:59:16,737 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 21:59:16,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:59:16,737 INFO L85 PathProgramCache]: Analyzing trace with hash 702423074, now seen corresponding path program 1 times [2025-01-09 21:59:16,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:59:16,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192985829] [2025-01-09 21:59:16,741 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:59:16,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:59:16,783 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-01-09 21:59:16,831 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-01-09 21:59:16,832 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:59:16,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:59:17,072 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-09 21:59:17,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:59:17,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192985829] [2025-01-09 21:59:17,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192985829] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:59:17,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:59:17,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 21:59:17,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193016197] [2025-01-09 21:59:17,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:59:17,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 21:59:17,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:59:17,074 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 21:59:17,074 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 21:59:17,074 INFO L87 Difference]: Start difference. First operand 668 states and 971 transitions. Second operand has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 21:59:17,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 21:59:17,168 INFO L93 Difference]: Finished difference Result 914 states and 1334 transitions. [2025-01-09 21:59:17,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 21:59:17,168 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 100 [2025-01-09 21:59:17,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 21:59:17,172 INFO L225 Difference]: With dead ends: 914 [2025-01-09 21:59:17,173 INFO L226 Difference]: Without dead ends: 914 [2025-01-09 21:59:17,173 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-01-09 21:59:17,175 INFO L435 NwaCegarLoop]: 572 mSDtfsCounter, 506 mSDsluCounter, 1086 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 514 SdHoareTripleChecker+Valid, 1658 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 21:59:17,176 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [514 Valid, 1658 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 21:59:17,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 914 states. [2025-01-09 21:59:17,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 914 to 670. [2025-01-09 21:59:17,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 670 states, 651 states have (on average 1.4516129032258065) internal successors, (945), 663 states have internal predecessors, (945), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2025-01-09 21:59:17,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 973 transitions. [2025-01-09 21:59:17,197 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 973 transitions. Word has length 100 [2025-01-09 21:59:17,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 21:59:17,198 INFO L471 AbstractCegarLoop]: Abstraction has 670 states and 973 transitions. [2025-01-09 21:59:17,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 21:59:17,199 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 973 transitions. [2025-01-09 21:59:17,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-01-09 21:59:17,203 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 21:59:17,203 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] [2025-01-09 21:59:17,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 21:59:17,203 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 21:59:17,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:59:17,204 INFO L85 PathProgramCache]: Analyzing trace with hash 910762525, now seen corresponding path program 1 times [2025-01-09 21:59:17,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:59:17,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833517382] [2025-01-09 21:59:17,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:59:17,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:59:17,241 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-01-09 21:59:17,263 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-01-09 21:59:17,264 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:59:17,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:59:17,457 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-09 21:59:17,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:59:17,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833517382] [2025-01-09 21:59:17,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833517382] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:59:17,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:59:17,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:59:17,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364991619] [2025-01-09 21:59:17,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:59:17,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 21:59:17,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:59:17,459 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 21:59:17,459 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 21:59:17,459 INFO L87 Difference]: Start difference. First operand 670 states and 973 transitions. Second operand has 5 states, 5 states have (on average 29.4) internal successors, (147), 5 states have internal predecessors, (147), 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-01-09 21:59:17,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 21:59:17,518 INFO L93 Difference]: Finished difference Result 676 states and 965 transitions. [2025-01-09 21:59:17,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 21:59:17,518 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.4) internal successors, (147), 5 states have internal predecessors, (147), 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 156 [2025-01-09 21:59:17,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 21:59:17,520 INFO L225 Difference]: With dead ends: 676 [2025-01-09 21:59:17,520 INFO L226 Difference]: Without dead ends: 676 [2025-01-09 21:59:17,521 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 21:59:17,521 INFO L435 NwaCegarLoop]: 519 mSDtfsCounter, 88 mSDsluCounter, 1452 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 1971 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 21:59:17,521 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 1971 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 21:59:17,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 676 states. [2025-01-09 21:59:17,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 676 to 670. [2025-01-09 21:59:17,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 670 states, 651 states have (on average 1.4301075268817205) internal successors, (931), 663 states have internal predecessors, (931), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2025-01-09 21:59:17,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 959 transitions. [2025-01-09 21:59:17,533 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 959 transitions. Word has length 156 [2025-01-09 21:59:17,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 21:59:17,533 INFO L471 AbstractCegarLoop]: Abstraction has 670 states and 959 transitions. [2025-01-09 21:59:17,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.4) internal successors, (147), 5 states have internal predecessors, (147), 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-01-09 21:59:17,533 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 959 transitions. [2025-01-09 21:59:17,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-01-09 21:59:17,534 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 21:59:17,534 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] [2025-01-09 21:59:17,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 21:59:17,535 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 21:59:17,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:59:17,535 INFO L85 PathProgramCache]: Analyzing trace with hash -260751599, now seen corresponding path program 1 times [2025-01-09 21:59:17,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:59:17,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582027002] [2025-01-09 21:59:17,536 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:59:17,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:59:17,571 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-01-09 21:59:17,584 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-01-09 21:59:17,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:59:17,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:59:17,684 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-09 21:59:17,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:59:17,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582027002] [2025-01-09 21:59:17,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582027002] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:59:17,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:59:17,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 21:59:17,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858418751] [2025-01-09 21:59:17,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:59:17,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 21:59:17,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:59:17,685 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 21:59:17,686 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 21:59:17,686 INFO L87 Difference]: Start difference. First operand 670 states and 959 transitions. Second operand has 4 states, 4 states have (on average 36.75) internal successors, (147), 4 states have internal predecessors, (147), 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-01-09 21:59:17,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 21:59:17,731 INFO L93 Difference]: Finished difference Result 574 states and 799 transitions. [2025-01-09 21:59:17,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 21:59:17,731 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.75) internal successors, (147), 4 states have internal predecessors, (147), 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 156 [2025-01-09 21:59:17,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 21:59:17,734 INFO L225 Difference]: With dead ends: 574 [2025-01-09 21:59:17,734 INFO L226 Difference]: Without dead ends: 574 [2025-01-09 21:59:17,735 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-01-09 21:59:17,735 INFO L435 NwaCegarLoop]: 444 mSDtfsCounter, 9 mSDsluCounter, 869 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 1313 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 21:59:17,735 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 1313 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 21:59:17,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2025-01-09 21:59:17,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 574. [2025-01-09 21:59:17,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 574 states, 555 states have (on average 1.3891891891891892) internal successors, (771), 567 states have internal predecessors, (771), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2025-01-09 21:59:17,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 799 transitions. [2025-01-09 21:59:17,763 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 799 transitions. Word has length 156 [2025-01-09 21:59:17,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 21:59:17,763 INFO L471 AbstractCegarLoop]: Abstraction has 574 states and 799 transitions. [2025-01-09 21:59:17,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.75) internal successors, (147), 4 states have internal predecessors, (147), 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-01-09 21:59:17,763 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 799 transitions. [2025-01-09 21:59:17,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-01-09 21:59:17,765 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 21:59:17,768 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] [2025-01-09 21:59:17,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 21:59:17,769 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 21:59:17,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:59:17,769 INFO L85 PathProgramCache]: Analyzing trace with hash 1111055699, now seen corresponding path program 1 times [2025-01-09 21:59:17,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:59:17,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325307185] [2025-01-09 21:59:17,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:59:17,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:59:17,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-01-09 21:59:17,825 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-01-09 21:59:17,825 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:59:17,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:59:17,966 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 21:59:17,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:59:17,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325307185] [2025-01-09 21:59:17,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325307185] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:59:17,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:59:17,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:59:17,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027862519] [2025-01-09 21:59:17,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:59:17,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 21:59:17,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:59:17,968 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 21:59:17,968 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 21:59:17,969 INFO L87 Difference]: Start difference. First operand 574 states and 799 transitions. Second operand has 5 states, 5 states have (on average 29.6) internal successors, (148), 5 states have internal predecessors, (148), 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-01-09 21:59:18,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 21:59:18,257 INFO L93 Difference]: Finished difference Result 658 states and 907 transitions. [2025-01-09 21:59:18,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 21:59:18,258 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.6) internal successors, (148), 5 states have internal predecessors, (148), 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 156 [2025-01-09 21:59:18,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 21:59:18,260 INFO L225 Difference]: With dead ends: 658 [2025-01-09 21:59:18,260 INFO L226 Difference]: Without dead ends: 658 [2025-01-09 21:59:18,260 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-01-09 21:59:18,262 INFO L435 NwaCegarLoop]: 639 mSDtfsCounter, 946 mSDsluCounter, 828 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 952 SdHoareTripleChecker+Valid, 1467 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 21:59:18,263 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [952 Valid, 1467 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 21:59:18,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 658 states. [2025-01-09 21:59:18,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 658 to 477. [2025-01-09 21:59:18,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 477 states, 463 states have (on average 1.388768898488121) internal successors, (643), 470 states have internal predecessors, (643), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2025-01-09 21:59:18,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 661 transitions. [2025-01-09 21:59:18,273 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 661 transitions. Word has length 156 [2025-01-09 21:59:18,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 21:59:18,273 INFO L471 AbstractCegarLoop]: Abstraction has 477 states and 661 transitions. [2025-01-09 21:59:18,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.6) internal successors, (148), 5 states have internal predecessors, (148), 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-01-09 21:59:18,273 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 661 transitions. [2025-01-09 21:59:18,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-01-09 21:59:18,275 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 21:59:18,275 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:59:18,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 21:59:18,275 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 21:59:18,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:59:18,275 INFO L85 PathProgramCache]: Analyzing trace with hash 1162293762, now seen corresponding path program 1 times [2025-01-09 21:59:18,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:59:18,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532396416] [2025-01-09 21:59:18,276 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:59:18,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:59:18,324 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-01-09 21:59:18,366 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-01-09 21:59:18,366 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:59:18,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:59:18,849 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 21:59:18,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:59:18,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532396416] [2025-01-09 21:59:18,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532396416] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 21:59:18,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [818972432] [2025-01-09 21:59:18,850 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:59:18,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:59:18,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:59:18,852 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-01-09 21:59:18,854 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-01-09 21:59:19,042 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-01-09 21:59:19,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-01-09 21:59:19,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:59:19,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:59:19,136 INFO L256 TraceCheckSpWp]: Trace formula consists of 772 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 21:59:19,143 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:59:19,162 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-01-09 21:59:19,357 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 19 treesize of output 11 [2025-01-09 21:59:19,371 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 21:59:19,371 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 21:59:19,521 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 21:59:19,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [818972432] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 21:59:19,521 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 21:59:19,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 5] total 12 [2025-01-09 21:59:19,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629252353] [2025-01-09 21:59:19,521 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 21:59:19,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 21:59:19,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:59:19,522 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 21:59:19,523 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2025-01-09 21:59:19,523 INFO L87 Difference]: Start difference. First operand 477 states and 661 transitions. Second operand has 12 states, 12 states have (on average 27.25) internal successors, (327), 12 states have internal predecessors, (327), 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-01-09 21:59:19,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 21:59:19,757 INFO L93 Difference]: Finished difference Result 1355 states and 1880 transitions. [2025-01-09 21:59:19,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 21:59:19,758 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 27.25) internal successors, (327), 12 states have internal predecessors, (327), 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 166 [2025-01-09 21:59:19,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 21:59:19,762 INFO L225 Difference]: With dead ends: 1355 [2025-01-09 21:59:19,762 INFO L226 Difference]: Without dead ends: 1355 [2025-01-09 21:59:19,762 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 340 GetRequests, 324 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2025-01-09 21:59:19,762 INFO L435 NwaCegarLoop]: 694 mSDtfsCounter, 2862 mSDsluCounter, 4113 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2876 SdHoareTripleChecker+Valid, 4807 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 21:59:19,763 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2876 Valid, 4807 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 21:59:19,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1355 states. [2025-01-09 21:59:19,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1355 to 920. [2025-01-09 21:59:19,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 920 states, 902 states have (on average 1.3880266075388026) internal successors, (1252), 909 states have internal predecessors, (1252), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-09 21:59:19,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 920 states to 920 states and 1276 transitions. [2025-01-09 21:59:19,777 INFO L78 Accepts]: Start accepts. Automaton has 920 states and 1276 transitions. Word has length 166 [2025-01-09 21:59:19,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 21:59:19,778 INFO L471 AbstractCegarLoop]: Abstraction has 920 states and 1276 transitions. [2025-01-09 21:59:19,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 27.25) internal successors, (327), 12 states have internal predecessors, (327), 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-01-09 21:59:19,778 INFO L276 IsEmpty]: Start isEmpty. Operand 920 states and 1276 transitions. [2025-01-09 21:59:19,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 395 [2025-01-09 21:59:19,781 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 21:59:19,781 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, 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, 1] [2025-01-09 21:59:19,789 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 21:59:19,982 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-01-09 21:59:19,982 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 21:59:19,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:59:19,983 INFO L85 PathProgramCache]: Analyzing trace with hash 481277528, now seen corresponding path program 1 times [2025-01-09 21:59:19,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:59:19,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228157813] [2025-01-09 21:59:19,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:59:19,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:59:20,073 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 394 statements into 1 equivalence classes. [2025-01-09 21:59:20,195 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 394 of 394 statements. [2025-01-09 21:59:20,195 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:59:20,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:59:22,503 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 458 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 21:59:22,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:59:22,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228157813] [2025-01-09 21:59:22,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228157813] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 21:59:22,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [546792031] [2025-01-09 21:59:22,504 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:59:22,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:59:22,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:59:22,508 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-01-09 21:59:22,508 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-01-09 21:59:22,802 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 394 statements into 1 equivalence classes. [2025-01-09 21:59:23,022 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 394 of 394 statements. [2025-01-09 21:59:23,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:59:23,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:59:23,031 INFO L256 TraceCheckSpWp]: Trace formula consists of 1903 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-09 21:59:23,047 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:59:23,049 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-01-09 21:59:23,212 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 19 treesize of output 11 [2025-01-09 21:59:23,317 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 19 treesize of output 11 [2025-01-09 21:59:23,420 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 19 treesize of output 11 [2025-01-09 21:59:23,525 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 19 treesize of output 11 [2025-01-09 21:59:23,541 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 458 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 21:59:23,543 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 21:59:23,973 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 458 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 21:59:23,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [546792031] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 21:59:23,974 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 21:59:23,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 8] total 24 [2025-01-09 21:59:23,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432151772] [2025-01-09 21:59:23,974 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 21:59:23,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-01-09 21:59:23,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:59:23,976 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-01-09 21:59:23,976 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=370, Unknown=0, NotChecked=0, Total=552 [2025-01-09 21:59:23,976 INFO L87 Difference]: Start difference. First operand 920 states and 1276 transitions. Second operand has 24 states, 24 states have (on average 42.125) internal successors, (1011), 24 states have internal predecessors, (1011), 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-01-09 21:59:24,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 21:59:24,629 INFO L93 Difference]: Finished difference Result 2867 states and 3995 transitions. [2025-01-09 21:59:24,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-01-09 21:59:24,630 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 42.125) internal successors, (1011), 24 states have internal predecessors, (1011), 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 394 [2025-01-09 21:59:24,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 21:59:24,637 INFO L225 Difference]: With dead ends: 2867 [2025-01-09 21:59:24,637 INFO L226 Difference]: Without dead ends: 2867 [2025-01-09 21:59:24,638 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 811 GetRequests, 777 SyntacticMatches, 3 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 358 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=318, Invalid=738, Unknown=0, NotChecked=0, Total=1056 [2025-01-09 21:59:24,638 INFO L435 NwaCegarLoop]: 1788 mSDtfsCounter, 6893 mSDsluCounter, 12073 mSDsCounter, 0 mSdLazyCounter, 583 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6928 SdHoareTripleChecker+Valid, 13861 SdHoareTripleChecker+Invalid, 642 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 21:59:24,638 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6928 Valid, 13861 Invalid, 642 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 583 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 21:59:24,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2867 states. [2025-01-09 21:59:24,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2867 to 2072. [2025-01-09 21:59:24,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2072 states, 2048 states have (on average 1.3935546875) internal successors, (2854), 2055 states have internal predecessors, (2854), 19 states have call successors, (19), 4 states have call predecessors, (19), 3 states have return successors, (17), 13 states have call predecessors, (17), 17 states have call successors, (17) [2025-01-09 21:59:24,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2072 states to 2072 states and 2890 transitions. [2025-01-09 21:59:24,669 INFO L78 Accepts]: Start accepts. Automaton has 2072 states and 2890 transitions. Word has length 394 [2025-01-09 21:59:24,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 21:59:24,670 INFO L471 AbstractCegarLoop]: Abstraction has 2072 states and 2890 transitions. [2025-01-09 21:59:24,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 42.125) internal successors, (1011), 24 states have internal predecessors, (1011), 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-01-09 21:59:24,671 INFO L276 IsEmpty]: Start isEmpty. Operand 2072 states and 2890 transitions. [2025-01-09 21:59:24,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 851 [2025-01-09 21:59:24,683 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 21:59:24,683 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, 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-01-09 21:59:24,694 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-01-09 21:59:24,884 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-01-09 21:59:24,885 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 21:59:24,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:59:24,886 INFO L85 PathProgramCache]: Analyzing trace with hash -113756668, now seen corresponding path program 2 times [2025-01-09 21:59:24,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:59:24,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095059643] [2025-01-09 21:59:24,886 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 21:59:24,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:59:25,075 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 850 statements into 2 equivalence classes. [2025-01-09 21:59:25,097 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 75 of 850 statements. [2025-01-09 21:59:25,097 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 21:59:25,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:59:25,250 INFO L134 CoverageAnalysis]: Checked inductivity of 3426 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3426 trivial. 0 not checked. [2025-01-09 21:59:25,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:59:25,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095059643] [2025-01-09 21:59:25,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095059643] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:59:25,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:59:25,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 21:59:25,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912415269] [2025-01-09 21:59:25,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:59:25,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 21:59:25,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:59:25,251 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 21:59:25,251 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-01-09 21:59:25,251 INFO L87 Difference]: Start difference. First operand 2072 states and 2890 transitions. Second operand has 8 states, 8 states have (on average 20.0) internal successors, (160), 8 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-01-09 21:59:25,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 21:59:25,521 INFO L93 Difference]: Finished difference Result 2077 states and 2895 transitions. [2025-01-09 21:59:25,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 21:59:25,521 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 20.0) internal successors, (160), 8 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 850 [2025-01-09 21:59:25,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 21:59:25,529 INFO L225 Difference]: With dead ends: 2077 [2025-01-09 21:59:25,529 INFO L226 Difference]: Without dead ends: 2077 [2025-01-09 21:59:25,529 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-01-09 21:59:25,529 INFO L435 NwaCegarLoop]: 436 mSDtfsCounter, 34 mSDsluCounter, 1842 mSDsCounter, 0 mSdLazyCounter, 417 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 2278 SdHoareTripleChecker+Invalid, 419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 21:59:25,529 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 2278 Invalid, 419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 417 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 21:59:25,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2077 states. [2025-01-09 21:59:25,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2077 to 2076. [2025-01-09 21:59:25,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2076 states, 2052 states have (on average 1.3927875243664718) internal successors, (2858), 2059 states have internal predecessors, (2858), 19 states have call successors, (19), 4 states have call predecessors, (19), 3 states have return successors, (17), 13 states have call predecessors, (17), 17 states have call successors, (17) [2025-01-09 21:59:25,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2076 states to 2076 states and 2894 transitions. [2025-01-09 21:59:25,556 INFO L78 Accepts]: Start accepts. Automaton has 2076 states and 2894 transitions. Word has length 850 [2025-01-09 21:59:25,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 21:59:25,557 INFO L471 AbstractCegarLoop]: Abstraction has 2076 states and 2894 transitions. [2025-01-09 21:59:25,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 20.0) internal successors, (160), 8 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-01-09 21:59:25,557 INFO L276 IsEmpty]: Start isEmpty. Operand 2076 states and 2894 transitions. [2025-01-09 21:59:25,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 852 [2025-01-09 21:59:25,570 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 21:59:25,571 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, 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, 1] [2025-01-09 21:59:25,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 21:59:25,572 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 21:59:25,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:59:25,572 INFO L85 PathProgramCache]: Analyzing trace with hash -2038204040, now seen corresponding path program 1 times [2025-01-09 21:59:25,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:59:25,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971394520] [2025-01-09 21:59:25,573 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:59:25,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:59:25,756 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 851 statements into 1 equivalence classes. [2025-01-09 21:59:26,025 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 851 of 851 statements. [2025-01-09 21:59:26,025 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:59:26,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:59:28,309 INFO L134 CoverageAnalysis]: Checked inductivity of 3426 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3426 trivial. 0 not checked. [2025-01-09 21:59:28,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:59:28,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971394520] [2025-01-09 21:59:28,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971394520] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:59:28,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:59:28,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 21:59:28,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706011613] [2025-01-09 21:59:28,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:59:28,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 21:59:28,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:59:28,311 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 21:59:28,311 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 21:59:28,312 INFO L87 Difference]: Start difference. First operand 2076 states and 2894 transitions. Second operand has 7 states, 7 states have (on average 23.0) internal successors, (161), 7 states have internal predecessors, (161), 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-01-09 21:59:28,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 21:59:28,625 INFO L93 Difference]: Finished difference Result 2081 states and 2900 transitions. [2025-01-09 21:59:28,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 21:59:28,626 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 7 states have internal predecessors, (161), 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 851 [2025-01-09 21:59:28,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 21:59:28,632 INFO L225 Difference]: With dead ends: 2081 [2025-01-09 21:59:28,633 INFO L226 Difference]: Without dead ends: 2081 [2025-01-09 21:59:28,633 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-01-09 21:59:28,634 INFO L435 NwaCegarLoop]: 443 mSDtfsCounter, 9 mSDsluCounter, 1825 mSDsCounter, 0 mSdLazyCounter, 427 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 2268 SdHoareTripleChecker+Invalid, 428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 21:59:28,634 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 2268 Invalid, 428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 427 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 21:59:28,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2081 states. [2025-01-09 21:59:28,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2081 to 2080. [2025-01-09 21:59:28,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2080 states, 2056 states have (on average 1.392509727626459) internal successors, (2863), 2063 states have internal predecessors, (2863), 19 states have call successors, (19), 4 states have call predecessors, (19), 3 states have return successors, (17), 13 states have call predecessors, (17), 17 states have call successors, (17) [2025-01-09 21:59:28,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2080 states to 2080 states and 2899 transitions. [2025-01-09 21:59:28,667 INFO L78 Accepts]: Start accepts. Automaton has 2080 states and 2899 transitions. Word has length 851 [2025-01-09 21:59:28,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 21:59:28,668 INFO L471 AbstractCegarLoop]: Abstraction has 2080 states and 2899 transitions. [2025-01-09 21:59:28,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 7 states have internal predecessors, (161), 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-01-09 21:59:28,669 INFO L276 IsEmpty]: Start isEmpty. Operand 2080 states and 2899 transitions. [2025-01-09 21:59:28,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 852 [2025-01-09 21:59:28,676 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 21:59:28,676 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, 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, 1] [2025-01-09 21:59:28,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 21:59:28,676 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 21:59:28,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:59:28,677 INFO L85 PathProgramCache]: Analyzing trace with hash 298942988, now seen corresponding path program 1 times [2025-01-09 21:59:28,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:59:28,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285805975] [2025-01-09 21:59:28,678 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:59:28,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:59:28,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 851 statements into 1 equivalence classes. [2025-01-09 21:59:29,107 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 851 of 851 statements. [2025-01-09 21:59:29,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:59:29,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:59:30,389 INFO L134 CoverageAnalysis]: Checked inductivity of 3426 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3426 trivial. 0 not checked. [2025-01-09 21:59:30,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:59:30,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285805975] [2025-01-09 21:59:30,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285805975] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:59:30,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:59:30,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 21:59:30,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809888810] [2025-01-09 21:59:30,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:59:30,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 21:59:30,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:59:30,392 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 21:59:30,393 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 21:59:30,393 INFO L87 Difference]: Start difference. First operand 2080 states and 2899 transitions. Second operand has 8 states, 8 states have (on average 20.125) internal successors, (161), 8 states have internal predecessors, (161), 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-01-09 21:59:30,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 21:59:30,705 INFO L93 Difference]: Finished difference Result 2085 states and 2905 transitions. [2025-01-09 21:59:30,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 21:59:30,706 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 20.125) internal successors, (161), 8 states have internal predecessors, (161), 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 851 [2025-01-09 21:59:30,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 21:59:30,712 INFO L225 Difference]: With dead ends: 2085 [2025-01-09 21:59:30,712 INFO L226 Difference]: Without dead ends: 2085 [2025-01-09 21:59:30,713 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 21:59:30,713 INFO L435 NwaCegarLoop]: 436 mSDtfsCounter, 10 mSDsluCounter, 1864 mSDsCounter, 0 mSdLazyCounter, 421 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 2300 SdHoareTripleChecker+Invalid, 422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 21:59:30,713 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 2300 Invalid, 422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 421 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 21:59:30,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2085 states. [2025-01-09 21:59:30,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2085 to 2080. [2025-01-09 21:59:30,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2080 states, 2056 states have (on average 1.392509727626459) internal successors, (2863), 2063 states have internal predecessors, (2863), 19 states have call successors, (19), 4 states have call predecessors, (19), 3 states have return successors, (17), 13 states have call predecessors, (17), 17 states have call successors, (17) [2025-01-09 21:59:30,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2080 states to 2080 states and 2899 transitions. [2025-01-09 21:59:30,751 INFO L78 Accepts]: Start accepts. Automaton has 2080 states and 2899 transitions. Word has length 851 [2025-01-09 21:59:30,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 21:59:30,752 INFO L471 AbstractCegarLoop]: Abstraction has 2080 states and 2899 transitions. [2025-01-09 21:59:30,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 20.125) internal successors, (161), 8 states have internal predecessors, (161), 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-01-09 21:59:30,753 INFO L276 IsEmpty]: Start isEmpty. Operand 2080 states and 2899 transitions. [2025-01-09 21:59:30,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 853 [2025-01-09 21:59:30,763 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 21:59:30,764 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, 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, 1, 1] [2025-01-09 21:59:30,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 21:59:30,764 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 21:59:30,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:59:30,765 INFO L85 PathProgramCache]: Analyzing trace with hash -2129416592, now seen corresponding path program 1 times [2025-01-09 21:59:30,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:59:30,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617488140] [2025-01-09 21:59:30,765 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:59:30,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:59:31,036 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 852 statements into 1 equivalence classes. [2025-01-09 21:59:31,319 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 852 of 852 statements. [2025-01-09 21:59:31,319 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:59:31,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:59:32,803 INFO L134 CoverageAnalysis]: Checked inductivity of 3426 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3426 trivial. 0 not checked. [2025-01-09 21:59:32,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:59:32,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617488140] [2025-01-09 21:59:32,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617488140] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:59:32,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:59:32,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 21:59:32,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418370930] [2025-01-09 21:59:32,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:59:32,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 21:59:32,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:59:32,806 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 21:59:32,806 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 21:59:32,806 INFO L87 Difference]: Start difference. First operand 2080 states and 2899 transitions. Second operand has 9 states, 9 states have (on average 18.0) internal successors, (162), 9 states have internal predecessors, (162), 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-01-09 21:59:33,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 21:59:33,170 INFO L93 Difference]: Finished difference Result 2091 states and 2913 transitions. [2025-01-09 21:59:33,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 21:59:33,171 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 18.0) internal successors, (162), 9 states have internal predecessors, (162), 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 852 [2025-01-09 21:59:33,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 21:59:33,177 INFO L225 Difference]: With dead ends: 2091 [2025-01-09 21:59:33,177 INFO L226 Difference]: Without dead ends: 2091 [2025-01-09 21:59:33,177 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-01-09 21:59:33,178 INFO L435 NwaCegarLoop]: 444 mSDtfsCounter, 27 mSDsluCounter, 2697 mSDsCounter, 0 mSdLazyCounter, 561 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 3141 SdHoareTripleChecker+Invalid, 564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 561 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 21:59:33,178 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 3141 Invalid, 564 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 561 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 21:59:33,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2091 states. [2025-01-09 21:59:33,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2091 to 2088. [2025-01-09 21:59:33,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2088 states, 2064 states have (on average 1.3919573643410852) internal successors, (2873), 2071 states have internal predecessors, (2873), 19 states have call successors, (19), 4 states have call predecessors, (19), 3 states have return successors, (17), 13 states have call predecessors, (17), 17 states have call successors, (17) [2025-01-09 21:59:33,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2088 states to 2088 states and 2909 transitions. [2025-01-09 21:59:33,205 INFO L78 Accepts]: Start accepts. Automaton has 2088 states and 2909 transitions. Word has length 852 [2025-01-09 21:59:33,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 21:59:33,206 INFO L471 AbstractCegarLoop]: Abstraction has 2088 states and 2909 transitions. [2025-01-09 21:59:33,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 18.0) internal successors, (162), 9 states have internal predecessors, (162), 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-01-09 21:59:33,206 INFO L276 IsEmpty]: Start isEmpty. Operand 2088 states and 2909 transitions. [2025-01-09 21:59:33,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 854 [2025-01-09 21:59:33,212 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 21:59:33,212 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, 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, 1, 1, 1] [2025-01-09 21:59:33,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 21:59:33,213 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 21:59:33,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:59:33,213 INFO L85 PathProgramCache]: Analyzing trace with hash -1198784621, now seen corresponding path program 1 times [2025-01-09 21:59:33,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:59:33,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279139170] [2025-01-09 21:59:33,214 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:59:33,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:59:33,383 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 853 statements into 1 equivalence classes. [2025-01-09 21:59:33,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 853 of 853 statements. [2025-01-09 21:59:33,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:59:33,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:59:34,645 INFO L134 CoverageAnalysis]: Checked inductivity of 3426 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3426 trivial. 0 not checked. [2025-01-09 21:59:34,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:59:34,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279139170] [2025-01-09 21:59:34,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279139170] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:59:34,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:59:34,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 21:59:34,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993596335] [2025-01-09 21:59:34,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:59:34,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 21:59:34,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:59:34,647 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 21:59:34,647 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 21:59:34,647 INFO L87 Difference]: Start difference. First operand 2088 states and 2909 transitions. Second operand has 7 states, 7 states have (on average 23.285714285714285) internal successors, (163), 7 states have internal predecessors, (163), 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-01-09 21:59:34,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 21:59:34,886 INFO L93 Difference]: Finished difference Result 2091 states and 2912 transitions. [2025-01-09 21:59:34,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 21:59:34,887 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.285714285714285) internal successors, (163), 7 states have internal predecessors, (163), 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 853 [2025-01-09 21:59:34,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 21:59:34,893 INFO L225 Difference]: With dead ends: 2091 [2025-01-09 21:59:34,893 INFO L226 Difference]: Without dead ends: 2091 [2025-01-09 21:59:34,893 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 21:59:34,894 INFO L435 NwaCegarLoop]: 447 mSDtfsCounter, 4 mSDsluCounter, 1841 mSDsCounter, 0 mSdLazyCounter, 417 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2288 SdHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 21:59:34,894 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2288 Invalid, 418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 417 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 21:59:34,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2091 states. [2025-01-09 21:59:34,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2091 to 2091. [2025-01-09 21:59:34,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2091 states, 2067 states have (on average 1.3913884857281085) internal successors, (2876), 2074 states have internal predecessors, (2876), 19 states have call successors, (19), 4 states have call predecessors, (19), 3 states have return successors, (17), 13 states have call predecessors, (17), 17 states have call successors, (17) [2025-01-09 21:59:34,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2091 states to 2091 states and 2912 transitions. [2025-01-09 21:59:34,942 INFO L78 Accepts]: Start accepts. Automaton has 2091 states and 2912 transitions. Word has length 853 [2025-01-09 21:59:34,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 21:59:34,943 INFO L471 AbstractCegarLoop]: Abstraction has 2091 states and 2912 transitions. [2025-01-09 21:59:34,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.285714285714285) internal successors, (163), 7 states have internal predecessors, (163), 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-01-09 21:59:34,943 INFO L276 IsEmpty]: Start isEmpty. Operand 2091 states and 2912 transitions. [2025-01-09 21:59:34,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 854 [2025-01-09 21:59:34,948 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 21:59:34,948 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, 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, 1, 1, 1] [2025-01-09 21:59:34,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 21:59:34,949 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 21:59:34,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:59:34,949 INFO L85 PathProgramCache]: Analyzing trace with hash 1601539951, now seen corresponding path program 1 times [2025-01-09 21:59:34,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:59:34,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284420407] [2025-01-09 21:59:34,950 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:59:34,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:59:35,134 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 853 statements into 1 equivalence classes.