./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_linked_list_end_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/aws-c-common/aws_linked_list_end_harness.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 2b70e84b228eaa9531633412d2ab011238b584270b603d32c94fa23bf8e03be1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 02:57:23,369 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 02:57:23,431 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-04 02:57:23,434 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 02:57:23,435 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 02:57:23,454 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 02:57:23,455 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 02:57:23,455 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 02:57:23,455 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 02:57:23,455 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 02:57:23,455 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 02:57:23,456 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 02:57:23,456 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 02:57:23,456 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 02:57:23,456 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 02:57:23,457 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 02:57:23,457 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 02:57:23,457 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 02:57:23,457 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 02:57:23,457 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 02:57:23,457 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 02:57:23,457 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 02:57:23,457 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 02:57:23,457 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 02:57:23,458 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 02:57:23,458 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 02:57:23,458 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 02:57:23,458 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 02:57:23,458 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 02:57:23,458 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 02:57:23,458 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 02:57:23,459 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 02:57:23,459 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 02:57:23,459 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 02:57:23,459 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 02:57:23,459 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 02:57:23,459 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 02:57:23,459 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 02:57:23,459 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 02:57:23,459 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 02:57:23,459 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! 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 -> 2b70e84b228eaa9531633412d2ab011238b584270b603d32c94fa23bf8e03be1 [2025-03-04 02:57:23,688 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 02:57:23,695 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 02:57:23,697 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 02:57:23,698 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 02:57:23,698 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 02:57:23,700 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/aws-c-common/aws_linked_list_end_harness.i [2025-03-04 02:57:24,885 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e9fffbb78/51db7af90ccd4e22850d6e3f16a648a5/FLAGa837abf5f [2025-03-04 02:57:25,265 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 02:57:25,266 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_end_harness.i [2025-03-04 02:57:25,298 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e9fffbb78/51db7af90ccd4e22850d6e3f16a648a5/FLAGa837abf5f [2025-03-04 02:57:25,310 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e9fffbb78/51db7af90ccd4e22850d6e3f16a648a5 [2025-03-04 02:57:25,312 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 02:57:25,313 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 02:57:25,315 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 02:57:25,315 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 02:57:25,318 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 02:57:25,318 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:57:25" (1/1) ... [2025-03-04 02:57:25,320 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@709691d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:57:25, skipping insertion in model container [2025-03-04 02:57:25,320 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:57:25" (1/1) ... [2025-03-04 02:57:25,384 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 02:57:25,551 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_end_harness.i[4493,4506] [2025-03-04 02:57:25,556 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_end_harness.i[4553,4566] [2025-03-04 02:57:25,953 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:57:25,953 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:57:25,954 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:57:25,954 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:57:25,954 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:57:25,963 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:57:25,964 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:57:25,966 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:57:25,966 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:57:25,967 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:57:25,968 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:57:25,968 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:57:25,968 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:57:26,247 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_end_harness.i[150460,150473] [2025-03-04 02:57:26,249 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 02:57:26,266 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 02:57:26,275 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_end_harness.i[4493,4506] [2025-03-04 02:57:26,277 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_end_harness.i[4553,4566] [2025-03-04 02:57:26,327 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:57:26,328 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:57:26,329 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:57:26,329 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:57:26,330 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:57:26,339 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:57:26,339 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:57:26,340 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:57:26,341 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:57:26,341 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:57:26,342 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:57:26,342 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:57:26,343 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:57:26,431 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_end_harness.i[150460,150473] [2025-03-04 02:57:26,432 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 02:57:26,606 INFO L204 MainTranslator]: Completed translation [2025-03-04 02:57:26,606 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:57:26 WrapperNode [2025-03-04 02:57:26,607 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 02:57:26,607 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 02:57:26,607 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 02:57:26,607 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 02:57:26,614 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:57:26" (1/1) ... [2025-03-04 02:57:26,662 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:57:26" (1/1) ... [2025-03-04 02:57:26,693 INFO L138 Inliner]: procedures = 668, calls = 1038, calls flagged for inlining = 53, calls inlined = 6, statements flattened = 131 [2025-03-04 02:57:26,694 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 02:57:26,694 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 02:57:26,694 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 02:57:26,694 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 02:57:26,700 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:57:26" (1/1) ... [2025-03-04 02:57:26,700 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:57:26" (1/1) ... [2025-03-04 02:57:26,702 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:57:26" (1/1) ... [2025-03-04 02:57:26,721 INFO L175 MemorySlicer]: Split 21 memory accesses to 3 slices as follows [2, 5, 14]. 67 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-03-04 02:57:26,721 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:57:26" (1/1) ... [2025-03-04 02:57:26,722 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:57:26" (1/1) ... [2025-03-04 02:57:26,736 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:57:26" (1/1) ... [2025-03-04 02:57:26,737 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:57:26" (1/1) ... [2025-03-04 02:57:26,739 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:57:26" (1/1) ... [2025-03-04 02:57:26,740 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:57:26" (1/1) ... [2025-03-04 02:57:26,742 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 02:57:26,743 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 02:57:26,743 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 02:57:26,743 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 02:57:26,744 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:57:26" (1/1) ... [2025-03-04 02:57:26,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 02:57:26,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:57:26,774 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 02:57:26,780 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 02:57:26,793 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 02:57:26,793 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-04 02:57:26,793 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-04 02:57:26,793 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_next_is_valid [2025-03-04 02:57:26,793 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_next_is_valid [2025-03-04 02:57:26,793 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 02:57:26,793 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_is_valid [2025-03-04 02:57:26,794 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_is_valid [2025-03-04 02:57:26,794 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 02:57:26,794 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-04 02:57:26,794 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-04 02:57:26,794 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-04 02:57:26,794 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 02:57:26,794 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 02:57:26,794 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 02:57:26,794 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 02:57:26,794 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 02:57:26,794 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-04 02:57:26,794 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-04 02:57:26,794 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-04 02:57:26,795 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-04 02:57:26,795 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-04 02:57:26,795 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-04 02:57:26,795 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2025-03-04 02:57:26,795 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2025-03-04 02:57:26,795 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 02:57:26,795 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 02:57:26,795 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 02:57:26,952 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 02:57:26,953 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 02:57:27,002 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4718: havoc #t~mem312.base, #t~mem312.offset;havoc #t~short313;havoc #t~mem314.base, #t~mem314.offset;havoc #t~mem315.base, #t~mem315.offset;havoc #t~short316; [2025-03-04 02:57:27,007 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L266: havoc #t~nondet9; [2025-03-04 02:57:27,127 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4700: havoc #t~ret311#1; [2025-03-04 02:57:27,146 INFO L? ?]: Removed 53 outVars from TransFormulas that were not future-live. [2025-03-04 02:57:27,147 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 02:57:27,153 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 02:57:27,153 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 02:57:27,153 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:57:27 BoogieIcfgContainer [2025-03-04 02:57:27,153 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 02:57:27,155 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 02:57:27,155 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 02:57:27,158 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 02:57:27,158 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 02:57:25" (1/3) ... [2025-03-04 02:57:27,158 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53d1b2ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:57:27, skipping insertion in model container [2025-03-04 02:57:27,158 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:57:26" (2/3) ... [2025-03-04 02:57:27,158 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53d1b2ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:57:27, skipping insertion in model container [2025-03-04 02:57:27,158 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:57:27" (3/3) ... [2025-03-04 02:57:27,159 INFO L128 eAbstractionObserver]: Analyzing ICFG aws_linked_list_end_harness.i [2025-03-04 02:57:27,168 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 02:57:27,169 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG aws_linked_list_end_harness.i that has 6 procedures, 67 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-03-04 02:57:27,207 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 02:57:27,215 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;@69049a65, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 02:57:27,215 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 02:57:27,218 INFO L276 IsEmpty]: Start isEmpty. Operand has 67 states, 47 states have (on average 1.3191489361702127) internal successors, (62), 48 states have internal predecessors, (62), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-04 02:57:27,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-04 02:57:27,223 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:57:27,224 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:57:27,224 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:57:27,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:57:27,227 INFO L85 PathProgramCache]: Analyzing trace with hash -1130872929, now seen corresponding path program 1 times [2025-03-04 02:57:27,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:57:27,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313417188] [2025-03-04 02:57:27,232 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:57:27,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:57:27,336 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-04 02:57:27,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-04 02:57:27,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:57:27,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:57:27,490 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2025-03-04 02:57:27,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:57:27,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313417188] [2025-03-04 02:57:27,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313417188] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:57:27,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1088471869] [2025-03-04 02:57:27,491 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:57:27,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:57:27,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:57:27,495 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:57:27,499 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 02:57:27,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-04 02:57:27,686 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-04 02:57:27,686 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:57:27,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:57:27,689 INFO L256 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 02:57:27,694 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:57:27,707 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2025-03-04 02:57:27,708 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 02:57:27,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1088471869] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:57:27,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 02:57:27,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 02:57:27,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393681095] [2025-03-04 02:57:27,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:57:27,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 02:57:27,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:57:27,727 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 02:57:27,728 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 02:57:27,730 INFO L87 Difference]: Start difference. First operand has 67 states, 47 states have (on average 1.3191489361702127) internal successors, (62), 48 states have internal predecessors, (62), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-04 02:57:27,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 02:57:27,751 INFO L93 Difference]: Finished difference Result 126 states and 174 transitions. [2025-03-04 02:57:27,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 02:57:27,752 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 70 [2025-03-04 02:57:27,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 02:57:27,757 INFO L225 Difference]: With dead ends: 126 [2025-03-04 02:57:27,758 INFO L226 Difference]: Without dead ends: 62 [2025-03-04 02:57:27,761 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 02:57:27,764 INFO L435 NwaCegarLoop]: 86 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, 86 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-03-04 02:57:27,766 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 02:57:27,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2025-03-04 02:57:27,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2025-03-04 02:57:27,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 43 states have (on average 1.302325581395349) internal successors, (56), 44 states have internal predecessors, (56), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-04 02:57:27,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 81 transitions. [2025-03-04 02:57:27,794 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 81 transitions. Word has length 70 [2025-03-04 02:57:27,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 02:57:27,795 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 81 transitions. [2025-03-04 02:57:27,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-04 02:57:27,795 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 81 transitions. [2025-03-04 02:57:27,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-04 02:57:27,797 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:57:27,797 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:57:27,804 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 02:57:28,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-04 02:57:28,006 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:57:28,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:57:28,007 INFO L85 PathProgramCache]: Analyzing trace with hash -624638336, now seen corresponding path program 1 times [2025-03-04 02:57:28,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:57:28,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814373797] [2025-03-04 02:57:28,007 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:57:28,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:57:28,053 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-04 02:57:28,155 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-04 02:57:28,155 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:57:28,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:57:28,591 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-03-04 02:57:28,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:57:28,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814373797] [2025-03-04 02:57:28,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814373797] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:57:28,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [8406636] [2025-03-04 02:57:28,592 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:57:28,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:57:28,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:57:28,594 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:57:28,596 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 02:57:28,695 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-04 02:57:28,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-04 02:57:28,742 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:57:28,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:57:28,750 INFO L256 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-03-04 02:57:28,754 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:57:28,836 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2025-03-04 02:57:28,850 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 9 [2025-03-04 02:57:28,894 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 02:57:28,895 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 02:57:28,896 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 02:57:28,897 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 41 [2025-03-04 02:57:28,905 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 02:57:28,906 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 02:57:28,907 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 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 34 treesize of output 22 [2025-03-04 02:57:29,587 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-04 02:57:29,588 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 02:57:29,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [8406636] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:57:29,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 02:57:29,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [6] total 13 [2025-03-04 02:57:29,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892767153] [2025-03-04 02:57:29,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:57:29,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 02:57:29,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:57:29,589 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 02:57:29,590 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2025-03-04 02:57:29,590 INFO L87 Difference]: Start difference. First operand 62 states and 81 transitions. Second operand has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 8 states have internal predecessors, (41), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-04 02:57:30,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 02:57:30,124 INFO L93 Difference]: Finished difference Result 171 states and 231 transitions. [2025-03-04 02:57:30,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 02:57:30,125 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 8 states have internal predecessors, (41), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) Word has length 70 [2025-03-04 02:57:30,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 02:57:30,127 INFO L225 Difference]: With dead ends: 171 [2025-03-04 02:57:30,127 INFO L226 Difference]: Without dead ends: 121 [2025-03-04 02:57:30,127 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2025-03-04 02:57:30,128 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 49 mSDsluCounter, 377 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 02:57:30,128 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 439 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 02:57:30,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2025-03-04 02:57:30,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 117. [2025-03-04 02:57:30,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 82 states have (on average 1.329268292682927) internal successors, (109), 85 states have internal predecessors, (109), 24 states have call successors, (24), 9 states have call predecessors, (24), 10 states have return successors, (24), 22 states have call predecessors, (24), 22 states have call successors, (24) [2025-03-04 02:57:30,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 157 transitions. [2025-03-04 02:57:30,152 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 157 transitions. Word has length 70 [2025-03-04 02:57:30,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 02:57:30,153 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 157 transitions. [2025-03-04 02:57:30,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 8 states have internal predecessors, (41), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-04 02:57:30,153 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 157 transitions. [2025-03-04 02:57:30,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-04 02:57:30,156 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:57:30,156 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-04 02:57:30,164 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 02:57:30,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2025-03-04 02:57:30,357 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:57:30,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:57:30,358 INFO L85 PathProgramCache]: Analyzing trace with hash 1346301121, now seen corresponding path program 1 times [2025-03-04 02:57:30,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:57:30,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853789263] [2025-03-04 02:57:30,358 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:57:30,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:57:30,379 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-04 02:57:30,392 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-04 02:57:30,393 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:57:30,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:57:30,709 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-03-04 02:57:30,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:57:30,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853789263] [2025-03-04 02:57:30,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853789263] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:57:30,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [113358019] [2025-03-04 02:57:30,710 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:57:30,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:57:30,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:57:30,712 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:57:30,714 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 02:57:30,801 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-04 02:57:30,844 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-04 02:57:30,844 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:57:30,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:57:30,850 INFO L256 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-04 02:57:30,853 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:57:30,952 INFO L349 Elim1Store]: treesize reduction 66, result has 39.4 percent of original size [2025-03-04 02:57:30,952 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 76 treesize of output 128 [2025-03-04 02:57:30,958 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2025-03-04 02:57:30,976 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 02:57:30,976 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2025-03-04 02:57:30,992 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 02:57:30,994 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 34 [2025-03-04 02:57:31,278 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-04 02:57:31,278 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 02:57:31,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [113358019] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:57:31,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 02:57:31,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [6] total 15 [2025-03-04 02:57:31,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477893185] [2025-03-04 02:57:31,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:57:31,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 02:57:31,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:57:31,279 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 02:57:31,279 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2025-03-04 02:57:31,279 INFO L87 Difference]: Start difference. First operand 117 states and 157 transitions. Second operand has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 10 states have internal predecessors, (41), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-04 02:57:35,287 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-04 02:57:39,335 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-04 02:57:43,403 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-04 02:57:47,427 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-04 02:57:51,446 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-04 02:57:51,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 02:57:51,916 INFO L93 Difference]: Finished difference Result 190 states and 263 transitions. [2025-03-04 02:57:51,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 02:57:51,917 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 10 states have internal predecessors, (41), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) Word has length 70 [2025-03-04 02:57:51,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 02:57:51,918 INFO L225 Difference]: With dead ends: 190 [2025-03-04 02:57:51,918 INFO L226 Difference]: Without dead ends: 136 [2025-03-04 02:57:51,919 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=98, Invalid=454, Unknown=0, NotChecked=0, Total=552 [2025-03-04 02:57:51,919 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 213 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 71 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.4s IncrementalHoareTripleChecker+Time [2025-03-04 02:57:51,919 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 379 Invalid, 302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 226 Invalid, 5 Unknown, 0 Unchecked, 20.4s Time] [2025-03-04 02:57:51,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2025-03-04 02:57:51,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 127. [2025-03-04 02:57:51,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 91 states have (on average 1.3626373626373627) internal successors, (124), 94 states have internal predecessors, (124), 25 states have call successors, (25), 9 states have call predecessors, (25), 10 states have return successors, (25), 23 states have call predecessors, (25), 23 states have call successors, (25) [2025-03-04 02:57:51,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 174 transitions. [2025-03-04 02:57:51,952 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 174 transitions. Word has length 70 [2025-03-04 02:57:51,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 02:57:51,952 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 174 transitions. [2025-03-04 02:57:51,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 10 states have internal predecessors, (41), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-04 02:57:51,953 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 174 transitions. [2025-03-04 02:57:51,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-04 02:57:51,954 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:57:51,954 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-03-04 02:57:51,965 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-04 02:57:52,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:57:52,155 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:57:52,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:57:52,155 INFO L85 PathProgramCache]: Analyzing trace with hash 1338541762, now seen corresponding path program 1 times [2025-03-04 02:57:52,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:57:52,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279912855] [2025-03-04 02:57:52,155 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:57:52,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:57:52,169 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-04 02:57:52,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-04 02:57:52,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:57:52,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:57:52,394 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-03-04 02:57:52,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:57:52,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279912855] [2025-03-04 02:57:52,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279912855] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:57:52,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1639113260] [2025-03-04 02:57:52,396 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:57:52,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:57:52,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:57:52,398 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:57:52,401 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 02:57:52,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-04 02:57:52,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-04 02:57:52,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:57:52,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:57:52,526 INFO L256 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-03-04 02:57:52,531 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:57:52,558 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 9 [2025-03-04 02:57:52,568 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2025-03-04 02:57:52,598 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 02:57:52,599 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 02:57:52,600 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 02:57:52,601 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 41 [2025-03-04 02:57:52,607 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 02:57:52,608 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 02:57:52,609 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 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 34 treesize of output 22 [2025-03-04 02:57:53,710 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-04 02:57:53,710 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 02:57:53,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1639113260] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:57:53,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 02:57:53,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 14 [2025-03-04 02:57:53,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865802725] [2025-03-04 02:57:53,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:57:53,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 02:57:53,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:57:53,711 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 02:57:53,711 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2025-03-04 02:57:53,711 INFO L87 Difference]: Start difference. First operand 127 states and 174 transitions. Second operand has 10 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-04 02:57:54,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 02:57:54,222 INFO L93 Difference]: Finished difference Result 197 states and 270 transitions. [2025-03-04 02:57:54,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 02:57:54,223 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) Word has length 70 [2025-03-04 02:57:54,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 02:57:54,224 INFO L225 Difference]: With dead ends: 197 [2025-03-04 02:57:54,224 INFO L226 Difference]: Without dead ends: 133 [2025-03-04 02:57:54,225 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 55 SyntacticMatches, 8 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2025-03-04 02:57:54,225 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 57 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 02:57:54,225 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 423 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 02:57:54,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2025-03-04 02:57:54,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 127. [2025-03-04 02:57:54,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 91 states have (on average 1.3516483516483517) internal successors, (123), 94 states have internal predecessors, (123), 25 states have call successors, (25), 9 states have call predecessors, (25), 10 states have return successors, (25), 23 states have call predecessors, (25), 23 states have call successors, (25) [2025-03-04 02:57:54,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 173 transitions. [2025-03-04 02:57:54,238 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 173 transitions. Word has length 70 [2025-03-04 02:57:54,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 02:57:54,238 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 173 transitions. [2025-03-04 02:57:54,238 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-04 02:57:54,238 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 173 transitions. [2025-03-04 02:57:54,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-04 02:57:54,239 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:57:54,240 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-04 02:57:54,247 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-04 02:57:54,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:57:54,442 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:57:54,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:57:54,443 INFO L85 PathProgramCache]: Analyzing trace with hash -723649246, now seen corresponding path program 1 times [2025-03-04 02:57:54,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:57:54,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127616587] [2025-03-04 02:57:54,443 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:57:54,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:57:54,454 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-04 02:57:54,465 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-04 02:57:54,465 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:57:54,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:57:54,641 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-03-04 02:57:54,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:57:54,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127616587] [2025-03-04 02:57:54,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127616587] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:57:54,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [623563832] [2025-03-04 02:57:54,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:57:54,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:57:54,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:57:54,644 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:57:54,646 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 02:57:54,732 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-04 02:57:54,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-04 02:57:54,766 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:57:54,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:57:54,771 INFO L256 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-03-04 02:57:54,776 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:57:54,884 INFO L349 Elim1Store]: treesize reduction 50, result has 41.2 percent of original size [2025-03-04 02:57:54,885 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 60 treesize of output 104 [2025-03-04 02:57:54,891 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2025-03-04 02:57:54,904 WARN L214 Elim1Store]: Array PQE input equivalent to false [2025-03-04 02:57:54,936 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 02:57:54,937 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 9 [2025-03-04 02:57:54,939 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2025-03-04 02:58:21,159 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:58:21,159 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 02:58:21,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [623563832] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:58:21,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 02:58:21,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [6] total 24 [2025-03-04 02:58:21,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817254382] [2025-03-04 02:58:21,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:58:21,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-04 02:58:21,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:58:21,160 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-04 02:58:21,161 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=399, Unknown=57, NotChecked=0, Total=552 [2025-03-04 02:58:21,162 INFO L87 Difference]: Start difference. First operand 127 states and 173 transitions. Second operand has 20 states, 17 states have (on average 3.235294117647059) internal successors, (55), 16 states have internal predecessors, (55), 7 states have call successors, (8), 7 states have call predecessors, (8), 6 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2025-03-04 02:58:34,862 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base|) 24))) (and (< 0 |c_#StackHeapBarrier|) (or (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_13| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_13|) 24))) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_13|) (<= |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_13| .cse0) (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int))) (let ((.cse1 (select (store (store |c_#memory_$Pointer$#2.base| .cse0 v_DerPreprocessor_3) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_13| v_DerPreprocessor_4) .cse0))) (and (= (select |c_#memory_$Pointer$#2.base| .cse0) .cse1) (= v_DerPreprocessor_4 (store .cse1 24 .cse0)))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_13| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_13|) (= (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_13|) 24) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_13|)))) (or (= .cse2 |c_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base|) (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int))) (let ((.cse3 (select (store (store |c_#memory_$Pointer$#2.base| .cse2 v_DerPreprocessor_3) |c_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base| v_DerPreprocessor_4) .cse2))) (and (= .cse3 (select |c_#memory_$Pointer$#2.base| .cse2)) (= (store .cse3 24 .cse2) v_DerPreprocessor_4))))) (= |c_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset| 0) (<= |c_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base| .cse2) (or (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_14| Int)) (and (= |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_14| (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_14|) 24)) (<= 2 |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_14|))) (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_14| Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_14|) 24))) (and (<= |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_14| .cse4) (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int))) (let ((.cse5 (select (store (store |c_#memory_$Pointer$#2.base| .cse4 v_DerPreprocessor_3) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_14| v_DerPreprocessor_4) .cse4))) (and (= (store .cse5 24 .cse4) v_DerPreprocessor_4) (= .cse5 (select |c_#memory_$Pointer$#2.base| .cse4))))) (<= 2 |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_14|))))) (<= 2 |c_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base|))) is different from true [2025-03-04 02:58:45,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 02:58:45,221 INFO L93 Difference]: Finished difference Result 371 states and 505 transitions. [2025-03-04 02:58:45,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-04 02:58:45,221 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 17 states have (on average 3.235294117647059) internal successors, (55), 16 states have internal predecessors, (55), 7 states have call successors, (8), 7 states have call predecessors, (8), 6 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) Word has length 70 [2025-03-04 02:58:45,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 02:58:45,225 INFO L225 Difference]: With dead ends: 371 [2025-03-04 02:58:45,226 INFO L226 Difference]: Without dead ends: 283 [2025-03-04 02:58:45,228 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 33.8s TimeCoverageRelationStatistics Valid=171, Invalid=857, Unknown=98, NotChecked=64, Total=1190 [2025-03-04 02:58:45,228 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 340 mSDsluCounter, 985 mSDsCounter, 0 mSdLazyCounter, 568 mSolverCounterSat, 7 mSolverCounterUnsat, 495 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 345 SdHoareTripleChecker+Valid, 1151 SdHoareTripleChecker+Invalid, 1088 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 568 IncrementalHoareTripleChecker+Invalid, 495 IncrementalHoareTripleChecker+Unknown, 18 IncrementalHoareTripleChecker+Unchecked, 14.0s IncrementalHoareTripleChecker+Time [2025-03-04 02:58:45,228 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [345 Valid, 1151 Invalid, 1088 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 568 Invalid, 495 Unknown, 18 Unchecked, 14.0s Time] [2025-03-04 02:58:45,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2025-03-04 02:58:45,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 262. [2025-03-04 02:58:45,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 203 states have (on average 1.3694581280788178) internal successors, (278), 206 states have internal predecessors, (278), 37 states have call successors, (37), 20 states have call predecessors, (37), 21 states have return successors, (37), 35 states have call predecessors, (37), 34 states have call successors, (37) [2025-03-04 02:58:45,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 352 transitions. [2025-03-04 02:58:45,270 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 352 transitions. Word has length 70 [2025-03-04 02:58:45,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 02:58:45,271 INFO L471 AbstractCegarLoop]: Abstraction has 262 states and 352 transitions. [2025-03-04 02:58:45,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 17 states have (on average 3.235294117647059) internal successors, (55), 16 states have internal predecessors, (55), 7 states have call successors, (8), 7 states have call predecessors, (8), 6 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2025-03-04 02:58:45,271 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 352 transitions. [2025-03-04 02:58:45,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-04 02:58:45,272 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:58:45,272 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-04 02:58:45,281 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-04 02:58:45,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:58:45,473 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:58:45,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:58:45,473 INFO L85 PathProgramCache]: Analyzing trace with hash 1774366691, now seen corresponding path program 2 times [2025-03-04 02:58:45,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:58:45,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455161058] [2025-03-04 02:58:45,473 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:58:45,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:58:45,487 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 70 statements into 2 equivalence classes. [2025-03-04 02:58:45,504 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 70 of 70 statements. [2025-03-04 02:58:45,505 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:58:45,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:58:45,667 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-03-04 02:58:45,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:58:45,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455161058] [2025-03-04 02:58:45,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455161058] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:58:45,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [117455321] [2025-03-04 02:58:45,668 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:58:45,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:58:45,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:58:45,670 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:58:45,671 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 02:58:45,757 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 70 statements into 2 equivalence classes. [2025-03-04 02:58:45,784 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 70 of 70 statements. [2025-03-04 02:58:45,784 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:58:45,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:58:45,786 INFO L256 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-03-04 02:58:45,789 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:58:45,849 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 15 [2025-03-04 02:58:45,859 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2025-03-04 02:58:45,894 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 02:58:45,896 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 02:58:45,897 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 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 22 treesize of output 25 [2025-03-04 02:58:45,905 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 02:58:45,906 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 02:58:45,908 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 02:58:45,908 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2025-03-04 02:58:47,289 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-04 02:58:47,289 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 02:58:47,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [117455321] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:58:47,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 02:58:47,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [6] total 15 [2025-03-04 02:58:47,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210349220] [2025-03-04 02:58:47,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:58:47,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 02:58:47,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:58:47,290 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 02:58:47,290 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2025-03-04 02:58:47,290 INFO L87 Difference]: Start difference. First operand 262 states and 352 transitions. Second operand has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 11 states have internal predecessors, (42), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-04 02:58:48,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 02:58:48,007 INFO L93 Difference]: Finished difference Result 543 states and 738 transitions. [2025-03-04 02:58:48,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 02:58:48,007 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 11 states have internal predecessors, (42), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) Word has length 70 [2025-03-04 02:58:48,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 02:58:48,009 INFO L225 Difference]: With dead ends: 543 [2025-03-04 02:58:48,009 INFO L226 Difference]: Without dead ends: 286 [2025-03-04 02:58:48,010 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 54 SyntacticMatches, 8 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2025-03-04 02:58:48,010 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 78 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 499 SdHoareTripleChecker+Invalid, 351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 02:58:48,011 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 499 Invalid, 351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 327 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 02:58:48,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2025-03-04 02:58:48,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 274. [2025-03-04 02:58:48,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 214 states have (on average 1.3504672897196262) internal successors, (289), 218 states have internal predecessors, (289), 37 states have call successors, (37), 20 states have call predecessors, (37), 22 states have return successors, (40), 35 states have call predecessors, (40), 34 states have call successors, (40) [2025-03-04 02:58:48,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 366 transitions. [2025-03-04 02:58:48,045 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 366 transitions. Word has length 70 [2025-03-04 02:58:48,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 02:58:48,046 INFO L471 AbstractCegarLoop]: Abstraction has 274 states and 366 transitions. [2025-03-04 02:58:48,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 11 states have internal predecessors, (42), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-04 02:58:48,046 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 366 transitions. [2025-03-04 02:58:48,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-04 02:58:48,047 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:58:48,047 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-03-04 02:58:48,053 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-04 02:58:48,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:58:48,251 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:58:48,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:58:48,251 INFO L85 PathProgramCache]: Analyzing trace with hash -1680813019, now seen corresponding path program 1 times [2025-03-04 02:58:48,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:58:48,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570144991] [2025-03-04 02:58:48,251 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:58:48,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:58:48,262 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-04 02:58:48,265 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-04 02:58:48,266 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:58:48,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:58:48,592 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-04 02:58:48,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:58:48,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570144991] [2025-03-04 02:58:48,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570144991] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:58:48,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [862572428] [2025-03-04 02:58:48,592 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:58:48,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:58:48,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:58:48,597 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:58:48,598 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 02:58:48,683 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-04 02:58:48,709 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-04 02:58:48,709 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:58:48,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:58:48,717 INFO L256 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 54 conjuncts are in the unsatisfiable core [2025-03-04 02:58:48,720 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:58:48,781 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 15 [2025-03-04 02:58:49,396 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-04 02:58:49,396 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 02:58:49,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [862572428] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:58:49,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 02:58:49,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [9] total 19 [2025-03-04 02:58:49,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208268057] [2025-03-04 02:58:49,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:58:49,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 02:58:49,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:58:49,397 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 02:58:49,397 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2025-03-04 02:58:49,397 INFO L87 Difference]: Start difference. First operand 274 states and 366 transitions. Second operand has 12 states, 12 states have (on average 3.75) internal successors, (45), 12 states have internal predecessors, (45), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-04 02:58:53,417 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-04 02:58:57,451 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-04 02:59:01,472 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0]