./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test10-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test10-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9885703216edf9cfe4bfb438db591a48e102e73a3e0423f90ce871c05fdf2b57 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 07:05:29,064 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 07:05:29,123 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2025-03-04 07:05:29,130 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 07:05:29,131 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 07:05:29,151 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 07:05:29,152 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 07:05:29,153 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 07:05:29,153 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 07:05:29,153 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 07:05:29,154 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 07:05:29,154 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 07:05:29,154 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 07:05:29,154 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 07:05:29,155 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 07:05:29,155 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 07:05:29,155 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 07:05:29,155 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 07:05:29,155 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 07:05:29,155 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 07:05:29,155 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 07:05:29,155 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 07:05:29,156 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 07:05:29,156 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 07:05:29,156 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 07:05:29,156 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 07:05:29,156 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 07:05:29,156 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 07:05:29,156 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 07:05:29,156 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 07:05:29,156 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 07:05:29,156 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 07:05:29,157 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 07:05:29,157 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 07:05:29,157 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 07:05:29,157 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 07:05:29,157 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 07:05:29,158 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 07:05:29,158 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 07:05:29,158 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 07:05:29,158 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 07:05:29,158 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 07:05:29,158 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 07:05:29,158 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 07:05:29,158 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 07:05:29,158 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-memcleanup) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9885703216edf9cfe4bfb438db591a48e102e73a3e0423f90ce871c05fdf2b57 [2025-03-04 07:05:29,377 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 07:05:29,382 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 07:05:29,386 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 07:05:29,387 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 07:05:29,387 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 07:05:29,388 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test10-1.i [2025-03-04 07:05:30,485 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cadec7b36/ab26b9ddadce496d8cfef61251c844d3/FLAG211bf9b0a [2025-03-04 07:05:30,835 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 07:05:30,835 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test10-1.i [2025-03-04 07:05:30,857 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cadec7b36/ab26b9ddadce496d8cfef61251c844d3/FLAG211bf9b0a [2025-03-04 07:05:31,047 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cadec7b36/ab26b9ddadce496d8cfef61251c844d3 [2025-03-04 07:05:31,049 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 07:05:31,051 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 07:05:31,052 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 07:05:31,052 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 07:05:31,054 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 07:05:31,055 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 07:05:31" (1/1) ... [2025-03-04 07:05:31,055 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19a14da0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:05:31, skipping insertion in model container [2025-03-04 07:05:31,055 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 07:05:31" (1/1) ... [2025-03-04 07:05:31,085 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 07:05:31,389 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 07:05:31,416 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 07:05:31,418 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 07:05:31,420 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 07:05:31,426 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 07:05:31,446 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 07:05:31,448 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 07:05:31,450 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 07:05:31,455 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 07:05:31,475 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 07:05:31,476 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 07:05:31,477 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 07:05:31,477 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 07:05:31,488 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 07:05:31,488 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 07:05:31,489 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 07:05:31,490 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 07:05:31,497 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 07:05:31,497 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 07:05:31,498 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 07:05:31,499 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 07:05:31,506 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 07:05:31,506 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 07:05:31,508 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 07:05:31,508 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 07:05:31,525 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 07:05:31,533 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 07:05:31,639 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 07:05:31,665 INFO L204 MainTranslator]: Completed translation [2025-03-04 07:05:31,666 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:05:31 WrapperNode [2025-03-04 07:05:31,666 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 07:05:31,666 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 07:05:31,666 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 07:05:31,666 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 07:05:31,670 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:05:31" (1/1) ... [2025-03-04 07:05:31,693 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:05:31" (1/1) ... [2025-03-04 07:05:31,770 INFO L138 Inliner]: procedures = 177, calls = 507, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 3310 [2025-03-04 07:05:31,771 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 07:05:31,771 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 07:05:31,771 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 07:05:31,772 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 07:05:31,778 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:05:31" (1/1) ... [2025-03-04 07:05:31,778 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:05:31" (1/1) ... [2025-03-04 07:05:31,793 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:05:31" (1/1) ... [2025-03-04 07:05:31,911 INFO L175 MemorySlicer]: Split 480 memory accesses to 3 slices as follows [2, 106, 372]. 78 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 86 writes are split as follows [0, 4, 82]. [2025-03-04 07:05:31,911 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:05:31" (1/1) ... [2025-03-04 07:05:31,911 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:05:31" (1/1) ... [2025-03-04 07:05:31,957 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:05:31" (1/1) ... [2025-03-04 07:05:31,961 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:05:31" (1/1) ... [2025-03-04 07:05:31,968 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:05:31" (1/1) ... [2025-03-04 07:05:31,975 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:05:31" (1/1) ... [2025-03-04 07:05:31,991 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 07:05:31,992 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 07:05:31,992 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 07:05:31,992 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 07:05:31,992 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:05:31" (1/1) ... [2025-03-04 07:05:31,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 07:05:32,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:05:32,024 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 07:05:32,028 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 07:05:32,057 INFO L130 BoogieDeclarations]: Found specification of procedure test_int_int [2025-03-04 07:05:32,057 INFO L138 BoogieDeclarations]: Found implementation of procedure test_int_int [2025-03-04 07:05:32,057 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 07:05:32,059 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 07:05:32,059 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 07:05:32,059 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-04 07:05:32,059 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-04 07:05:32,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 07:05:32,060 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 07:05:32,060 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 07:05:32,060 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-03-04 07:05:32,060 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-03-04 07:05:32,060 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-03-04 07:05:32,060 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-03-04 07:05:32,060 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-03-04 07:05:32,060 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-03-04 07:05:32,060 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 07:05:32,060 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 07:05:32,060 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-04 07:05:32,060 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-04 07:05:32,060 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-04 07:05:32,060 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 07:05:32,060 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-04 07:05:32,060 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-04 07:05:32,060 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-04 07:05:32,060 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 07:05:32,060 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 07:05:32,060 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 07:05:32,060 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 07:05:32,060 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 07:05:32,060 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 07:05:32,284 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 07:05:32,286 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 07:05:34,215 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L731: call ULTIMATE.dealloc(main_~#i~0#1.base, main_~#i~0#1.offset);havoc main_~#i~0#1.base, main_~#i~0#1.offset; [2025-03-04 07:05:34,423 INFO L? ?]: Removed 782 outVars from TransFormulas that were not future-live. [2025-03-04 07:05:34,423 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 07:05:34,520 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 07:05:34,520 INFO L336 CfgBuilder]: Removed 2 assume(true) statements. [2025-03-04 07:05:34,520 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 07:05:34 BoogieIcfgContainer [2025-03-04 07:05:34,520 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 07:05:34,522 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 07:05:34,522 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 07:05:34,526 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 07:05:34,526 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 07:05:31" (1/3) ... [2025-03-04 07:05:34,526 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ede6bec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 07:05:34, skipping insertion in model container [2025-03-04 07:05:34,527 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:05:31" (2/3) ... [2025-03-04 07:05:34,527 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ede6bec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 07:05:34, skipping insertion in model container [2025-03-04 07:05:34,527 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 07:05:34" (3/3) ... [2025-03-04 07:05:34,528 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_BER_test10-1.i [2025-03-04 07:05:34,538 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 07:05:34,539 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_BER_test10-1.i that has 6 procedures, 1027 locations, 1 initial locations, 78 loop locations, and 2 error locations. [2025-03-04 07:05:34,594 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 07:05:34,606 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;@6d91874e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 07:05:34,607 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-04 07:05:34,613 INFO L276 IsEmpty]: Start isEmpty. Operand has 1019 states, 999 states have (on average 1.6256256256256256) internal successors, (1624), 1005 states have internal predecessors, (1624), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-04 07:05:34,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-04 07:05:34,621 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:05:34,621 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:05:34,622 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-04 07:05:34,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:05:34,626 INFO L85 PathProgramCache]: Analyzing trace with hash -702444487, now seen corresponding path program 1 times [2025-03-04 07:05:34,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:05:34,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056672028] [2025-03-04 07:05:34,632 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:05:34,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:05:34,699 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 07:05:34,710 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 07:05:34,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:05:34,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:05:34,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:05:34,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:05:34,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056672028] [2025-03-04 07:05:34,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056672028] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:05:34,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:05:34,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 07:05:34,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366515745] [2025-03-04 07:05:34,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:05:34,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 07:05:34,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:05:34,773 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 07:05:34,773 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 07:05:34,776 INFO L87 Difference]: Start difference. First operand has 1019 states, 999 states have (on average 1.6256256256256256) internal successors, (1624), 1005 states have internal predecessors, (1624), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:05:34,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:05:34,950 INFO L93 Difference]: Finished difference Result 1018 states and 1503 transitions. [2025-03-04 07:05:34,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 07:05:34,951 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-03-04 07:05:34,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:05:34,961 INFO L225 Difference]: With dead ends: 1018 [2025-03-04 07:05:34,963 INFO L226 Difference]: Without dead ends: 1016 [2025-03-04 07:05:34,964 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-03-04 07:05:34,966 INFO L435 NwaCegarLoop]: 1383 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1383 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:05:34,969 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1383 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:05:34,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1016 states. [2025-03-04 07:05:35,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1016 to 1016. [2025-03-04 07:05:35,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1016 states, 997 states have (on average 1.4774322968906721) internal successors, (1473), 1002 states have internal predecessors, (1473), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-04 07:05:35,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1016 states to 1016 states and 1501 transitions. [2025-03-04 07:05:35,055 INFO L78 Accepts]: Start accepts. Automaton has 1016 states and 1501 transitions. Word has length 14 [2025-03-04 07:05:35,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:05:35,056 INFO L471 AbstractCegarLoop]: Abstraction has 1016 states and 1501 transitions. [2025-03-04 07:05:35,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:05:35,056 INFO L276 IsEmpty]: Start isEmpty. Operand 1016 states and 1501 transitions. [2025-03-04 07:05:35,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-04 07:05:35,060 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:05:35,061 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:05:35,061 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 07:05:35,061 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-04 07:05:35,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:05:35,062 INFO L85 PathProgramCache]: Analyzing trace with hash -461582399, now seen corresponding path program 1 times [2025-03-04 07:05:35,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:05:35,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140384041] [2025-03-04 07:05:35,062 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:05:35,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:05:35,114 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-04 07:05:35,127 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-04 07:05:35,127 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:05:35,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:05:35,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:05:35,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:05:35,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140384041] [2025-03-04 07:05:35,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140384041] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:05:35,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:05:35,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 07:05:35,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398460745] [2025-03-04 07:05:35,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:05:35,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 07:05:35,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:05:35,553 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 07:05:35,554 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 07:05:35,554 INFO L87 Difference]: Start difference. First operand 1016 states and 1501 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:05:36,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:05:36,053 INFO L93 Difference]: Finished difference Result 1396 states and 2056 transitions. [2025-03-04 07:05:36,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 07:05:36,054 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2025-03-04 07:05:36,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:05:36,062 INFO L225 Difference]: With dead ends: 1396 [2025-03-04 07:05:36,062 INFO L226 Difference]: Without dead ends: 1396 [2025-03-04 07:05:36,062 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:05:36,063 INFO L435 NwaCegarLoop]: 1455 mSDtfsCounter, 542 mSDsluCounter, 2765 mSDsCounter, 0 mSdLazyCounter, 450 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 548 SdHoareTripleChecker+Valid, 4220 SdHoareTripleChecker+Invalid, 450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 450 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 07:05:36,063 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [548 Valid, 4220 Invalid, 450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 450 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 07:05:36,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1396 states. [2025-03-04 07:05:36,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1396 to 1018. [2025-03-04 07:05:36,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1018 states, 999 states have (on average 1.4764764764764764) internal successors, (1475), 1004 states have internal predecessors, (1475), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-04 07:05:36,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1018 states to 1018 states and 1503 transitions. [2025-03-04 07:05:36,096 INFO L78 Accepts]: Start accepts. Automaton has 1018 states and 1503 transitions. Word has length 67 [2025-03-04 07:05:36,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:05:36,096 INFO L471 AbstractCegarLoop]: Abstraction has 1018 states and 1503 transitions. [2025-03-04 07:05:36,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:05:36,096 INFO L276 IsEmpty]: Start isEmpty. Operand 1018 states and 1503 transitions. [2025-03-04 07:05:36,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-03-04 07:05:36,101 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:05:36,102 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:05:36,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 07:05:36,102 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-04 07:05:36,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:05:36,102 INFO L85 PathProgramCache]: Analyzing trace with hash 1931277587, now seen corresponding path program 1 times [2025-03-04 07:05:36,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:05:36,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969727962] [2025-03-04 07:05:36,103 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:05:36,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:05:36,151 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-04 07:05:36,158 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-04 07:05:36,159 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:05:36,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:05:36,710 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:05:36,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:05:36,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969727962] [2025-03-04 07:05:36,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969727962] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:05:36,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:05:36,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 07:05:36,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641003182] [2025-03-04 07:05:36,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:05:36,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 07:05:36,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:05:36,714 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 07:05:36,714 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:05:36,714 INFO L87 Difference]: Start difference. First operand 1018 states and 1503 transitions. Second operand has 6 states, 6 states have (on average 23.333333333333332) internal successors, (140), 6 states have internal predecessors, (140), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:05:37,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:05:37,239 INFO L93 Difference]: Finished difference Result 1396 states and 2055 transitions. [2025-03-04 07:05:37,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 07:05:37,240 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 23.333333333333332) internal successors, (140), 6 states have internal predecessors, (140), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 142 [2025-03-04 07:05:37,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:05:37,244 INFO L225 Difference]: With dead ends: 1396 [2025-03-04 07:05:37,245 INFO L226 Difference]: Without dead ends: 1396 [2025-03-04 07:05:37,245 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-04 07:05:37,245 INFO L435 NwaCegarLoop]: 1423 mSDtfsCounter, 540 mSDsluCounter, 5397 mSDsCounter, 0 mSdLazyCounter, 835 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 546 SdHoareTripleChecker+Valid, 6820 SdHoareTripleChecker+Invalid, 835 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 835 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 07:05:37,246 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [546 Valid, 6820 Invalid, 835 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 835 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 07:05:37,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1396 states. [2025-03-04 07:05:37,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1396 to 1021. [2025-03-04 07:05:37,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1021 states, 1002 states have (on average 1.4750499001996007) internal successors, (1478), 1007 states have internal predecessors, (1478), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-04 07:05:37,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1021 states to 1021 states and 1506 transitions. [2025-03-04 07:05:37,271 INFO L78 Accepts]: Start accepts. Automaton has 1021 states and 1506 transitions. Word has length 142 [2025-03-04 07:05:37,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:05:37,271 INFO L471 AbstractCegarLoop]: Abstraction has 1021 states and 1506 transitions. [2025-03-04 07:05:37,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.333333333333332) internal successors, (140), 6 states have internal predecessors, (140), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:05:37,272 INFO L276 IsEmpty]: Start isEmpty. Operand 1021 states and 1506 transitions. [2025-03-04 07:05:37,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2025-03-04 07:05:37,275 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:05:37,275 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:05:37,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 07:05:37,276 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-04 07:05:37,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:05:37,277 INFO L85 PathProgramCache]: Analyzing trace with hash -210397494, now seen corresponding path program 1 times [2025-03-04 07:05:37,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:05:37,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020080094] [2025-03-04 07:05:37,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:05:37,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:05:37,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 211 statements into 1 equivalence classes. [2025-03-04 07:05:37,364 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 211 of 211 statements. [2025-03-04 07:05:37,364 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:05:37,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:05:37,641 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:05:37,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:05:37,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020080094] [2025-03-04 07:05:37,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020080094] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:05:37,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:05:37,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 07:05:37,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666411464] [2025-03-04 07:05:37,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:05:37,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 07:05:37,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:05:37,646 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 07:05:37,646 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 07:05:37,647 INFO L87 Difference]: Start difference. First operand 1021 states and 1506 transitions. Second operand has 4 states, 4 states have (on average 52.25) internal successors, (209), 4 states have internal predecessors, (209), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:05:37,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:05:37,890 INFO L93 Difference]: Finished difference Result 979 states and 1429 transitions. [2025-03-04 07:05:37,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 07:05:37,890 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 52.25) internal successors, (209), 4 states have internal predecessors, (209), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 211 [2025-03-04 07:05:37,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:05:37,894 INFO L225 Difference]: With dead ends: 979 [2025-03-04 07:05:37,894 INFO L226 Difference]: Without dead ends: 979 [2025-03-04 07:05:37,895 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:05:37,896 INFO L435 NwaCegarLoop]: 1289 mSDtfsCounter, 30 mSDsluCounter, 2559 mSDsCounter, 0 mSdLazyCounter, 374 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 3848 SdHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:05:37,897 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 3848 Invalid, 396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 374 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:05:37,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 979 states. [2025-03-04 07:05:37,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 979 to 979. [2025-03-04 07:05:37,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 979 states, 960 states have (on average 1.459375) internal successors, (1401), 965 states have internal predecessors, (1401), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-04 07:05:37,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 979 states to 979 states and 1429 transitions. [2025-03-04 07:05:37,915 INFO L78 Accepts]: Start accepts. Automaton has 979 states and 1429 transitions. Word has length 211 [2025-03-04 07:05:37,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:05:37,917 INFO L471 AbstractCegarLoop]: Abstraction has 979 states and 1429 transitions. [2025-03-04 07:05:37,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 52.25) internal successors, (209), 4 states have internal predecessors, (209), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:05:37,917 INFO L276 IsEmpty]: Start isEmpty. Operand 979 states and 1429 transitions. [2025-03-04 07:05:37,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2025-03-04 07:05:37,921 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:05:37,921 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:05:37,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 07:05:37,921 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-04 07:05:37,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:05:37,922 INFO L85 PathProgramCache]: Analyzing trace with hash 1373816272, now seen corresponding path program 1 times [2025-03-04 07:05:37,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:05:37,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120765311] [2025-03-04 07:05:37,922 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:05:37,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:05:37,981 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 211 statements into 1 equivalence classes. [2025-03-04 07:05:37,998 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 211 of 211 statements. [2025-03-04 07:05:37,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:05:37,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:05:38,145 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:05:38,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:05:38,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120765311] [2025-03-04 07:05:38,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120765311] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:05:38,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:05:38,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 07:05:38,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465648284] [2025-03-04 07:05:38,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:05:38,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:05:38,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:05:38,146 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:05:38,146 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:05:38,146 INFO L87 Difference]: Start difference. First operand 979 states and 1429 transitions. Second operand has 3 states, 3 states have (on average 69.66666666666667) internal successors, (209), 3 states have internal predecessors, (209), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:05:38,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:05:38,391 INFO L93 Difference]: Finished difference Result 1505 states and 2205 transitions. [2025-03-04 07:05:38,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:05:38,392 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 69.66666666666667) internal successors, (209), 3 states have internal predecessors, (209), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 211 [2025-03-04 07:05:38,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:05:38,398 INFO L225 Difference]: With dead ends: 1505 [2025-03-04 07:05:38,398 INFO L226 Difference]: Without dead ends: 1505 [2025-03-04 07:05:38,398 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:05:38,399 INFO L435 NwaCegarLoop]: 1305 mSDtfsCounter, 712 mSDsluCounter, 1287 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 716 SdHoareTripleChecker+Valid, 2592 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:05:38,399 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [716 Valid, 2592 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:05:38,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1505 states. [2025-03-04 07:05:38,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1505 to 1345. [2025-03-04 07:05:38,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1345 states, 1324 states have (on average 1.4629909365558913) internal successors, (1937), 1329 states have internal predecessors, (1937), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (16), 13 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-04 07:05:38,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1345 states to 1345 states and 1969 transitions. [2025-03-04 07:05:38,431 INFO L78 Accepts]: Start accepts. Automaton has 1345 states and 1969 transitions. Word has length 211 [2025-03-04 07:05:38,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:05:38,432 INFO L471 AbstractCegarLoop]: Abstraction has 1345 states and 1969 transitions. [2025-03-04 07:05:38,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 69.66666666666667) internal successors, (209), 3 states have internal predecessors, (209), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:05:38,432 INFO L276 IsEmpty]: Start isEmpty. Operand 1345 states and 1969 transitions. [2025-03-04 07:05:38,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2025-03-04 07:05:38,434 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:05:38,434 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:05:38,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 07:05:38,434 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-04 07:05:38,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:05:38,435 INFO L85 PathProgramCache]: Analyzing trace with hash 592975597, now seen corresponding path program 1 times [2025-03-04 07:05:38,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:05:38,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537820868] [2025-03-04 07:05:38,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:05:38,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:05:38,500 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 226 statements into 1 equivalence classes. [2025-03-04 07:05:38,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 226 of 226 statements. [2025-03-04 07:05:38,526 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:05:38,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:05:38,769 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 07:05:38,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:05:38,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537820868] [2025-03-04 07:05:38,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537820868] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:05:38,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:05:38,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 07:05:38,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080178656] [2025-03-04 07:05:38,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:05:38,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 07:05:38,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:05:38,772 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 07:05:38,772 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 07:05:38,773 INFO L87 Difference]: Start difference. First operand 1345 states and 1969 transitions. Second operand has 4 states, 4 states have (on average 54.25) internal successors, (217), 4 states have internal predecessors, (217), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 07:05:38,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:05:38,999 INFO L93 Difference]: Finished difference Result 1303 states and 1892 transitions. [2025-03-04 07:05:39,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 07:05:39,000 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 54.25) internal successors, (217), 4 states have internal predecessors, (217), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 226 [2025-03-04 07:05:39,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:05:39,004 INFO L225 Difference]: With dead ends: 1303 [2025-03-04 07:05:39,005 INFO L226 Difference]: Without dead ends: 1303 [2025-03-04 07:05:39,005 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:05:39,005 INFO L435 NwaCegarLoop]: 1215 mSDtfsCounter, 30 mSDsluCounter, 2411 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 3626 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:05:39,006 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 3626 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:05:39,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1303 states. [2025-03-04 07:05:39,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1303 to 1303. [2025-03-04 07:05:39,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1303 states, 1282 states have (on average 1.4508580343213728) internal successors, (1860), 1287 states have internal predecessors, (1860), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (16), 13 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-04 07:05:39,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1303 states to 1303 states and 1892 transitions. [2025-03-04 07:05:39,044 INFO L78 Accepts]: Start accepts. Automaton has 1303 states and 1892 transitions. Word has length 226 [2025-03-04 07:05:39,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:05:39,044 INFO L471 AbstractCegarLoop]: Abstraction has 1303 states and 1892 transitions. [2025-03-04 07:05:39,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 54.25) internal successors, (217), 4 states have internal predecessors, (217), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 07:05:39,044 INFO L276 IsEmpty]: Start isEmpty. Operand 1303 states and 1892 transitions. [2025-03-04 07:05:39,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2025-03-04 07:05:39,046 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:05:39,046 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:05:39,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 07:05:39,046 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-04 07:05:39,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:05:39,047 INFO L85 PathProgramCache]: Analyzing trace with hash 1617230918, now seen corresponding path program 1 times [2025-03-04 07:05:39,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:05:39,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040636454] [2025-03-04 07:05:39,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:05:39,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:05:39,116 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 226 statements into 1 equivalence classes. [2025-03-04 07:05:39,136 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 226 of 226 statements. [2025-03-04 07:05:39,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:05:39,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:05:39,316 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 07:05:39,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:05:39,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040636454] [2025-03-04 07:05:39,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040636454] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:05:39,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:05:39,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 07:05:39,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398549083] [2025-03-04 07:05:39,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:05:39,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:05:39,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:05:39,318 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:05:39,318 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:05:39,318 INFO L87 Difference]: Start difference. First operand 1303 states and 1892 transitions. Second operand has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 3 states have internal predecessors, (217), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 07:05:39,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:05:39,485 INFO L93 Difference]: Finished difference Result 1303 states and 1889 transitions. [2025-03-04 07:05:39,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:05:39,486 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 3 states have internal predecessors, (217), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 226 [2025-03-04 07:05:39,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:05:39,491 INFO L225 Difference]: With dead ends: 1303 [2025-03-04 07:05:39,491 INFO L226 Difference]: Without dead ends: 1303 [2025-03-04 07:05:39,492 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-03-04 07:05:39,493 INFO L435 NwaCegarLoop]: 1227 mSDtfsCounter, 1 mSDsluCounter, 1205 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2432 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:05:39,493 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2432 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:05:39,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1303 states. [2025-03-04 07:05:39,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1303 to 1303. [2025-03-04 07:05:39,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1303 states, 1282 states have (on average 1.4485179407176287) internal successors, (1857), 1287 states have internal predecessors, (1857), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (16), 13 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-04 07:05:39,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1303 states to 1303 states and 1889 transitions. [2025-03-04 07:05:39,520 INFO L78 Accepts]: Start accepts. Automaton has 1303 states and 1889 transitions. Word has length 226 [2025-03-04 07:05:39,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:05:39,521 INFO L471 AbstractCegarLoop]: Abstraction has 1303 states and 1889 transitions. [2025-03-04 07:05:39,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 3 states have internal predecessors, (217), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 07:05:39,521 INFO L276 IsEmpty]: Start isEmpty. Operand 1303 states and 1889 transitions. [2025-03-04 07:05:39,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2025-03-04 07:05:39,523 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:05:39,523 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:05:39,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 07:05:39,523 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-04 07:05:39,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:05:39,526 INFO L85 PathProgramCache]: Analyzing trace with hash 1381552743, now seen corresponding path program 1 times [2025-03-04 07:05:39,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:05:39,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079188496] [2025-03-04 07:05:39,526 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:05:39,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:05:39,588 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 226 statements into 1 equivalence classes. [2025-03-04 07:05:39,625 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 226 of 226 statements. [2025-03-04 07:05:39,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:05:39,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:05:39,765 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 07:05:39,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:05:39,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079188496] [2025-03-04 07:05:39,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079188496] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:05:39,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:05:39,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 07:05:39,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986394544] [2025-03-04 07:05:39,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:05:39,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:05:39,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:05:39,769 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:05:39,769 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:05:39,769 INFO L87 Difference]: Start difference. First operand 1303 states and 1889 transitions. Second operand has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 3 states have internal predecessors, (217), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 07:05:39,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:05:39,994 INFO L93 Difference]: Finished difference Result 1868 states and 2712 transitions. [2025-03-04 07:05:39,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:05:39,995 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 3 states have internal predecessors, (217), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 226 [2025-03-04 07:05:39,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:05:40,002 INFO L225 Difference]: With dead ends: 1868 [2025-03-04 07:05:40,002 INFO L226 Difference]: Without dead ends: 1868 [2025-03-04 07:05:40,002 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:05:40,003 INFO L435 NwaCegarLoop]: 1231 mSDtfsCounter, 594 mSDsluCounter, 1213 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 598 SdHoareTripleChecker+Valid, 2444 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:05:40,003 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [598 Valid, 2444 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:05:40,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1868 states. [2025-03-04 07:05:40,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1868 to 1860. [2025-03-04 07:05:40,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1860 states, 1833 states have (on average 1.4511729405346427) internal successors, (2660), 1838 states have internal predecessors, (2660), 22 states have call successors, (22), 3 states have call predecessors, (22), 3 states have return successors, (22), 19 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-04 07:05:40,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1860 states to 1860 states and 2704 transitions. [2025-03-04 07:05:40,047 INFO L78 Accepts]: Start accepts. Automaton has 1860 states and 2704 transitions. Word has length 226 [2025-03-04 07:05:40,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:05:40,048 INFO L471 AbstractCegarLoop]: Abstraction has 1860 states and 2704 transitions. [2025-03-04 07:05:40,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 3 states have internal predecessors, (217), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 07:05:40,048 INFO L276 IsEmpty]: Start isEmpty. Operand 1860 states and 2704 transitions. [2025-03-04 07:05:40,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2025-03-04 07:05:40,050 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:05:40,051 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:05:40,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 07:05:40,051 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-04 07:05:40,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:05:40,051 INFO L85 PathProgramCache]: Analyzing trace with hash -2136246531, now seen corresponding path program 1 times [2025-03-04 07:05:40,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:05:40,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981290461] [2025-03-04 07:05:40,051 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:05:40,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:05:40,113 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 241 statements into 1 equivalence classes. [2025-03-04 07:05:40,157 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 241 of 241 statements. [2025-03-04 07:05:40,158 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:05:40,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:05:40,367 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 07:05:40,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:05:40,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981290461] [2025-03-04 07:05:40,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981290461] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:05:40,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:05:40,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 07:05:40,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51986781] [2025-03-04 07:05:40,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:05:40,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 07:05:40,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:05:40,369 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 07:05:40,369 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 07:05:40,370 INFO L87 Difference]: Start difference. First operand 1860 states and 2704 transitions. Second operand has 4 states, 4 states have (on average 55.5) internal successors, (222), 4 states have internal predecessors, (222), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 07:05:40,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:05:40,783 INFO L93 Difference]: Finished difference Result 1437 states and 2065 transitions. [2025-03-04 07:05:40,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 07:05:40,784 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 55.5) internal successors, (222), 4 states have internal predecessors, (222), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 241 [2025-03-04 07:05:40,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:05:40,788 INFO L225 Difference]: With dead ends: 1437 [2025-03-04 07:05:40,788 INFO L226 Difference]: Without dead ends: 1437 [2025-03-04 07:05:40,789 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:05:40,791 INFO L435 NwaCegarLoop]: 1260 mSDtfsCounter, 2352 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2352 SdHoareTripleChecker+Valid, 1444 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 07:05:40,791 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2352 Valid, 1444 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 07:05:40,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1437 states. [2025-03-04 07:05:40,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1437 to 1437. [2025-03-04 07:05:40,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1437 states, 1415 states have (on average 1.4353356890459363) internal successors, (2031), 1420 states have internal predecessors, (2031), 17 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (17), 14 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-04 07:05:40,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1437 states to 1437 states and 2065 transitions. [2025-03-04 07:05:40,818 INFO L78 Accepts]: Start accepts. Automaton has 1437 states and 2065 transitions. Word has length 241 [2025-03-04 07:05:40,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:05:40,819 INFO L471 AbstractCegarLoop]: Abstraction has 1437 states and 2065 transitions. [2025-03-04 07:05:40,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 55.5) internal successors, (222), 4 states have internal predecessors, (222), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 07:05:40,820 INFO L276 IsEmpty]: Start isEmpty. Operand 1437 states and 2065 transitions. [2025-03-04 07:05:40,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2025-03-04 07:05:40,822 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:05:40,822 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:05:40,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 07:05:40,822 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-04 07:05:40,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:05:40,823 INFO L85 PathProgramCache]: Analyzing trace with hash -1512289813, now seen corresponding path program 1 times [2025-03-04 07:05:40,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:05:40,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905840134] [2025-03-04 07:05:40,823 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:05:40,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:05:40,899 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 251 statements into 1 equivalence classes. [2025-03-04 07:05:40,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 251 of 251 statements. [2025-03-04 07:05:40,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:05:40,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:05:41,186 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-04 07:05:41,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:05:41,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905840134] [2025-03-04 07:05:41,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905840134] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:05:41,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:05:41,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 07:05:41,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625900586] [2025-03-04 07:05:41,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:05:41,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 07:05:41,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:05:41,188 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 07:05:41,188 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 07:05:41,188 INFO L87 Difference]: Start difference. First operand 1437 states and 2065 transitions. Second operand has 4 states, 4 states have (on average 57.75) internal successors, (231), 4 states have internal predecessors, (231), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 07:05:41,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:05:41,408 INFO L93 Difference]: Finished difference Result 1395 states and 1988 transitions. [2025-03-04 07:05:41,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 07:05:41,409 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 57.75) internal successors, (231), 4 states have internal predecessors, (231), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 251 [2025-03-04 07:05:41,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:05:41,415 INFO L225 Difference]: With dead ends: 1395 [2025-03-04 07:05:41,415 INFO L226 Difference]: Without dead ends: 1395 [2025-03-04 07:05:41,415 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:05:41,416 INFO L435 NwaCegarLoop]: 1139 mSDtfsCounter, 30 mSDsluCounter, 2259 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 3398 SdHoareTripleChecker+Invalid, 342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:05:41,416 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 3398 Invalid, 342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:05:41,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1395 states. [2025-03-04 07:05:41,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1395 to 1395. [2025-03-04 07:05:41,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1395 states, 1373 states have (on average 1.4231609613983978) internal successors, (1954), 1378 states have internal predecessors, (1954), 17 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (17), 14 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-04 07:05:41,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1395 states to 1395 states and 1988 transitions. [2025-03-04 07:05:41,443 INFO L78 Accepts]: Start accepts. Automaton has 1395 states and 1988 transitions. Word has length 251 [2025-03-04 07:05:41,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:05:41,443 INFO L471 AbstractCegarLoop]: Abstraction has 1395 states and 1988 transitions. [2025-03-04 07:05:41,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 57.75) internal successors, (231), 4 states have internal predecessors, (231), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 07:05:41,443 INFO L276 IsEmpty]: Start isEmpty. Operand 1395 states and 1988 transitions. [2025-03-04 07:05:41,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2025-03-04 07:05:41,446 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:05:41,446 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:05:41,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 07:05:41,446 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-04 07:05:41,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:05:41,447 INFO L85 PathProgramCache]: Analyzing trace with hash -1526872142, now seen corresponding path program 1 times [2025-03-04 07:05:41,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:05:41,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113258854] [2025-03-04 07:05:41,447 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:05:41,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:05:41,510 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 251 statements into 1 equivalence classes. [2025-03-04 07:05:41,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 251 of 251 statements. [2025-03-04 07:05:41,584 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:05:41,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:05:42,279 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 07:05:42,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:05:42,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113258854] [2025-03-04 07:05:42,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113258854] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:05:42,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [762675841] [2025-03-04 07:05:42,280 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:05:42,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:05:42,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:05:42,284 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:05:42,285 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 07:05:42,602 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 251 statements into 1 equivalence classes. [2025-03-04 07:05:42,745 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 251 of 251 statements. [2025-03-04 07:05:42,745 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:05:42,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:05:42,753 INFO L256 TraceCheckSpWp]: Trace formula consists of 1262 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 07:05:42,766 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:05:43,167 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-03-04 07:05:43,182 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-04 07:05:43,194 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 07:05:43,197 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:05:43,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [762675841] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:05:43,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 07:05:43,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 12 [2025-03-04 07:05:43,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699536655] [2025-03-04 07:05:43,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:05:43,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 07:05:43,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:05:43,198 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 07:05:43,198 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2025-03-04 07:05:43,198 INFO L87 Difference]: Start difference. First operand 1395 states and 1988 transitions. Second operand has 7 states, 7 states have (on average 33.142857142857146) internal successors, (232), 7 states have internal predecessors, (232), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 07:05:43,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:05:43,961 INFO L93 Difference]: Finished difference Result 1715 states and 2413 transitions. [2025-03-04 07:05:43,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 07:05:43,961 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 33.142857142857146) internal successors, (232), 7 states have internal predecessors, (232), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 251 [2025-03-04 07:05:43,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:05:43,968 INFO L225 Difference]: With dead ends: 1715 [2025-03-04 07:05:43,968 INFO L226 Difference]: Without dead ends: 1715 [2025-03-04 07:05:43,969 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 240 SyntacticMatches, 7 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2025-03-04 07:05:43,969 INFO L435 NwaCegarLoop]: 1097 mSDtfsCounter, 2445 mSDsluCounter, 3005 mSDsCounter, 0 mSdLazyCounter, 622 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2453 SdHoareTripleChecker+Valid, 4102 SdHoareTripleChecker+Invalid, 637 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 622 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-04 07:05:43,970 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2453 Valid, 4102 Invalid, 637 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 622 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-04 07:05:43,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1715 states. [2025-03-04 07:05:43,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1715 to 1563. [2025-03-04 07:05:43,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1563 states, 1531 states have (on average 1.4134552580013062) internal successors, (2164), 1540 states have internal predecessors, (2164), 24 states have call successors, (24), 6 states have call predecessors, (24), 6 states have return successors, (24), 18 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-04 07:05:43,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1563 states to 1563 states and 2212 transitions. [2025-03-04 07:05:43,998 INFO L78 Accepts]: Start accepts. Automaton has 1563 states and 2212 transitions. Word has length 251 [2025-03-04 07:05:43,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:05:43,998 INFO L471 AbstractCegarLoop]: Abstraction has 1563 states and 2212 transitions. [2025-03-04 07:05:43,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 33.142857142857146) internal successors, (232), 7 states have internal predecessors, (232), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 07:05:43,999 INFO L276 IsEmpty]: Start isEmpty. Operand 1563 states and 2212 transitions. [2025-03-04 07:05:44,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2025-03-04 07:05:44,001 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:05:44,002 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:05:44,012 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 07:05:44,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-04 07:05:44,203 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-04 07:05:44,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:05:44,203 INFO L85 PathProgramCache]: Analyzing trace with hash 758424454, now seen corresponding path program 1 times [2025-03-04 07:05:44,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:05:44,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886476956] [2025-03-04 07:05:44,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:05:44,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:05:44,284 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 326 statements into 1 equivalence classes. [2025-03-04 07:05:44,359 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 326 of 326 statements. [2025-03-04 07:05:44,359 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:05:44,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:05:45,164 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 72 proven. 5 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 07:05:45,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:05:45,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886476956] [2025-03-04 07:05:45,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886476956] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:05:45,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [789099122] [2025-03-04 07:05:45,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:05:45,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:05:45,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:05:45,168 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:05:45,169 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 07:05:45,573 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 326 statements into 1 equivalence classes. [2025-03-04 07:05:45,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 326 of 326 statements. [2025-03-04 07:05:45,753 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:05:45,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:05:45,760 INFO L256 TraceCheckSpWp]: Trace formula consists of 1641 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 07:05:45,767 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:05:45,777 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 15 treesize of output 1 [2025-03-04 07:05:46,047 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-03-04 07:05:46,061 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-04 07:05:46,066 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 72 proven. 5 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 07:05:46,066 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:05:46,340 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 72 proven. 5 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 07:05:46,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [789099122] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:05:46,340 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:05:46,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 5] total 12 [2025-03-04 07:05:46,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852600645] [2025-03-04 07:05:46,341 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:05:46,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 07:05:46,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:05:46,342 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 07:05:46,343 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2025-03-04 07:05:46,343 INFO L87 Difference]: Start difference. First operand 1563 states and 2212 transitions. Second operand has 12 states, 12 states have (on average 39.583333333333336) internal successors, (475), 12 states have internal predecessors, (475), 3 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-04 07:05:47,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:05:47,216 INFO L93 Difference]: Finished difference Result 2489 states and 3452 transitions. [2025-03-04 07:05:47,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 07:05:47,217 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 39.583333333333336) internal successors, (475), 12 states have internal predecessors, (475), 3 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 326 [2025-03-04 07:05:47,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:05:47,223 INFO L225 Difference]: With dead ends: 2489 [2025-03-04 07:05:47,223 INFO L226 Difference]: Without dead ends: 2489 [2025-03-04 07:05:47,223 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 663 GetRequests, 642 SyntacticMatches, 7 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=164, Unknown=0, NotChecked=0, Total=240 [2025-03-04 07:05:47,224 INFO L435 NwaCegarLoop]: 1125 mSDtfsCounter, 2352 mSDsluCounter, 7682 mSDsCounter, 0 mSdLazyCounter, 1177 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2370 SdHoareTripleChecker+Valid, 8807 SdHoareTripleChecker+Invalid, 1187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-04 07:05:47,224 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2370 Valid, 8807 Invalid, 1187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1177 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-04 07:05:47,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2489 states. [2025-03-04 07:05:47,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2489 to 2207. [2025-03-04 07:05:47,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2207 states, 2163 states have (on average 1.3878871937124364) internal successors, (3002), 2172 states have internal predecessors, (3002), 35 states have call successors, (35), 7 states have call predecessors, (35), 7 states have return successors, (35), 29 states have call predecessors, (35), 35 states have call successors, (35) [2025-03-04 07:05:47,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2207 states to 2207 states and 3072 transitions. [2025-03-04 07:05:47,262 INFO L78 Accepts]: Start accepts. Automaton has 2207 states and 3072 transitions. Word has length 326 [2025-03-04 07:05:47,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:05:47,262 INFO L471 AbstractCegarLoop]: Abstraction has 2207 states and 3072 transitions. [2025-03-04 07:05:47,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 39.583333333333336) internal successors, (475), 12 states have internal predecessors, (475), 3 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-04 07:05:47,263 INFO L276 IsEmpty]: Start isEmpty. Operand 2207 states and 3072 transitions. [2025-03-04 07:05:47,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 759 [2025-03-04 07:05:47,273 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:05:47,273 INFO L218 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:05:47,285 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 07:05:47,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-04 07:05:47,477 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-04 07:05:47,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:05:47,478 INFO L85 PathProgramCache]: Analyzing trace with hash -54520885, now seen corresponding path program 1 times [2025-03-04 07:05:47,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:05:47,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592122690] [2025-03-04 07:05:47,478 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:05:47,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:05:47,655 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 758 statements into 1 equivalence classes. [2025-03-04 07:05:47,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 758 of 758 statements. [2025-03-04 07:05:47,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:05:47,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:05:51,620 INFO L134 CoverageAnalysis]: Checked inductivity of 1184 backedges. 288 proven. 872 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 07:05:51,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:05:51,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592122690] [2025-03-04 07:05:51,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592122690] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:05:51,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1328888421] [2025-03-04 07:05:51,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:05:51,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:05:51,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:05:51,622 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:05:51,624 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 07:05:52,203 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 758 statements into 1 equivalence classes. [2025-03-04 07:05:52,645 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 758 of 758 statements. [2025-03-04 07:05:52,645 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:05:52,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:05:52,663 INFO L256 TraceCheckSpWp]: Trace formula consists of 3756 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-04 07:05:52,675 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:05:52,684 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 15 treesize of output 1 [2025-03-04 07:05:52,958 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-03-04 07:05:53,102 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-03-04 07:05:53,256 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-03-04 07:05:53,398 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-03-04 07:05:53,405 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-04 07:05:53,411 INFO L134 CoverageAnalysis]: Checked inductivity of 1184 backedges. 288 proven. 872 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 07:05:53,411 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:05:54,067 INFO L134 CoverageAnalysis]: Checked inductivity of 1184 backedges. 288 proven. 872 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 07:05:54,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1328888421] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:05:54,067 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:05:54,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9, 8] total 21 [2025-03-04 07:05:54,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19967800] [2025-03-04 07:05:54,068 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:05:54,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-04 07:05:54,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:05:54,070 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-04 07:05:54,070 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=271, Unknown=0, NotChecked=0, Total=420 [2025-03-04 07:05:54,071 INFO L87 Difference]: Start difference. First operand 2207 states and 3072 transitions. Second operand has 21 states, 21 states have (on average 64.04761904761905) internal successors, (1345), 21 states have internal predecessors, (1345), 3 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-04 07:05:55,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:05:55,290 INFO L93 Difference]: Finished difference Result 4211 states and 5762 transitions. [2025-03-04 07:05:55,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-03-04 07:05:55,290 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 64.04761904761905) internal successors, (1345), 21 states have internal predecessors, (1345), 3 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 758 [2025-03-04 07:05:55,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:05:55,303 INFO L225 Difference]: With dead ends: 4211 [2025-03-04 07:05:55,303 INFO L226 Difference]: Without dead ends: 4211 [2025-03-04 07:05:55,304 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1540 GetRequests, 1504 SyntacticMatches, 7 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 292 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=286, Invalid=644, Unknown=0, NotChecked=0, Total=930 [2025-03-04 07:05:55,305 INFO L435 NwaCegarLoop]: 1125 mSDtfsCounter, 4004 mSDsluCounter, 12005 mSDsCounter, 0 mSdLazyCounter, 1720 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4046 SdHoareTripleChecker+Valid, 13130 SdHoareTripleChecker+Invalid, 1734 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1720 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-04 07:05:55,305 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4046 Valid, 13130 Invalid, 1734 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1720 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-04 07:05:55,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4211 states. [2025-03-04 07:05:55,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4211 to 3929. [2025-03-04 07:05:55,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3929 states, 3861 states have (on average 1.3633773633773634) internal successors, (5264), 3870 states have internal predecessors, (5264), 59 states have call successors, (59), 7 states have call predecessors, (59), 7 states have return successors, (59), 53 states have call predecessors, (59), 59 states have call successors, (59) [2025-03-04 07:05:55,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3929 states to 3929 states and 5382 transitions. [2025-03-04 07:05:55,378 INFO L78 Accepts]: Start accepts. Automaton has 3929 states and 5382 transitions. Word has length 758 [2025-03-04 07:05:55,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:05:55,378 INFO L471 AbstractCegarLoop]: Abstraction has 3929 states and 5382 transitions. [2025-03-04 07:05:55,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 64.04761904761905) internal successors, (1345), 21 states have internal predecessors, (1345), 3 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-04 07:05:55,379 INFO L276 IsEmpty]: Start isEmpty. Operand 3929 states and 5382 transitions. [2025-03-04 07:05:55,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1623 [2025-03-04 07:05:55,416 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:05:55,417 INFO L218 NwaCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 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, 9, 9, 9, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:05:55,435 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-04 07:05:55,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:05:55,618 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-04 07:05:55,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:05:55,620 INFO L85 PathProgramCache]: Analyzing trace with hash 96119381, now seen corresponding path program 2 times [2025-03-04 07:05:55,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:05:55,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209397357] [2025-03-04 07:05:55,620 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 07:05:55,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:05:56,013 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1622 statements into 2 equivalence classes. [2025-03-04 07:05:56,027 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 77 of 1622 statements. [2025-03-04 07:05:56,028 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 07:05:56,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:05:56,183 INFO L134 CoverageAnalysis]: Checked inductivity of 7238 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7238 trivial. 0 not checked. [2025-03-04 07:05:56,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:05:56,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209397357] [2025-03-04 07:05:56,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209397357] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:05:56,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:05:56,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 07:05:56,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454658806] [2025-03-04 07:05:56,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:05:56,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 07:05:56,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:05:56,185 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 07:05:56,185 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-04 07:05:56,185 INFO L87 Difference]: Start difference. First operand 3929 states and 5382 transitions. Second operand has 8 states, 8 states have (on average 29.75) internal successors, (238), 8 states have internal predecessors, (238), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 07:05:56,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:05:56,831 INFO L93 Difference]: Finished difference Result 3944 states and 5398 transitions. [2025-03-04 07:05:56,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 07:05:56,833 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 29.75) internal successors, (238), 8 states have internal predecessors, (238), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 1622 [2025-03-04 07:05:56,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:05:56,854 INFO L225 Difference]: With dead ends: 3944 [2025-03-04 07:05:56,854 INFO L226 Difference]: Without dead ends: 3944 [2025-03-04 07:05:56,854 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2025-03-04 07:05:56,854 INFO L435 NwaCegarLoop]: 1145 mSDtfsCounter, 51 mSDsluCounter, 6457 mSDsCounter, 0 mSdLazyCounter, 1096 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 7602 SdHoareTripleChecker+Invalid, 1100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1096 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 07:05:56,855 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 7602 Invalid, 1100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1096 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 07:05:56,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3944 states. [2025-03-04 07:05:56,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3944 to 3940. [2025-03-04 07:05:56,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3940 states, 3872 states have (on average 1.3623450413223142) internal successors, (5275), 3881 states have internal predecessors, (5275), 59 states have call successors, (59), 7 states have call predecessors, (59), 7 states have return successors, (59), 53 states have call predecessors, (59), 59 states have call successors, (59) [2025-03-04 07:05:56,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3940 states to 3940 states and 5393 transitions. [2025-03-04 07:05:56,906 INFO L78 Accepts]: Start accepts. Automaton has 3940 states and 5393 transitions. Word has length 1622 [2025-03-04 07:05:56,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:05:56,908 INFO L471 AbstractCegarLoop]: Abstraction has 3940 states and 5393 transitions. [2025-03-04 07:05:56,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 29.75) internal successors, (238), 8 states have internal predecessors, (238), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 07:05:56,908 INFO L276 IsEmpty]: Start isEmpty. Operand 3940 states and 5393 transitions. [2025-03-04 07:05:56,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1624 [2025-03-04 07:05:56,926 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:05:56,926 INFO L218 NwaCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 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, 9, 9, 9, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:05:56,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 07:05:56,927 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-04 07:05:56,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:05:56,929 INFO L85 PathProgramCache]: Analyzing trace with hash 677849910, now seen corresponding path program 1 times [2025-03-04 07:05:56,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:05:56,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940688274] [2025-03-04 07:05:56,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:05:56,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:05:57,567 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1623 statements into 1 equivalence classes. [2025-03-04 07:05:58,386 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1623 of 1623 statements. [2025-03-04 07:05:58,387 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:05:58,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:06:01,925 INFO L134 CoverageAnalysis]: Checked inductivity of 7238 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7238 trivial. 0 not checked. [2025-03-04 07:06:01,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:06:01,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940688274] [2025-03-04 07:06:01,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940688274] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:06:01,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:06:01,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 07:06:01,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003797854] [2025-03-04 07:06:01,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:06:01,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 07:06:01,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:06:01,927 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 07:06:01,927 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-04 07:06:01,927 INFO L87 Difference]: Start difference. First operand 3940 states and 5393 transitions. Second operand has 7 states, 7 states have (on average 34.142857142857146) internal successors, (239), 7 states have internal predecessors, (239), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 07:06:02,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:06:02,374 INFO L93 Difference]: Finished difference Result 3945 states and 5399 transitions. [2025-03-04 07:06:02,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 07:06:02,374 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 34.142857142857146) internal successors, (239), 7 states have internal predecessors, (239), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 1623 [2025-03-04 07:06:02,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:06:02,381 INFO L225 Difference]: With dead ends: 3945 [2025-03-04 07:06:02,381 INFO L226 Difference]: Without dead ends: 3945 [2025-03-04 07:06:02,381 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-03-04 07:06:02,382 INFO L435 NwaCegarLoop]: 1151 mSDtfsCounter, 21 mSDsluCounter, 4330 mSDsCounter, 0 mSdLazyCounter, 779 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 5481 SdHoareTripleChecker+Invalid, 780 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 779 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 07:06:02,382 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 5481 Invalid, 780 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 779 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 07:06:02,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3945 states. [2025-03-04 07:06:02,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3945 to 3944. [2025-03-04 07:06:02,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3944 states, 3876 states have (on average 1.3622291021671826) internal successors, (5280), 3885 states have internal predecessors, (5280), 59 states have call successors, (59), 7 states have call predecessors, (59), 7 states have return successors, (59), 53 states have call predecessors, (59), 59 states have call successors, (59) [2025-03-04 07:06:02,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3944 states to 3944 states and 5398 transitions. [2025-03-04 07:06:02,417 INFO L78 Accepts]: Start accepts. Automaton has 3944 states and 5398 transitions. Word has length 1623 [2025-03-04 07:06:02,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:06:02,418 INFO L471 AbstractCegarLoop]: Abstraction has 3944 states and 5398 transitions. [2025-03-04 07:06:02,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 34.142857142857146) internal successors, (239), 7 states have internal predecessors, (239), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 07:06:02,419 INFO L276 IsEmpty]: Start isEmpty. Operand 3944 states and 5398 transitions. [2025-03-04 07:06:02,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1624 [2025-03-04 07:06:02,434 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:06:02,434 INFO L218 NwaCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 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, 9, 9, 9, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:06:02,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 07:06:02,435 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-04 07:06:02,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:06:02,435 INFO L85 PathProgramCache]: Analyzing trace with hash -964589283, now seen corresponding path program 1 times [2025-03-04 07:06:02,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:06:02,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325430856] [2025-03-04 07:06:02,436 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:06:02,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:06:02,786 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1623 statements into 1 equivalence classes. [2025-03-04 07:06:03,316 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1623 of 1623 statements. [2025-03-04 07:06:03,316 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:06:03,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:06:05,985 INFO L134 CoverageAnalysis]: Checked inductivity of 7238 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7238 trivial. 0 not checked. [2025-03-04 07:06:05,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:06:05,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325430856] [2025-03-04 07:06:05,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325430856] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:06:05,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:06:05,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 07:06:05,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221757288] [2025-03-04 07:06:05,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:06:05,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 07:06:05,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:06:05,987 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 07:06:05,987 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-04 07:06:05,987 INFO L87 Difference]: Start difference. First operand 3944 states and 5398 transitions. Second operand has 8 states, 8 states have (on average 29.875) internal successors, (239), 8 states have internal predecessors, (239), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 07:06:06,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:06:06,471 INFO L93 Difference]: Finished difference Result 3952 states and 5408 transitions. [2025-03-04 07:06:06,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 07:06:06,472 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 29.875) internal successors, (239), 8 states have internal predecessors, (239), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 1623 [2025-03-04 07:06:06,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:06:06,478 INFO L225 Difference]: With dead ends: 3952 [2025-03-04 07:06:06,478 INFO L226 Difference]: Without dead ends: 3952 [2025-03-04 07:06:06,479 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-04 07:06:06,480 INFO L435 NwaCegarLoop]: 1145 mSDtfsCounter, 24 mSDsluCounter, 6490 mSDsCounter, 0 mSdLazyCounter, 1119 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 7635 SdHoareTripleChecker+Invalid, 1121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 07:06:06,480 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 7635 Invalid, 1121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1119 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 07:06:06,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3952 states. [2025-03-04 07:06:06,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3952 to 3944. [2025-03-04 07:06:06,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3944 states, 3876 states have (on average 1.3622291021671826) internal successors, (5280), 3885 states have internal predecessors, (5280), 59 states have call successors, (59), 7 states have call predecessors, (59), 7 states have return successors, (59), 53 states have call predecessors, (59), 59 states have call successors, (59) [2025-03-04 07:06:06,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3944 states to 3944 states and 5398 transitions. [2025-03-04 07:06:06,520 INFO L78 Accepts]: Start accepts. Automaton has 3944 states and 5398 transitions. Word has length 1623 [2025-03-04 07:06:06,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:06:06,521 INFO L471 AbstractCegarLoop]: Abstraction has 3944 states and 5398 transitions. [2025-03-04 07:06:06,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 29.875) internal successors, (239), 8 states have internal predecessors, (239), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 07:06:06,521 INFO L276 IsEmpty]: Start isEmpty. Operand 3944 states and 5398 transitions. [2025-03-04 07:06:06,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1625 [2025-03-04 07:06:06,536 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:06:06,537 INFO L218 NwaCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 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, 9, 9, 9, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:06:06,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 07:06:06,538 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-04 07:06:06,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:06:06,539 INFO L85 PathProgramCache]: Analyzing trace with hash -2139347602, now seen corresponding path program 1 times [2025-03-04 07:06:06,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:06:06,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9955848] [2025-03-04 07:06:06,539 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:06:06,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:06:06,917 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1624 statements into 1 equivalence classes. [2025-03-04 07:06:07,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1624 of 1624 statements. [2025-03-04 07:06:07,361 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:06:07,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:06:10,242 INFO L134 CoverageAnalysis]: Checked inductivity of 7238 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7238 trivial. 0 not checked. [2025-03-04 07:06:10,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:06:10,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9955848] [2025-03-04 07:06:10,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9955848] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:06:10,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:06:10,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 07:06:10,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86805504] [2025-03-04 07:06:10,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:06:10,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 07:06:10,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:06:10,245 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 07:06:10,245 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-04 07:06:10,245 INFO L87 Difference]: Start difference. First operand 3944 states and 5398 transitions. Second operand has 9 states, 9 states have (on average 26.666666666666668) internal successors, (240), 9 states have internal predecessors, (240), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 07:06:10,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:06:10,874 INFO L93 Difference]: Finished difference Result 3955 states and 5412 transitions. [2025-03-04 07:06:10,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 07:06:10,874 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 26.666666666666668) internal successors, (240), 9 states have internal predecessors, (240), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 1624 [2025-03-04 07:06:10,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:06:10,881 INFO L225 Difference]: With dead ends: 3955 [2025-03-04 07:06:10,881 INFO L226 Difference]: Without dead ends: 3955 [2025-03-04 07:06:10,881 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-03-04 07:06:10,881 INFO L435 NwaCegarLoop]: 1145 mSDtfsCounter, 31 mSDsluCounter, 7645 mSDsCounter, 0 mSdLazyCounter, 1244 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 8790 SdHoareTripleChecker+Invalid, 1247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 07:06:10,881 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 8790 Invalid, 1247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1244 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 07:06:10,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3955 states. [2025-03-04 07:06:10,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3955 to 3952. [2025-03-04 07:06:10,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3952 states, 3884 states have (on average 1.361997940267765) internal successors, (5290), 3893 states have internal predecessors, (5290), 59 states have call successors, (59), 7 states have call predecessors, (59), 7 states have return successors, (59), 53 states have call predecessors, (59), 59 states have call successors, (59) [2025-03-04 07:06:10,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3952 states to 3952 states and 5408 transitions. [2025-03-04 07:06:10,914 INFO L78 Accepts]: Start accepts. Automaton has 3952 states and 5408 transitions. Word has length 1624 [2025-03-04 07:06:10,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:06:10,914 INFO L471 AbstractCegarLoop]: Abstraction has 3952 states and 5408 transitions. [2025-03-04 07:06:10,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 26.666666666666668) internal successors, (240), 9 states have internal predecessors, (240), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 07:06:10,915 INFO L276 IsEmpty]: Start isEmpty. Operand 3952 states and 5408 transitions. [2025-03-04 07:06:10,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1626 [2025-03-04 07:06:10,930 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:06:10,930 INFO L218 NwaCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 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, 9, 9, 9, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:06:10,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 07:06:10,931 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-04 07:06:10,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:06:10,932 INFO L85 PathProgramCache]: Analyzing trace with hash -140776487, now seen corresponding path program 1 times [2025-03-04 07:06:10,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:06:10,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207583444] [2025-03-04 07:06:10,932 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:06:10,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:06:11,296 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1625 statements into 1 equivalence classes. [2025-03-04 07:06:11,743 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1625 of 1625 statements. [2025-03-04 07:06:11,743 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:06:11,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:06:14,530 INFO L134 CoverageAnalysis]: Checked inductivity of 7238 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7238 trivial. 0 not checked. [2025-03-04 07:06:14,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:06:14,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207583444] [2025-03-04 07:06:14,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207583444] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:06:14,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:06:14,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 07:06:14,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394687505] [2025-03-04 07:06:14,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:06:14,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 07:06:14,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:06:14,532 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 07:06:14,532 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-04 07:06:14,532 INFO L87 Difference]: Start difference. First operand 3952 states and 5408 transitions. Second operand has 7 states, 7 states have (on average 34.42857142857143) internal successors, (241), 7 states have internal predecessors, (241), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 07:06:14,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:06:14,931 INFO L93 Difference]: Finished difference Result 3955 states and 5411 transitions. [2025-03-04 07:06:14,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 07:06:14,931 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 34.42857142857143) internal successors, (241), 7 states have internal predecessors, (241), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 1625 [2025-03-04 07:06:14,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:06:14,938 INFO L225 Difference]: With dead ends: 3955 [2025-03-04 07:06:14,938 INFO L226 Difference]: Without dead ends: 3955 [2025-03-04 07:06:14,938 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-03-04 07:06:14,938 INFO L435 NwaCegarLoop]: 1154 mSDtfsCounter, 16 mSDsluCounter, 4345 mSDsCounter, 0 mSdLazyCounter, 769 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 5499 SdHoareTripleChecker+Invalid, 770 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 769 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 07:06:14,939 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 5499 Invalid, 770 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 769 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 07:06:14,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3955 states. [2025-03-04 07:06:14,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3955 to 3955. [2025-03-04 07:06:14,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3955 states, 3887 states have (on average 1.361718549009519) internal successors, (5293), 3896 states have internal predecessors, (5293), 59 states have call successors, (59), 7 states have call predecessors, (59), 7 states have return successors, (59), 53 states have call predecessors, (59), 59 states have call successors, (59) [2025-03-04 07:06:14,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3955 states to 3955 states and 5411 transitions. [2025-03-04 07:06:14,975 INFO L78 Accepts]: Start accepts. Automaton has 3955 states and 5411 transitions. Word has length 1625 [2025-03-04 07:06:14,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:06:14,977 INFO L471 AbstractCegarLoop]: Abstraction has 3955 states and 5411 transitions. [2025-03-04 07:06:14,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 34.42857142857143) internal successors, (241), 7 states have internal predecessors, (241), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 07:06:14,977 INFO L276 IsEmpty]: Start isEmpty. Operand 3955 states and 5411 transitions. [2025-03-04 07:06:14,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1626 [2025-03-04 07:06:14,992 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:06:14,992 INFO L218 NwaCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 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, 9, 9, 9, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:06:14,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-04 07:06:14,992 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-04 07:06:14,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:06:14,993 INFO L85 PathProgramCache]: Analyzing trace with hash 2029714879, now seen corresponding path program 1 times [2025-03-04 07:06:14,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:06:14,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036695173] [2025-03-04 07:06:14,993 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:06:14,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:06:15,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1625 statements into 1 equivalence classes. [2025-03-04 07:06:15,865 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1625 of 1625 statements. [2025-03-04 07:06:15,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:06:15,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:06:20,666 INFO L134 CoverageAnalysis]: Checked inductivity of 7238 backedges. 1961 proven. 74 refuted. 0 times theorem prover too weak. 5203 trivial. 0 not checked. [2025-03-04 07:06:20,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:06:20,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036695173] [2025-03-04 07:06:20,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036695173] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:06:20,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [617288556] [2025-03-04 07:06:20,666 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:06:20,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:06:20,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:06:20,668 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:06:20,669 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 07:06:21,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1625 statements into 1 equivalence classes. [2025-03-04 07:06:22,743 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1625 of 1625 statements. [2025-03-04 07:06:22,743 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:06:22,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:06:22,785 INFO L256 TraceCheckSpWp]: Trace formula consists of 7986 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-03-04 07:06:22,807 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:06:23,034 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-03-04 07:06:23,164 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-03-04 07:06:23,297 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-03-04 07:06:23,418 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-03-04 07:06:23,541 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-03-04 07:06:23,683 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-03-04 07:06:23,810 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-03-04 07:06:23,928 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-03-04 07:06:24,066 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-03-04 07:06:24,197 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-03-04 07:06:24,271 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-03-04 07:06:24,286 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-04 07:06:24,300 INFO L134 CoverageAnalysis]: Checked inductivity of 7238 backedges. 42 proven. 7172 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 07:06:24,300 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:06:25,909 INFO L134 CoverageAnalysis]: Checked inductivity of 7238 backedges. 42 proven. 7172 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 07:06:25,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [617288556] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:06:25,910 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:06:25,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 17, 16] total 34 [2025-03-04 07:06:25,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668959715] [2025-03-04 07:06:25,910 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:06:25,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-03-04 07:06:25,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:06:25,914 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-03-04 07:06:25,914 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=387, Invalid=735, Unknown=0, NotChecked=0, Total=1122 [2025-03-04 07:06:25,915 INFO L87 Difference]: Start difference. First operand 3955 states and 5411 transitions. Second operand has 34 states, 34 states have (on average 97.1470588235294) internal successors, (3303), 34 states have internal predecessors, (3303), 4 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-04 07:06:28,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:06:28,033 INFO L93 Difference]: Finished difference Result 7280 states and 9835 transitions. [2025-03-04 07:06:28,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2025-03-04 07:06:28,034 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 97.1470588235294) internal successors, (3303), 34 states have internal predecessors, (3303), 4 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 1625 [2025-03-04 07:06:28,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:06:28,046 INFO L225 Difference]: With dead ends: 7280 [2025-03-04 07:06:28,046 INFO L226 Difference]: Without dead ends: 7280 [2025-03-04 07:06:28,048 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3305 GetRequests, 3219 SyntacticMatches, 7 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1400 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1731, Invalid=4749, Unknown=0, NotChecked=0, Total=6480 [2025-03-04 07:06:28,048 INFO L435 NwaCegarLoop]: 1092 mSDtfsCounter, 7416 mSDsluCounter, 10305 mSDsCounter, 0 mSdLazyCounter, 1707 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7488 SdHoareTripleChecker+Valid, 11397 SdHoareTripleChecker+Invalid, 1735 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1707 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-04 07:06:28,048 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7488 Valid, 11397 Invalid, 1735 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1707 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-04 07:06:28,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7280 states. [2025-03-04 07:06:28,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7280 to 7277. [2025-03-04 07:06:28,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7277 states, 7143 states have (on average 1.3415931681366373) internal successors, (9583), 7152 states have internal predecessors, (9583), 125 states have call successors, (125), 7 states have call predecessors, (125), 7 states have return successors, (125), 119 states have call predecessors, (125), 125 states have call successors, (125) [2025-03-04 07:06:28,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7277 states to 7277 states and 9833 transitions. [2025-03-04 07:06:28,108 INFO L78 Accepts]: Start accepts. Automaton has 7277 states and 9833 transitions. Word has length 1625 [2025-03-04 07:06:28,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:06:28,109 INFO L471 AbstractCegarLoop]: Abstraction has 7277 states and 9833 transitions. [2025-03-04 07:06:28,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 97.1470588235294) internal successors, (3303), 34 states have internal predecessors, (3303), 4 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-04 07:06:28,110 INFO L276 IsEmpty]: Start isEmpty. Operand 7277 states and 9833 transitions. [2025-03-04 07:06:28,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3276 [2025-03-04 07:06:28,154 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:06:28,155 INFO L218 NwaCegarLoop]: trace histogram [34, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 32, 32, 32, 23, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:06:28,186 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-04 07:06:28,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:06:28,357 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-04 07:06:28,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:06:28,359 INFO L85 PathProgramCache]: Analyzing trace with hash 1234236927, now seen corresponding path program 2 times [2025-03-04 07:06:28,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:06:28,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463785758] [2025-03-04 07:06:28,359 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 07:06:28,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:06:29,033 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3275 statements into 2 equivalence classes. [2025-03-04 07:06:29,057 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 80 of 3275 statements. [2025-03-04 07:06:29,058 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 07:06:29,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:06:29,409 INFO L134 CoverageAnalysis]: Checked inductivity of 42713 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42713 trivial. 0 not checked. [2025-03-04 07:06:29,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:06:29,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463785758] [2025-03-04 07:06:29,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463785758] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:06:29,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:06:29,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-04 07:06:29,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456612759] [2025-03-04 07:06:29,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:06:29,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 07:06:29,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:06:29,413 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 07:06:29,413 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2025-03-04 07:06:29,413 INFO L87 Difference]: Start difference. First operand 7277 states and 9833 transitions. Second operand has 13 states, 13 states have (on average 18.53846153846154) internal successors, (241), 13 states have internal predecessors, (241), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 07:06:30,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:06:30,747 INFO L93 Difference]: Finished difference Result 7322 states and 9897 transitions. [2025-03-04 07:06:30,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 07:06:30,747 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 18.53846153846154) internal successors, (241), 13 states have internal predecessors, (241), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 3275 [2025-03-04 07:06:30,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:06:30,759 INFO L225 Difference]: With dead ends: 7322 [2025-03-04 07:06:30,759 INFO L226 Difference]: Without dead ends: 7322 [2025-03-04 07:06:30,759 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2025-03-04 07:06:30,760 INFO L435 NwaCegarLoop]: 1152 mSDtfsCounter, 85 mSDsluCounter, 10023 mSDsCounter, 0 mSdLazyCounter, 1800 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 11175 SdHoareTripleChecker+Invalid, 1807 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1800 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:06:30,760 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 11175 Invalid, 1807 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [7 Valid, 1800 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-04 07:06:30,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7322 states. [2025-03-04 07:06:30,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7322 to 7283. [2025-03-04 07:06:30,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7283 states, 7149 states have (on average 1.34158623583718) internal successors, (9591), 7158 states have internal predecessors, (9591), 125 states have call successors, (125), 7 states have call predecessors, (125), 7 states have return successors, (125), 119 states have call predecessors, (125), 125 states have call successors, (125) [2025-03-04 07:06:30,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7283 states to 7283 states and 9841 transitions. [2025-03-04 07:06:30,837 INFO L78 Accepts]: Start accepts. Automaton has 7283 states and 9841 transitions. Word has length 3275 [2025-03-04 07:06:30,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:06:30,839 INFO L471 AbstractCegarLoop]: Abstraction has 7283 states and 9841 transitions. [2025-03-04 07:06:30,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 18.53846153846154) internal successors, (241), 13 states have internal predecessors, (241), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 07:06:30,839 INFO L276 IsEmpty]: Start isEmpty. Operand 7283 states and 9841 transitions. [2025-03-04 07:06:30,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3277 [2025-03-04 07:06:30,884 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:06:30,885 INFO L218 NwaCegarLoop]: trace histogram [34, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 32, 32, 32, 23, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:06:30,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-04 07:06:30,886 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-04 07:06:30,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:06:30,887 INFO L85 PathProgramCache]: Analyzing trace with hash 636742430, now seen corresponding path program 1 times [2025-03-04 07:06:30,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:06:30,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594392081] [2025-03-04 07:06:30,888 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:06:30,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:06:31,589 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3276 statements into 1 equivalence classes. [2025-03-04 07:06:33,593 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3276 of 3276 statements. [2025-03-04 07:06:33,593 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:06:33,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat