./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_string_eq_c_str_harness_negated.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/aws-c-common/aws_string_eq_c_str_harness_negated.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash f3174b0caf7483d7aa96d2ace1d661f4c70bbed9301f1108659fc7d611ebd9af --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 02:01:35,369 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 02:01:35,430 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-02-08 02:01:35,437 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 02:01:35,439 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 02:01:35,459 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 02:01:35,459 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 02:01:35,459 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 02:01:35,460 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 02:01:35,460 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 02:01:35,460 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 02:01:35,460 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 02:01:35,460 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 02:01:35,460 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 02:01:35,461 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 02:01:35,461 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 02:01:35,461 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 02:01:35,461 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 02:01:35,461 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 02:01:35,462 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 02:01:35,462 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 02:01:35,462 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 02:01:35,462 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 02:01:35,462 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 02:01:35,462 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 02:01:35,462 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 02:01:35,462 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 02:01:35,462 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 02:01:35,462 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 02:01:35,463 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 02:01:35,463 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 02:01:35,463 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 02:01:35,463 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 02:01:35,463 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 02:01:35,463 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 02:01:35,463 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 02:01:35,463 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 02:01:35,464 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 02:01:35,464 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 02:01:35,464 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 02:01:35,464 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f3174b0caf7483d7aa96d2ace1d661f4c70bbed9301f1108659fc7d611ebd9af [2025-02-08 02:01:35,673 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 02:01:35,686 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 02:01:35,688 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 02:01:35,689 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 02:01:35,689 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 02:01:35,690 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/aws-c-common/aws_string_eq_c_str_harness_negated.i [2025-02-08 02:01:36,852 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/02fa22f5d/feb69fe6d76f44beba343d6a0b6d478a/FLAG42ae77fe6 [2025-02-08 02:01:37,434 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 02:01:37,436 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_string_eq_c_str_harness_negated.i [2025-02-08 02:01:37,472 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/02fa22f5d/feb69fe6d76f44beba343d6a0b6d478a/FLAG42ae77fe6 [2025-02-08 02:01:37,487 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/02fa22f5d/feb69fe6d76f44beba343d6a0b6d478a [2025-02-08 02:01:37,489 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 02:01:37,490 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 02:01:37,491 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 02:01:37,492 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 02:01:37,495 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 02:01:37,495 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 02:01:37" (1/1) ... [2025-02-08 02:01:37,498 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3fce8ea6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:01:37, skipping insertion in model container [2025-02-08 02:01:37,498 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 02:01:37" (1/1) ... [2025-02-08 02:01:37,579 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 02:01:37,713 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_string_eq_c_str_harness_negated.i[4493,4506] [2025-02-08 02:01:37,718 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_string_eq_c_str_harness_negated.i[4553,4566] [2025-02-08 02:01:38,144 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 02:01:38,146 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 02:01:38,146 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 02:01:38,151 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 02:01:38,152 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 02:01:38,164 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 02:01:38,165 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 02:01:38,166 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 02:01:38,166 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 02:01:38,576 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 02:01:38,577 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 02:01:38,607 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 02:01:38,696 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 02:01:38,709 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_string_eq_c_str_harness_negated.i[4493,4506] [2025-02-08 02:01:38,709 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_string_eq_c_str_harness_negated.i[4553,4566] [2025-02-08 02:01:38,748 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 02:01:38,748 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 02:01:38,748 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 02:01:38,749 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 02:01:38,749 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 02:01:38,754 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 02:01:38,757 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 02:01:38,759 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 02:01:38,759 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 02:01:38,856 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" : "+r"(index)); [8556] [2025-02-08 02:01:38,857 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 02:01:38,857 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 02:01:38,867 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 02:01:39,007 INFO L204 MainTranslator]: Completed translation [2025-02-08 02:01:39,007 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:01:39 WrapperNode [2025-02-08 02:01:39,008 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 02:01:39,008 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 02:01:39,009 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 02:01:39,009 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 02:01:39,013 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:01:39" (1/1) ... [2025-02-08 02:01:39,056 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:01:39" (1/1) ... [2025-02-08 02:01:39,094 INFO L138 Inliner]: procedures = 670, calls = 2270, calls flagged for inlining = 60, calls inlined = 8, statements flattened = 396 [2025-02-08 02:01:39,094 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 02:01:39,095 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 02:01:39,095 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 02:01:39,095 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 02:01:39,101 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:01:39" (1/1) ... [2025-02-08 02:01:39,102 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:01:39" (1/1) ... [2025-02-08 02:01:39,110 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:01:39" (1/1) ... [2025-02-08 02:01:39,135 INFO L175 MemorySlicer]: Split 279 memory accesses to 4 slices as follows [2, 5, 15, 257]. 92 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 5, 0, 0]. The 260 writes are split as follows [0, 0, 3, 257]. [2025-02-08 02:01:39,136 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:01:39" (1/1) ... [2025-02-08 02:01:39,136 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:01:39" (1/1) ... [2025-02-08 02:01:39,149 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:01:39" (1/1) ... [2025-02-08 02:01:39,149 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:01:39" (1/1) ... [2025-02-08 02:01:39,152 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:01:39" (1/1) ... [2025-02-08 02:01:39,157 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:01:39" (1/1) ... [2025-02-08 02:01:39,160 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 02:01:39,160 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 02:01:39,161 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 02:01:39,161 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 02:01:39,161 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:01:39" (1/1) ... [2025-02-08 02:01:39,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 02:01:39,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 02:01:39,190 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 02:01:39,192 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 02:01:39,210 INFO L130 BoogieDeclarations]: Found specification of procedure aws_array_eq_c_str [2025-02-08 02:01:39,210 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_array_eq_c_str [2025-02-08 02:01:39,211 INFO L130 BoogieDeclarations]: Found specification of procedure aws_string_is_valid [2025-02-08 02:01:39,211 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_string_is_valid [2025-02-08 02:01:39,211 INFO L130 BoogieDeclarations]: Found specification of procedure ensure_string_is_allocated_bounded_length [2025-02-08 02:01:39,211 INFO L138 BoogieDeclarations]: Found implementation of procedure ensure_string_is_allocated_bounded_length [2025-02-08 02:01:39,211 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2025-02-08 02:01:39,211 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2025-02-08 02:01:39,211 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-02-08 02:01:39,212 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-02-08 02:01:39,212 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-02-08 02:01:39,212 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-02-08 02:01:39,212 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 02:01:39,212 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 02:01:39,212 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-08 02:01:39,212 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-08 02:01:39,212 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-02-08 02:01:39,213 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-02-08 02:01:39,213 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 02:01:39,213 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 02:01:39,213 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-08 02:01:39,213 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-08 02:01:39,213 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-08 02:01:39,213 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-02-08 02:01:39,213 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 02:01:39,213 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 02:01:39,213 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2025-02-08 02:01:39,213 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2025-02-08 02:01:39,213 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-08 02:01:39,213 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-08 02:01:39,213 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-02-08 02:01:39,213 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-02-08 02:01:39,213 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-02-08 02:01:39,213 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-02-08 02:01:39,213 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_allocator [2025-02-08 02:01:39,213 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_allocator [2025-02-08 02:01:39,213 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2025-02-08 02:01:39,213 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2025-02-08 02:01:39,213 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 02:01:39,213 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 02:01:39,213 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-08 02:01:39,213 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-08 02:01:39,213 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 02:01:39,213 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 02:01:39,213 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-08 02:01:39,213 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-08 02:01:39,441 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 02:01:39,443 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 02:01:39,486 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6875: havoc #t~malloc557.base, #t~malloc557.offset; [2025-02-08 02:01:39,494 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L261: havoc #t~nondet4; [2025-02-08 02:01:39,536 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L8078: havoc #t~mem921; [2025-02-08 02:01:39,556 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6245: havoc #t~mem472;havoc #t~short473;havoc #t~mem474;havoc #t~mem475;havoc #t~short476; [2025-02-08 02:01:39,558 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L266: havoc #t~nondet9; [2025-02-08 02:01:39,588 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6792: havoc #t~ret543#1.base, #t~ret543#1.offset; [2025-02-08 02:01:45,291 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L7096-1: SUMMARY for call assume_abort_if_not((if 0 == (if assert_bytes_match_~i~4#1 % 18446744073709551616 < assert_bytes_match_~len#1 % 18446744073709551616 && assert_bytes_match_~len#1 % 18446744073709551616 < 36028797018963967 then 1 else 0) then 0 else 1)); srcloc: null [2025-02-08 02:01:45,291 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L7096: call assert_bytes_match_#t~mem595#1 := read~int#2(assert_bytes_match_~a#1.base, assert_bytes_match_~a#1.offset + (if assert_bytes_match_~i~4#1 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then assert_bytes_match_~i~4#1 % 18446744073709551616 % 18446744073709551616 else assert_bytes_match_~i~4#1 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), 1);call assert_bytes_match_#t~mem596#1 := read~int#2(assert_bytes_match_~b#1.base, assert_bytes_match_~b#1.offset + (if assert_bytes_match_~i~4#1 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then assert_bytes_match_~i~4#1 % 18446744073709551616 % 18446744073709551616 else assert_bytes_match_~i~4#1 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), 1); [2025-02-08 02:01:45,292 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L8888: havoc aws_string_eq_c_str_harness_#t~ret1317#1;call aws_string_eq_c_str_harness_#t~mem1319#1 := read~int#2(aws_string_eq_c_str_harness_~str~3#1.base, 8 + aws_string_eq_c_str_harness_~str~3#1.offset, 8);aws_string_eq_c_str_harness_#t~ret1320#1 := (if 0 == (if !(aws_string_eq_c_str_harness_#t~mem1319#1 % 18446744073709551616 == aws_string_eq_c_str_harness_#t~nondet1318#1 % 18446744073709551616) then 1 else 0) then 0 else 1); [2025-02-08 02:01:45,292 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L8888-1: SUMMARY for call __VERIFIER_assert((if 0 == (if 0 == aws_string_eq_c_str_harness_#t~ret1317#1 % 256 then 1 else 0) then 0 else 1)); srcloc: null [2025-02-08 02:01:45,292 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L8888-2: aws_string_eq_c_str_harness_#t~ret1317#1 := aws_c_string_is_valid_#res#1;havoc aws_c_string_is_valid_~str#1.base, aws_c_string_is_valid_~str#1.offset;havoc aws_c_string_is_valid_#in~str#1.base, aws_c_string_is_valid_#in~str#1.offset;assume { :end_inline_aws_c_string_is_valid } true; [2025-02-08 02:01:45,292 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L8889: havoc aws_string_eq_c_str_harness_#t~mem1319#1;havoc aws_string_eq_c_str_harness_#t~nondet1318#1;havoc aws_string_eq_c_str_harness_#t~ret1320#1;call aws_string_eq_c_str_harness_#t~mem1321#1 := read~int#2(aws_string_eq_c_str_harness_~str~3#1.base, 8 + aws_string_eq_c_str_harness_~str~3#1.offset, 8);assume { :begin_inline_assert_bytes_match } true;assert_bytes_match_#in~a#1.base, assert_bytes_match_#in~a#1.offset, assert_bytes_match_#in~b#1.base, assert_bytes_match_#in~b#1.offset, assert_bytes_match_#in~len#1 := aws_string_eq_c_str_harness_~str~3#1.base, 16 + aws_string_eq_c_str_harness_~str~3#1.offset, aws_string_eq_c_str_harness_~c_str~0#1.base, aws_string_eq_c_str_harness_~c_str~0#1.offset, aws_string_eq_c_str_harness_#t~mem1321#1;havoc assert_bytes_match_#t~ret594#1, assert_bytes_match_#t~mem595#1, assert_bytes_match_#t~mem596#1, assert_bytes_match_~i~4#1, assert_bytes_match_~a#1.base, assert_bytes_match_~a#1.offset, assert_bytes_match_~b#1.base, assert_bytes_match_~b#1.offset, assert_bytes_match_~len#1;assert_bytes_match_~a#1.base, assert_bytes_match_~a#1.offset := assert_bytes_match_#in~a#1.base, assert_bytes_match_#in~a#1.offset;assert_bytes_match_~b#1.base, assert_bytes_match_~b#1.offset := assert_bytes_match_#in~b#1.base, assert_bytes_match_#in~b#1.offset;assert_bytes_match_~len#1 := assert_bytes_match_#in~len#1; [2025-02-08 02:01:45,292 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L8889-1: SUMMARY for call __VERIFIER_assert(aws_string_eq_c_str_harness_#t~ret1320#1); srcloc: null [2025-02-08 02:01:45,292 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L7089: SUMMARY for call __VERIFIER_assert((if 0 == (if !((if assert_bytes_match_~a#1.base == 0 && assert_bytes_match_~a#1.offset == 0 then 1 else 0) == (if assert_bytes_match_~b#1.base == 0 && assert_bytes_match_~b#1.offset == 0 then 1 else 0)) then 1 else 0) then 0 else 1)); srcloc: null [2025-02-08 02:01:45,292 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L8890: havoc assert_bytes_match_#t~ret594#1, assert_bytes_match_#t~mem595#1, assert_bytes_match_#t~mem596#1, assert_bytes_match_~i~4#1, assert_bytes_match_~a#1.base, assert_bytes_match_~a#1.offset, assert_bytes_match_~b#1.base, assert_bytes_match_~b#1.offset, assert_bytes_match_~len#1;havoc assert_bytes_match_#in~a#1.base, assert_bytes_match_#in~a#1.offset, assert_bytes_match_#in~b#1.base, assert_bytes_match_#in~b#1.offset, assert_bytes_match_#in~len#1;assume { :end_inline_assert_bytes_match } true;havoc aws_string_eq_c_str_harness_#t~mem1321#1; [2025-02-08 02:01:45,292 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L7090: assume (assert_bytes_match_~len#1 % 18446744073709551616 > 0 && (assert_bytes_match_~a#1.base != 0 || assert_bytes_match_~a#1.offset != 0)) && (assert_bytes_match_~b#1.base != 0 || assert_bytes_match_~b#1.offset != 0); [2025-02-08 02:01:45,292 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L7090: assume !((assert_bytes_match_~len#1 % 18446744073709551616 > 0 && (assert_bytes_match_~a#1.base != 0 || assert_bytes_match_~a#1.offset != 0)) && (assert_bytes_match_~b#1.base != 0 || assert_bytes_match_~b#1.offset != 0)); [2025-02-08 02:01:45,293 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L7099-1: SUMMARY for call __VERIFIER_assert((if 0 == (if !((if assert_bytes_match_#t~mem595#1 % 256 % 4294967296 <= 2147483647 then assert_bytes_match_#t~mem595#1 % 256 % 4294967296 else assert_bytes_match_#t~mem595#1 % 256 % 4294967296 - 4294967296) == (if assert_bytes_match_#t~mem596#1 % 256 % 4294967296 <= 2147483647 then assert_bytes_match_#t~mem596#1 % 256 % 4294967296 else assert_bytes_match_#t~mem596#1 % 256 % 4294967296 - 4294967296)) then 1 else 0) then 0 else 1)); srcloc: null [2025-02-08 02:01:45,293 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L7099: havoc assert_bytes_match_~i~4#1;havoc assert_bytes_match_#t~mem595#1;havoc assert_bytes_match_#t~mem596#1; [2025-02-08 02:01:45,293 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L7095-1: SUMMARY for call assert_bytes_match_#t~ret594#1 := nondet_uint64_t(); srcloc: null [2025-02-08 02:01:45,293 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L7095: assert_bytes_match_~i~4#1 := assert_bytes_match_#t~ret594#1;havoc assert_bytes_match_#t~ret594#1; [2025-02-08 02:01:45,293 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L8883-1: aws_string_eq_c_str_harness_#t~ret1313#1.base, aws_string_eq_c_str_harness_#t~ret1313#1.offset := ensure_c_str_is_allocated_#res#1.base, ensure_c_str_is_allocated_#res#1.offset;havoc ensure_c_str_is_allocated_#t~ret548#1, ensure_c_str_is_allocated_#t~ret549#1.base, ensure_c_str_is_allocated_#t~ret549#1.offset, ensure_c_str_is_allocated_#t~mem550#1, ensure_c_str_is_allocated_~max_size#1, ensure_c_str_is_allocated_~cap~0#1, ensure_c_str_is_allocated_~str~1#1.base, ensure_c_str_is_allocated_~str~1#1.offset;havoc ensure_c_str_is_allocated_#in~max_size#1;assume { :end_inline_ensure_c_str_is_allocated } true;aws_string_eq_c_str_harness_#t~ite1314#1.base, aws_string_eq_c_str_harness_#t~ite1314#1.offset := aws_string_eq_c_str_harness_#t~ret1313#1.base, aws_string_eq_c_str_harness_#t~ret1313#1.offset; [2025-02-08 02:01:45,293 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L7566: havoc aws_string_eq_c_str_#t~mem734#1;havoc aws_string_eq_c_str_#t~ret735#1; [2025-02-08 02:01:45,360 INFO L? ?]: Removed 67 outVars from TransFormulas that were not future-live. [2025-02-08 02:01:45,360 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 02:01:45,367 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 02:01:45,367 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 02:01:45,367 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 02:01:45 BoogieIcfgContainer [2025-02-08 02:01:45,367 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 02:01:45,369 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 02:01:45,369 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 02:01:45,372 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 02:01:45,372 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 02:01:37" (1/3) ... [2025-02-08 02:01:45,373 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e51c70d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 02:01:45, skipping insertion in model container [2025-02-08 02:01:45,373 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:01:39" (2/3) ... [2025-02-08 02:01:45,373 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e51c70d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 02:01:45, skipping insertion in model container [2025-02-08 02:01:45,373 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 02:01:45" (3/3) ... [2025-02-08 02:01:45,374 INFO L128 eAbstractionObserver]: Analyzing ICFG aws_string_eq_c_str_harness_negated.i [2025-02-08 02:01:45,384 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 02:01:45,385 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG aws_string_eq_c_str_harness_negated.i that has 10 procedures, 89 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-08 02:01:45,426 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 02:01:45,436 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;@aeba329, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 02:01:45,436 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-08 02:01:45,439 INFO L276 IsEmpty]: Start isEmpty. Operand has 89 states, 56 states have (on average 1.2678571428571428) internal successors, (71), 59 states have internal predecessors, (71), 20 states have call successors, (20), 9 states have call predecessors, (20), 9 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-02-08 02:01:45,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-02-08 02:01:45,446 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 02:01:45,447 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 02:01:45,447 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 02:01:45,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 02:01:45,451 INFO L85 PathProgramCache]: Analyzing trace with hash -339460580, now seen corresponding path program 1 times [2025-02-08 02:01:45,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 02:01:45,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535359518] [2025-02-08 02:01:45,457 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 02:01:45,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 02:02:27,599 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-08 02:02:27,950 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-08 02:02:27,951 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 02:02:27,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 02:02:28,372 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 02:02:28,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 02:02:28,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535359518] [2025-02-08 02:02:28,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535359518] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 02:02:28,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 02:02:28,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 02:02:28,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401763239] [2025-02-08 02:02:28,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 02:02:28,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-08 02:02:28,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 02:02:28,394 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-08 02:02:28,395 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 02:02:28,397 INFO L87 Difference]: Start difference. First operand has 89 states, 56 states have (on average 1.2678571428571428) internal successors, (71), 59 states have internal predecessors, (71), 20 states have call successors, (20), 9 states have call predecessors, (20), 9 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-08 02:02:28,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 02:02:28,419 INFO L93 Difference]: Finished difference Result 170 states and 221 transitions. [2025-02-08 02:02:28,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-08 02:02:28,420 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 35 [2025-02-08 02:02:28,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 02:02:28,426 INFO L225 Difference]: With dead ends: 170 [2025-02-08 02:02:28,427 INFO L226 Difference]: Without dead ends: 74 [2025-02-08 02:02:28,430 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 02:02:28,434 INFO L435 NwaCegarLoop]: 109 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, 109 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 02:02:28,436 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 02:02:28,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2025-02-08 02:02:28,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2025-02-08 02:02:28,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 49 states have (on average 1.2040816326530612) internal successors, (59), 49 states have internal predecessors, (59), 16 states have call successors, (16), 9 states have call predecessors, (16), 8 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-02-08 02:02:28,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 90 transitions. [2025-02-08 02:02:28,475 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 90 transitions. Word has length 35 [2025-02-08 02:02:28,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 02:02:28,477 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 90 transitions. [2025-02-08 02:02:28,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-08 02:02:28,477 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 90 transitions. [2025-02-08 02:02:28,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-02-08 02:02:28,479 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 02:02:28,479 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 02:02:28,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 02:02:28,480 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 02:02:28,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 02:02:28,480 INFO L85 PathProgramCache]: Analyzing trace with hash -1183932451, now seen corresponding path program 1 times [2025-02-08 02:02:28,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 02:02:28,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421610129] [2025-02-08 02:02:28,480 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 02:02:28,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 02:03:11,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-08 02:03:11,207 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-08 02:03:11,207 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 02:03:11,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 02:03:12,216 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 02:03:12,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 02:03:12,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421610129] [2025-02-08 02:03:12,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421610129] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 02:03:12,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 02:03:12,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 02:03:12,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499972504] [2025-02-08 02:03:12,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 02:03:12,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 02:03:12,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 02:03:12,218 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 02:03:12,219 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 02:03:12,219 INFO L87 Difference]: Start difference. First operand 74 states and 90 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-08 02:03:16,285 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 02:03:20,703 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.42s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 02:03:21,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 02:03:21,349 INFO L93 Difference]: Finished difference Result 102 states and 126 transitions. [2025-02-08 02:03:21,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 02:03:21,350 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 35 [2025-02-08 02:03:21,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 02:03:21,351 INFO L225 Difference]: With dead ends: 102 [2025-02-08 02:03:21,352 INFO L226 Difference]: Without dead ends: 74 [2025-02-08 02:03:21,352 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 02:03:21,353 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 6 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.1s IncrementalHoareTripleChecker+Time [2025-02-08 02:03:21,353 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 259 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 2 Unknown, 0 Unchecked, 9.1s Time] [2025-02-08 02:03:21,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2025-02-08 02:03:21,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2025-02-08 02:03:21,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 49 states have (on average 1.183673469387755) internal successors, (58), 49 states have internal predecessors, (58), 16 states have call successors, (16), 9 states have call predecessors, (16), 8 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-02-08 02:03:21,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 89 transitions. [2025-02-08 02:03:21,361 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 89 transitions. Word has length 35 [2025-02-08 02:03:21,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 02:03:21,361 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 89 transitions. [2025-02-08 02:03:21,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-08 02:03:21,361 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 89 transitions. [2025-02-08 02:03:21,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-02-08 02:03:21,362 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 02:03:21,362 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 02:03:21,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 02:03:21,363 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 02:03:21,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 02:03:21,363 INFO L85 PathProgramCache]: Analyzing trace with hash 1146138805, now seen corresponding path program 1 times [2025-02-08 02:03:21,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 02:03:21,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472602032] [2025-02-08 02:03:21,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 02:03:21,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms