./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_linked_list_insert_after_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/aws-c-common/aws_linked_list_insert_after_harness.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 90d8983d1d445f35ced762b5547157927629cd141f5cc02ba145442ec7c5e770 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 01:52:25,224 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 01:52:25,257 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-02-08 01:52:25,260 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 01:52:25,261 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 01:52:25,274 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 01:52:25,275 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 01:52:25,275 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 01:52:25,275 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 01:52:25,275 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 01:52:25,275 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 01:52:25,275 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 01:52:25,276 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 01:52:25,276 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 01:52:25,276 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 01:52:25,276 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 01:52:25,276 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 01:52:25,276 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 01:52:25,276 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 01:52:25,276 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 01:52:25,276 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 01:52:25,276 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 01:52:25,276 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 01:52:25,276 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 01:52:25,276 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 01:52:25,276 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 01:52:25,276 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 01:52:25,276 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 01:52:25,276 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 01:52:25,277 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 01:52:25,277 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 01:52:25,277 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 01:52:25,277 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 01:52:25,277 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 01:52:25,277 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 01:52:25,277 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 01:52:25,277 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 01:52:25,277 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 01:52:25,277 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 01:52:25,277 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 01:52:25,277 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 90d8983d1d445f35ced762b5547157927629cd141f5cc02ba145442ec7c5e770 [2025-02-08 01:52:25,482 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 01:52:25,491 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 01:52:25,493 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 01:52:25,494 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 01:52:25,494 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 01:52:25,496 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/aws-c-common/aws_linked_list_insert_after_harness.i [2025-02-08 01:52:26,751 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3fe8df551/acc547f682634965998e45005f46b136/FLAGee1b38e9f [2025-02-08 01:52:27,164 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 01:52:27,165 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_insert_after_harness.i [2025-02-08 01:52:27,195 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3fe8df551/acc547f682634965998e45005f46b136/FLAGee1b38e9f [2025-02-08 01:52:27,329 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3fe8df551/acc547f682634965998e45005f46b136 [2025-02-08 01:52:27,331 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 01:52:27,332 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 01:52:27,333 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 01:52:27,333 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 01:52:27,336 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 01:52:27,337 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:52:27" (1/1) ... [2025-02-08 01:52:27,339 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11369eca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:52:27, skipping insertion in model container [2025-02-08 01:52:27,339 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:52:27" (1/1) ... [2025-02-08 01:52:27,393 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 01:52:27,585 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_insert_after_harness.i[4502,4515] [2025-02-08 01:52:27,592 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_insert_after_harness.i[4562,4575] [2025-02-08 01:52:28,040 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:52:28,040 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:52:28,040 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:52:28,041 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:52:28,041 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:52:28,059 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:52:28,060 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:52:28,060 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:52:28,061 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:52:28,066 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:52:28,067 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:52:28,067 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:52:28,068 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:52:28,354 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_insert_after_harness.i[150740,150753] [2025-02-08 01:52:28,355 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 01:52:28,370 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 01:52:28,379 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_insert_after_harness.i[4502,4515] [2025-02-08 01:52:28,379 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_insert_after_harness.i[4562,4575] [2025-02-08 01:52:28,416 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:52:28,419 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:52:28,419 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:52:28,419 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:52:28,420 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:52:28,425 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:52:28,426 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:52:28,426 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:52:28,427 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:52:28,427 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:52:28,428 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:52:28,428 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:52:28,428 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:52:28,507 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_insert_after_harness.i[150740,150753] [2025-02-08 01:52:28,507 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 01:52:28,633 INFO L204 MainTranslator]: Completed translation [2025-02-08 01:52:28,633 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:52:28 WrapperNode [2025-02-08 01:52:28,634 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 01:52:28,634 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 01:52:28,634 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 01:52:28,634 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 01:52:28,638 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:52:28" (1/1) ... [2025-02-08 01:52:28,672 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:52:28" (1/1) ... [2025-02-08 01:52:28,692 INFO L138 Inliner]: procedures = 668, calls = 1048, calls flagged for inlining = 51, calls inlined = 4, statements flattened = 76 [2025-02-08 01:52:28,696 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 01:52:28,697 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 01:52:28,697 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 01:52:28,697 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 01:52:28,703 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:52:28" (1/1) ... [2025-02-08 01:52:28,703 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:52:28" (1/1) ... [2025-02-08 01:52:28,706 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:52:28" (1/1) ... [2025-02-08 01:52:28,727 INFO L175 MemorySlicer]: Split 24 memory accesses to 3 slices as follows [2, 5, 17]. 71 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 5, 0]. The 6 writes are split as follows [0, 0, 6]. [2025-02-08 01:52:28,727 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:52:28" (1/1) ... [2025-02-08 01:52:28,728 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:52:28" (1/1) ... [2025-02-08 01:52:28,739 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:52:28" (1/1) ... [2025-02-08 01:52:28,743 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:52:28" (1/1) ... [2025-02-08 01:52:28,745 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:52:28" (1/1) ... [2025-02-08 01:52:28,750 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:52:28" (1/1) ... [2025-02-08 01:52:28,753 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 01:52:28,757 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 01:52:28,757 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 01:52:28,757 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 01:52:28,758 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:52:28" (1/1) ... [2025-02-08 01:52:28,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 01:52:28,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:52:28,794 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 01:52:28,800 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 01:52:28,814 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 01:52:28,815 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-02-08 01:52:28,815 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-02-08 01:52:28,815 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_next_is_valid [2025-02-08 01:52:28,815 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_next_is_valid [2025-02-08 01:52:28,815 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 01:52:28,815 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-08 01:52:28,815 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-08 01:52:28,815 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-08 01:52:28,815 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 01:52:28,815 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 01:52:28,815 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-08 01:52:28,815 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-08 01:52:28,815 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 01:52:28,815 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-08 01:52:28,815 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-08 01:52:28,815 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-08 01:52:28,815 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-02-08 01:52:28,815 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-02-08 01:52:28,815 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-02-08 01:52:28,815 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_prev_is_valid [2025-02-08 01:52:28,815 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_prev_is_valid [2025-02-08 01:52:28,815 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 01:52:28,815 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 01:52:28,815 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-08 01:52:29,004 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 01:52:29,006 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 01:52:29,050 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4720: havoc #t~mem308.base, #t~mem308.offset;havoc #t~short309;havoc #t~mem310.base, #t~mem310.offset;havoc #t~mem311.base, #t~mem311.offset;havoc #t~short312; [2025-02-08 01:52:29,063 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4731: havoc #t~mem313.base, #t~mem313.offset;havoc #t~short314;havoc #t~mem315.base, #t~mem315.offset;havoc #t~mem316.base, #t~mem316.offset;havoc #t~short317; [2025-02-08 01:52:29,206 INFO L? ?]: Removed 31 outVars from TransFormulas that were not future-live. [2025-02-08 01:52:29,206 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 01:52:29,216 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 01:52:29,216 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 01:52:29,216 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:52:29 BoogieIcfgContainer [2025-02-08 01:52:29,218 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 01:52:29,219 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 01:52:29,219 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 01:52:29,222 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 01:52:29,222 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 01:52:27" (1/3) ... [2025-02-08 01:52:29,223 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e97236e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:52:29, skipping insertion in model container [2025-02-08 01:52:29,223 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:52:28" (2/3) ... [2025-02-08 01:52:29,223 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e97236e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:52:29, skipping insertion in model container [2025-02-08 01:52:29,223 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:52:29" (3/3) ... [2025-02-08 01:52:29,224 INFO L128 eAbstractionObserver]: Analyzing ICFG aws_linked_list_insert_after_harness.i [2025-02-08 01:52:29,235 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 01:52:29,237 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG aws_linked_list_insert_after_harness.i that has 5 procedures, 59 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-02-08 01:52:29,282 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 01:52:29,292 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=LoopHeads, 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;@3f90e0b7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 01:52:29,292 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-08 01:52:29,297 INFO L276 IsEmpty]: Start isEmpty. Operand has 59 states, 33 states have (on average 1.2121212121212122) internal successors, (40), 34 states have internal predecessors, (40), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-02-08 01:52:29,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-02-08 01:52:29,303 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 01:52:29,303 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:52:29,304 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 01:52:29,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:52:29,308 INFO L85 PathProgramCache]: Analyzing trace with hash 1698734204, now seen corresponding path program 1 times [2025-02-08 01:52:29,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:52:29,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179872324] [2025-02-08 01:52:29,314 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:52:29,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:52:29,441 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-08 01:52:29,487 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-08 01:52:29,488 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:52:29,488 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:52:29,635 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-08 01:52:29,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:52:29,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179872324] [2025-02-08 01:52:29,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179872324] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 01:52:29,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [112176306] [2025-02-08 01:52:29,637 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:52:29,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:52:29,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:52:29,642 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 01:52:29,643 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-08 01:52:29,741 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-08 01:52:29,781 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-08 01:52:29,781 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:52:29,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:52:29,783 INFO L256 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-08 01:52:29,786 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 01:52:29,796 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 01:52:29,796 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 01:52:29,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [112176306] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:52:29,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 01:52:29,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-08 01:52:29,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829618821] [2025-02-08 01:52:29,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:52:29,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-08 01:52:29,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:52:29,812 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-08 01:52:29,816 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 01:52:29,817 INFO L87 Difference]: Start difference. First operand has 59 states, 33 states have (on average 1.2121212121212122) internal successors, (40), 34 states have internal predecessors, (40), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-08 01:52:29,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 01:52:29,840 INFO L93 Difference]: Finished difference Result 115 states and 167 transitions. [2025-02-08 01:52:29,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-08 01:52:29,842 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 33 [2025-02-08 01:52:29,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 01:52:29,846 INFO L225 Difference]: With dead ends: 115 [2025-02-08 01:52:29,846 INFO L226 Difference]: Without dead ends: 56 [2025-02-08 01:52:29,848 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 01:52:29,850 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 01:52:29,851 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 01:52:29,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-02-08 01:52:29,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2025-02-08 01:52:29,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 32 states have internal predecessors, (36), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-02-08 01:52:29,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 75 transitions. [2025-02-08 01:52:29,874 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 75 transitions. Word has length 33 [2025-02-08 01:52:29,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 01:52:29,879 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 75 transitions. [2025-02-08 01:52:29,879 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-08 01:52:29,879 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 75 transitions. [2025-02-08 01:52:29,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-02-08 01:52:29,880 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 01:52:29,880 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:52:29,895 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-08 01:52:30,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-08 01:52:30,082 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 01:52:30,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:52:30,082 INFO L85 PathProgramCache]: Analyzing trace with hash -849856262, now seen corresponding path program 1 times [2025-02-08 01:52:30,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:52:30,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510112460] [2025-02-08 01:52:30,083 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:52:30,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:52:30,121 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-08 01:52:30,251 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-08 01:52:30,251 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:52:30,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:52:31,926 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-08 01:52:31,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:52:31,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510112460] [2025-02-08 01:52:31,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510112460] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:52:31,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:52:31,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-08 01:52:31,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145118171] [2025-02-08 01:52:31,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:52:31,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-08 01:52:31,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:52:31,928 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-08 01:52:31,928 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2025-02-08 01:52:31,928 INFO L87 Difference]: Start difference. First operand 56 states and 75 transitions. Second operand has 11 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-08 01:52:32,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 01:52:32,205 INFO L93 Difference]: Finished difference Result 67 states and 90 transitions. [2025-02-08 01:52:32,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 01:52:32,206 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 33 [2025-02-08 01:52:32,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 01:52:32,207 INFO L225 Difference]: With dead ends: 67 [2025-02-08 01:52:32,208 INFO L226 Difference]: Without dead ends: 65 [2025-02-08 01:52:32,208 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2025-02-08 01:52:32,208 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 15 mSDsluCounter, 396 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 01:52:32,209 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 460 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 01:52:32,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2025-02-08 01:52:32,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 64. [2025-02-08 01:52:32,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 36 states have (on average 1.1388888888888888) internal successors, (41), 38 states have internal predecessors, (41), 21 states have call successors, (21), 5 states have call predecessors, (21), 6 states have return successors, (25), 20 states have call predecessors, (25), 20 states have call successors, (25) [2025-02-08 01:52:32,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 87 transitions. [2025-02-08 01:52:32,217 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 87 transitions. Word has length 33 [2025-02-08 01:52:32,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 01:52:32,217 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 87 transitions. [2025-02-08 01:52:32,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-08 01:52:32,217 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 87 transitions. [2025-02-08 01:52:32,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-02-08 01:52:32,218 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 01:52:32,218 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-08 01:52:32,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 01:52:32,218 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 01:52:32,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:52:32,219 INFO L85 PathProgramCache]: Analyzing trace with hash 892954073, now seen corresponding path program 1 times [2025-02-08 01:52:32,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:52:32,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486430603] [2025-02-08 01:52:32,219 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:52:32,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:52:32,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-08 01:52:32,245 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-08 01:52:32,245 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:52:32,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:52:32,463 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-08 01:52:32,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:52:32,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486430603] [2025-02-08 01:52:32,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486430603] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:52:32,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:52:32,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 01:52:32,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102333125] [2025-02-08 01:52:32,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:52:32,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 01:52:32,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:52:32,465 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 01:52:32,465 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-08 01:52:32,465 INFO L87 Difference]: Start difference. First operand 64 states and 87 transitions. Second operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-08 01:52:32,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 01:52:32,641 INFO L93 Difference]: Finished difference Result 131 states and 180 transitions. [2025-02-08 01:52:32,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 01:52:32,642 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 33 [2025-02-08 01:52:32,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 01:52:32,643 INFO L225 Difference]: With dead ends: 131 [2025-02-08 01:52:32,643 INFO L226 Difference]: Without dead ends: 69 [2025-02-08 01:52:32,643 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2025-02-08 01:52:32,644 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 17 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 01:52:32,644 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 319 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 01:52:32,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2025-02-08 01:52:32,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2025-02-08 01:52:32,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 40 states have (on average 1.15) internal successors, (46), 43 states have internal predecessors, (46), 21 states have call successors, (21), 5 states have call predecessors, (21), 7 states have return successors, (28), 20 states have call predecessors, (28), 20 states have call successors, (28) [2025-02-08 01:52:32,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 95 transitions. [2025-02-08 01:52:32,654 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 95 transitions. Word has length 33 [2025-02-08 01:52:32,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 01:52:32,654 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 95 transitions. [2025-02-08 01:52:32,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-08 01:52:32,654 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 95 transitions. [2025-02-08 01:52:32,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-02-08 01:52:32,655 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 01:52:32,655 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-08 01:52:32,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 01:52:32,655 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 01:52:32,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:52:32,656 INFO L85 PathProgramCache]: Analyzing trace with hash 696440568, now seen corresponding path program 1 times [2025-02-08 01:52:32,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:52:32,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632100224] [2025-02-08 01:52:32,656 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:52:32,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:52:32,679 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-08 01:52:32,685 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-08 01:52:32,686 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:52:32,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:52:32,763 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-08 01:52:32,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:52:32,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632100224] [2025-02-08 01:52:32,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632100224] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:52:32,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:52:32,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 01:52:32,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682541947] [2025-02-08 01:52:32,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:52:32,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 01:52:32,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:52:32,765 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 01:52:32,765 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 01:52:32,765 INFO L87 Difference]: Start difference. First operand 69 states and 95 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-08 01:52:32,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 01:52:32,816 INFO L93 Difference]: Finished difference Result 138 states and 191 transitions. [2025-02-08 01:52:32,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 01:52:32,817 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 33 [2025-02-08 01:52:32,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 01:52:32,818 INFO L225 Difference]: With dead ends: 138 [2025-02-08 01:52:32,818 INFO L226 Difference]: Without dead ends: 71 [2025-02-08 01:52:32,818 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 01:52:32,819 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 3 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 01:52:32,819 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 266 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 01:52:32,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2025-02-08 01:52:32,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 65. [2025-02-08 01:52:32,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 38 states have (on average 1.1578947368421053) internal successors, (44), 40 states have internal predecessors, (44), 20 states have call successors, (20), 5 states have call predecessors, (20), 6 states have return successors, (22), 19 states have call predecessors, (22), 19 states have call successors, (22) [2025-02-08 01:52:32,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 86 transitions. [2025-02-08 01:52:32,827 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 86 transitions. Word has length 33 [2025-02-08 01:52:32,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 01:52:32,828 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 86 transitions. [2025-02-08 01:52:32,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-08 01:52:32,828 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 86 transitions. [2025-02-08 01:52:32,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-02-08 01:52:32,828 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 01:52:32,829 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-08 01:52:32,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 01:52:32,829 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 01:52:32,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:52:32,829 INFO L85 PathProgramCache]: Analyzing trace with hash 353301295, now seen corresponding path program 1 times [2025-02-08 01:52:32,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:52:32,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549081242] [2025-02-08 01:52:32,829 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:52:32,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:52:32,849 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-02-08 01:52:32,877 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-02-08 01:52:32,877 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:52:32,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:52:34,000 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-08 01:52:34,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:52:34,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549081242] [2025-02-08 01:52:34,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549081242] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:52:34,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:52:34,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-08 01:52:34,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465944703] [2025-02-08 01:52:34,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:52:34,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-08 01:52:34,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:52:34,003 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-08 01:52:34,003 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2025-02-08 01:52:34,003 INFO L87 Difference]: Start difference. First operand 65 states and 86 transitions. Second operand has 13 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-02-08 01:52:34,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 01:52:34,311 INFO L93 Difference]: Finished difference Result 79 states and 104 transitions. [2025-02-08 01:52:34,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-08 01:52:34,311 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 47 [2025-02-08 01:52:34,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 01:52:34,312 INFO L225 Difference]: With dead ends: 79 [2025-02-08 01:52:34,312 INFO L226 Difference]: Without dead ends: 77 [2025-02-08 01:52:34,312 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2025-02-08 01:52:34,313 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 15 mSDsluCounter, 587 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 656 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 01:52:34,313 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 656 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 01:52:34,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-02-08 01:52:34,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 73. [2025-02-08 01:52:34,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 43 states have (on average 1.1395348837209303) internal successors, (49), 46 states have internal predecessors, (49), 21 states have call successors, (21), 6 states have call predecessors, (21), 8 states have return successors, (26), 20 states have call predecessors, (26), 20 states have call successors, (26) [2025-02-08 01:52:34,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 96 transitions. [2025-02-08 01:52:34,321 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 96 transitions. Word has length 47 [2025-02-08 01:52:34,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 01:52:34,322 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 96 transitions. [2025-02-08 01:52:34,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-02-08 01:52:34,322 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 96 transitions. [2025-02-08 01:52:34,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-02-08 01:52:34,322 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 01:52:34,323 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-08 01:52:34,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 01:52:34,323 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 01:52:34,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:52:34,323 INFO L85 PathProgramCache]: Analyzing trace with hash 2096111630, now seen corresponding path program 1 times [2025-02-08 01:52:34,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:52:34,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936792316] [2025-02-08 01:52:34,323 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:52:34,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:52:34,341 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-02-08 01:52:34,355 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-02-08 01:52:34,355 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:52:34,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:52:35,039 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-08 01:52:35,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:52:35,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936792316] [2025-02-08 01:52:35,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936792316] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:52:35,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:52:35,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-08 01:52:35,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582000036] [2025-02-08 01:52:35,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:52:35,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-08 01:52:35,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:52:35,041 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-08 01:52:35,042 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-02-08 01:52:35,042 INFO L87 Difference]: Start difference. First operand 73 states and 96 transitions. Second operand has 11 states, 10 states have (on average 2.9) internal successors, (29), 11 states have internal predecessors, (29), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-02-08 01:52:35,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 01:52:35,297 INFO L93 Difference]: Finished difference Result 131 states and 177 transitions. [2025-02-08 01:52:35,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 01:52:35,298 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.9) internal successors, (29), 11 states have internal predecessors, (29), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 47 [2025-02-08 01:52:35,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 01:52:35,299 INFO L225 Difference]: With dead ends: 131 [2025-02-08 01:52:35,300 INFO L226 Difference]: Without dead ends: 81 [2025-02-08 01:52:35,300 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2025-02-08 01:52:35,301 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 18 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 478 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 01:52:35,301 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 478 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 01:52:35,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-02-08 01:52:35,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 78. [2025-02-08 01:52:35,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 47 states have (on average 1.148936170212766) internal successors, (54), 51 states have internal predecessors, (54), 21 states have call successors, (21), 6 states have call predecessors, (21), 9 states have return successors, (28), 20 states have call predecessors, (28), 20 states have call successors, (28) [2025-02-08 01:52:35,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 103 transitions. [2025-02-08 01:52:35,318 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 103 transitions. Word has length 47 [2025-02-08 01:52:35,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 01:52:35,320 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 103 transitions. [2025-02-08 01:52:35,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.9) internal successors, (29), 11 states have internal predecessors, (29), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-02-08 01:52:35,320 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 103 transitions. [2025-02-08 01:52:35,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-02-08 01:52:35,320 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 01:52:35,321 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-08 01:52:35,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 01:52:35,321 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 01:52:35,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:52:35,321 INFO L85 PathProgramCache]: Analyzing trace with hash 1899598125, now seen corresponding path program 1 times [2025-02-08 01:52:35,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:52:35,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568307556] [2025-02-08 01:52:35,321 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:52:35,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:52:35,343 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-02-08 01:52:35,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-02-08 01:52:35,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:52:35,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:52:35,430 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-02-08 01:52:35,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:52:35,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568307556] [2025-02-08 01:52:35,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568307556] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:52:35,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:52:35,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 01:52:35,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392040192] [2025-02-08 01:52:35,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:52:35,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 01:52:35,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:52:35,432 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 01:52:35,432 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 01:52:35,433 INFO L87 Difference]: Start difference. First operand 78 states and 103 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2025-02-08 01:52:35,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 01:52:35,482 INFO L93 Difference]: Finished difference Result 140 states and 186 transitions. [2025-02-08 01:52:35,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 01:52:35,483 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 47 [2025-02-08 01:52:35,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 01:52:35,486 INFO L225 Difference]: With dead ends: 140 [2025-02-08 01:52:35,486 INFO L226 Difference]: Without dead ends: 80 [2025-02-08 01:52:35,487 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 01:52:35,487 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 3 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 01:52:35,487 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 272 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 01:52:35,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2025-02-08 01:52:35,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 74. [2025-02-08 01:52:35,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 45 states have (on average 1.1555555555555554) internal successors, (52), 48 states have internal predecessors, (52), 20 states have call successors, (20), 6 states have call predecessors, (20), 8 states have return successors, (24), 19 states have call predecessors, (24), 19 states have call successors, (24) [2025-02-08 01:52:35,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 96 transitions. [2025-02-08 01:52:35,505 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 96 transitions. Word has length 47 [2025-02-08 01:52:35,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 01:52:35,505 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 96 transitions. [2025-02-08 01:52:35,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2025-02-08 01:52:35,505 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 96 transitions. [2025-02-08 01:52:35,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-02-08 01:52:35,508 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 01:52:35,508 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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] [2025-02-08 01:52:35,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 01:52:35,508 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 01:52:35,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:52:35,509 INFO L85 PathProgramCache]: Analyzing trace with hash -1635861239, now seen corresponding path program 1 times [2025-02-08 01:52:35,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:52:35,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318925977] [2025-02-08 01:52:35,509 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:52:35,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:52:35,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-02-08 01:52:35,558 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-02-08 01:52:35,559 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:52:35,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:52:37,047 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-02-08 01:52:37,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:52:37,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318925977] [2025-02-08 01:52:37,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318925977] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:52:37,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:52:37,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-08 01:52:37,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358896662] [2025-02-08 01:52:37,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:52:37,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-08 01:52:37,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:52:37,049 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-08 01:52:37,049 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2025-02-08 01:52:37,049 INFO L87 Difference]: Start difference. First operand 74 states and 96 transitions. Second operand has 12 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 10 states have internal predecessors, (29), 5 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2025-02-08 01:52:37,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 01:52:37,348 INFO L93 Difference]: Finished difference Result 85 states and 109 transitions. [2025-02-08 01:52:37,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-08 01:52:37,349 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 10 states have internal predecessors, (29), 5 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) Word has length 61 [2025-02-08 01:52:37,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 01:52:37,350 INFO L225 Difference]: With dead ends: 85 [2025-02-08 01:52:37,350 INFO L226 Difference]: Without dead ends: 83 [2025-02-08 01:52:37,350 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2025-02-08 01:52:37,351 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 12 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 519 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 01:52:37,351 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 519 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 01:52:37,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2025-02-08 01:52:37,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 82. [2025-02-08 01:52:37,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 50 states have (on average 1.14) internal successors, (57), 54 states have internal predecessors, (57), 21 states have call successors, (21), 7 states have call predecessors, (21), 10 states have return successors, (28), 20 states have call predecessors, (28), 20 states have call successors, (28) [2025-02-08 01:52:37,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 106 transitions. [2025-02-08 01:52:37,378 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 106 transitions. Word has length 61 [2025-02-08 01:52:37,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 01:52:37,382 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 106 transitions. [2025-02-08 01:52:37,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 10 states have internal predecessors, (29), 5 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2025-02-08 01:52:37,383 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 106 transitions. [2025-02-08 01:52:37,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-02-08 01:52:37,384 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 01:52:37,384 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2025-02-08 01:52:37,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 01:52:37,384 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 01:52:37,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:52:37,384 INFO L85 PathProgramCache]: Analyzing trace with hash 106949096, now seen corresponding path program 1 times [2025-02-08 01:52:37,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:52:37,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805471476] [2025-02-08 01:52:37,384 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:52:37,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:52:37,423 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-02-08 01:52:37,434 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-02-08 01:52:37,435 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:52:37,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:52:38,155 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-08 01:52:38,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:52:38,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805471476] [2025-02-08 01:52:38,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805471476] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 01:52:38,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [357907787] [2025-02-08 01:52:38,156 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:52:38,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:52:38,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:52:38,158 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 01:52:38,160 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-08 01:52:38,269 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-02-08 01:52:38,321 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-02-08 01:52:38,322 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:52:38,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:52:38,325 INFO L256 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 96 conjuncts are in the unsatisfiable core [2025-02-08 01:52:38,331 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 01:52:38,397 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-02-08 01:52:38,398 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 90 treesize of output 84 [2025-02-08 01:52:38,410 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2025-02-08 01:52:38,423 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-08 01:52:38,423 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 37 [2025-02-08 01:52:38,993 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 01:52:38,996 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 50 [2025-02-08 01:52:39,022 INFO L349 Elim1Store]: treesize reduction 67, result has 19.3 percent of original size [2025-02-08 01:52:39,023 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 87 treesize of output 98 [2025-02-08 01:52:39,035 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2025-02-08 01:52:39,061 INFO L349 Elim1Store]: treesize reduction 60, result has 7.7 percent of original size [2025-02-08 01:52:39,062 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 74 treesize of output 41 [2025-02-08 01:52:40,365 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 25 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 01:52:40,365 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 01:52:40,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [357907787] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 01:52:40,992 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 01:52:40,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 18] total 31 [2025-02-08 01:52:40,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38924143] [2025-02-08 01:52:40,992 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 01:52:40,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-02-08 01:52:40,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:52:40,993 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-02-08 01:52:40,994 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=1634, Unknown=0, NotChecked=0, Total=1806 [2025-02-08 01:52:40,994 INFO L87 Difference]: Start difference. First operand 82 states and 106 transitions. Second operand has 31 states, 27 states have (on average 2.7777777777777777) internal successors, (75), 30 states have internal predecessors, (75), 10 states have call successors, (17), 4 states have call predecessors, (17), 9 states have return successors, (16), 7 states have call predecessors, (16), 9 states have call successors, (16) [2025-02-08 01:52:42,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 01:52:42,896 INFO L93 Difference]: Finished difference Result 170 states and 215 transitions. [2025-02-08 01:52:42,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-02-08 01:52:42,897 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 27 states have (on average 2.7777777777777777) internal successors, (75), 30 states have internal predecessors, (75), 10 states have call successors, (17), 4 states have call predecessors, (17), 9 states have return successors, (16), 7 states have call predecessors, (16), 9 states have call successors, (16) Word has length 61 [2025-02-08 01:52:42,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 01:52:42,898 INFO L225 Difference]: With dead ends: 170 [2025-02-08 01:52:42,898 INFO L226 Difference]: Without dead ends: 102 [2025-02-08 01:52:42,899 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 72 SyntacticMatches, 9 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 931 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=319, Invalid=2873, Unknown=0, NotChecked=0, Total=3192 [2025-02-08 01:52:42,900 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 60 mSDsluCounter, 604 mSDsCounter, 0 mSdLazyCounter, 1244 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 659 SdHoareTripleChecker+Invalid, 1276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-02-08 01:52:42,900 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 659 Invalid, 1276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1244 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-02-08 01:52:42,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2025-02-08 01:52:42,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 94. [2025-02-08 01:52:42,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 60 states have (on average 1.1166666666666667) internal successors, (67), 64 states have internal predecessors, (67), 21 states have call successors, (21), 9 states have call predecessors, (21), 12 states have return successors, (30), 20 states have call predecessors, (30), 20 states have call successors, (30) [2025-02-08 01:52:42,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 118 transitions. [2025-02-08 01:52:42,910 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 118 transitions. Word has length 61 [2025-02-08 01:52:42,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 01:52:42,910 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 118 transitions. [2025-02-08 01:52:42,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 27 states have (on average 2.7777777777777777) internal successors, (75), 30 states have internal predecessors, (75), 10 states have call successors, (17), 4 states have call predecessors, (17), 9 states have return successors, (16), 7 states have call predecessors, (16), 9 states have call successors, (16) [2025-02-08 01:52:42,911 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 118 transitions. [2025-02-08 01:52:42,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-02-08 01:52:42,911 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 01:52:42,911 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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] [2025-02-08 01:52:42,918 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-08 01:52:43,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:52:43,112 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 01:52:43,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:52:43,113 INFO L85 PathProgramCache]: Analyzing trace with hash -89564409, now seen corresponding path program 1 times [2025-02-08 01:52:43,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:52:43,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678005817] [2025-02-08 01:52:43,113 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:52:43,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:52:43,128 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-02-08 01:52:43,134 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-02-08 01:52:43,134 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:52:43,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:52:43,257 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-02-08 01:52:43,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:52:43,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678005817] [2025-02-08 01:52:43,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678005817] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:52:43,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:52:43,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 01:52:43,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838079531] [2025-02-08 01:52:43,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:52:43,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 01:52:43,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:52:43,259 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 01:52:43,259 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-08 01:52:43,259 INFO L87 Difference]: Start difference. First operand 94 states and 118 transitions. Second operand has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 3 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2025-02-08 01:52:43,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 01:52:43,357 INFO L93 Difference]: Finished difference Result 156 states and 198 transitions. [2025-02-08 01:52:43,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 01:52:43,358 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 3 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 61 [2025-02-08 01:52:43,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 01:52:43,359 INFO L225 Difference]: With dead ends: 156 [2025-02-08 01:52:43,360 INFO L226 Difference]: Without dead ends: 96 [2025-02-08 01:52:43,360 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-02-08 01:52:43,360 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 10 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 01:52:43,360 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 446 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 01:52:43,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-02-08 01:52:43,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 87. [2025-02-08 01:52:43,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 56 states have (on average 1.125) internal successors, (63), 58 states have internal predecessors, (63), 20 states have call successors, (20), 9 states have call predecessors, (20), 10 states have return successors, (23), 19 states have call predecessors, (23), 19 states have call successors, (23) [2025-02-08 01:52:43,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 106 transitions. [2025-02-08 01:52:43,375 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 106 transitions. Word has length 61 [2025-02-08 01:52:43,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 01:52:43,376 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 106 transitions. [2025-02-08 01:52:43,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 3 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2025-02-08 01:52:43,376 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 106 transitions. [2025-02-08 01:52:43,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-02-08 01:52:43,376 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 01:52:43,376 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:52:43,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 01:52:43,376 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 01:52:43,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:52:43,377 INFO L85 PathProgramCache]: Analyzing trace with hash -323685368, now seen corresponding path program 1 times [2025-02-08 01:52:43,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:52:43,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344443132] [2025-02-08 01:52:43,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:52:43,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:52:43,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-02-08 01:52:43,408 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-02-08 01:52:43,409 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:52:43,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:52:43,599 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-02-08 01:52:43,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:52:43,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344443132] [2025-02-08 01:52:43,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344443132] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:52:43,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:52:43,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 01:52:43,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555410125] [2025-02-08 01:52:43,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:52:43,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 01:52:43,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:52:43,600 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 01:52:43,600 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 01:52:43,600 INFO L87 Difference]: Start difference. First operand 87 states and 106 transitions. Second operand has 6 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 3 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-02-08 01:52:43,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 01:52:43,684 INFO L93 Difference]: Finished difference Result 93 states and 111 transitions. [2025-02-08 01:52:43,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 01:52:43,685 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 3 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 67 [2025-02-08 01:52:43,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 01:52:43,686 INFO L225 Difference]: With dead ends: 93 [2025-02-08 01:52:43,686 INFO L226 Difference]: Without dead ends: 91 [2025-02-08 01:52:43,686 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-08 01:52:43,686 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 3 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 01:52:43,686 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 323 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 01:52:43,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-02-08 01:52:43,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2025-02-08 01:52:43,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 59 states have (on average 1.11864406779661) internal successors, (66), 61 states have internal predecessors, (66), 20 states have call successors, (20), 10 states have call predecessors, (20), 11 states have return successors, (23), 19 states have call predecessors, (23), 19 states have call successors, (23) [2025-02-08 01:52:43,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 109 transitions. [2025-02-08 01:52:43,697 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 109 transitions. Word has length 67 [2025-02-08 01:52:43,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 01:52:43,698 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 109 transitions. [2025-02-08 01:52:43,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 3 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-02-08 01:52:43,698 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 109 transitions. [2025-02-08 01:52:43,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-02-08 01:52:43,698 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 01:52:43,698 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2025-02-08 01:52:43,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 01:52:43,698 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 01:52:43,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:52:43,699 INFO L85 PathProgramCache]: Analyzing trace with hash 610192489, now seen corresponding path program 1 times [2025-02-08 01:52:43,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:52:43,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662488346] [2025-02-08 01:52:43,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:52:43,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:52:43,718 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-02-08 01:52:43,747 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-02-08 01:52:43,747 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:52:43,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:52:44,778 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 26 proven. 6 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-02-08 01:52:44,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:52:44,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662488346] [2025-02-08 01:52:44,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662488346] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 01:52:44,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [919530408] [2025-02-08 01:52:44,778 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:52:44,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:52:44,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:52:44,780 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 01:52:44,784 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-08 01:52:44,925 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-02-08 01:52:44,994 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-02-08 01:52:44,994 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:52:44,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:52:44,996 INFO L256 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 75 conjuncts are in the unsatisfiable core [2025-02-08 01:52:45,008 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 01:52:49,354 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 41 proven. 22 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-08 01:52:49,354 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 01:52:50,226 INFO L349 Elim1Store]: treesize reduction 21, result has 78.8 percent of original size [2025-02-08 01:52:50,226 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 113 treesize of output 144 [2025-02-08 01:52:50,284 INFO L349 Elim1Store]: treesize reduction 15, result has 77.6 percent of original size [2025-02-08 01:52:50,284 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 123 treesize of output 136 [2025-02-08 01:52:50,788 INFO L349 Elim1Store]: treesize reduction 21, result has 78.8 percent of original size [2025-02-08 01:52:50,788 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 121 [2025-02-08 01:52:50,833 INFO L349 Elim1Store]: treesize reduction 15, result has 77.6 percent of original size [2025-02-08 01:52:50,833 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 102 treesize of output 125 [2025-02-08 01:52:51,045 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 25 proven. 22 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-02-08 01:52:51,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [919530408] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 01:52:51,045 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 01:52:51,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 20, 17] total 41 [2025-02-08 01:52:51,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006485578] [2025-02-08 01:52:51,045 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 01:52:51,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2025-02-08 01:52:51,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:52:51,046 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2025-02-08 01:52:51,046 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=1506, Unknown=0, NotChecked=0, Total=1640 [2025-02-08 01:52:51,047 INFO L87 Difference]: Start difference. First operand 91 states and 109 transitions. Second operand has 41 states, 34 states have (on average 2.9411764705882355) internal successors, (100), 35 states have internal predecessors, (100), 14 states have call successors, (35), 4 states have call predecessors, (35), 10 states have return successors, (33), 12 states have call predecessors, (33), 11 states have call successors, (33) [2025-02-08 01:52:53,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 01:52:53,089 INFO L93 Difference]: Finished difference Result 113 states and 135 transitions. [2025-02-08 01:52:53,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-02-08 01:52:53,090 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 34 states have (on average 2.9411764705882355) internal successors, (100), 35 states have internal predecessors, (100), 14 states have call successors, (35), 4 states have call predecessors, (35), 10 states have return successors, (33), 12 states have call predecessors, (33), 11 states have call successors, (33) Word has length 81 [2025-02-08 01:52:53,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 01:52:53,092 INFO L225 Difference]: With dead ends: 113 [2025-02-08 01:52:53,092 INFO L226 Difference]: Without dead ends: 111 [2025-02-08 01:52:53,093 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 128 SyntacticMatches, 13 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 764 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=292, Invalid=3130, Unknown=0, NotChecked=0, Total=3422 [2025-02-08 01:52:53,094 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 61 mSDsluCounter, 706 mSDsCounter, 0 mSdLazyCounter, 1250 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 749 SdHoareTripleChecker+Invalid, 1326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 1250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-02-08 01:52:53,094 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 749 Invalid, 1326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 1250 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-02-08 01:52:53,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2025-02-08 01:52:53,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 99. [2025-02-08 01:52:53,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 64 states have (on average 1.109375) internal successors, (71), 67 states have internal predecessors, (71), 21 states have call successors, (21), 11 states have call predecessors, (21), 13 states have return successors, (26), 20 states have call predecessors, (26), 20 states have call successors, (26) [2025-02-08 01:52:53,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 118 transitions. [2025-02-08 01:52:53,119 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 118 transitions. Word has length 81 [2025-02-08 01:52:53,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 01:52:53,120 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 118 transitions. [2025-02-08 01:52:53,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 34 states have (on average 2.9411764705882355) internal successors, (100), 35 states have internal predecessors, (100), 14 states have call successors, (35), 4 states have call predecessors, (35), 10 states have return successors, (33), 12 states have call predecessors, (33), 11 states have call successors, (33) [2025-02-08 01:52:53,120 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 118 transitions. [2025-02-08 01:52:53,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-02-08 01:52:53,120 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 01:52:53,120 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:52:53,134 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-08 01:52:53,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:52:53,327 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 01:52:53,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:52:53,328 INFO L85 PathProgramCache]: Analyzing trace with hash -1941964472, now seen corresponding path program 1 times [2025-02-08 01:52:53,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:52:53,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796990755] [2025-02-08 01:52:53,328 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:52:53,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:52:53,421 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-02-08 01:52:53,432 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-02-08 01:52:53,435 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:52:53,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:52:53,847 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2025-02-08 01:52:53,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:52:53,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796990755] [2025-02-08 01:52:53,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796990755] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:52:53,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:52:53,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-08 01:52:53,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93894720] [2025-02-08 01:52:53,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:52:53,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-08 01:52:53,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:52:53,848 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-08 01:52:53,848 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2025-02-08 01:52:53,849 INFO L87 Difference]: Start difference. First operand 99 states and 118 transitions. Second operand has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 12 states have internal predecessors, (34), 5 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 5 states have call predecessors, (11), 4 states have call successors, (11) [2025-02-08 01:52:54,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 01:52:54,104 INFO L93 Difference]: Finished difference Result 152 states and 185 transitions. [2025-02-08 01:52:54,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-08 01:52:54,105 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 12 states have internal predecessors, (34), 5 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 5 states have call predecessors, (11), 4 states have call successors, (11) Word has length 81 [2025-02-08 01:52:54,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 01:52:54,106 INFO L225 Difference]: With dead ends: 152 [2025-02-08 01:52:54,106 INFO L226 Difference]: Without dead ends: 105 [2025-02-08 01:52:54,106 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2025-02-08 01:52:54,107 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 20 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 01:52:54,107 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 307 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 01:52:54,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2025-02-08 01:52:54,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 102. [2025-02-08 01:52:54,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 66 states have (on average 1.106060606060606) internal successors, (73), 70 states have internal predecessors, (73), 21 states have call successors, (21), 11 states have call predecessors, (21), 14 states have return successors, (27), 20 states have call predecessors, (27), 20 states have call successors, (27) [2025-02-08 01:52:54,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 121 transitions. [2025-02-08 01:52:54,124 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 121 transitions. Word has length 81 [2025-02-08 01:52:54,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 01:52:54,124 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 121 transitions. [2025-02-08 01:52:54,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 12 states have internal predecessors, (34), 5 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 5 states have call predecessors, (11), 4 states have call successors, (11) [2025-02-08 01:52:54,125 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 121 transitions. [2025-02-08 01:52:54,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-02-08 01:52:54,125 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 01:52:54,125 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:52:54,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 01:52:54,125 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 01:52:54,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:52:54,126 INFO L85 PathProgramCache]: Analyzing trace with hash -2138477977, now seen corresponding path program 1 times [2025-02-08 01:52:54,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:52:54,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370762735] [2025-02-08 01:52:54,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:52:54,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:52:54,149 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-02-08 01:52:54,156 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-02-08 01:52:54,156 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:52:54,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:52:54,233 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2025-02-08 01:52:54,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:52:54,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370762735] [2025-02-08 01:52:54,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370762735] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:52:54,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:52:54,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 01:52:54,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009901880] [2025-02-08 01:52:54,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:52:54,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 01:52:54,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:52:54,234 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 01:52:54,234 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 01:52:54,234 INFO L87 Difference]: Start difference. First operand 102 states and 121 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2025-02-08 01:52:54,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 01:52:54,262 INFO L93 Difference]: Finished difference Result 156 states and 186 transitions. [2025-02-08 01:52:54,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 01:52:54,263 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) Word has length 81 [2025-02-08 01:52:54,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 01:52:54,263 INFO L225 Difference]: With dead ends: 156 [2025-02-08 01:52:54,263 INFO L226 Difference]: Without dead ends: 101 [2025-02-08 01:52:54,264 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 01:52:54,264 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 6 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 01:52:54,264 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 254 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 01:52:54,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-02-08 01:52:54,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 95. [2025-02-08 01:52:54,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 62 states have (on average 1.1129032258064515) internal successors, (69), 64 states have internal predecessors, (69), 20 states have call successors, (20), 11 states have call predecessors, (20), 12 states have return successors, (22), 19 states have call predecessors, (22), 19 states have call successors, (22) [2025-02-08 01:52:54,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 111 transitions. [2025-02-08 01:52:54,278 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 111 transitions. Word has length 81 [2025-02-08 01:52:54,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 01:52:54,278 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 111 transitions. [2025-02-08 01:52:54,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2025-02-08 01:52:54,278 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 111 transitions. [2025-02-08 01:52:54,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-02-08 01:52:54,279 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 01:52:54,279 INFO L218 NwaCegarLoop]: trace histogram [6, 5, 5, 4, 4, 4, 4, 4, 4, 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] [2025-02-08 01:52:54,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-08 01:52:54,279 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 01:52:54,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:52:54,279 INFO L85 PathProgramCache]: Analyzing trace with hash -1753851729, now seen corresponding path program 1 times [2025-02-08 01:52:54,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:52:54,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803278114] [2025-02-08 01:52:54,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:52:54,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:52:54,312 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-02-08 01:52:54,392 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-02-08 01:52:54,393 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:52:54,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:52:56,403 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 27 proven. 19 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2025-02-08 01:52:56,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:52:56,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803278114] [2025-02-08 01:52:56,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803278114] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 01:52:56,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2109558838] [2025-02-08 01:52:56,403 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:52:56,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:52:56,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:52:56,405 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 01:52:56,407 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-08 01:52:56,534 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-02-08 01:52:56,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-02-08 01:52:56,605 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:52:56,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:52:56,607 INFO L256 TraceCheckSpWp]: Trace formula consists of 466 conjuncts, 77 conjuncts are in the unsatisfiable core [2025-02-08 01:52:56,611 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 01:52:58,100 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 59 proven. 16 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-02-08 01:52:58,100 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 01:53:06,768 INFO L349 Elim1Store]: treesize reduction 23, result has 79.3 percent of original size [2025-02-08 01:53:06,769 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 125 treesize of output 154 [2025-02-08 01:53:06,824 INFO L349 Elim1Store]: treesize reduction 15, result has 80.0 percent of original size [2025-02-08 01:53:06,825 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 133 treesize of output 140 [2025-02-08 01:53:07,345 INFO L349 Elim1Store]: treesize reduction 23, result has 79.3 percent of original size [2025-02-08 01:53:07,346 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 80 treesize of output 131 [2025-02-08 01:53:07,396 INFO L349 Elim1Store]: treesize reduction 15, result has 80.0 percent of original size [2025-02-08 01:53:07,396 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 112 treesize of output 129 [2025-02-08 01:53:07,666 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 15 proven. 16 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2025-02-08 01:53:07,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2109558838] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 01:53:07,666 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 01:53:07,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 20] total 48 [2025-02-08 01:53:07,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525807514] [2025-02-08 01:53:07,666 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 01:53:07,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2025-02-08 01:53:07,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:53:07,667 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2025-02-08 01:53:07,667 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=2103, Unknown=1, NotChecked=0, Total=2256 [2025-02-08 01:53:07,667 INFO L87 Difference]: Start difference. First operand 95 states and 111 transitions. Second operand has 48 states, 41 states have (on average 2.6097560975609757) internal successors, (107), 40 states have internal predecessors, (107), 15 states have call successors, (38), 4 states have call predecessors, (38), 13 states have return successors, (36), 14 states have call predecessors, (36), 12 states have call successors, (36) [2025-02-08 01:53:09,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 01:53:09,802 INFO L93 Difference]: Finished difference Result 129 states and 152 transitions. [2025-02-08 01:53:09,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-02-08 01:53:09,803 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 41 states have (on average 2.6097560975609757) internal successors, (107), 40 states have internal predecessors, (107), 15 states have call successors, (38), 4 states have call predecessors, (38), 13 states have return successors, (36), 14 states have call predecessors, (36), 12 states have call successors, (36) Word has length 95 [2025-02-08 01:53:09,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 01:53:09,804 INFO L225 Difference]: With dead ends: 129 [2025-02-08 01:53:09,804 INFO L226 Difference]: Without dead ends: 123 [2025-02-08 01:53:09,805 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 161 SyntacticMatches, 12 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1144 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=362, Invalid=4893, Unknown=1, NotChecked=0, Total=5256 [2025-02-08 01:53:09,805 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 69 mSDsluCounter, 834 mSDsCounter, 0 mSdLazyCounter, 1616 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 880 SdHoareTripleChecker+Invalid, 1686 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 1616 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-02-08 01:53:09,805 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 880 Invalid, 1686 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 1616 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-02-08 01:53:09,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2025-02-08 01:53:09,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 107. [2025-02-08 01:53:09,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 71 states have (on average 1.0985915492957747) internal successors, (78), 73 states have internal predecessors, (78), 21 states have call successors, (21), 13 states have call predecessors, (21), 14 states have return successors, (25), 20 states have call predecessors, (25), 20 states have call successors, (25) [2025-02-08 01:53:09,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 124 transitions. [2025-02-08 01:53:09,818 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 124 transitions. Word has length 95 [2025-02-08 01:53:09,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 01:53:09,818 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 124 transitions. [2025-02-08 01:53:09,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 41 states have (on average 2.6097560975609757) internal successors, (107), 40 states have internal predecessors, (107), 15 states have call successors, (38), 4 states have call predecessors, (38), 13 states have return successors, (36), 14 states have call predecessors, (36), 12 states have call successors, (36) [2025-02-08 01:53:09,818 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 124 transitions. [2025-02-08 01:53:09,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-02-08 01:53:09,819 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 01:53:09,819 INFO L218 NwaCegarLoop]: trace histogram [6, 5, 5, 4, 4, 4, 4, 4, 4, 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] [2025-02-08 01:53:09,826 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-08 01:53:10,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-02-08 01:53:10,023 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 01:53:10,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:53:10,023 INFO L85 PathProgramCache]: Analyzing trace with hash -11041394, now seen corresponding path program 1 times [2025-02-08 01:53:10,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:53:10,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286243891] [2025-02-08 01:53:10,023 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:53:10,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:53:10,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-02-08 01:53:10,059 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-02-08 01:53:10,059 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:53:10,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:53:10,823 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 46 proven. 3 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2025-02-08 01:53:10,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:53:10,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286243891] [2025-02-08 01:53:10,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286243891] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 01:53:10,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1149964546] [2025-02-08 01:53:10,824 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:53:10,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:53:10,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:53:10,829 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 01:53:10,832 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-08 01:53:10,960 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-02-08 01:53:11,016 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-02-08 01:53:11,016 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:53:11,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:53:11,019 INFO L256 TraceCheckSpWp]: Trace formula consists of 457 conjuncts, 82 conjuncts are in the unsatisfiable core [2025-02-08 01:53:11,022 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 01:53:11,039 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2025-02-08 01:53:11,046 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-02-08 01:53:11,047 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 27 [2025-02-08 01:53:11,055 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-08 01:53:11,055 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 32 [2025-02-08 01:53:15,101 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_14| Int)) (and (not (= |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_14| (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_14|) 0))) (<= 2 |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_14|))) is different from true [2025-02-08 01:53:23,220 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_15| Int)) (and (not (= |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_15| (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_15|) 0))) (<= 2 |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_15|))) is different from true [2025-02-08 01:53:27,293 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_16| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_16|) (not (= |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_16| (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_16|) 0))))) is different from true [2025-02-08 01:53:27,351 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 01:53:27,354 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 01:53:27,355 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 49 [2025-02-08 01:53:27,359 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 01:53:27,378 INFO L349 Elim1Store]: treesize reduction 67, result has 19.3 percent of original size [2025-02-08 01:53:27,379 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 89 treesize of output 100 [2025-02-08 01:53:27,384 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 90 treesize of output 69 [2025-02-08 01:53:51,009 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 39 proven. 6 refuted. 42 times theorem prover too weak. 0 trivial. 16 not checked. [2025-02-08 01:53:51,009 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 01:53:52,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1149964546] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 01:53:52,133 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 01:53:52,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 31] total 47 [2025-02-08 01:53:52,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123939577] [2025-02-08 01:53:52,133 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 01:53:52,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2025-02-08 01:53:52,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:53:52,134 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2025-02-08 01:53:52,134 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=246, Invalid=1837, Unknown=379, NotChecked=294, Total=2756 [2025-02-08 01:53:52,135 INFO L87 Difference]: Start difference. First operand 107 states and 124 transitions. Second operand has 47 states, 40 states have (on average 2.75) internal successors, (110), 41 states have internal predecessors, (110), 18 states have call successors, (27), 15 states have call predecessors, (27), 17 states have return successors, (26), 16 states have call predecessors, (26), 17 states have call successors, (26)