./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_array_list_front_harness_negated.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_array_list_front_harness_negated.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 2ce109988390b6767f379f20c8317980e8ad55260534e411b505fed6860deb81 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 02:34:00,804 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 02:34:00,858 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-04 02:34:00,864 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 02:34:00,867 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 02:34:00,887 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 02:34:00,888 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 02:34:00,888 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 02:34:00,888 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 02:34:00,888 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 02:34:00,888 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 02:34:00,889 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 02:34:00,889 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 02:34:00,889 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 02:34:00,889 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 02:34:00,889 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 02:34:00,889 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 02:34:00,890 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 02:34:00,890 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 02:34:00,890 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 02:34:00,891 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 02:34:00,891 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 02:34:00,891 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 02:34:00,891 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 02:34:00,891 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 02:34:00,891 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 02:34:00,891 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 02:34:00,891 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 02:34:00,891 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 02:34:00,891 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 02:34:00,891 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 02:34:00,891 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 02:34:00,892 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 02:34:00,892 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 02:34:00,892 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 02:34:00,892 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 02:34:00,892 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 02:34:00,892 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 02:34:00,893 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 02:34:00,893 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 02:34:00,893 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 -> 2ce109988390b6767f379f20c8317980e8ad55260534e411b505fed6860deb81 [2025-03-04 02:34:01,118 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 02:34:01,127 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 02:34:01,129 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 02:34:01,130 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 02:34:01,131 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 02:34:01,132 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/aws-c-common/aws_array_list_front_harness_negated.i [2025-03-04 02:34:02,290 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eaea4133f/08256bcfce384f7c8b66370f9344e219/FLAGdeeeb3434 [2025-03-04 02:34:02,780 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 02:34:02,781 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_array_list_front_harness_negated.i [2025-03-04 02:34:02,816 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eaea4133f/08256bcfce384f7c8b66370f9344e219/FLAGdeeeb3434 [2025-03-04 02:34:02,858 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eaea4133f/08256bcfce384f7c8b66370f9344e219 [2025-03-04 02:34:02,860 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 02:34:02,861 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 02:34:02,863 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 02:34:02,863 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 02:34:02,866 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 02:34:02,867 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:34:02" (1/1) ... [2025-03-04 02:34:02,867 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50d52a85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:34:02, skipping insertion in model container [2025-03-04 02:34:02,869 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:34:02" (1/1) ... [2025-03-04 02:34:02,940 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 02:34:03,103 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_array_list_front_harness_negated.i[4494,4507] [2025-03-04 02:34:03,110 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_array_list_front_harness_negated.i[4554,4567] [2025-03-04 02:34:03,567 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:34:03,567 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:34:03,567 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:34:03,568 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:34:03,568 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:34:03,577 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:34:03,578 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:34:03,579 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:34:03,579 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:34:03,580 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:34:03,581 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:34:03,581 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:34:03,581 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:34:03,942 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:34:03,950 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:34:03,998 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 02:34:04,024 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 02:34:04,035 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_array_list_front_harness_negated.i[4494,4507] [2025-03-04 02:34:04,035 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_array_list_front_harness_negated.i[4554,4567] [2025-03-04 02:34:04,076 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:34:04,076 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:34:04,076 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:34:04,076 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:34:04,077 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:34:04,081 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:34:04,081 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:34:04,082 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:34:04,082 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:34:04,083 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:34:04,083 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:34:04,083 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:34:04,083 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:34:04,171 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:34:04,178 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:34:04,183 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" : : "r"(pBuf) : "memory"); [7735-7746] [2025-03-04 02:34:04,201 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 02:34:04,357 INFO L204 MainTranslator]: Completed translation [2025-03-04 02:34:04,358 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:34:04 WrapperNode [2025-03-04 02:34:04,358 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 02:34:04,359 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 02:34:04,359 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 02:34:04,359 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 02:34:04,363 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:34:04" (1/1) ... [2025-03-04 02:34:04,414 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:34:04" (1/1) ... [2025-03-04 02:34:04,457 INFO L138 Inliner]: procedures = 680, calls = 1682, calls flagged for inlining = 53, calls inlined = 8, statements flattened = 662 [2025-03-04 02:34:04,457 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 02:34:04,457 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 02:34:04,458 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 02:34:04,458 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 02:34:04,470 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:34:04" (1/1) ... [2025-03-04 02:34:04,470 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:34:04" (1/1) ... [2025-03-04 02:34:04,477 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:34:04" (1/1) ... [2025-03-04 02:34:04,536 INFO L175 MemorySlicer]: Split 314 memory accesses to 6 slices as follows [56, 238, 2, 6, 9, 3]. 76 percent of accesses are in the largest equivalence class. The 24 initializations are split as follows [10, 6, 2, 0, 5, 1]. The 239 writes are split as follows [3, 232, 0, 2, 1, 1]. [2025-03-04 02:34:04,536 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:34:04" (1/1) ... [2025-03-04 02:34:04,536 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:34:04" (1/1) ... [2025-03-04 02:34:04,563 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:34:04" (1/1) ... [2025-03-04 02:34:04,565 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:34:04" (1/1) ... [2025-03-04 02:34:04,570 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:34:04" (1/1) ... [2025-03-04 02:34:04,572 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:34:04" (1/1) ... [2025-03-04 02:34:04,577 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 02:34:04,578 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 02:34:04,578 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 02:34:04,578 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 02:34:04,582 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:34:04" (1/1) ... [2025-03-04 02:34:04,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 02:34:04,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:34:04,612 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:34:04,615 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:34:04,643 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 02:34:04,643 INFO L130 BoogieDeclarations]: Found specification of procedure aws_array_list_is_bounded [2025-03-04 02:34:04,643 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_array_list_is_bounded [2025-03-04 02:34:04,643 INFO L130 BoogieDeclarations]: Found specification of procedure aws_array_list_is_valid [2025-03-04 02:34:04,643 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_array_list_is_valid [2025-03-04 02:34:04,643 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2025-03-04 02:34:04,643 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2025-03-04 02:34:04,643 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-03-04 02:34:04,644 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-03-04 02:34:04,644 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-03-04 02:34:04,644 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-03-04 02:34:04,644 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-03-04 02:34:04,644 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2025-03-04 02:34:04,644 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 02:34:04,644 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 02:34:04,644 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 02:34:04,644 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-04 02:34:04,644 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-04 02:34:04,644 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-04 02:34:04,644 INFO L130 BoogieDeclarations]: Found specification of procedure aws_raise_error [2025-03-04 02:34:04,644 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_raise_error [2025-03-04 02:34:04,644 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-04 02:34:04,644 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-04 02:34:04,644 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 02:34:04,644 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 02:34:04,644 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-04 02:34:04,644 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-04 02:34:04,645 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-04 02:34:04,645 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-03-04 02:34:04,645 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-03-04 02:34:04,645 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-03-04 02:34:04,645 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy_impl [2025-03-04 02:34:04,645 INFO L138 BoogieDeclarations]: Found implementation of procedure memcpy_impl [2025-03-04 02:34:04,645 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 02:34:04,645 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 02:34:04,645 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2025-03-04 02:34:04,645 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2025-03-04 02:34:04,645 INFO L130 BoogieDeclarations]: Found specification of procedure assert_byte_from_buffer_matches [2025-03-04 02:34:04,645 INFO L138 BoogieDeclarations]: Found implementation of procedure assert_byte_from_buffer_matches [2025-03-04 02:34:04,645 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_size_t [2025-03-04 02:34:04,645 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_size_t [2025-03-04 02:34:04,645 INFO L130 BoogieDeclarations]: Found specification of procedure aws_mul_size_checked [2025-03-04 02:34:04,645 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_mul_size_checked [2025-03-04 02:34:04,645 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2025-03-04 02:34:04,645 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2025-03-04 02:34:04,645 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2025-03-04 02:34:04,645 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2025-03-04 02:34:04,645 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2025-03-04 02:34:04,645 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2025-03-04 02:34:04,645 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_malloc [2025-03-04 02:34:04,645 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_malloc [2025-03-04 02:34:04,645 INFO L130 BoogieDeclarations]: Found specification of procedure aws_array_list_length [2025-03-04 02:34:04,645 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_array_list_length [2025-03-04 02:34:04,645 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 02:34:04,645 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 02:34:04,645 INFO L130 BoogieDeclarations]: Found specification of procedure my_memcpy [2025-03-04 02:34:04,645 INFO L138 BoogieDeclarations]: Found implementation of procedure my_memcpy [2025-03-04 02:34:04,645 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 02:34:04,645 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-04 02:34:04,647 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-04 02:34:04,647 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-04 02:34:04,647 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-03-04 02:34:04,647 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-03-04 02:34:04,647 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-03-04 02:34:04,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-04 02:34:04,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-04 02:34:04,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-04 02:34:04,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-03-04 02:34:04,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-03-04 02:34:04,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-03-04 02:34:04,648 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_allocator [2025-03-04 02:34:04,648 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_allocator [2025-03-04 02:34:04,648 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_overflow_mult [2025-03-04 02:34:04,648 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_overflow_mult [2025-03-04 02:34:04,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 02:34:04,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 02:34:04,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 02:34:04,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-04 02:34:04,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-04 02:34:04,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-04 02:34:04,648 INFO L130 BoogieDeclarations]: Found specification of procedure ensure_array_list_has_allocated_data_member [2025-03-04 02:34:04,648 INFO L138 BoogieDeclarations]: Found implementation of procedure ensure_array_list_has_allocated_data_member [2025-03-04 02:34:04,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 02:34:04,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 02:34:04,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 02:34:04,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-04 02:34:04,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-04 02:34:04,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-04 02:34:04,898 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 02:34:04,900 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 02:34:04,931 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2782: havoc #t~malloc77.base, #t~malloc77.offset; [2025-03-04 02:34:04,944 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L263: havoc #t~nondet6; [2025-03-04 02:34:04,962 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2588: havoc #t~ret57#1; [2025-03-04 02:34:05,005 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2796: havoc #t~ret81;havoc #t~ite83.base, #t~ite83.offset;havoc #t~ret82.base, #t~ret82.offset; [2025-03-04 02:34:05,084 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3268: call ULTIMATE.dealloc(~#required_size~0.base, ~#required_size~0.offset);havoc ~#required_size~0.base, ~#required_size~0.offset; [2025-03-04 02:34:05,087 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L261: havoc #t~nondet4; [2025-03-04 02:34:05,102 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7356: havoc #t~ret687.base, #t~ret687.offset; [2025-03-04 02:34:10,285 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3342: havoc aws_array_list_front_#t~ret180#1; [2025-03-04 02:34:10,337 INFO L? ?]: Removed 131 outVars from TransFormulas that were not future-live. [2025-03-04 02:34:10,337 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 02:34:10,349 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 02:34:10,350 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 02:34:10,351 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:34:10 BoogieIcfgContainer [2025-03-04 02:34:10,351 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 02:34:10,353 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 02:34:10,354 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 02:34:10,357 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 02:34:10,357 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 02:34:02" (1/3) ... [2025-03-04 02:34:10,358 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66484d5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:34:10, skipping insertion in model container [2025-03-04 02:34:10,358 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:34:04" (2/3) ... [2025-03-04 02:34:10,358 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66484d5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:34:10, skipping insertion in model container [2025-03-04 02:34:10,358 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:34:10" (3/3) ... [2025-03-04 02:34:10,359 INFO L128 eAbstractionObserver]: Analyzing ICFG aws_array_list_front_harness_negated.i [2025-03-04 02:34:10,370 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 02:34:10,371 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG aws_array_list_front_harness_negated.i that has 18 procedures, 186 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 02:34:10,418 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 02:34:10,427 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;@2fa27e1d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 02:34:10,428 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 02:34:10,431 INFO L276 IsEmpty]: Start isEmpty. Operand has 186 states, 111 states have (on average 1.1981981981981982) internal successors, (133), 112 states have internal predecessors, (133), 56 states have call successors, (56), 17 states have call predecessors, (56), 17 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2025-03-04 02:34:10,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-04 02:34:10,439 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:34:10,440 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:10,440 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:34:10,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:34:10,444 INFO L85 PathProgramCache]: Analyzing trace with hash -411417386, now seen corresponding path program 1 times [2025-03-04 02:34:10,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:34:10,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277878559] [2025-03-04 02:34:10,449 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:34:10,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:34:14,566 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-04 02:34:14,888 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-04 02:34:14,888 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:34:14,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:34:15,312 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2025-03-04 02:34:15,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:34:15,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277878559] [2025-03-04 02:34:15,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277878559] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:34:15,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1355549550] [2025-03-04 02:34:15,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:34:15,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:34:15,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:34:15,318 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:34:15,318 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:34:19,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-04 02:34:19,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-04 02:34:19,881 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:34:19,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:34:19,901 INFO L256 TraceCheckSpWp]: Trace formula consists of 4252 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 02:34:19,910 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:34:19,930 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2025-03-04 02:34:19,930 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 02:34:19,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1355549550] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:34:19,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 02:34:19,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 02:34:19,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453381990] [2025-03-04 02:34:19,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:34:19,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 02:34:19,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:34:19,950 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 02:34:19,950 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 02:34:19,953 INFO L87 Difference]: Start difference. First operand has 186 states, 111 states have (on average 1.1981981981981982) internal successors, (133), 112 states have internal predecessors, (133), 56 states have call successors, (56), 17 states have call predecessors, (56), 17 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) Second operand has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-04 02:34:19,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 02:34:19,980 INFO L93 Difference]: Finished difference Result 365 states and 519 transitions. [2025-03-04 02:34:19,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 02:34:19,981 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 129 [2025-03-04 02:34:19,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 02:34:19,986 INFO L225 Difference]: With dead ends: 365 [2025-03-04 02:34:19,987 INFO L226 Difference]: Without dead ends: 177 [2025-03-04 02:34:19,992 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 130 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:34:19,995 INFO L435 NwaCegarLoop]: 243 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, 243 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:34:19,997 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 02:34:20,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2025-03-04 02:34:20,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2025-03-04 02:34:20,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 104 states have (on average 1.1634615384615385) internal successors, (121), 105 states have internal predecessors, (121), 56 states have call successors, (56), 17 states have call predecessors, (56), 16 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2025-03-04 02:34:20,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 231 transitions. [2025-03-04 02:34:20,032 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 231 transitions. Word has length 129 [2025-03-04 02:34:20,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 02:34:20,032 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 231 transitions. [2025-03-04 02:34:20,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-04 02:34:20,032 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 231 transitions. [2025-03-04 02:34:20,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-04 02:34:20,035 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:34:20,035 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:20,049 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:34:20,236 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:34:20,236 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:34:20,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:34:20,236 INFO L85 PathProgramCache]: Analyzing trace with hash -381902376, now seen corresponding path program 1 times [2025-03-04 02:34:20,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:34:20,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017316036] [2025-03-04 02:34:20,237 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:34:20,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:34:23,979 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-04 02:34:24,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-04 02:34:24,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:34:24,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:34:26,028 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 02:34:26,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:34:26,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017316036] [2025-03-04 02:34:26,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017316036] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:34:26,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:34:26,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 02:34:26,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554959164] [2025-03-04 02:34:26,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:34:26,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 02:34:26,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:34:26,031 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 02:34:26,031 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 02:34:26,031 INFO L87 Difference]: Start difference. First operand 177 states and 231 transitions. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 6 states have internal predecessors, (46), 3 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (21), 4 states have call predecessors, (21), 3 states have call successors, (21) [2025-03-04 02:34:26,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 02:34:26,490 INFO L93 Difference]: Finished difference Result 306 states and 403 transitions. [2025-03-04 02:34:26,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 02:34:26,492 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 6 states have internal predecessors, (46), 3 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (21), 4 states have call predecessors, (21), 3 states have call successors, (21) Word has length 129 [2025-03-04 02:34:26,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 02:34:26,494 INFO L225 Difference]: With dead ends: 306 [2025-03-04 02:34:26,494 INFO L226 Difference]: Without dead ends: 195 [2025-03-04 02:34:26,495 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-04 02:34:26,498 INFO L435 NwaCegarLoop]: 226 mSDtfsCounter, 6 mSDsluCounter, 1125 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 1351 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 02:34:26,498 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 1351 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 02:34:26,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2025-03-04 02:34:26,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 191. [2025-03-04 02:34:26,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 113 states have (on average 1.1592920353982301) internal successors, (131), 114 states have internal predecessors, (131), 60 states have call successors, (60), 17 states have call predecessors, (60), 17 states have return successors, (59), 59 states have call predecessors, (59), 58 states have call successors, (59) [2025-03-04 02:34:26,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 250 transitions. [2025-03-04 02:34:26,519 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 250 transitions. Word has length 129 [2025-03-04 02:34:26,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 02:34:26,519 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 250 transitions. [2025-03-04 02:34:26,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 6 states have internal predecessors, (46), 3 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (21), 4 states have call predecessors, (21), 3 states have call successors, (21) [2025-03-04 02:34:26,519 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 250 transitions. [2025-03-04 02:34:26,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-04 02:34:26,521 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:34:26,521 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:26,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 02:34:26,521 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:34:26,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:34:26,523 INFO L85 PathProgramCache]: Analyzing trace with hash 56107127, now seen corresponding path program 1 times [2025-03-04 02:34:26,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:34:26,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703263101] [2025-03-04 02:34:26,524 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:34:26,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:34:30,339 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-04 02:34:30,437 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-04 02:34:30,437 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:34:30,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:34:32,410 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 02:34:32,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:34:32,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703263101] [2025-03-04 02:34:32,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703263101] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:34:32,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:34:32,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 02:34:32,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201279790] [2025-03-04 02:34:32,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:34:32,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 02:34:32,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:34:32,413 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 02:34:32,413 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-04 02:34:32,413 INFO L87 Difference]: Start difference. First operand 191 states and 250 transitions. Second operand has 8 states, 8 states have (on average 5.75) internal successors, (46), 7 states have internal predecessors, (46), 4 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (21), 5 states have call predecessors, (21), 4 states have call successors, (21) [2025-03-04 02:34:32,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 02:34:32,991 INFO L93 Difference]: Finished difference Result 321 states and 426 transitions. [2025-03-04 02:34:32,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 02:34:32,992 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 7 states have internal predecessors, (46), 4 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (21), 5 states have call predecessors, (21), 4 states have call successors, (21) Word has length 129 [2025-03-04 02:34:32,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 02:34:32,994 INFO L225 Difference]: With dead ends: 321 [2025-03-04 02:34:32,994 INFO L226 Difference]: Without dead ends: 216 [2025-03-04 02:34:32,995 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-04 02:34:32,995 INFO L435 NwaCegarLoop]: 234 mSDtfsCounter, 14 mSDsluCounter, 1390 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 1624 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 02:34:32,995 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 1624 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 02:34:32,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2025-03-04 02:34:33,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 197. [2025-03-04 02:34:33,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 116 states have (on average 1.1551724137931034) internal successors, (134), 117 states have internal predecessors, (134), 63 states have call successors, (63), 17 states have call predecessors, (63), 17 states have return successors, (62), 62 states have call predecessors, (62), 61 states have call successors, (62) [2025-03-04 02:34:33,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 259 transitions. [2025-03-04 02:34:33,012 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 259 transitions. Word has length 129 [2025-03-04 02:34:33,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 02:34:33,013 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 259 transitions. [2025-03-04 02:34:33,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 7 states have internal predecessors, (46), 4 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (21), 5 states have call predecessors, (21), 4 states have call successors, (21) [2025-03-04 02:34:33,014 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 259 transitions. [2025-03-04 02:34:33,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-04 02:34:33,015 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:34:33,015 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:33,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 02:34:33,015 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:34:33,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:34:33,016 INFO L85 PathProgramCache]: Analyzing trace with hash 2006407382, now seen corresponding path program 1 times [2025-03-04 02:34:33,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:34:33,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855703652] [2025-03-04 02:34:33,016 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:34:33,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:34:36,549 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-04 02:34:36,690 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-04 02:34:36,690 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:34:36,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:34:38,620 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 212 trivial. 0 not checked. [2025-03-04 02:34:38,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:34:38,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855703652] [2025-03-04 02:34:38,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855703652] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:34:38,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:34:38,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 02:34:38,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340244422] [2025-03-04 02:34:38,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:34:38,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 02:34:38,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:34:38,623 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 02:34:38,623 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 02:34:38,624 INFO L87 Difference]: Start difference. First operand 197 states and 259 transitions. Second operand has 6 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (21), 2 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-04 02:34:39,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 02:34:39,011 INFO L93 Difference]: Finished difference Result 207 states and 278 transitions. [2025-03-04 02:34:39,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 02:34:39,012 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (21), 2 states have call predecessors, (21), 1 states have call successors, (21) Word has length 129 [2025-03-04 02:34:39,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 02:34:39,015 INFO L225 Difference]: With dead ends: 207 [2025-03-04 02:34:39,015 INFO L226 Difference]: Without dead ends: 205 [2025-03-04 02:34:39,015 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-04 02:34:39,015 INFO L435 NwaCegarLoop]: 228 mSDtfsCounter, 3 mSDsluCounter, 896 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1124 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 02:34:39,016 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1124 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 02:34:39,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2025-03-04 02:34:39,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 204. [2025-03-04 02:34:39,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 120 states have (on average 1.15) internal successors, (138), 122 states have internal predecessors, (138), 64 states have call successors, (64), 18 states have call predecessors, (64), 19 states have return successors, (73), 63 states have call predecessors, (73), 62 states have call successors, (73) [2025-03-04 02:34:39,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 275 transitions. [2025-03-04 02:34:39,033 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 275 transitions. Word has length 129 [2025-03-04 02:34:39,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 02:34:39,033 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 275 transitions. [2025-03-04 02:34:39,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (21), 2 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-04 02:34:39,036 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 275 transitions. [2025-03-04 02:34:39,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-04 02:34:39,037 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:34:39,037 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:34:39,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 02:34:39,037 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:34:39,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:34:39,038 INFO L85 PathProgramCache]: Analyzing trace with hash -783219405, now seen corresponding path program 1 times [2025-03-04 02:34:39,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:34:39,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762151991] [2025-03-04 02:34:39,038 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:34:39,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:34:42,499 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-04 02:34:42,596 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-04 02:34:42,596 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:34:42,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:34:44,984 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 9 proven. 12 refuted. 0 times theorem prover too weak. 199 trivial. 0 not checked. [2025-03-04 02:34:44,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:34:44,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762151991] [2025-03-04 02:34:44,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762151991] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:34:44,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [418617805] [2025-03-04 02:34:44,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:34:44,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:34:44,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:34:44,987 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:34:44,987 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:34:49,073 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-04 02:34:49,485 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-04 02:34:49,485 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:34:49,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:34:49,505 INFO L256 TraceCheckSpWp]: Trace formula consists of 4379 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 02:34:49,512 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:34:52,013 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked. [2025-03-04 02:34:52,013 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 02:34:52,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [418617805] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:34:52,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 02:34:52,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [11] total 18 [2025-03-04 02:34:52,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310742790] [2025-03-04 02:34:52,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:34:52,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 02:34:52,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:34:52,016 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 02:34:52,016 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2025-03-04 02:34:52,016 INFO L87 Difference]: Start difference. First operand 204 states and 275 transitions. Second operand has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 8 states have internal predecessors, (60), 6 states have call successors, (25), 3 states have call predecessors, (25), 2 states have return successors, (23), 6 states have call predecessors, (23), 5 states have call successors, (23) [2025-03-04 02:34:57,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 02:34:57,008 INFO L93 Difference]: Finished difference Result 378 states and 510 transitions. [2025-03-04 02:34:57,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 02:34:57,009 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 8 states have internal predecessors, (60), 6 states have call successors, (25), 3 states have call predecessors, (25), 2 states have return successors, (23), 6 states have call predecessors, (23), 5 states have call successors, (23) Word has length 144 [2025-03-04 02:34:57,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 02:34:57,011 INFO L225 Difference]: With dead ends: 378 [2025-03-04 02:34:57,011 INFO L226 Difference]: Without dead ends: 182 [2025-03-04 02:34:57,012 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=82, Invalid=518, Unknown=0, NotChecked=0, Total=600 [2025-03-04 02:34:57,013 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 251 mSDsluCounter, 939 mSDsCounter, 0 mSdLazyCounter, 369 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 1108 SdHoareTripleChecker+Invalid, 457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2025-03-04 02:34:57,013 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 1108 Invalid, 457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 369 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2025-03-04 02:34:57,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2025-03-04 02:34:57,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2025-03-04 02:34:57,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 105 states have (on average 1.1238095238095238) internal successors, (118), 106 states have internal predecessors, (118), 60 states have call successors, (60), 16 states have call predecessors, (60), 16 states have return successors, (59), 59 states have call predecessors, (59), 58 states have call successors, (59) [2025-03-04 02:34:57,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 237 transitions. [2025-03-04 02:34:57,028 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 237 transitions. Word has length 144 [2025-03-04 02:34:57,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 02:34:57,028 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 237 transitions. [2025-03-04 02:34:57,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 8 states have internal predecessors, (60), 6 states have call successors, (25), 3 states have call predecessors, (25), 2 states have return successors, (23), 6 states have call predecessors, (23), 5 states have call successors, (23) [2025-03-04 02:34:57,029 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 237 transitions. [2025-03-04 02:34:57,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-04 02:34:57,031 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:34:57,031 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 6, 6, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:34:57,051 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:34:57,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:34:57,232 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:34:57,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:34:57,233 INFO L85 PathProgramCache]: Analyzing trace with hash -410359903, now seen corresponding path program 1 times [2025-03-04 02:34:57,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:34:57,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337646500] [2025-03-04 02:34:57,233 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:34:57,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:35:00,731 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-04 02:35:00,873 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-04 02:35:00,874 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:35:00,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:35:02,656 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 35 proven. 4 refuted. 0 times theorem prover too weak. 203 trivial. 0 not checked. [2025-03-04 02:35:02,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:35:02,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337646500] [2025-03-04 02:35:02,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337646500] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:35:02,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [900053176] [2025-03-04 02:35:02,657 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:35:02,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:35:02,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:35:02,659 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:35:02,660 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:35:07,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-04 02:35:07,462 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-04 02:35:07,462 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:35:07,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:35:07,482 INFO L256 TraceCheckSpWp]: Trace formula consists of 4291 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-04 02:35:07,487 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:35:07,868 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2025-03-04 02:35:07,868 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 02:35:07,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [900053176] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:35:07,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 02:35:07,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 8 [2025-03-04 02:35:07,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074366049] [2025-03-04 02:35:07,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:35:07,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 02:35:07,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:35:07,869 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 02:35:07,869 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-04 02:35:07,869 INFO L87 Difference]: Start difference. First operand 182 states and 237 transitions. Second operand has 6 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 3 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) [2025-03-04 02:35:08,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 02:35:08,362 INFO L93 Difference]: Finished difference Result 190 states and 243 transitions. [2025-03-04 02:35:08,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 02:35:08,362 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 3 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) Word has length 143 [2025-03-04 02:35:08,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 02:35:08,363 INFO L225 Difference]: With dead ends: 190 [2025-03-04 02:35:08,363 INFO L226 Difference]: Without dead ends: 0 [2025-03-04 02:35:08,363 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-04 02:35:08,364 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 0 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 02:35:08,364 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 379 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 02:35:08,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-04 02:35:08,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-04 02:35:08,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:35:08,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-04 02:35:08,365 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 143 [2025-03-04 02:35:08,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 02:35:08,365 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 02:35:08,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 3 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) [2025-03-04 02:35:08,365 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-04 02:35:08,365 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-04 02:35:08,369 INFO L782 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-04 02:35:08,387 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:35:08,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:35:08,572 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-03-04 02:35:08,573 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-04 02:35:13,065 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 02:35:13,073 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 02:35:13 BoogieIcfgContainer [2025-03-04 02:35:13,073 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 02:35:13,073 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 02:35:13,073 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 02:35:13,073 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 02:35:13,074 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:34:10" (3/4) ... [2025-03-04 02:35:13,075 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-04 02:35:13,080 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure can_fail_malloc [2025-03-04 02:35:13,080 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure bounded_malloc [2025-03-04 02:35:13,081 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure ensure_array_list_has_allocated_data_member [2025-03-04 02:35:13,081 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure aws_array_list_is_bounded [2025-03-04 02:35:13,081 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure aws_array_list_is_valid [2025-03-04 02:35:13,081 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure nondet_bool [2025-03-04 02:35:13,081 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2025-03-04 02:35:13,082 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure aws_raise_error [2025-03-04 02:35:13,082 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure my_memcpy [2025-03-04 02:35:13,082 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure can_fail_allocator [2025-03-04 02:35:13,082 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure __CPROVER_overflow_mult [2025-03-04 02:35:13,082 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure assert_byte_from_buffer_matches [2025-03-04 02:35:13,082 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure nondet_size_t [2025-03-04 02:35:13,082 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure aws_mul_size_checked [2025-03-04 02:35:13,082 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure memcpy_impl [2025-03-04 02:35:13,082 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure aws_array_list_length [2025-03-04 02:35:13,082 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2025-03-04 02:35:13,097 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 137 nodes and edges [2025-03-04 02:35:13,100 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 63 nodes and edges [2025-03-04 02:35:13,101 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 25 nodes and edges [2025-03-04 02:35:13,102 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2025-03-04 02:35:13,102 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2025-03-04 02:35:13,103 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-04 02:35:13,103 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-03-04 02:35:13,104 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-04 02:35:13,502 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 02:35:13,503 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-04 02:35:13,503 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 02:35:13,504 INFO L158 Benchmark]: Toolchain (without parser) took 70642.49ms. Allocated memory was 142.6MB in the beginning and 2.8GB in the end (delta: 2.6GB). Free memory was 100.2MB in the beginning and 2.4GB in the end (delta: -2.3GB). Peak memory consumption was 344.5MB. Max. memory is 16.1GB. [2025-03-04 02:35:13,504 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 126.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 02:35:13,504 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1495.94ms. Allocated memory is still 142.6MB. Free memory was 100.2MB in the beginning and 65.6MB in the end (delta: 34.6MB). Peak memory consumption was 97.9MB. Max. memory is 16.1GB. [2025-03-04 02:35:13,504 INFO L158 Benchmark]: Boogie Procedure Inliner took 97.80ms. Allocated memory is still 142.6MB. Free memory was 65.6MB in the beginning and 57.2MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 02:35:13,505 INFO L158 Benchmark]: Boogie Preprocessor took 119.62ms. Allocated memory is still 142.6MB. Free memory was 57.2MB in the beginning and 42.1MB in the end (delta: 15.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 02:35:13,505 INFO L158 Benchmark]: IcfgBuilder took 5773.03ms. Allocated memory was 142.6MB in the beginning and 335.5MB in the end (delta: 192.9MB). Free memory was 42.1MB in the beginning and 113.4MB in the end (delta: -71.3MB). Peak memory consumption was 129.8MB. Max. memory is 16.1GB. [2025-03-04 02:35:13,505 INFO L158 Benchmark]: TraceAbstraction took 62719.38ms. Allocated memory was 335.5MB in the beginning and 2.8GB in the end (delta: 2.4GB). Free memory was 113.4MB in the beginning and 2.5GB in the end (delta: -2.4GB). Peak memory consumption was 29.1MB. Max. memory is 16.1GB. [2025-03-04 02:35:13,505 INFO L158 Benchmark]: Witness Printer took 429.92ms. Allocated memory is still 2.8GB. Free memory was 2.5GB in the beginning and 2.4GB in the end (delta: 133.9MB). Peak memory consumption was 134.2MB. Max. memory is 16.1GB. [2025-03-04 02:35:13,506 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 126.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1495.94ms. Allocated memory is still 142.6MB. Free memory was 100.2MB in the beginning and 65.6MB in the end (delta: 34.6MB). Peak memory consumption was 97.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 97.80ms. Allocated memory is still 142.6MB. Free memory was 65.6MB in the beginning and 57.2MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 119.62ms. Allocated memory is still 142.6MB. Free memory was 57.2MB in the beginning and 42.1MB in the end (delta: 15.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * IcfgBuilder took 5773.03ms. Allocated memory was 142.6MB in the beginning and 335.5MB in the end (delta: 192.9MB). Free memory was 42.1MB in the beginning and 113.4MB in the end (delta: -71.3MB). Peak memory consumption was 129.8MB. Max. memory is 16.1GB. * TraceAbstraction took 62719.38ms. Allocated memory was 335.5MB in the beginning and 2.8GB in the end (delta: 2.4GB). Free memory was 113.4MB in the beginning and 2.5GB in the end (delta: -2.4GB). Peak memory consumption was 29.1MB. Max. memory is 16.1GB. * Witness Printer took 429.92ms. Allocated memory is still 2.8GB. Free memory was 2.5GB in the beginning and 2.4GB in the end (delta: 133.9MB). Peak memory consumption was 134.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 7735]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" : : "r"(pBuf) : "memory"); [7735-7746] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 223]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 18 procedures, 186 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 58.2s, OverallIterations: 6, TraceHistogramMax: 10, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 7.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 289 SdHoareTripleChecker+Valid, 5.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 274 mSDsluCounter, 5829 SdHoareTripleChecker+Invalid, 5.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4649 mSDsCounter, 94 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 532 IncrementalHoareTripleChecker+Invalid, 626 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 94 mSolverCounterUnsat, 1180 mSDtfsCounter, 532 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 464 GetRequests, 417 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 5.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=204occurred in iteration=4, InterpolantAutomatonStates: 41, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 24 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 2.2s SatisfiabilityAnalysisTime, 13.4s InterpolantComputationTime, 1219 NumberOfCodeBlocks, 1219 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 1210 ConstructedInterpolants, 0 QuantifiedInterpolants, 1639 SizeOfPredicates, 4 NumberOfNonLiveVariables, 12922 ConjunctsInSsa, 24 ConjunctsInUnsatCore, 9 InterpolantComputations, 6 PerfectInterpolantSequences, 1990/2024 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 7349]: Location Invariant Derived location invariant: 0 RESULT: Ultimate proved your program to be correct! [2025-03-04 02:35:13,600 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE