./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_string_bytes_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/aws-c-common/aws_string_bytes_harness.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 3a8d46e4c372901c9f89e699afc459289c693eafeb857e561ae47d4325b43f1e --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 03:05:56,084 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 03:05:56,139 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-04 03:05:56,143 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 03:05:56,143 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 03:05:56,163 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 03:05:56,165 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 03:05:56,165 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 03:05:56,165 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 03:05:56,165 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 03:05:56,165 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 03:05:56,166 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 03:05:56,166 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 03:05:56,166 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 03:05:56,166 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 03:05:56,166 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 03:05:56,166 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 03:05:56,166 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 03:05:56,166 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 03:05:56,166 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 03:05:56,166 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 03:05:56,166 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 03:05:56,166 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 03:05:56,166 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 03:05:56,166 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 03:05:56,166 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 03:05:56,166 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 03:05:56,166 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 03:05:56,167 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 03:05:56,167 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 03:05:56,167 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 03:05:56,167 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 03:05:56,167 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 03:05:56,167 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 03:05:56,167 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 03:05:56,167 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 03:05:56,167 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 03:05:56,167 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 03:05:56,167 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 03:05:56,167 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 03:05:56,167 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 -> 3a8d46e4c372901c9f89e699afc459289c693eafeb857e561ae47d4325b43f1e [2025-03-04 03:05:56,371 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 03:05:56,376 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 03:05:56,377 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 03:05:56,378 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 03:05:56,378 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 03:05:56,380 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/aws-c-common/aws_string_bytes_harness.i [2025-03-04 03:05:57,523 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/11acc8899/07d76c594a1e4f169dd178a890202e4d/FLAG56d750e4e [2025-03-04 03:05:57,963 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 03:05:57,963 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_string_bytes_harness.i [2025-03-04 03:05:57,989 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/11acc8899/07d76c594a1e4f169dd178a890202e4d/FLAG56d750e4e [2025-03-04 03:05:58,088 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/11acc8899/07d76c594a1e4f169dd178a890202e4d [2025-03-04 03:05:58,091 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 03:05:58,092 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 03:05:58,093 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 03:05:58,093 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 03:05:58,096 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 03:05:58,097 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:05:58" (1/1) ... [2025-03-04 03:05:58,097 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58508e9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:05:58, skipping insertion in model container [2025-03-04 03:05:58,097 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:05:58" (1/1) ... [2025-03-04 03:05:58,143 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 03:05:58,328 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_string_bytes_harness.i[4490,4503] [2025-03-04 03:05:58,334 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_string_bytes_harness.i[4550,4563] [2025-03-04 03:05:58,741 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 03:05:58,742 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 03:05:58,742 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 03:05:58,742 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 03:05:58,743 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 03:05:58,760 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 03:05:58,760 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 03:05:58,761 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 03:05:58,761 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 03:05:58,762 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 03:05:58,765 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 03:05:58,766 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 03:05:58,766 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 03:05:59,052 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_string_bytes_harness.i[147449,147462] [2025-03-04 03:05:59,053 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 03:05:59,066 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 03:05:59,076 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_string_bytes_harness.i[4490,4503] [2025-03-04 03:05:59,079 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_string_bytes_harness.i[4550,4563] [2025-03-04 03:05:59,113 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 03:05:59,114 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 03:05:59,114 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 03:05:59,114 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 03:05:59,115 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 03:05:59,120 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 03:05:59,121 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 03:05:59,121 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 03:05:59,122 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 03:05:59,122 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 03:05:59,123 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 03:05:59,123 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 03:05:59,123 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 03:05:59,192 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_string_bytes_harness.i[147449,147462] [2025-03-04 03:05:59,194 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 03:05:59,316 INFO L204 MainTranslator]: Completed translation [2025-03-04 03:05:59,316 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:05:59 WrapperNode [2025-03-04 03:05:59,316 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 03:05:59,317 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 03:05:59,317 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 03:05:59,317 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 03:05:59,321 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:05:59" (1/1) ... [2025-03-04 03:05:59,351 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:05:59" (1/1) ... [2025-03-04 03:05:59,369 INFO L138 Inliner]: procedures = 668, calls = 972, calls flagged for inlining = 46, calls inlined = 6, statements flattened = 61 [2025-03-04 03:05:59,370 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 03:05:59,370 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 03:05:59,370 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 03:05:59,370 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 03:05:59,376 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:05:59" (1/1) ... [2025-03-04 03:05:59,376 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:05:59" (1/1) ... [2025-03-04 03:05:59,378 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:05:59" (1/1) ... [2025-03-04 03:05:59,389 INFO L175 MemorySlicer]: Split 13 memory accesses to 3 slices as follows [2, 6, 5]. 46 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 0, 5]. The 3 writes are split as follows [0, 3, 0]. [2025-03-04 03:05:59,389 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:05:59" (1/1) ... [2025-03-04 03:05:59,389 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:05:59" (1/1) ... [2025-03-04 03:05:59,396 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:05:59" (1/1) ... [2025-03-04 03:05:59,396 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:05:59" (1/1) ... [2025-03-04 03:05:59,398 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:05:59" (1/1) ... [2025-03-04 03:05:59,399 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:05:59" (1/1) ... [2025-03-04 03:05:59,401 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 03:05:59,402 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 03:05:59,402 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 03:05:59,402 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 03:05:59,402 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:05:59" (1/1) ... [2025-03-04 03:05:59,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 03:05:59,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 03:05:59,428 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 03:05:59,429 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 03:05:59,444 INFO L130 BoogieDeclarations]: Found specification of procedure aws_string_is_valid [2025-03-04 03:05:59,444 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_string_is_valid [2025-03-04 03:05:59,444 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2025-03-04 03:05:59,444 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2025-03-04 03:05:59,444 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 03:05:59,444 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 03:05:59,444 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 03:05:59,445 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-04 03:05:59,445 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-04 03:05:59,445 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 03:05:59,445 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 03:05:59,445 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-04 03:05:59,445 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-04 03:05:59,445 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-04 03:05:59,445 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 03:05:59,445 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 03:05:59,445 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2025-03-04 03:05:59,445 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2025-03-04 03:05:59,445 INFO L130 BoogieDeclarations]: Found specification of procedure aws_string_bytes [2025-03-04 03:05:59,445 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_string_bytes [2025-03-04 03:05:59,445 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 03:05:59,445 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 03:05:59,445 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-04 03:05:59,446 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-04 03:05:59,446 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-04 03:05:59,446 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_allocator [2025-03-04 03:05:59,446 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_allocator [2025-03-04 03:05:59,446 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2025-03-04 03:05:59,446 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2025-03-04 03:05:59,446 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 03:05:59,446 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 03:05:59,446 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 03:05:59,446 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 03:05:59,446 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 03:05:59,446 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 03:05:59,595 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 03:05:59,596 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 03:05:59,626 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6945: havoc #t~malloc583.base, #t~malloc583.offset; [2025-03-04 03:05:59,635 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L261: havoc #t~nondet4; [2025-03-04 03:05:59,653 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6305: havoc #t~mem498;havoc #t~short499;havoc #t~mem500;havoc #t~mem501;havoc #t~short502; [2025-03-04 03:05:59,656 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L266: havoc #t~nondet9; [2025-03-04 03:05:59,697 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6862: havoc ensure_string_is_allocated_bounded_length_#t~ret569#1.base, ensure_string_is_allocated_bounded_length_#t~ret569#1.offset; [2025-03-04 03:05:59,697 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6854: havoc ensure_string_is_allocated_nondet_length_#t~ret567#1.base, ensure_string_is_allocated_nondet_length_#t~ret567#1.offset; [2025-03-04 03:05:59,720 INFO L? ?]: Removed 30 outVars from TransFormulas that were not future-live. [2025-03-04 03:05:59,721 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 03:05:59,726 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 03:05:59,727 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 03:05:59,727 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:05:59 BoogieIcfgContainer [2025-03-04 03:05:59,727 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 03:05:59,730 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 03:05:59,730 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 03:05:59,750 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 03:05:59,751 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 03:05:58" (1/3) ... [2025-03-04 03:05:59,751 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75c675ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:05:59, skipping insertion in model container [2025-03-04 03:05:59,752 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:05:59" (2/3) ... [2025-03-04 03:05:59,752 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75c675ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:05:59, skipping insertion in model container [2025-03-04 03:05:59,752 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:05:59" (3/3) ... [2025-03-04 03:05:59,753 INFO L128 eAbstractionObserver]: Analyzing ICFG aws_string_bytes_harness.i [2025-03-04 03:05:59,762 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 03:05:59,763 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG aws_string_bytes_harness.i that has 9 procedures, 63 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-03-04 03:05:59,797 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 03:05:59,805 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;@2218e604, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 03:05:59,806 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 03:05:59,808 INFO L276 IsEmpty]: Start isEmpty. Operand has 63 states, 41 states have (on average 1.146341463414634) internal successors, (47), 42 states have internal predecessors, (47), 12 states have call successors, (12), 8 states have call predecessors, (12), 8 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-04 03:05:59,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-04 03:05:59,812 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:05:59,813 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-04 03:05:59,813 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:05:59,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:05:59,816 INFO L85 PathProgramCache]: Analyzing trace with hash 1798088701, now seen corresponding path program 1 times [2025-03-04 03:05:59,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:05:59,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439727146] [2025-03-04 03:05:59,821 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:05:59,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:05:59,917 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-04 03:05:59,937 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-04 03:05:59,938 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:05:59,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:06:00,075 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 03:06:00,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:06:00,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439727146] [2025-03-04 03:06:00,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439727146] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 03:06:00,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2127908894] [2025-03-04 03:06:00,076 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:06:00,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 03:06:00,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 03:06:00,079 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 03:06:00,080 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 03:06:00,175 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-04 03:06:00,215 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-04 03:06:00,216 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:06:00,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:06:00,218 INFO L256 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 03:06:00,221 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 03:06:00,230 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 03:06:00,231 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 03:06:00,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2127908894] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:06:00,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 03:06:00,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 03:06:00,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071048676] [2025-03-04 03:06:00,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:06:00,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 03:06:00,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:06:00,249 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 03:06:00,250 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 03:06:00,251 INFO L87 Difference]: Start difference. First operand has 63 states, 41 states have (on average 1.146341463414634) internal successors, (47), 42 states have internal predecessors, (47), 12 states have call successors, (12), 8 states have call predecessors, (12), 8 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-04 03:06:00,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:06:00,268 INFO L93 Difference]: Finished difference Result 118 states and 140 transitions. [2025-03-04 03:06:00,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 03:06:00,271 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 55 [2025-03-04 03:06:00,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:06:00,274 INFO L225 Difference]: With dead ends: 118 [2025-03-04 03:06:00,274 INFO L226 Difference]: Without dead ends: 58 [2025-03-04 03:06:00,276 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 56 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 03:06:00,278 INFO L435 NwaCegarLoop]: 69 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, 69 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 03:06:00,278 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 03:06:00,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2025-03-04 03:06:00,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2025-03-04 03:06:00,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 37 states have (on average 1.1081081081081081) internal successors, (41), 38 states have internal predecessors, (41), 12 states have call successors, (12), 8 states have call predecessors, (12), 8 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-04 03:06:00,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 64 transitions. [2025-03-04 03:06:00,299 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 64 transitions. Word has length 55 [2025-03-04 03:06:00,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:06:00,300 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 64 transitions. [2025-03-04 03:06:00,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-04 03:06:00,300 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 64 transitions. [2025-03-04 03:06:00,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-04 03:06:00,301 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:06:00,301 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-04 03:06:00,308 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 03:06:00,502 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 03:06:00,502 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:06:00,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:06:00,503 INFO L85 PathProgramCache]: Analyzing trace with hash 2051031898, now seen corresponding path program 1 times [2025-03-04 03:06:00,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:06:00,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554748209] [2025-03-04 03:06:00,503 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:06:00,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:06:00,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-04 03:06:00,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-04 03:06:00,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:06:00,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:06:01,275 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 03:06:01,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:06:01,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554748209] [2025-03-04 03:06:01,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554748209] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:06:01,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 03:06:01,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-04 03:06:01,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810016244] [2025-03-04 03:06:01,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:06:01,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 03:06:01,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:06:01,277 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 03:06:01,278 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2025-03-04 03:06:01,279 INFO L87 Difference]: Start difference. First operand 58 states and 64 transitions. Second operand has 14 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 11 states have internal predecessors, (32), 5 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2025-03-04 03:06:01,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:06:01,403 INFO L93 Difference]: Finished difference Result 64 states and 69 transitions. [2025-03-04 03:06:01,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 03:06:01,404 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 11 states have internal predecessors, (32), 5 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Word has length 55 [2025-03-04 03:06:01,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:06:01,405 INFO L225 Difference]: With dead ends: 64 [2025-03-04 03:06:01,405 INFO L226 Difference]: Without dead ends: 60 [2025-03-04 03:06:01,405 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2025-03-04 03:06:01,406 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 6 mSDsluCounter, 618 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 672 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 03:06:01,406 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 672 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 03:06:01,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2025-03-04 03:06:01,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2025-03-04 03:06:01,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 39 states have (on average 1.0769230769230769) internal successors, (42), 39 states have internal predecessors, (42), 12 states have call successors, (12), 9 states have call predecessors, (12), 8 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-04 03:06:01,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 65 transitions. [2025-03-04 03:06:01,411 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 65 transitions. Word has length 55 [2025-03-04 03:06:01,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:06:01,412 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 65 transitions. [2025-03-04 03:06:01,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 11 states have internal predecessors, (32), 5 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2025-03-04 03:06:01,412 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 65 transitions. [2025-03-04 03:06:01,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-04 03:06:01,413 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:06:01,413 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 03:06:01,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 03:06:01,414 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:06:01,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:06:01,414 INFO L85 PathProgramCache]: Analyzing trace with hash 1423287623, now seen corresponding path program 1 times [2025-03-04 03:06:01,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:06:01,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542812785] [2025-03-04 03:06:01,414 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:06:01,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:06:01,431 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-04 03:06:01,566 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-04 03:06:01,566 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:06:01,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:06:03,836 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-04 03:06:03,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:06:03,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542812785] [2025-03-04 03:06:03,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542812785] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 03:06:03,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2039794697] [2025-03-04 03:06:03,841 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:06:03,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 03:06:03,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 03:06:03,842 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 03:06:03,843 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 03:06:03,930 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-04 03:06:03,974 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-04 03:06:03,975 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:06:03,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:06:03,978 INFO L256 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 97 conjuncts are in the unsatisfiable core [2025-03-04 03:06:03,985 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 03:06:04,159 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 53 [2025-03-04 03:06:04,190 INFO L349 Elim1Store]: treesize reduction 36, result has 39.0 percent of original size [2025-03-04 03:06:04,190 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 53 treesize of output 92 [2025-03-04 03:06:04,264 INFO L349 Elim1Store]: treesize reduction 87, result has 1.1 percent of original size [2025-03-04 03:06:04,264 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 105 treesize of output 52 [2025-03-04 03:07:33,082 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 03:07:33,083 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 563 treesize of output 547 [2025-03-04 03:07:33,283 INFO L349 Elim1Store]: treesize reduction 64, result has 28.1 percent of original size [2025-03-04 03:07:33,283 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 9 new quantified variables, introduced 10 case distinctions, treesize of input 233 treesize of output 178 [2025-03-04 03:07:33,476 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 15 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 03:07:33,476 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 03:07:35,140 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 47 [2025-03-04 03:07:35,161 INFO L349 Elim1Store]: treesize reduction 26, result has 56.7 percent of original size [2025-03-04 03:07:35,161 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 47 treesize of output 98 [2025-03-04 03:07:35,436 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-04 03:07:35,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2039794697] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 03:07:35,436 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 03:07:35,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 27, 20] total 60 [2025-03-04 03:07:35,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780124293] [2025-03-04 03:07:35,436 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 03:07:35,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2025-03-04 03:07:35,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:07:35,438 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2025-03-04 03:07:35,439 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=3318, Unknown=10, NotChecked=0, Total=3540 [2025-03-04 03:07:35,439 INFO L87 Difference]: Start difference. First operand 60 states and 65 transitions. Second operand has 60 states, 53 states have (on average 1.9811320754716981) internal successors, (105), 48 states have internal predecessors, (105), 18 states have call successors, (29), 5 states have call predecessors, (29), 12 states have return successors, (27), 20 states have call predecessors, (27), 15 states have call successors, (27)