./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test10-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 8fc3dc66 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_SFH_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 85fe539c4a9811cd5d49f239f4680cc0b3752a2958e9f287c34e302b923af4f9 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 11:41:11,337 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 11:41:11,387 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2025-03-17 11:41:11,393 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 11:41:11,396 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 11:41:11,417 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 11:41:11,418 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 11:41:11,418 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 11:41:11,419 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 11:41:11,419 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 11:41:11,419 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 11:41:11,420 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 11:41:11,420 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 11:41:11,420 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 11:41:11,420 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 11:41:11,420 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 11:41:11,420 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 11:41:11,421 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 11:41:11,421 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 11:41:11,421 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 11:41:11,421 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 11:41:11,421 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 11:41:11,421 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-17 11:41:11,421 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-17 11:41:11,421 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 11:41:11,421 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 11:41:11,421 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 11:41:11,421 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 11:41:11,422 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 11:41:11,422 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 11:41:11,422 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 11:41:11,422 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 11:41:11,422 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 11:41:11,422 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 11:41:11,422 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 11:41:11,423 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 11:41:11,423 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 11:41:11,423 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 11:41:11,423 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 11:41:11,423 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 11:41:11,423 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 11:41:11,423 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 11:41:11,423 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 11:41:11,423 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 11:41:11,423 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 11:41:11,423 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 -> 85fe539c4a9811cd5d49f239f4680cc0b3752a2958e9f287c34e302b923af4f9 [2025-03-17 11:41:11,616 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 11:41:11,622 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 11:41:11,624 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 11:41:11,625 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 11:41:11,625 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 11:41:11,627 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test10-1.i [2025-03-17 11:41:12,778 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d1a63d28/c19a547ec86b41ecb62a072fcae13749/FLAGc58ce4d40 [2025-03-17 11:41:13,066 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 11:41:13,066 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test10-1.i [2025-03-17 11:41:13,086 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d1a63d28/c19a547ec86b41ecb62a072fcae13749/FLAGc58ce4d40 [2025-03-17 11:41:13,340 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d1a63d28/c19a547ec86b41ecb62a072fcae13749 [2025-03-17 11:41:13,342 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 11:41:13,343 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 11:41:13,343 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 11:41:13,344 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 11:41:13,346 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 11:41:13,347 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 11:41:13" (1/1) ... [2025-03-17 11:41:13,347 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b91a4eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:41:13, skipping insertion in model container [2025-03-17 11:41:13,347 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 11:41:13" (1/1) ... [2025-03-17 11:41:13,376 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 11:41:13,632 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-17 11:41:13,662 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-17 11:41:13,664 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-17 11:41:13,668 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 11:41:13,671 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-17 11:41:13,692 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-17 11:41:13,693 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-17 11:41:13,698 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 11:41:13,702 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 11:41:13,719 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-17 11:41:13,721 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-17 11:41:13,724 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-17 11:41:13,725 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-17 11:41:13,740 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-17 11:41:13,741 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-17 11:41:13,744 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-17 11:41:13,744 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-17 11:41:13,758 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-17 11:41:13,759 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-17 11:41:13,761 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-17 11:41:13,763 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-17 11:41:13,772 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-17 11:41:13,772 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-17 11:41:13,773 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-17 11:41:13,773 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-17 11:41:13,785 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 11:41:13,800 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 11:41:13,913 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 11:41:13,940 INFO L204 MainTranslator]: Completed translation [2025-03-17 11:41:13,941 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:41:13 WrapperNode [2025-03-17 11:41:13,942 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 11:41:13,943 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 11:41:13,943 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 11:41:13,943 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 11:41:13,947 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:41:13" (1/1) ... [2025-03-17 11:41:13,983 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:41:13" (1/1) ... [2025-03-17 11:41:14,088 INFO L138 Inliner]: procedures = 177, calls = 507, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 3310 [2025-03-17 11:41:14,088 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 11:41:14,089 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 11:41:14,089 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 11:41:14,089 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 11:41:14,095 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:41:13" (1/1) ... [2025-03-17 11:41:14,096 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:41:13" (1/1) ... [2025-03-17 11:41:14,111 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:41:13" (1/1) ... [2025-03-17 11:41:14,224 INFO L175 MemorySlicer]: Split 480 memory accesses to 3 slices as follows [106, 2, 372]. 78 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [0, 2, 0]. The 86 writes are split as follows [4, 0, 82]. [2025-03-17 11:41:14,225 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:41:13" (1/1) ... [2025-03-17 11:41:14,225 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:41:13" (1/1) ... [2025-03-17 11:41:14,266 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:41:13" (1/1) ... [2025-03-17 11:41:14,270 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:41:13" (1/1) ... [2025-03-17 11:41:14,275 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:41:13" (1/1) ... [2025-03-17 11:41:14,281 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:41:13" (1/1) ... [2025-03-17 11:41:14,291 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 11:41:14,292 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 11:41:14,292 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 11:41:14,292 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 11:41:14,293 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:41:13" (1/1) ... [2025-03-17 11:41:14,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 11:41:14,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:41:14,320 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-17 11:41:14,322 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-17 11:41:14,337 INFO L130 BoogieDeclarations]: Found specification of procedure test_int_int [2025-03-17 11:41:14,337 INFO L138 BoogieDeclarations]: Found implementation of procedure test_int_int [2025-03-17 11:41:14,337 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 11:41:14,338 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 11:41:14,338 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-17 11:41:14,338 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-17 11:41:14,338 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-17 11:41:14,338 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 11:41:14,338 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 11:41:14,338 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-17 11:41:14,338 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-03-17 11:41:14,338 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-03-17 11:41:14,338 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-03-17 11:41:14,338 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-03-17 11:41:14,338 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-03-17 11:41:14,338 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-03-17 11:41:14,338 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-17 11:41:14,338 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 11:41:14,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-17 11:41:14,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-17 11:41:14,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-17 11:41:14,339 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-17 11:41:14,339 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-17 11:41:14,339 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-17 11:41:14,339 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-17 11:41:14,339 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-17 11:41:14,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 11:41:14,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 11:41:14,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-17 11:41:14,339 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 11:41:14,339 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 11:41:14,551 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 11:41:14,553 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 11:41:16,560 INFO L1322 $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-17 11:41:16,716 INFO L? ?]: Removed 782 outVars from TransFormulas that were not future-live. [2025-03-17 11:41:16,717 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 11:41:16,804 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 11:41:16,804 INFO L336 CfgBuilder]: Removed 2 assume(true) statements. [2025-03-17 11:41:16,804 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:41:16 BoogieIcfgContainer [2025-03-17 11:41:16,805 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 11:41:16,807 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 11:41:16,807 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 11:41:16,811 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 11:41:16,811 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 11:41:13" (1/3) ... [2025-03-17 11:41:16,812 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b5b4d4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 11:41:16, skipping insertion in model container [2025-03-17 11:41:16,812 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:41:13" (2/3) ... [2025-03-17 11:41:16,812 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b5b4d4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 11:41:16, skipping insertion in model container [2025-03-17 11:41:16,812 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:41:16" (3/3) ... [2025-03-17 11:41:16,813 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_SFH_test10-1.i [2025-03-17 11:41:16,824 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 11:41:16,826 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_SFH_test10-1.i that has 6 procedures, 1026 locations, 1 initial locations, 78 loop locations, and 2 error locations. [2025-03-17 11:41:16,886 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 11:41:16,897 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;@48e3916c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 11:41:16,897 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-17 11:41:16,903 INFO L276 IsEmpty]: Start isEmpty. Operand has 1018 states, 998 states have (on average 1.62625250501002) internal successors, (1623), 1004 states have internal predecessors, (1623), 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-17 11:41:16,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-17 11:41:16,913 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:41:16,913 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:41:16,914 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-17 11:41:16,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:41:16,919 INFO L85 PathProgramCache]: Analyzing trace with hash -1457075004, now seen corresponding path program 1 times [2025-03-17 11:41:16,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:41:16,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104798323] [2025-03-17 11:41:16,927 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:41:16,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:41:17,008 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-17 11:41:17,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 11:41:17,019 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:41:17,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:41:17,071 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-17 11:41:17,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:41:17,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104798323] [2025-03-17 11:41:17,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104798323] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:41:17,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:41:17,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:41:17,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066861120] [2025-03-17 11:41:17,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:41:17,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 11:41:17,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:41:17,099 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 11:41:17,099 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 11:41:17,102 INFO L87 Difference]: Start difference. First operand has 1018 states, 998 states have (on average 1.62625250501002) internal successors, (1623), 1004 states have internal predecessors, (1623), 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 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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-17 11:41:17,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:41:17,299 INFO L93 Difference]: Finished difference Result 1017 states and 1502 transitions. [2025-03-17 11:41:17,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 11:41:17,300 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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 13 [2025-03-17 11:41:17,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:41:17,315 INFO L225 Difference]: With dead ends: 1017 [2025-03-17 11:41:17,318 INFO L226 Difference]: Without dead ends: 1015 [2025-03-17 11:41:17,319 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-17 11:41:17,321 INFO L435 NwaCegarLoop]: 1382 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, 1382 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.2s IncrementalHoareTripleChecker+Time [2025-03-17 11:41:17,322 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1382 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 11:41:17,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1015 states. [2025-03-17 11:41:17,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1015 to 1015. [2025-03-17 11:41:17,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1015 states, 996 states have (on average 1.4779116465863453) internal successors, (1472), 1001 states have internal predecessors, (1472), 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-17 11:41:17,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1015 states to 1015 states and 1500 transitions. [2025-03-17 11:41:17,409 INFO L78 Accepts]: Start accepts. Automaton has 1015 states and 1500 transitions. Word has length 13 [2025-03-17 11:41:17,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:41:17,409 INFO L471 AbstractCegarLoop]: Abstraction has 1015 states and 1500 transitions. [2025-03-17 11:41:17,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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-17 11:41:17,409 INFO L276 IsEmpty]: Start isEmpty. Operand 1015 states and 1500 transitions. [2025-03-17 11:41:17,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-17 11:41:17,413 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:41:17,414 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] [2025-03-17 11:41:17,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 11:41:17,414 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-17 11:41:17,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:41:17,415 INFO L85 PathProgramCache]: Analyzing trace with hash -1059423530, now seen corresponding path program 1 times [2025-03-17 11:41:17,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:41:17,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741560291] [2025-03-17 11:41:17,416 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:41:17,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:41:17,441 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-17 11:41:17,453 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-17 11:41:17,454 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:41:17,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:41:17,841 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-17 11:41:17,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:41:17,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741560291] [2025-03-17 11:41:17,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [741560291] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:41:17,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:41:17,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 11:41:17,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137416336] [2025-03-17 11:41:17,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:41:17,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 11:41:17,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:41:17,845 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 11:41:17,845 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 11:41:17,845 INFO L87 Difference]: Start difference. First operand 1015 states and 1500 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 3 states have internal predecessors, (64), 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-17 11:41:18,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:41:18,289 INFO L93 Difference]: Finished difference Result 1395 states and 2055 transitions. [2025-03-17 11:41:18,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 11:41:18,289 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 3 states have internal predecessors, (64), 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 66 [2025-03-17 11:41:18,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:41:18,293 INFO L225 Difference]: With dead ends: 1395 [2025-03-17 11:41:18,293 INFO L226 Difference]: Without dead ends: 1395 [2025-03-17 11:41:18,294 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 11:41:18,294 INFO L435 NwaCegarLoop]: 1415 mSDtfsCounter, 542 mSDsluCounter, 2724 mSDsCounter, 0 mSdLazyCounter, 444 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 548 SdHoareTripleChecker+Valid, 4139 SdHoareTripleChecker+Invalid, 444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 444 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 11:41:18,294 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [548 Valid, 4139 Invalid, 444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 444 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 11:41:18,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1395 states. [2025-03-17 11:41:18,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1395 to 1017. [2025-03-17 11:41:18,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1017 states, 998 states have (on average 1.4769539078156313) internal successors, (1474), 1003 states have internal predecessors, (1474), 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-17 11:41:18,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1017 states to 1017 states and 1502 transitions. [2025-03-17 11:41:18,315 INFO L78 Accepts]: Start accepts. Automaton has 1017 states and 1502 transitions. Word has length 66 [2025-03-17 11:41:18,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:41:18,315 INFO L471 AbstractCegarLoop]: Abstraction has 1017 states and 1502 transitions. [2025-03-17 11:41:18,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 3 states have internal predecessors, (64), 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-17 11:41:18,316 INFO L276 IsEmpty]: Start isEmpty. Operand 1017 states and 1502 transitions. [2025-03-17 11:41:18,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-17 11:41:18,319 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:41:18,319 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] [2025-03-17 11:41:18,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 11:41:18,320 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-17 11:41:18,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:41:18,320 INFO L85 PathProgramCache]: Analyzing trace with hash -94075490, now seen corresponding path program 1 times [2025-03-17 11:41:18,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:41:18,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857475493] [2025-03-17 11:41:18,320 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:41:18,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:41:18,363 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-17 11:41:18,367 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-17 11:41:18,368 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:41:18,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:41:18,668 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-17 11:41:18,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:41:18,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857475493] [2025-03-17 11:41:18,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857475493] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:41:18,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:41:18,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 11:41:18,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896080939] [2025-03-17 11:41:18,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:41:18,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 11:41:18,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:41:18,669 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 11:41:18,669 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 11:41:18,669 INFO L87 Difference]: Start difference. First operand 1017 states and 1502 transitions. Second operand has 4 states, 4 states have (on average 34.75) internal successors, (139), 3 states have internal predecessors, (139), 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-17 11:41:18,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:41:18,995 INFO L93 Difference]: Finished difference Result 1395 states and 2054 transitions. [2025-03-17 11:41:18,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 11:41:18,995 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.75) internal successors, (139), 3 states have internal predecessors, (139), 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 141 [2025-03-17 11:41:18,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:41:19,000 INFO L225 Difference]: With dead ends: 1395 [2025-03-17 11:41:19,000 INFO L226 Difference]: Without dead ends: 1395 [2025-03-17 11:41:19,000 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 11:41:19,001 INFO L435 NwaCegarLoop]: 1384 mSDtfsCounter, 538 mSDsluCounter, 2694 mSDsCounter, 0 mSdLazyCounter, 438 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 544 SdHoareTripleChecker+Valid, 4078 SdHoareTripleChecker+Invalid, 438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 438 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 11:41:19,001 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [544 Valid, 4078 Invalid, 438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 438 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 11:41:19,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1395 states. [2025-03-17 11:41:19,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1395 to 1020. [2025-03-17 11:41:19,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1020 states, 1001 states have (on average 1.4755244755244756) internal successors, (1477), 1006 states have internal predecessors, (1477), 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-17 11:41:19,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1020 states to 1020 states and 1505 transitions. [2025-03-17 11:41:19,039 INFO L78 Accepts]: Start accepts. Automaton has 1020 states and 1505 transitions. Word has length 141 [2025-03-17 11:41:19,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:41:19,040 INFO L471 AbstractCegarLoop]: Abstraction has 1020 states and 1505 transitions. [2025-03-17 11:41:19,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.75) internal successors, (139), 3 states have internal predecessors, (139), 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-17 11:41:19,040 INFO L276 IsEmpty]: Start isEmpty. Operand 1020 states and 1505 transitions. [2025-03-17 11:41:19,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2025-03-17 11:41:19,044 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:41:19,044 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] [2025-03-17 11:41:19,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 11:41:19,044 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-17 11:41:19,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:41:19,045 INFO L85 PathProgramCache]: Analyzing trace with hash -915478561, now seen corresponding path program 1 times [2025-03-17 11:41:19,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:41:19,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94180393] [2025-03-17 11:41:19,045 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:41:19,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:41:19,109 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 210 statements into 1 equivalence classes. [2025-03-17 11:41:19,115 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 210 of 210 statements. [2025-03-17 11:41:19,116 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:41:19,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:41:19,336 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-17 11:41:19,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:41:19,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94180393] [2025-03-17 11:41:19,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94180393] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:41:19,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:41:19,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 11:41:19,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688818394] [2025-03-17 11:41:19,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:41:19,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 11:41:19,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:41:19,339 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 11:41:19,339 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 11:41:19,339 INFO L87 Difference]: Start difference. First operand 1020 states and 1505 transitions. Second operand has 4 states, 4 states have (on average 52.0) internal successors, (208), 4 states have internal predecessors, (208), 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-17 11:41:19,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:41:19,594 INFO L93 Difference]: Finished difference Result 1023 states and 1501 transitions. [2025-03-17 11:41:19,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 11:41:19,594 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 52.0) internal successors, (208), 4 states have internal predecessors, (208), 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 210 [2025-03-17 11:41:19,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:41:19,598 INFO L225 Difference]: With dead ends: 1023 [2025-03-17 11:41:19,598 INFO L226 Difference]: Without dead ends: 1023 [2025-03-17 11:41:19,598 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-17 11:41:19,599 INFO L435 NwaCegarLoop]: 1353 mSDtfsCounter, 105 mSDsluCounter, 2622 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 3975 SdHoareTripleChecker+Invalid, 410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 11:41:19,599 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 3975 Invalid, 410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 394 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 11:41:19,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1023 states. [2025-03-17 11:41:19,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1023 to 1020. [2025-03-17 11:41:19,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1020 states, 1001 states have (on average 1.4685314685314685) internal successors, (1470), 1006 states have internal predecessors, (1470), 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-17 11:41:19,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1020 states to 1020 states and 1498 transitions. [2025-03-17 11:41:19,616 INFO L78 Accepts]: Start accepts. Automaton has 1020 states and 1498 transitions. Word has length 210 [2025-03-17 11:41:19,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:41:19,617 INFO L471 AbstractCegarLoop]: Abstraction has 1020 states and 1498 transitions. [2025-03-17 11:41:19,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 52.0) internal successors, (208), 4 states have internal predecessors, (208), 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-17 11:41:19,617 INFO L276 IsEmpty]: Start isEmpty. Operand 1020 states and 1498 transitions. [2025-03-17 11:41:19,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2025-03-17 11:41:19,622 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:41:19,622 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] [2025-03-17 11:41:19,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 11:41:19,623 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-17 11:41:19,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:41:19,624 INFO L85 PathProgramCache]: Analyzing trace with hash 668735205, now seen corresponding path program 1 times [2025-03-17 11:41:19,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:41:19,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055464995] [2025-03-17 11:41:19,625 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:41:19,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:41:19,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 210 statements into 1 equivalence classes. [2025-03-17 11:41:19,694 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 210 of 210 statements. [2025-03-17 11:41:19,695 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:41:19,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:41:19,853 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-17 11:41:19,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:41:19,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055464995] [2025-03-17 11:41:19,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055464995] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:41:19,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:41:19,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:41:19,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902878240] [2025-03-17 11:41:19,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:41:19,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:41:19,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:41:19,855 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:41:19,855 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:41:19,855 INFO L87 Difference]: Start difference. First operand 1020 states and 1498 transitions. Second operand has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 2 states have internal predecessors, (208), 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-17 11:41:20,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:41:20,124 INFO L93 Difference]: Finished difference Result 1588 states and 2344 transitions. [2025-03-17 11:41:20,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:41:20,125 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 2 states have internal predecessors, (208), 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 210 [2025-03-17 11:41:20,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:41:20,130 INFO L225 Difference]: With dead ends: 1588 [2025-03-17 11:41:20,130 INFO L226 Difference]: Without dead ends: 1588 [2025-03-17 11:41:20,130 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:41:20,131 INFO L435 NwaCegarLoop]: 1371 mSDtfsCounter, 788 mSDsluCounter, 1353 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 792 SdHoareTripleChecker+Valid, 2724 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 11:41:20,131 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [792 Valid, 2724 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 259 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 11:41:20,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1588 states. [2025-03-17 11:41:20,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1588 to 1428. [2025-03-17 11:41:20,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1428 states, 1407 states have (on average 1.4754797441364607) internal successors, (2076), 1412 states have internal predecessors, (2076), 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-17 11:41:20,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1428 states to 1428 states and 2108 transitions. [2025-03-17 11:41:20,158 INFO L78 Accepts]: Start accepts. Automaton has 1428 states and 2108 transitions. Word has length 210 [2025-03-17 11:41:20,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:41:20,158 INFO L471 AbstractCegarLoop]: Abstraction has 1428 states and 2108 transitions. [2025-03-17 11:41:20,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 2 states have internal predecessors, (208), 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-17 11:41:20,158 INFO L276 IsEmpty]: Start isEmpty. Operand 1428 states and 2108 transitions. [2025-03-17 11:41:20,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2025-03-17 11:41:20,160 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:41:20,160 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] [2025-03-17 11:41:20,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 11:41:20,161 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-17 11:41:20,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:41:20,161 INFO L85 PathProgramCache]: Analyzing trace with hash 1208913336, now seen corresponding path program 1 times [2025-03-17 11:41:20,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:41:20,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305513427] [2025-03-17 11:41:20,161 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:41:20,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:41:20,218 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 225 statements into 1 equivalence classes. [2025-03-17 11:41:20,242 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 225 of 225 statements. [2025-03-17 11:41:20,242 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:41:20,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:41:20,457 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-17 11:41:20,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:41:20,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305513427] [2025-03-17 11:41:20,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305513427] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:41:20,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:41:20,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 11:41:20,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455983521] [2025-03-17 11:41:20,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:41:20,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 11:41:20,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:41:20,459 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 11:41:20,459 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 11:41:20,459 INFO L87 Difference]: Start difference. First operand 1428 states and 2108 transitions. Second operand has 4 states, 4 states have (on average 54.0) internal successors, (216), 4 states have internal predecessors, (216), 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-17 11:41:20,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:41:20,707 INFO L93 Difference]: Finished difference Result 1431 states and 2104 transitions. [2025-03-17 11:41:20,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 11:41:20,708 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 54.0) internal successors, (216), 4 states have internal predecessors, (216), 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 225 [2025-03-17 11:41:20,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:41:20,713 INFO L225 Difference]: With dead ends: 1431 [2025-03-17 11:41:20,713 INFO L226 Difference]: Without dead ends: 1431 [2025-03-17 11:41:20,713 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-17 11:41:20,714 INFO L435 NwaCegarLoop]: 1346 mSDtfsCounter, 105 mSDsluCounter, 2608 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 3954 SdHoareTripleChecker+Invalid, 410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 11:41:20,714 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 3954 Invalid, 410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 394 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 11:41:20,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1431 states. [2025-03-17 11:41:20,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1431 to 1428. [2025-03-17 11:41:20,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1428 states, 1407 states have (on average 1.4705046197583511) internal successors, (2069), 1412 states have internal predecessors, (2069), 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-17 11:41:20,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1428 states to 1428 states and 2101 transitions. [2025-03-17 11:41:20,744 INFO L78 Accepts]: Start accepts. Automaton has 1428 states and 2101 transitions. Word has length 225 [2025-03-17 11:41:20,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:41:20,744 INFO L471 AbstractCegarLoop]: Abstraction has 1428 states and 2101 transitions. [2025-03-17 11:41:20,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 54.0) internal successors, (216), 4 states have internal predecessors, (216), 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-17 11:41:20,745 INFO L276 IsEmpty]: Start isEmpty. Operand 1428 states and 2101 transitions. [2025-03-17 11:41:20,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2025-03-17 11:41:20,747 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:41:20,747 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] [2025-03-17 11:41:20,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 11:41:20,747 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-17 11:41:20,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:41:20,748 INFO L85 PathProgramCache]: Analyzing trace with hash -2061798639, now seen corresponding path program 1 times [2025-03-17 11:41:20,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:41:20,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749628339] [2025-03-17 11:41:20,748 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:41:20,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:41:20,802 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 225 statements into 1 equivalence classes. [2025-03-17 11:41:20,820 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 225 of 225 statements. [2025-03-17 11:41:20,820 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:41:20,820 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:41:20,976 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-17 11:41:20,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:41:20,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749628339] [2025-03-17 11:41:20,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749628339] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:41:20,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:41:20,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 11:41:20,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522522048] [2025-03-17 11:41:20,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:41:20,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:41:20,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:41:20,977 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:41:20,978 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:41:20,978 INFO L87 Difference]: Start difference. First operand 1428 states and 2101 transitions. Second operand has 3 states, 3 states have (on average 72.0) internal successors, (216), 3 states have internal predecessors, (216), 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-17 11:41:21,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:41:21,188 INFO L93 Difference]: Finished difference Result 1434 states and 2107 transitions. [2025-03-17 11:41:21,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:41:21,188 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 72.0) internal successors, (216), 3 states have internal predecessors, (216), 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 225 [2025-03-17 11:41:21,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:41:21,194 INFO L225 Difference]: With dead ends: 1434 [2025-03-17 11:41:21,194 INFO L226 Difference]: Without dead ends: 1434 [2025-03-17 11:41:21,194 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-17 11:41:21,195 INFO L435 NwaCegarLoop]: 1360 mSDtfsCounter, 1 mSDsluCounter, 1338 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2698 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 11:41:21,195 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2698 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 11:41:21,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1434 states. [2025-03-17 11:41:21,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1434 to 1434. [2025-03-17 11:41:21,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1434 states, 1413 states have (on average 1.4685067232837934) internal successors, (2075), 1418 states have internal predecessors, (2075), 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-17 11:41:21,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1434 states to 1434 states and 2107 transitions. [2025-03-17 11:41:21,220 INFO L78 Accepts]: Start accepts. Automaton has 1434 states and 2107 transitions. Word has length 225 [2025-03-17 11:41:21,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:41:21,220 INFO L471 AbstractCegarLoop]: Abstraction has 1434 states and 2107 transitions. [2025-03-17 11:41:21,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.0) internal successors, (216), 3 states have internal predecessors, (216), 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-17 11:41:21,222 INFO L276 IsEmpty]: Start isEmpty. Operand 1434 states and 2107 transitions. [2025-03-17 11:41:21,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2025-03-17 11:41:21,225 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:41:21,225 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] [2025-03-17 11:41:21,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 11:41:21,225 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-17 11:41:21,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:41:21,226 INFO L85 PathProgramCache]: Analyzing trace with hash 1997490482, now seen corresponding path program 1 times [2025-03-17 11:41:21,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:41:21,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693021669] [2025-03-17 11:41:21,226 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:41:21,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:41:21,297 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 225 statements into 1 equivalence classes. [2025-03-17 11:41:21,335 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 225 of 225 statements. [2025-03-17 11:41:21,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:41:21,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:41:21,487 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-17 11:41:21,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:41:21,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693021669] [2025-03-17 11:41:21,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693021669] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:41:21,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:41:21,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 11:41:21,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988142049] [2025-03-17 11:41:21,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:41:21,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:41:21,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:41:21,489 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:41:21,489 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:41:21,489 INFO L87 Difference]: Start difference. First operand 1434 states and 2107 transitions. Second operand has 3 states, 3 states have (on average 72.0) internal successors, (216), 3 states have internal predecessors, (216), 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-17 11:41:21,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:41:21,752 INFO L93 Difference]: Finished difference Result 2047 states and 3009 transitions. [2025-03-17 11:41:21,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:41:21,753 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 72.0) internal successors, (216), 3 states have internal predecessors, (216), 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 225 [2025-03-17 11:41:21,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:41:21,759 INFO L225 Difference]: With dead ends: 2047 [2025-03-17 11:41:21,760 INFO L226 Difference]: Without dead ends: 2047 [2025-03-17 11:41:21,761 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-17 11:41:21,761 INFO L435 NwaCegarLoop]: 1748 mSDtfsCounter, 745 mSDsluCounter, 1347 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 749 SdHoareTripleChecker+Valid, 3095 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 11:41:21,761 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [749 Valid, 3095 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 11:41:21,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2047 states. [2025-03-17 11:41:21,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2047 to 2039. [2025-03-17 11:41:21,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2039 states, 2012 states have (on average 1.4696819085487078) internal successors, (2957), 2017 states have internal predecessors, (2957), 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-17 11:41:21,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2039 states to 2039 states and 3001 transitions. [2025-03-17 11:41:21,808 INFO L78 Accepts]: Start accepts. Automaton has 2039 states and 3001 transitions. Word has length 225 [2025-03-17 11:41:21,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:41:21,809 INFO L471 AbstractCegarLoop]: Abstraction has 2039 states and 3001 transitions. [2025-03-17 11:41:21,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.0) internal successors, (216), 3 states have internal predecessors, (216), 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-17 11:41:21,810 INFO L276 IsEmpty]: Start isEmpty. Operand 2039 states and 3001 transitions. [2025-03-17 11:41:21,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2025-03-17 11:41:21,812 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:41:21,812 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] [2025-03-17 11:41:21,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 11:41:21,812 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-17 11:41:21,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:41:21,813 INFO L85 PathProgramCache]: Analyzing trace with hash 1994377682, now seen corresponding path program 1 times [2025-03-17 11:41:21,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:41:21,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349977797] [2025-03-17 11:41:21,814 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:41:21,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:41:21,870 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 240 statements into 1 equivalence classes. [2025-03-17 11:41:21,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 240 of 240 statements. [2025-03-17 11:41:21,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:41:21,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:41:22,114 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-17 11:41:22,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:41:22,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349977797] [2025-03-17 11:41:22,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349977797] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:41:22,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:41:22,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 11:41:22,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904815579] [2025-03-17 11:41:22,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:41:22,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 11:41:22,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:41:22,116 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 11:41:22,116 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 11:41:22,116 INFO L87 Difference]: Start difference. First operand 2039 states and 3001 transitions. Second operand has 4 states, 4 states have (on average 55.25) internal successors, (221), 4 states have internal predecessors, (221), 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-17 11:41:22,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:41:22,848 INFO L93 Difference]: Finished difference Result 1616 states and 2362 transitions. [2025-03-17 11:41:22,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 11:41:22,848 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 55.25) internal successors, (221), 4 states have internal predecessors, (221), 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 240 [2025-03-17 11:41:22,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:41:22,853 INFO L225 Difference]: With dead ends: 1616 [2025-03-17 11:41:22,854 INFO L226 Difference]: Without dead ends: 1616 [2025-03-17 11:41:22,854 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-17 11:41:22,854 INFO L435 NwaCegarLoop]: 1460 mSDtfsCounter, 2656 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2656 SdHoareTripleChecker+Valid, 1709 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-17 11:41:22,855 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2656 Valid, 1709 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-17 11:41:22,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1616 states. [2025-03-17 11:41:22,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1616 to 1616. [2025-03-17 11:41:22,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1616 states, 1594 states have (on average 1.4604767879548306) internal successors, (2328), 1599 states have internal predecessors, (2328), 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-17 11:41:22,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1616 states to 1616 states and 2362 transitions. [2025-03-17 11:41:22,883 INFO L78 Accepts]: Start accepts. Automaton has 1616 states and 2362 transitions. Word has length 240 [2025-03-17 11:41:22,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:41:22,883 INFO L471 AbstractCegarLoop]: Abstraction has 1616 states and 2362 transitions. [2025-03-17 11:41:22,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 55.25) internal successors, (221), 4 states have internal predecessors, (221), 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-17 11:41:22,883 INFO L276 IsEmpty]: Start isEmpty. Operand 1616 states and 2362 transitions. [2025-03-17 11:41:22,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2025-03-17 11:41:22,886 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:41:22,886 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] [2025-03-17 11:41:22,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 11:41:22,886 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-17 11:41:22,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:41:22,886 INFO L85 PathProgramCache]: Analyzing trace with hash -1307603328, now seen corresponding path program 1 times [2025-03-17 11:41:22,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:41:22,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145636871] [2025-03-17 11:41:22,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:41:22,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:41:22,948 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 250 statements into 1 equivalence classes. [2025-03-17 11:41:22,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 250 of 250 statements. [2025-03-17 11:41:22,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:41:22,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:41:23,260 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-17 11:41:23,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:41:23,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145636871] [2025-03-17 11:41:23,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145636871] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:41:23,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:41:23,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 11:41:23,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125447316] [2025-03-17 11:41:23,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:41:23,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 11:41:23,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:41:23,261 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 11:41:23,262 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 11:41:23,262 INFO L87 Difference]: Start difference. First operand 1616 states and 2362 transitions. Second operand has 4 states, 4 states have (on average 57.5) internal successors, (230), 4 states have internal predecessors, (230), 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-17 11:41:23,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:41:23,502 INFO L93 Difference]: Finished difference Result 1574 states and 2285 transitions. [2025-03-17 11:41:23,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 11:41:23,503 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 57.5) internal successors, (230), 4 states have internal predecessors, (230), 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 250 [2025-03-17 11:41:23,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:41:23,508 INFO L225 Difference]: With dead ends: 1574 [2025-03-17 11:41:23,509 INFO L226 Difference]: Without dead ends: 1574 [2025-03-17 11:41:23,509 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-17 11:41:23,509 INFO L435 NwaCegarLoop]: 1272 mSDtfsCounter, 30 mSDsluCounter, 2525 mSDsCounter, 0 mSdLazyCounter, 374 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 3797 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-17 11:41:23,509 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 3797 Invalid, 396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 374 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 11:41:23,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1574 states. [2025-03-17 11:41:23,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1574 to 1574. [2025-03-17 11:41:23,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1574 states, 1552 states have (on average 1.4503865979381443) internal successors, (2251), 1557 states have internal predecessors, (2251), 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-17 11:41:23,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1574 states to 1574 states and 2285 transitions. [2025-03-17 11:41:23,539 INFO L78 Accepts]: Start accepts. Automaton has 1574 states and 2285 transitions. Word has length 250 [2025-03-17 11:41:23,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:41:23,540 INFO L471 AbstractCegarLoop]: Abstraction has 1574 states and 2285 transitions. [2025-03-17 11:41:23,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 57.5) internal successors, (230), 4 states have internal predecessors, (230), 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-17 11:41:23,540 INFO L276 IsEmpty]: Start isEmpty. Operand 1574 states and 2285 transitions. [2025-03-17 11:41:23,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2025-03-17 11:41:23,543 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:41:23,543 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] [2025-03-17 11:41:23,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 11:41:23,543 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-17 11:41:23,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:41:23,544 INFO L85 PathProgramCache]: Analyzing trace with hash -1322185657, now seen corresponding path program 1 times [2025-03-17 11:41:23,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:41:23,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561480439] [2025-03-17 11:41:23,545 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:41:23,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:41:23,608 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 250 statements into 1 equivalence classes. [2025-03-17 11:41:23,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 250 of 250 statements. [2025-03-17 11:41:23,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:41:23,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:41:24,384 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-17 11:41:24,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:41:24,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561480439] [2025-03-17 11:41:24,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561480439] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:41:24,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [438389009] [2025-03-17 11:41:24,385 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:41:24,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:41:24,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:41:24,388 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-17 11:41:24,390 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-17 11:41:24,730 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 250 statements into 1 equivalence classes. [2025-03-17 11:41:24,879 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 250 of 250 statements. [2025-03-17 11:41:24,879 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:41:24,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:41:24,888 INFO L256 TraceCheckSpWp]: Trace formula consists of 1262 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-17 11:41:24,898 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:41:25,294 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-17 11:41:25,307 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-17 11:41:25,318 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-17 11:41:25,318 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 11:41:25,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [438389009] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:41:25,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 11:41:25,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 11 [2025-03-17 11:41:25,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84865878] [2025-03-17 11:41:25,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:41:25,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 11:41:25,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:41:25,320 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 11:41:25,320 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2025-03-17 11:41:25,320 INFO L87 Difference]: Start difference. First operand 1574 states and 2285 transitions. Second operand has 7 states, 7 states have (on average 33.0) internal successors, (231), 7 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-17 11:41:25,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:41:25,941 INFO L93 Difference]: Finished difference Result 1990 states and 2868 transitions. [2025-03-17 11:41:25,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 11:41:25,942 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 33.0) internal successors, (231), 7 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 250 [2025-03-17 11:41:25,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:41:25,950 INFO L225 Difference]: With dead ends: 1990 [2025-03-17 11:41:25,950 INFO L226 Difference]: Without dead ends: 1990 [2025-03-17 11:41:25,951 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 239 SyntacticMatches, 7 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2025-03-17 11:41:25,952 INFO L435 NwaCegarLoop]: 1230 mSDtfsCounter, 1486 mSDsluCounter, 4091 mSDsCounter, 0 mSdLazyCounter, 813 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1494 SdHoareTripleChecker+Valid, 5321 SdHoareTripleChecker+Invalid, 820 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 813 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 11:41:25,953 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1494 Valid, 5321 Invalid, 820 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 813 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 11:41:25,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1990 states. [2025-03-17 11:41:25,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1990 to 1790. [2025-03-17 11:41:25,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1790 states, 1758 states have (on average 1.4448236632536975) internal successors, (2540), 1767 states have internal predecessors, (2540), 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-17 11:41:25,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1790 states to 1790 states and 2588 transitions. [2025-03-17 11:41:25,984 INFO L78 Accepts]: Start accepts. Automaton has 1790 states and 2588 transitions. Word has length 250 [2025-03-17 11:41:25,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:41:25,985 INFO L471 AbstractCegarLoop]: Abstraction has 1790 states and 2588 transitions. [2025-03-17 11:41:25,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 33.0) internal successors, (231), 7 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-17 11:41:25,985 INFO L276 IsEmpty]: Start isEmpty. Operand 1790 states and 2588 transitions. [2025-03-17 11:41:25,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2025-03-17 11:41:25,988 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:41:25,988 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] [2025-03-17 11:41:25,998 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-17 11:41:26,193 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-17 11:41:26,193 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-17 11:41:26,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:41:26,193 INFO L85 PathProgramCache]: Analyzing trace with hash -885282159, now seen corresponding path program 1 times [2025-03-17 11:41:26,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:41:26,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67568846] [2025-03-17 11:41:26,194 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:41:26,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:41:26,274 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 325 statements into 1 equivalence classes. [2025-03-17 11:41:26,354 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 325 of 325 statements. [2025-03-17 11:41:26,354 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:41:26,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:41:27,210 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-17 11:41:27,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:41:27,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67568846] [2025-03-17 11:41:27,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67568846] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:41:27,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [915044857] [2025-03-17 11:41:27,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:41:27,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:41:27,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:41:27,212 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-17 11:41:27,214 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-17 11:41:27,585 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 325 statements into 1 equivalence classes. [2025-03-17 11:41:27,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 325 of 325 statements. [2025-03-17 11:41:27,759 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:41:27,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:41:27,767 INFO L256 TraceCheckSpWp]: Trace formula consists of 1641 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 11:41:27,775 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:41:27,784 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-17 11:41:28,044 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-17 11:41:28,051 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-17 11:41:28,056 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-17 11:41:28,056 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:41:28,274 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-17 11:41:28,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [915044857] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:41:28,274 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:41:28,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 12 [2025-03-17 11:41:28,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759440810] [2025-03-17 11:41:28,275 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:41:28,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 11:41:28,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:41:28,276 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 11:41:28,276 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2025-03-17 11:41:28,276 INFO L87 Difference]: Start difference. First operand 1790 states and 2588 transitions. Second operand has 12 states, 12 states have (on average 39.5) internal successors, (474), 12 states have internal predecessors, (474), 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-17 11:41:28,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:41:28,983 INFO L93 Difference]: Finished difference Result 2986 states and 4275 transitions. [2025-03-17 11:41:28,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 11:41:28,983 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 39.5) internal successors, (474), 12 states have internal predecessors, (474), 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 325 [2025-03-17 11:41:28,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:41:28,991 INFO L225 Difference]: With dead ends: 2986 [2025-03-17 11:41:28,992 INFO L226 Difference]: Without dead ends: 2986 [2025-03-17 11:41:28,992 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 661 GetRequests, 640 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-17 11:41:28,992 INFO L435 NwaCegarLoop]: 1258 mSDtfsCounter, 3733 mSDsluCounter, 6097 mSDsCounter, 0 mSdLazyCounter, 942 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3751 SdHoareTripleChecker+Valid, 7355 SdHoareTripleChecker+Invalid, 951 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 942 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 11:41:28,993 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3751 Valid, 7355 Invalid, 951 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 942 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 11:41:28,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2986 states. [2025-03-17 11:41:29,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2986 to 2614. [2025-03-17 11:41:29,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2614 states, 2570 states have (on average 1.4303501945525292) internal successors, (3676), 2579 states have internal predecessors, (3676), 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-17 11:41:29,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2614 states to 2614 states and 3746 transitions. [2025-03-17 11:41:29,034 INFO L78 Accepts]: Start accepts. Automaton has 2614 states and 3746 transitions. Word has length 325 [2025-03-17 11:41:29,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:41:29,035 INFO L471 AbstractCegarLoop]: Abstraction has 2614 states and 3746 transitions. [2025-03-17 11:41:29,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 39.5) internal successors, (474), 12 states have internal predecessors, (474), 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-17 11:41:29,035 INFO L276 IsEmpty]: Start isEmpty. Operand 2614 states and 3746 transitions. [2025-03-17 11:41:29,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 758 [2025-03-17 11:41:29,045 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:41:29,045 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] [2025-03-17 11:41:29,055 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-17 11:41:29,245 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-17 11:41:29,246 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-17 11:41:29,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:41:29,247 INFO L85 PathProgramCache]: Analyzing trace with hash 963504342, now seen corresponding path program 1 times [2025-03-17 11:41:29,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:41:29,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488607914] [2025-03-17 11:41:29,247 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:41:29,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:41:29,435 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 757 statements into 1 equivalence classes. [2025-03-17 11:41:29,646 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 757 of 757 statements. [2025-03-17 11:41:29,646 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:41:29,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:41:33,618 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-17 11:41:33,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:41:33,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488607914] [2025-03-17 11:41:33,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488607914] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:41:33,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1738876133] [2025-03-17 11:41:33,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:41:33,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:41:33,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:41:33,621 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-17 11:41:33,623 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-17 11:41:34,160 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 757 statements into 1 equivalence classes. [2025-03-17 11:41:34,587 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 757 of 757 statements. [2025-03-17 11:41:34,587 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:41:34,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:41:34,607 INFO L256 TraceCheckSpWp]: Trace formula consists of 3756 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-17 11:41:34,618 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:41:34,623 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-17 11:41:34,884 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-17 11:41:35,028 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-03-17 11:41:35,165 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-17 11:41:35,300 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-17 11:41:35,306 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-17 11:41:35,311 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-17 11:41:35,311 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:41:35,984 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-17 11:41:35,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1738876133] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:41:35,985 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:41:35,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 8, 8] total 21 [2025-03-17 11:41:35,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480987833] [2025-03-17 11:41:35,987 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:41:35,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-17 11:41:35,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:41:35,989 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-17 11:41:35,989 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=271, Unknown=0, NotChecked=0, Total=420 [2025-03-17 11:41:35,990 INFO L87 Difference]: Start difference. First operand 2614 states and 3746 transitions. Second operand has 21 states, 21 states have (on average 64.0) internal successors, (1344), 21 states have internal predecessors, (1344), 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-17 11:41:37,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:41:37,405 INFO L93 Difference]: Finished difference Result 5248 states and 7479 transitions. [2025-03-17 11:41:37,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-03-17 11:41:37,406 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 64.0) internal successors, (1344), 21 states have internal predecessors, (1344), 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 757 [2025-03-17 11:41:37,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:41:37,422 INFO L225 Difference]: With dead ends: 5248 [2025-03-17 11:41:37,424 INFO L226 Difference]: Without dead ends: 5248 [2025-03-17 11:41:37,425 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1536 GetRequests, 1500 SyntacticMatches, 7 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 292 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=286, Invalid=644, Unknown=0, NotChecked=0, Total=930 [2025-03-17 11:41:37,425 INFO L435 NwaCegarLoop]: 1258 mSDtfsCounter, 7760 mSDsluCounter, 11848 mSDsCounter, 0 mSdLazyCounter, 1670 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7802 SdHoareTripleChecker+Valid, 13106 SdHoareTripleChecker+Invalid, 1682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1670 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:41:37,425 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7802 Valid, 13106 Invalid, 1682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1670 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-17 11:41:37,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5248 states. [2025-03-17 11:41:37,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5248 to 4876. [2025-03-17 11:41:37,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4876 states, 4808 states have (on average 1.420965058236273) internal successors, (6832), 4817 states have internal predecessors, (6832), 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-17 11:41:37,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4876 states to 4876 states and 6950 transitions. [2025-03-17 11:41:37,505 INFO L78 Accepts]: Start accepts. Automaton has 4876 states and 6950 transitions. Word has length 757 [2025-03-17 11:41:37,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:41:37,506 INFO L471 AbstractCegarLoop]: Abstraction has 4876 states and 6950 transitions. [2025-03-17 11:41:37,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 64.0) internal successors, (1344), 21 states have internal predecessors, (1344), 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-17 11:41:37,506 INFO L276 IsEmpty]: Start isEmpty. Operand 4876 states and 6950 transitions. [2025-03-17 11:41:37,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1622 [2025-03-17 11:41:37,556 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:41:37,557 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] [2025-03-17 11:41:37,574 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-17 11:41:37,757 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-17 11:41:37,758 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-17 11:41:37,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:41:37,759 INFO L85 PathProgramCache]: Analyzing trace with hash 1738152800, now seen corresponding path program 2 times [2025-03-17 11:41:37,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:41:37,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466148747] [2025-03-17 11:41:37,759 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 11:41:37,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:41:38,166 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1621 statements into 2 equivalence classes. [2025-03-17 11:41:38,188 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 76 of 1621 statements. [2025-03-17 11:41:38,188 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 11:41:38,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:41:38,346 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-17 11:41:38,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:41:38,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466148747] [2025-03-17 11:41:38,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466148747] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:41:38,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:41:38,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 11:41:38,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454217556] [2025-03-17 11:41:38,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:41:38,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 11:41:38,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:41:38,348 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 11:41:38,348 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-17 11:41:38,348 INFO L87 Difference]: Start difference. First operand 4876 states and 6950 transitions. Second operand has 8 states, 8 states have (on average 29.625) internal successors, (237), 8 states have internal predecessors, (237), 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-17 11:41:39,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:41:39,082 INFO L93 Difference]: Finished difference Result 4891 states and 6966 transitions. [2025-03-17 11:41:39,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 11:41:39,083 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 29.625) internal successors, (237), 8 states have internal predecessors, (237), 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 1621 [2025-03-17 11:41:39,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:41:39,091 INFO L225 Difference]: With dead ends: 4891 [2025-03-17 11:41:39,091 INFO L226 Difference]: Without dead ends: 4891 [2025-03-17 11:41:39,091 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-17 11:41:39,092 INFO L435 NwaCegarLoop]: 1278 mSDtfsCounter, 53 mSDsluCounter, 6066 mSDsCounter, 0 mSdLazyCounter, 1045 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 7344 SdHoareTripleChecker+Invalid, 1049 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1045 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-17 11:41:39,092 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 7344 Invalid, 1049 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1045 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-17 11:41:39,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4891 states. [2025-03-17 11:41:39,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4891 to 4887. [2025-03-17 11:41:39,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4887 states, 4819 states have (on average 1.4200041502386387) internal successors, (6843), 4828 states have internal predecessors, (6843), 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-17 11:41:39,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4887 states to 4887 states and 6961 transitions. [2025-03-17 11:41:39,141 INFO L78 Accepts]: Start accepts. Automaton has 4887 states and 6961 transitions. Word has length 1621 [2025-03-17 11:41:39,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:41:39,143 INFO L471 AbstractCegarLoop]: Abstraction has 4887 states and 6961 transitions. [2025-03-17 11:41:39,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 29.625) internal successors, (237), 8 states have internal predecessors, (237), 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-17 11:41:39,144 INFO L276 IsEmpty]: Start isEmpty. Operand 4887 states and 6961 transitions. [2025-03-17 11:41:39,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1623 [2025-03-17 11:41:39,160 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:41:39,161 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-17 11:41:39,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 11:41:39,161 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-17 11:41:39,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:41:39,163 INFO L85 PathProgramCache]: Analyzing trace with hash 814609995, now seen corresponding path program 1 times [2025-03-17 11:41:39,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:41:39,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470198926] [2025-03-17 11:41:39,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:41:39,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:41:39,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1622 statements into 1 equivalence classes. [2025-03-17 11:41:40,415 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1622 of 1622 statements. [2025-03-17 11:41:40,416 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:41:40,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:41:43,879 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-17 11:41:43,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:41:43,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470198926] [2025-03-17 11:41:43,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470198926] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:41:43,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:41:43,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 11:41:43,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047462955] [2025-03-17 11:41:43,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:41:43,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 11:41:43,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:41:43,881 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 11:41:43,881 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-17 11:41:43,881 INFO L87 Difference]: Start difference. First operand 4887 states and 6961 transitions. Second operand has 7 states, 7 states have (on average 34.0) internal successors, (238), 7 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-17 11:41:44,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:41:44,407 INFO L93 Difference]: Finished difference Result 4892 states and 6967 transitions. [2025-03-17 11:41:44,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 11:41:44,407 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 34.0) internal successors, (238), 7 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-17 11:41:44,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:41:44,416 INFO L225 Difference]: With dead ends: 4892 [2025-03-17 11:41:44,416 INFO L226 Difference]: Without dead ends: 4892 [2025-03-17 11:41:44,417 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-17 11:41:44,417 INFO L435 NwaCegarLoop]: 1284 mSDtfsCounter, 21 mSDsluCounter, 4862 mSDsCounter, 0 mSdLazyCounter, 869 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 6146 SdHoareTripleChecker+Invalid, 870 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 869 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 11:41:44,417 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 6146 Invalid, 870 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 869 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 11:41:44,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4892 states. [2025-03-17 11:41:44,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4892 to 4891. [2025-03-17 11:41:44,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4891 states, 4823 states have (on average 1.4198631557122123) internal successors, (6848), 4832 states have internal predecessors, (6848), 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-17 11:41:44,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4891 states to 4891 states and 6966 transitions. [2025-03-17 11:41:44,499 INFO L78 Accepts]: Start accepts. Automaton has 4891 states and 6966 transitions. Word has length 1622 [2025-03-17 11:41:44,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:41:44,500 INFO L471 AbstractCegarLoop]: Abstraction has 4891 states and 6966 transitions. [2025-03-17 11:41:44,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 34.0) internal successors, (238), 7 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-17 11:41:44,500 INFO L276 IsEmpty]: Start isEmpty. Operand 4891 states and 6966 transitions. [2025-03-17 11:41:44,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1623 [2025-03-17 11:41:44,516 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:41:44,517 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-17 11:41:44,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 11:41:44,517 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-17 11:41:44,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:41:44,518 INFO L85 PathProgramCache]: Analyzing trace with hash -827829198, now seen corresponding path program 1 times [2025-03-17 11:41:44,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:41:44,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521808612] [2025-03-17 11:41:44,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:41:44,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:41:45,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1622 statements into 1 equivalence classes. [2025-03-17 11:41:45,652 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1622 of 1622 statements. [2025-03-17 11:41:45,652 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:41:45,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:41:48,449 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-17 11:41:48,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:41:48,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521808612] [2025-03-17 11:41:48,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521808612] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:41:48,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:41:48,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 11:41:48,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543366785] [2025-03-17 11:41:48,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:41:48,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 11:41:48,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:41:48,452 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 11:41:48,452 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-17 11:41:48,452 INFO L87 Difference]: Start difference. First operand 4891 states and 6966 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-17 11:41:48,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:41:48,922 INFO L93 Difference]: Finished difference Result 4899 states and 6976 transitions. [2025-03-17 11:41:48,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 11:41:48,922 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-17 11:41:48,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:41:48,929 INFO L225 Difference]: With dead ends: 4899 [2025-03-17 11:41:48,929 INFO L226 Difference]: Without dead ends: 4899 [2025-03-17 11:41:48,929 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-17 11:41:48,929 INFO L435 NwaCegarLoop]: 1278 mSDtfsCounter, 25 mSDsluCounter, 6099 mSDsCounter, 0 mSdLazyCounter, 1068 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 7377 SdHoareTripleChecker+Invalid, 1070 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1068 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 11:41:48,930 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 7377 Invalid, 1070 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1068 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 11:41:48,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4899 states. [2025-03-17 11:41:48,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4899 to 4891. [2025-03-17 11:41:48,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4891 states, 4823 states have (on average 1.4198631557122123) internal successors, (6848), 4832 states have internal predecessors, (6848), 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-17 11:41:48,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4891 states to 4891 states and 6966 transitions. [2025-03-17 11:41:48,968 INFO L78 Accepts]: Start accepts. Automaton has 4891 states and 6966 transitions. Word has length 1622 [2025-03-17 11:41:48,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:41:48,969 INFO L471 AbstractCegarLoop]: Abstraction has 4891 states and 6966 transitions. [2025-03-17 11:41:48,969 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-17 11:41:48,970 INFO L276 IsEmpty]: Start isEmpty. Operand 4891 states and 6966 transitions. [2025-03-17 11:41:48,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1624 [2025-03-17 11:41:48,987 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:41:48,988 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-17 11:41:48,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-17 11:41:48,988 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-17 11:41:48,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:41:48,989 INFO L85 PathProgramCache]: Analyzing trace with hash -1421420615, now seen corresponding path program 1 times [2025-03-17 11:41:48,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:41:48,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021768921] [2025-03-17 11:41:48,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:41:48,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:41:49,465 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1623 statements into 1 equivalence classes. [2025-03-17 11:41:50,070 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1623 of 1623 statements. [2025-03-17 11:41:50,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:41:50,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:41:53,401 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-17 11:41:53,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:41:53,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021768921] [2025-03-17 11:41:53,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021768921] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:41:53,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:41:53,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 11:41:53,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99637490] [2025-03-17 11:41:53,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:41:53,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 11:41:53,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:41:53,408 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 11:41:53,409 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-17 11:41:53,409 INFO L87 Difference]: Start difference. First operand 4891 states and 6966 transitions. Second operand has 9 states, 9 states have (on average 26.555555555555557) internal successors, (239), 9 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-17 11:41:54,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:41:54,192 INFO L93 Difference]: Finished difference Result 4902 states and 6980 transitions. [2025-03-17 11:41:54,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 11:41:54,193 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 26.555555555555557) internal successors, (239), 9 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-17 11:41:54,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:41:54,202 INFO L225 Difference]: With dead ends: 4902 [2025-03-17 11:41:54,202 INFO L226 Difference]: Without dead ends: 4902 [2025-03-17 11:41:54,202 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-17 11:41:54,203 INFO L435 NwaCegarLoop]: 1278 mSDtfsCounter, 31 mSDsluCounter, 8576 mSDsCounter, 0 mSdLazyCounter, 1388 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 9854 SdHoareTripleChecker+Invalid, 1391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-17 11:41:54,203 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 9854 Invalid, 1391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1388 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-17 11:41:54,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4902 states. [2025-03-17 11:41:54,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4902 to 4899. [2025-03-17 11:41:54,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4899 states, 4831 states have (on average 1.4195818671082592) internal successors, (6858), 4840 states have internal predecessors, (6858), 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-17 11:41:54,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4899 states to 4899 states and 6976 transitions. [2025-03-17 11:41:54,261 INFO L78 Accepts]: Start accepts. Automaton has 4899 states and 6976 transitions. Word has length 1623 [2025-03-17 11:41:54,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:41:54,263 INFO L471 AbstractCegarLoop]: Abstraction has 4899 states and 6976 transitions. [2025-03-17 11:41:54,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 26.555555555555557) internal successors, (239), 9 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-17 11:41:54,263 INFO L276 IsEmpty]: Start isEmpty. Operand 4899 states and 6976 transitions. [2025-03-17 11:41:54,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1625 [2025-03-17 11:41:54,292 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:41:54,292 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-17 11:41:54,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-17 11:41:54,293 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-17 11:41:54,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:41:54,294 INFO L85 PathProgramCache]: Analyzing trace with hash 1413455278, now seen corresponding path program 1 times [2025-03-17 11:41:54,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:41:54,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089249018] [2025-03-17 11:41:54,295 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:41:54,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:41:54,736 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1624 statements into 1 equivalence classes. [2025-03-17 11:41:55,232 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1624 of 1624 statements. [2025-03-17 11:41:55,233 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:41:55,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:41:57,869 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-17 11:41:57,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:41:57,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089249018] [2025-03-17 11:41:57,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089249018] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:41:57,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:41:57,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 11:41:57,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622649382] [2025-03-17 11:41:57,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:41:57,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 11:41:57,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:41:57,871 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 11:41:57,871 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-17 11:41:57,871 INFO L87 Difference]: Start difference. First operand 4899 states and 6976 transitions. Second operand has 7 states, 7 states have (on average 34.285714285714285) internal successors, (240), 7 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-17 11:41:58,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:41:58,305 INFO L93 Difference]: Finished difference Result 4902 states and 6979 transitions. [2025-03-17 11:41:58,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 11:41:58,306 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 34.285714285714285) internal successors, (240), 7 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-17 11:41:58,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:41:58,314 INFO L225 Difference]: With dead ends: 4902 [2025-03-17 11:41:58,314 INFO L226 Difference]: Without dead ends: 4902 [2025-03-17 11:41:58,315 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-17 11:41:58,315 INFO L435 NwaCegarLoop]: 1287 mSDtfsCounter, 16 mSDsluCounter, 4877 mSDsCounter, 0 mSdLazyCounter, 859 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 6164 SdHoareTripleChecker+Invalid, 860 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 859 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 11:41:58,315 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 6164 Invalid, 860 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 859 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 11:41:58,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4902 states. [2025-03-17 11:41:58,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4902 to 4902. [2025-03-17 11:41:58,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4902 states, 4834 states have (on average 1.4193214729002896) internal successors, (6861), 4843 states have internal predecessors, (6861), 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-17 11:41:58,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4902 states to 4902 states and 6979 transitions. [2025-03-17 11:41:58,359 INFO L78 Accepts]: Start accepts. Automaton has 4902 states and 6979 transitions. Word has length 1624 [2025-03-17 11:41:58,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:41:58,360 INFO L471 AbstractCegarLoop]: Abstraction has 4902 states and 6979 transitions. [2025-03-17 11:41:58,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 34.285714285714285) internal successors, (240), 7 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-17 11:41:58,361 INFO L276 IsEmpty]: Start isEmpty. Operand 4902 states and 6979 transitions. [2025-03-17 11:41:58,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1625 [2025-03-17 11:41:58,375 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:41:58,375 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-17 11:41:58,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-17 11:41:58,375 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-17 11:41:58,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:41:58,376 INFO L85 PathProgramCache]: Analyzing trace with hash 313673269, now seen corresponding path program 1 times [2025-03-17 11:41:58,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:41:58,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064641335] [2025-03-17 11:41:58,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:41:58,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:41:58,726 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1624 statements into 1 equivalence classes. [2025-03-17 11:41:59,229 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1624 of 1624 statements. [2025-03-17 11:41:59,230 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:41:59,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:42:04,027 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-17 11:42:04,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:42:04,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064641335] [2025-03-17 11:42:04,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064641335] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:42:04,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1721561828] [2025-03-17 11:42:04,031 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:42:04,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:42:04,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:42:04,033 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-17 11:42:04,035 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-17 11:42:05,457 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1624 statements into 1 equivalence classes. [2025-03-17 11:42:06,258 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1624 of 1624 statements. [2025-03-17 11:42:06,258 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:42:06,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:42:06,299 INFO L256 TraceCheckSpWp]: Trace formula consists of 7986 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-03-17 11:42:06,323 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:42:06,571 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-17 11:42:06,700 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-17 11:42:06,824 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-17 11:42:06,945 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-17 11:42:07,063 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-17 11:42:07,196 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-17 11:42:07,367 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-17 11:42:07,491 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-17 11:42:07,622 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-17 11:42:07,749 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-17 11:42:07,817 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-17 11:42:07,831 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-17 11:42:07,844 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-17 11:42:07,844 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:42:09,250 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-17 11:42:09,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1721561828] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:42:09,251 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:42:09,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 17, 16] total 34 [2025-03-17 11:42:09,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683387002] [2025-03-17 11:42:09,251 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:42:09,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-03-17 11:42:09,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:42:09,255 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-03-17 11:42:09,256 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=387, Invalid=735, Unknown=0, NotChecked=0, Total=1122 [2025-03-17 11:42:09,256 INFO L87 Difference]: Start difference. First operand 4902 states and 6979 transitions. Second operand has 34 states, 34 states have (on average 97.11764705882354) internal successors, (3302), 34 states have internal predecessors, (3302), 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-17 11:42:11,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:42:11,780 INFO L93 Difference]: Finished difference Result 9283 states and 13141 transitions. [2025-03-17 11:42:11,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2025-03-17 11:42:11,781 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 97.11764705882354) internal successors, (3302), 34 states have internal predecessors, (3302), 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 1624 [2025-03-17 11:42:11,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:42:11,795 INFO L225 Difference]: With dead ends: 9283 [2025-03-17 11:42:11,795 INFO L226 Difference]: Without dead ends: 9283 [2025-03-17 11:42:11,796 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3303 GetRequests, 3217 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-17 11:42:11,797 INFO L435 NwaCegarLoop]: 1225 mSDtfsCounter, 18246 mSDsluCounter, 11559 mSDsCounter, 0 mSdLazyCounter, 1854 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18318 SdHoareTripleChecker+Valid, 12784 SdHoareTripleChecker+Invalid, 1927 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 1854 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-17 11:42:11,797 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18318 Valid, 12784 Invalid, 1927 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 1854 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-17 11:42:11,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9283 states. [2025-03-17 11:42:11,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9283 to 9280. [2025-03-17 11:42:11,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9280 states, 9146 states have (on average 1.4092499453312923) internal successors, (12889), 9155 states have internal predecessors, (12889), 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-17 11:42:11,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9280 states to 9280 states and 13139 transitions. [2025-03-17 11:42:11,874 INFO L78 Accepts]: Start accepts. Automaton has 9280 states and 13139 transitions. Word has length 1624 [2025-03-17 11:42:11,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:42:11,875 INFO L471 AbstractCegarLoop]: Abstraction has 9280 states and 13139 transitions. [2025-03-17 11:42:11,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 97.11764705882354) internal successors, (3302), 34 states have internal predecessors, (3302), 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-17 11:42:11,876 INFO L276 IsEmpty]: Start isEmpty. Operand 9280 states and 13139 transitions. [2025-03-17 11:42:11,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3275 [2025-03-17 11:42:11,962 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:42:11,963 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] [2025-03-17 11:42:11,998 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-17 11:42:12,163 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-17 11:42:12,164 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-17 11:42:12,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:42:12,166 INFO L85 PathProgramCache]: Analyzing trace with hash 736980789, now seen corresponding path program 2 times [2025-03-17 11:42:12,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:42:12,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538108644] [2025-03-17 11:42:12,166 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 11:42:12,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:42:12,918 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3274 statements into 2 equivalence classes. [2025-03-17 11:42:12,941 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 79 of 3274 statements. [2025-03-17 11:42:12,942 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 11:42:12,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:42:13,284 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-17 11:42:13,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:42:13,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538108644] [2025-03-17 11:42:13,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538108644] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:42:13,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:42:13,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-17 11:42:13,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919800412] [2025-03-17 11:42:13,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:42:13,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 11:42:13,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:42:13,287 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 11:42:13,287 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2025-03-17 11:42:13,288 INFO L87 Difference]: Start difference. First operand 9280 states and 13139 transitions. Second operand has 13 states, 13 states have (on average 18.46153846153846) internal successors, (240), 13 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-17 11:42:14,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:42:14,104 INFO L93 Difference]: Finished difference Result 9325 states and 13203 transitions. [2025-03-17 11:42:14,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-17 11:42:14,104 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 18.46153846153846) internal successors, (240), 13 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 3274 [2025-03-17 11:42:14,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:42:14,116 INFO L225 Difference]: With dead ends: 9325 [2025-03-17 11:42:14,116 INFO L226 Difference]: Without dead ends: 9325 [2025-03-17 11:42:14,116 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2025-03-17 11:42:14,117 INFO L435 NwaCegarLoop]: 1285 mSDtfsCounter, 102 mSDsluCounter, 9985 mSDsCounter, 0 mSdLazyCounter, 1808 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 11270 SdHoareTripleChecker+Invalid, 1815 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1808 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-17 11:42:14,117 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 11270 Invalid, 1815 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1808 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-17 11:42:14,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9325 states. [2025-03-17 11:42:14,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9325 to 9286. [2025-03-17 11:42:14,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9286 states, 9152 states have (on average 1.4092001748251748) internal successors, (12897), 9161 states have internal predecessors, (12897), 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-17 11:42:14,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9286 states to 9286 states and 13147 transitions. [2025-03-17 11:42:14,202 INFO L78 Accepts]: Start accepts. Automaton has 9286 states and 13147 transitions. Word has length 3274 [2025-03-17 11:42:14,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:42:14,204 INFO L471 AbstractCegarLoop]: Abstraction has 9286 states and 13147 transitions. [2025-03-17 11:42:14,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 18.46153846153846) internal successors, (240), 13 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-17 11:42:14,204 INFO L276 IsEmpty]: Start isEmpty. Operand 9286 states and 13147 transitions. [2025-03-17 11:42:14,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3276 [2025-03-17 11:42:14,252 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:42:14,253 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-17 11:42:14,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-17 11:42:14,254 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-17 11:42:14,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:42:14,255 INFO L85 PathProgramCache]: Analyzing trace with hash -496676952, now seen corresponding path program 1 times [2025-03-17 11:42:14,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:42:14,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897550285] [2025-03-17 11:42:14,255 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:42:14,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:42:15,003 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3275 statements into 1 equivalence classes. [2025-03-17 11:42:17,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3275 of 3275 statements. [2025-03-17 11:42:17,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:42:17,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat