./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_byte_cursor_from_string_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version eb692b52 Calling Ultimate with: /usr/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.5.800.v20200727-1323.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_byte_cursor_from_string_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.graphml --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 c3b06783378816ab028e38f9f4609990f4d1028238bbcb0e88638ebb644bb54d --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-19 22:05:26,025 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-19 22:05:26,027 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-19 22:05:26,061 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-19 22:05:26,061 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-19 22:05:26,062 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-19 22:05:26,064 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-19 22:05:26,066 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-19 22:05:26,067 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-19 22:05:26,071 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-19 22:05:26,072 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-19 22:05:26,073 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-19 22:05:26,074 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-19 22:05:26,075 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-19 22:05:26,076 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-19 22:05:26,078 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-19 22:05:26,079 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-19 22:05:26,080 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-19 22:05:26,081 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-19 22:05:26,086 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-19 22:05:26,087 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-19 22:05:26,088 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-19 22:05:26,089 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-19 22:05:26,089 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-19 22:05:26,090 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-19 22:05:26,096 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-19 22:05:26,096 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-19 22:05:26,096 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-19 22:05:26,097 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-19 22:05:26,098 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-19 22:05:26,099 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-19 22:05:26,099 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-19 22:05:26,100 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-19 22:05:26,100 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-19 22:05:26,101 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-19 22:05:26,102 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-19 22:05:26,102 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-19 22:05:26,103 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-19 22:05:26,103 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-19 22:05:26,103 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-19 22:05:26,104 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-19 22:05:26,105 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-19 22:05:26,106 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-19 22:05:26,131 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-19 22:05:26,131 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-19 22:05:26,132 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-19 22:05:26,132 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-19 22:05:26,132 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-19 22:05:26,133 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-19 22:05:26,133 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-19 22:05:26,133 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-19 22:05:26,133 INFO L138 SettingsManager]: * Use SBE=true [2022-07-19 22:05:26,134 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-19 22:05:26,134 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-19 22:05:26,134 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-19 22:05:26,134 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-19 22:05:26,135 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-19 22:05:26,135 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-19 22:05:26,135 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-19 22:05:26,135 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-19 22:05:26,135 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-19 22:05:26,135 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-19 22:05:26,136 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-19 22:05:26,137 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-19 22:05:26,137 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 22:05:26,137 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-19 22:05:26,137 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-19 22:05:26,137 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-19 22:05:26,137 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-19 22:05:26,138 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-19 22:05:26,138 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-19 22:05:26,138 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-19 22:05:26,138 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-19 22:05:26,138 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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.graphml 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 -> c3b06783378816ab028e38f9f4609990f4d1028238bbcb0e88638ebb644bb54d [2022-07-19 22:05:26,327 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-19 22:05:26,361 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-19 22:05:26,363 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-19 22:05:26,364 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-19 22:05:26,364 INFO L275 PluginConnector]: CDTParser initialized [2022-07-19 22:05:26,365 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/aws-c-common/aws_byte_cursor_from_string_harness.i [2022-07-19 22:05:26,408 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e33571420/6931f312a14b4250a6769582dae4ffa1/FLAG57ebb70dc [2022-07-19 22:05:26,916 INFO L306 CDTParser]: Found 1 translation units. [2022-07-19 22:05:26,916 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_cursor_from_string_harness.i [2022-07-19 22:05:26,952 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e33571420/6931f312a14b4250a6769582dae4ffa1/FLAG57ebb70dc [2022-07-19 22:05:27,166 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e33571420/6931f312a14b4250a6769582dae4ffa1 [2022-07-19 22:05:27,168 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-19 22:05:27,169 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-19 22:05:27,172 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-19 22:05:27,172 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-19 22:05:27,174 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-19 22:05:27,175 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 10:05:27" (1/1) ... [2022-07-19 22:05:27,176 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16bf29b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:05:27, skipping insertion in model container [2022-07-19 22:05:27,176 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 10:05:27" (1/1) ... [2022-07-19 22:05:27,192 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-19 22:05:27,262 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-19 22:05:27,448 WARN L230 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_byte_cursor_from_string_harness.i[4501,4514] [2022-07-19 22:05:27,453 WARN L230 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_byte_cursor_from_string_harness.i[4561,4574] [2022-07-19 22:05:27,976 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:05:27,977 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:05:27,978 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:05:27,980 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:05:27,981 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:05:27,988 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:05:27,990 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:05:27,992 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:05:27,993 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:05:28,226 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-07-19 22:05:28,227 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-07-19 22:05:28,235 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-07-19 22:05:28,237 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-07-19 22:05:28,238 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-07-19 22:05:28,238 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-07-19 22:05:28,239 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-07-19 22:05:28,241 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-07-19 22:05:28,241 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-07-19 22:05:28,241 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-07-19 22:05:28,360 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-07-19 22:05:28,430 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:05:28,431 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:05:28,524 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 22:05:28,570 INFO L203 MainTranslator]: Completed pre-run [2022-07-19 22:05:28,589 WARN L230 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_byte_cursor_from_string_harness.i[4501,4514] [2022-07-19 22:05:28,590 WARN L230 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_byte_cursor_from_string_harness.i[4561,4574] [2022-07-19 22:05:28,616 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:05:28,617 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:05:28,617 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:05:28,618 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:05:28,618 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:05:28,621 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:05:28,622 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:05:28,623 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:05:28,623 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:05:28,650 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-07-19 22:05:28,651 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-07-19 22:05:28,651 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-07-19 22:05:28,651 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-07-19 22:05:28,652 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-07-19 22:05:28,652 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-07-19 22:05:28,652 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-07-19 22:05:28,653 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-07-19 22:05:28,653 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-07-19 22:05:28,653 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-07-19 22:05:28,666 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-07-19 22:05:28,761 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:05:28,762 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:05:28,802 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 22:05:28,958 INFO L208 MainTranslator]: Completed translation [2022-07-19 22:05:28,959 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:05:28 WrapperNode [2022-07-19 22:05:28,959 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-19 22:05:28,960 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-19 22:05:28,960 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-19 22:05:28,960 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-19 22:05:28,966 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:05:28" (1/1) ... [2022-07-19 22:05:29,050 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:05:28" (1/1) ... [2022-07-19 22:05:29,126 INFO L137 Inliner]: procedures = 693, calls = 2785, calls flagged for inlining = 59, calls inlined = 7, statements flattened = 833 [2022-07-19 22:05:29,126 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-19 22:05:29,127 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-19 22:05:29,127 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-19 22:05:29,127 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-19 22:05:29,133 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:05:28" (1/1) ... [2022-07-19 22:05:29,133 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:05:28" (1/1) ... [2022-07-19 22:05:29,141 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:05:28" (1/1) ... [2022-07-19 22:05:29,141 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:05:28" (1/1) ... [2022-07-19 22:05:29,174 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:05:28" (1/1) ... [2022-07-19 22:05:29,184 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:05:28" (1/1) ... [2022-07-19 22:05:29,188 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:05:28" (1/1) ... [2022-07-19 22:05:29,199 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-19 22:05:29,202 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-19 22:05:29,202 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-19 22:05:29,202 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-19 22:05:29,203 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:05:28" (1/1) ... [2022-07-19 22:05:29,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 22:05:29,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 22:05:29,223 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-19 22:05:29,243 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-19 22:05:29,253 INFO L130 BoogieDeclarations]: Found specification of procedure aws_string_is_valid [2022-07-19 22:05:29,254 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_string_is_valid [2022-07-19 22:05:29,254 INFO L130 BoogieDeclarations]: Found specification of procedure aws_byte_cursor_is_valid [2022-07-19 22:05:29,254 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_byte_cursor_is_valid [2022-07-19 22:05:29,254 INFO L130 BoogieDeclarations]: Found specification of procedure ensure_string_is_allocated_bounded_length [2022-07-19 22:05:29,254 INFO L138 BoogieDeclarations]: Found implementation of procedure ensure_string_is_allocated_bounded_length [2022-07-19 22:05:29,254 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-19 22:05:29,254 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2022-07-19 22:05:29,255 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2022-07-19 22:05:29,255 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-19 22:05:29,255 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-07-19 22:05:29,256 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-07-19 22:05:29,256 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-19 22:05:29,256 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-19 22:05:29,256 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-19 22:05:29,257 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-19 22:05:29,257 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-19 22:05:29,257 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2022-07-19 22:05:29,257 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2022-07-19 22:05:29,257 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-07-19 22:05:29,257 INFO L130 BoogieDeclarations]: Found specification of procedure aws_string_bytes [2022-07-19 22:05:29,257 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_string_bytes [2022-07-19 22:05:29,257 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-19 22:05:29,257 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-19 22:05:29,258 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-19 22:05:29,258 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-19 22:05:29,258 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-19 22:05:29,258 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_allocator [2022-07-19 22:05:29,259 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_allocator [2022-07-19 22:05:29,259 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2022-07-19 22:05:29,259 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2022-07-19 22:05:29,259 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-19 22:05:29,259 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-19 22:05:29,477 INFO L234 CfgBuilder]: Building ICFG [2022-07-19 22:05:29,478 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-19 22:05:30,205 INFO L275 CfgBuilder]: Performing block encoding [2022-07-19 22:05:30,211 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-19 22:05:30,211 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-19 22:05:30,213 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 10:05:30 BoogieIcfgContainer [2022-07-19 22:05:30,213 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-19 22:05:30,214 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-19 22:05:30,214 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-19 22:05:30,216 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-19 22:05:30,217 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.07 10:05:27" (1/3) ... [2022-07-19 22:05:30,217 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78af4ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 10:05:30, skipping insertion in model container [2022-07-19 22:05:30,217 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:05:28" (2/3) ... [2022-07-19 22:05:30,218 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78af4ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 10:05:30, skipping insertion in model container [2022-07-19 22:05:30,218 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 10:05:30" (3/3) ... [2022-07-19 22:05:30,219 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_byte_cursor_from_string_harness.i [2022-07-19 22:05:30,228 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-19 22:05:30,229 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-19 22:05:30,261 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-19 22:05:30,265 INFO L357 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, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@655882ee, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@265deffc [2022-07-19 22:05:30,266 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-19 22:05:30,269 INFO L276 IsEmpty]: Start isEmpty. Operand has 104 states, 67 states have (on average 1.1791044776119404) internal successors, (79), 68 states have internal predecessors, (79), 25 states have call successors, (25), 10 states have call predecessors, (25), 10 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2022-07-19 22:05:30,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-07-19 22:05:30,276 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:05:30,276 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 22:05:30,277 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:05:30,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:05:30,280 INFO L85 PathProgramCache]: Analyzing trace with hash -1122645662, now seen corresponding path program 1 times [2022-07-19 22:05:30,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:05:30,287 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781060707] [2022-07-19 22:05:30,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:05:30,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:05:30,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:30,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:05:30,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:30,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:05:30,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:30,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 22:05:30,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:30,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 22:05:30,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:30,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:05:30,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:30,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 22:05:30,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:30,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-19 22:05:30,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:30,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-19 22:05:30,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:30,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-19 22:05:30,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:30,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:05:30,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:30,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 22:05:30,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:30,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-19 22:05:30,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:30,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-19 22:05:30,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:30,925 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-07-19 22:05:30,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:05:30,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781060707] [2022-07-19 22:05:30,927 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781060707] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:05:30,927 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 22:05:30,927 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 22:05:30,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540516072] [2022-07-19 22:05:30,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:05:30,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 22:05:30,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:05:30,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 22:05:30,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-19 22:05:30,958 INFO L87 Difference]: Start difference. First operand has 104 states, 67 states have (on average 1.1791044776119404) internal successors, (79), 68 states have internal predecessors, (79), 25 states have call successors, (25), 10 states have call predecessors, (25), 10 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-19 22:05:31,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:05:31,173 INFO L93 Difference]: Finished difference Result 201 states and 264 transitions. [2022-07-19 22:05:31,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 22:05:31,175 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 85 [2022-07-19 22:05:31,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:05:31,180 INFO L225 Difference]: With dead ends: 201 [2022-07-19 22:05:31,181 INFO L226 Difference]: Without dead ends: 98 [2022-07-19 22:05:31,183 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-19 22:05:31,186 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 92 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 22:05:31,186 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 140 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 22:05:31,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-07-19 22:05:31,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2022-07-19 22:05:31,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 62 states have (on average 1.1451612903225807) internal successors, (71), 63 states have internal predecessors, (71), 25 states have call successors, (25), 10 states have call predecessors, (25), 10 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2022-07-19 22:05:31,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 120 transitions. [2022-07-19 22:05:31,216 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 120 transitions. Word has length 85 [2022-07-19 22:05:31,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:05:31,217 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 120 transitions. [2022-07-19 22:05:31,217 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-19 22:05:31,218 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 120 transitions. [2022-07-19 22:05:31,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-07-19 22:05:31,220 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:05:31,220 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 22:05:31,220 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-19 22:05:31,220 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:05:31,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:05:31,221 INFO L85 PathProgramCache]: Analyzing trace with hash -1334345696, now seen corresponding path program 1 times [2022-07-19 22:05:31,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:05:31,221 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269181088] [2022-07-19 22:05:31,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:05:31,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:05:31,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:31,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:05:31,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:31,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:05:31,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:31,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 22:05:31,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:31,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 22:05:31,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:31,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:05:31,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:31,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 22:05:31,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:31,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-19 22:05:31,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:31,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-19 22:05:31,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:31,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-19 22:05:31,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:31,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:05:31,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:31,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 22:05:31,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:31,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-19 22:05:31,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:31,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-19 22:05:31,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:31,516 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-07-19 22:05:31,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:05:31,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269181088] [2022-07-19 22:05:31,516 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269181088] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:05:31,516 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 22:05:31,517 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-19 22:05:31,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913306364] [2022-07-19 22:05:31,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:05:31,518 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-19 22:05:31,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:05:31,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-19 22:05:31,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-19 22:05:31,519 INFO L87 Difference]: Start difference. First operand 98 states and 120 transitions. Second operand has 7 states, 6 states have (on average 6.666666666666667) internal successors, (40), 5 states have internal predecessors, (40), 3 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-19 22:05:31,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:05:31,795 INFO L93 Difference]: Finished difference Result 155 states and 190 transitions. [2022-07-19 22:05:31,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-19 22:05:31,796 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.666666666666667) internal successors, (40), 5 states have internal predecessors, (40), 3 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 85 [2022-07-19 22:05:31,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:05:31,798 INFO L225 Difference]: With dead ends: 155 [2022-07-19 22:05:31,798 INFO L226 Difference]: Without dead ends: 101 [2022-07-19 22:05:31,799 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2022-07-19 22:05:31,800 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 111 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-19 22:05:31,800 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 268 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-19 22:05:31,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-07-19 22:05:31,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2022-07-19 22:05:31,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 64 states have (on average 1.140625) internal successors, (73), 66 states have internal predecessors, (73), 25 states have call successors, (25), 10 states have call predecessors, (25), 11 states have return successors, (25), 24 states have call predecessors, (25), 24 states have call successors, (25) [2022-07-19 22:05:31,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 123 transitions. [2022-07-19 22:05:31,809 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 123 transitions. Word has length 85 [2022-07-19 22:05:31,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:05:31,810 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 123 transitions. [2022-07-19 22:05:31,810 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.666666666666667) internal successors, (40), 5 states have internal predecessors, (40), 3 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-19 22:05:31,810 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 123 transitions. [2022-07-19 22:05:31,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-07-19 22:05:31,811 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:05:31,811 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 22:05:31,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-19 22:05:31,812 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:05:31,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:05:31,812 INFO L85 PathProgramCache]: Analyzing trace with hash 50703397, now seen corresponding path program 1 times [2022-07-19 22:05:31,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:05:31,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722114400] [2022-07-19 22:05:31,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:05:31,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:05:31,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:32,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:05:32,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:32,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:05:32,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:32,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 22:05:32,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:32,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 22:05:32,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:32,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:05:32,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:32,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 22:05:32,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:32,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-19 22:05:32,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:32,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-19 22:05:32,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:32,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-19 22:05:32,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:32,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:05:32,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:32,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 22:05:32,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:32,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-19 22:05:32,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:32,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-19 22:05:32,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:32,118 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-07-19 22:05:32,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:05:32,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722114400] [2022-07-19 22:05:32,118 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722114400] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:05:32,119 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 22:05:32,119 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-19 22:05:32,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136876939] [2022-07-19 22:05:32,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:05:32,119 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-19 22:05:32,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:05:32,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-19 22:05:32,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-07-19 22:05:32,120 INFO L87 Difference]: Start difference. First operand 101 states and 123 transitions. Second operand has 10 states, 9 states have (on average 4.666666666666667) internal successors, (42), 6 states have internal predecessors, (42), 2 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) [2022-07-19 22:05:32,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:05:32,566 INFO L93 Difference]: Finished difference Result 113 states and 136 transitions. [2022-07-19 22:05:32,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-19 22:05:32,567 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.666666666666667) internal successors, (42), 6 states have internal predecessors, (42), 2 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) Word has length 87 [2022-07-19 22:05:32,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:05:32,568 INFO L225 Difference]: With dead ends: 113 [2022-07-19 22:05:32,569 INFO L226 Difference]: Without dead ends: 111 [2022-07-19 22:05:32,569 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2022-07-19 22:05:32,570 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 114 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 479 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-19 22:05:32,570 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 419 Invalid, 538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 479 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-19 22:05:32,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-07-19 22:05:32,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 110. [2022-07-19 22:05:32,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 70 states have (on average 1.1285714285714286) internal successors, (79), 73 states have internal predecessors, (79), 26 states have call successors, (26), 11 states have call predecessors, (26), 13 states have return successors, (28), 25 states have call predecessors, (28), 25 states have call successors, (28) [2022-07-19 22:05:32,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 133 transitions. [2022-07-19 22:05:32,578 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 133 transitions. Word has length 87 [2022-07-19 22:05:32,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:05:32,578 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 133 transitions. [2022-07-19 22:05:32,578 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.666666666666667) internal successors, (42), 6 states have internal predecessors, (42), 2 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) [2022-07-19 22:05:32,578 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 133 transitions. [2022-07-19 22:05:32,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-07-19 22:05:32,579 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:05:32,580 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 22:05:32,580 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-19 22:05:32,580 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:05:32,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:05:32,580 INFO L85 PathProgramCache]: Analyzing trace with hash 976473645, now seen corresponding path program 1 times [2022-07-19 22:05:32,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:05:32,581 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092855068] [2022-07-19 22:05:32,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:05:32,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:05:32,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:32,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:05:32,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:32,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:05:32,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:32,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 22:05:32,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:32,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 22:05:32,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:33,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:05:33,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:33,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 22:05:33,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:33,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-19 22:05:33,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:33,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-19 22:05:33,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:33,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-19 22:05:33,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:33,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:05:33,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:33,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 22:05:33,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:33,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-19 22:05:33,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:33,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-19 22:05:33,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:33,092 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-07-19 22:05:33,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:05:33,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092855068] [2022-07-19 22:05:33,092 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092855068] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 22:05:33,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1073857866] [2022-07-19 22:05:33,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:05:33,092 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 22:05:33,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 22:05:33,108 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) [2022-07-19 22:05:33,109 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-19 22:05:33,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:33,473 INFO L263 TraceCheckSpWp]: Trace formula consists of 2658 conjuncts, 48 conjunts are in the unsatisfiable core [2022-07-19 22:05:33,480 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 22:05:33,720 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:05:33,722 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2022-07-19 22:05:34,051 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-07-19 22:05:34,051 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 22:05:34,051 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1073857866] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:05:34,051 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 22:05:34,052 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [13] total 30 [2022-07-19 22:05:34,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345845280] [2022-07-19 22:05:34,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:05:34,052 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-19 22:05:34,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:05:34,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-19 22:05:34,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=801, Unknown=0, NotChecked=0, Total=870 [2022-07-19 22:05:34,054 INFO L87 Difference]: Start difference. First operand 110 states and 133 transitions. Second operand has 19 states, 18 states have (on average 2.5555555555555554) internal successors, (46), 15 states have internal predecessors, (46), 7 states have call successors, (14), 3 states have call predecessors, (14), 5 states have return successors, (13), 9 states have call predecessors, (13), 6 states have call successors, (13) [2022-07-19 22:05:34,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:05:34,258 INFO L93 Difference]: Finished difference Result 196 states and 234 transitions. [2022-07-19 22:05:34,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-19 22:05:34,259 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.5555555555555554) internal successors, (46), 15 states have internal predecessors, (46), 7 states have call successors, (14), 3 states have call predecessors, (14), 5 states have return successors, (13), 9 states have call predecessors, (13), 6 states have call successors, (13) Word has length 91 [2022-07-19 22:05:34,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:05:34,260 INFO L225 Difference]: With dead ends: 196 [2022-07-19 22:05:34,261 INFO L226 Difference]: Without dead ends: 127 [2022-07-19 22:05:34,261 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=102, Invalid=1158, Unknown=0, NotChecked=0, Total=1260 [2022-07-19 22:05:34,262 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 32 mSDsluCounter, 1434 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 1545 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 84 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 22:05:34,262 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 1545 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 145 Invalid, 0 Unknown, 84 Unchecked, 0.1s Time] [2022-07-19 22:05:34,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2022-07-19 22:05:34,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 124. [2022-07-19 22:05:34,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 83 states have (on average 1.144578313253012) internal successors, (95), 86 states have internal predecessors, (95), 26 states have call successors, (26), 12 states have call predecessors, (26), 14 states have return successors, (28), 25 states have call predecessors, (28), 25 states have call successors, (28) [2022-07-19 22:05:34,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 149 transitions. [2022-07-19 22:05:34,271 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 149 transitions. Word has length 91 [2022-07-19 22:05:34,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:05:34,271 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 149 transitions. [2022-07-19 22:05:34,272 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.5555555555555554) internal successors, (46), 15 states have internal predecessors, (46), 7 states have call successors, (14), 3 states have call predecessors, (14), 5 states have return successors, (13), 9 states have call predecessors, (13), 6 states have call successors, (13) [2022-07-19 22:05:34,272 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 149 transitions. [2022-07-19 22:05:34,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-07-19 22:05:34,273 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:05:34,273 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 22:05:34,306 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-07-19 22:05:34,493 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 22:05:34,494 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:05:34,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:05:34,494 INFO L85 PathProgramCache]: Analyzing trace with hash 1234639083, now seen corresponding path program 1 times [2022-07-19 22:05:34,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:05:34,495 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858952395] [2022-07-19 22:05:34,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:05:34,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:05:34,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:34,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:05:34,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:34,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:05:34,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:34,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 22:05:34,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:34,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 22:05:34,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:34,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:05:34,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:34,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 22:05:34,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:34,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-19 22:05:34,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:34,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-19 22:05:34,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:34,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-19 22:05:34,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:34,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:05:34,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:34,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 22:05:34,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:34,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-19 22:05:34,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:34,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-19 22:05:34,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:34,745 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-07-19 22:05:34,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:05:34,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858952395] [2022-07-19 22:05:34,746 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858952395] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:05:34,746 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 22:05:34,746 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-19 22:05:34,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667835091] [2022-07-19 22:05:34,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:05:34,747 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-19 22:05:34,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:05:34,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-19 22:05:34,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-19 22:05:34,748 INFO L87 Difference]: Start difference. First operand 124 states and 149 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) [2022-07-19 22:05:34,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:05:34,998 INFO L93 Difference]: Finished difference Result 183 states and 222 transitions. [2022-07-19 22:05:34,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 22:05:34,998 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) Word has length 91 [2022-07-19 22:05:34,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:05:34,999 INFO L225 Difference]: With dead ends: 183 [2022-07-19 22:05:34,999 INFO L226 Difference]: Without dead ends: 118 [2022-07-19 22:05:35,000 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-19 22:05:35,001 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 55 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-19 22:05:35,001 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 227 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-19 22:05:35,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-07-19 22:05:35,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 117. [2022-07-19 22:05:35,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 77 states have (on average 1.1168831168831168) internal successors, (86), 79 states have internal predecessors, (86), 26 states have call successors, (26), 12 states have call predecessors, (26), 13 states have return successors, (27), 25 states have call predecessors, (27), 25 states have call successors, (27) [2022-07-19 22:05:35,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 139 transitions. [2022-07-19 22:05:35,009 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 139 transitions. Word has length 91 [2022-07-19 22:05:35,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:05:35,009 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 139 transitions. [2022-07-19 22:05:35,009 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) [2022-07-19 22:05:35,009 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 139 transitions. [2022-07-19 22:05:35,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-07-19 22:05:35,015 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:05:35,015 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 22:05:35,016 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-19 22:05:35,016 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:05:35,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:05:35,016 INFO L85 PathProgramCache]: Analyzing trace with hash -2058076652, now seen corresponding path program 1 times [2022-07-19 22:05:35,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:05:35,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855815644] [2022-07-19 22:05:35,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:05:35,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:05:35,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:35,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:05:35,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:35,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:05:35,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:35,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 22:05:35,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:35,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 22:05:35,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:35,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:05:35,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:35,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 22:05:35,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:35,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-19 22:05:35,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:35,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-19 22:05:35,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:35,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-19 22:05:35,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:35,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:05:35,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:35,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 22:05:35,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:35,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-19 22:05:35,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:35,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-19 22:05:35,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:35,371 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-07-19 22:05:35,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:05:35,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855815644] [2022-07-19 22:05:35,371 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855815644] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:05:35,371 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 22:05:35,372 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-07-19 22:05:35,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461927460] [2022-07-19 22:05:35,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:05:35,372 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-19 22:05:35,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:05:35,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-19 22:05:35,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2022-07-19 22:05:35,373 INFO L87 Difference]: Start difference. First operand 117 states and 139 transitions. Second operand has 15 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 11 states have internal predecessors, (48), 2 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) [2022-07-19 22:05:36,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:05:36,083 INFO L93 Difference]: Finished difference Result 131 states and 152 transitions. [2022-07-19 22:05:36,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-19 22:05:36,084 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 11 states have internal predecessors, (48), 2 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) Word has length 93 [2022-07-19 22:05:36,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:05:36,085 INFO L225 Difference]: With dead ends: 131 [2022-07-19 22:05:36,085 INFO L226 Difference]: Without dead ends: 129 [2022-07-19 22:05:36,085 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=138, Invalid=564, Unknown=0, NotChecked=0, Total=702 [2022-07-19 22:05:36,086 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 85 mSDsluCounter, 504 mSDsCounter, 0 mSdLazyCounter, 824 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 605 SdHoareTripleChecker+Invalid, 867 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 824 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-19 22:05:36,086 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 605 Invalid, 867 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 824 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-19 22:05:36,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-07-19 22:05:36,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 117. [2022-07-19 22:05:36,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 78 states have (on average 1.1153846153846154) internal successors, (87), 80 states have internal predecessors, (87), 25 states have call successors, (25), 12 states have call predecessors, (25), 13 states have return successors, (26), 24 states have call predecessors, (26), 24 states have call successors, (26) [2022-07-19 22:05:36,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 138 transitions. [2022-07-19 22:05:36,093 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 138 transitions. Word has length 93 [2022-07-19 22:05:36,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:05:36,093 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 138 transitions. [2022-07-19 22:05:36,094 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 11 states have internal predecessors, (48), 2 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) [2022-07-19 22:05:36,094 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 138 transitions. [2022-07-19 22:05:36,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-07-19 22:05:36,095 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:05:36,095 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 22:05:36,095 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-19 22:05:36,095 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:05:36,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:05:36,096 INFO L85 PathProgramCache]: Analyzing trace with hash 1315799824, now seen corresponding path program 1 times [2022-07-19 22:05:36,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:05:36,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576716303] [2022-07-19 22:05:36,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:05:36,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:05:36,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:36,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:05:36,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:36,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:05:36,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:36,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 22:05:36,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:36,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 22:05:36,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:36,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:05:36,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:36,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 22:05:36,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:36,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-19 22:05:36,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:36,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-19 22:05:36,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:36,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-19 22:05:36,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:36,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:05:36,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:36,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 22:05:36,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:36,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-19 22:05:36,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:36,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-19 22:05:36,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:36,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-19 22:05:36,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:36,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-19 22:05:36,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:36,529 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 2 proven. 18 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2022-07-19 22:05:36,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:05:36,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576716303] [2022-07-19 22:05:36,530 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576716303] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 22:05:36,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [37475827] [2022-07-19 22:05:36,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:05:36,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 22:05:36,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 22:05:36,531 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) [2022-07-19 22:05:36,533 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-19 22:05:36,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:05:36,924 INFO L263 TraceCheckSpWp]: Trace formula consists of 2703 conjuncts, 120 conjunts are in the unsatisfiable core [2022-07-19 22:05:36,930 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 22:05:36,997 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-19 22:05:38,507 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:05:38,508 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 72 [2022-07-19 22:05:38,513 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2022-07-19 22:05:40,403 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:05:40,405 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:05:40,448 INFO L356 Elim1Store]: treesize reduction 120, result has 17.2 percent of original size [2022-07-19 22:05:40,448 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 3 disjoint index pairs (out of 21 index pairs), introduced 10 new quantified variables, introduced 16 case distinctions, treesize of input 139 treesize of output 104 [2022-07-19 22:05:40,566 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 32 proven. 21 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-19 22:05:40,566 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 22:05:50,558 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 22:05:50,558 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 102 treesize of output 90 [2022-07-19 22:05:51,076 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [37475827] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 22:05:51,076 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 22:05:51,076 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 36] total 46 [2022-07-19 22:05:51,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908829436] [2022-07-19 22:05:51,076 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 22:05:51,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-07-19 22:05:51,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:05:51,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-07-19 22:05:51,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=3574, Unknown=0, NotChecked=0, Total=3782 [2022-07-19 22:05:51,079 INFO L87 Difference]: Start difference. First operand 117 states and 138 transitions. Second operand has 46 states, 39 states have (on average 2.717948717948718) internal successors, (106), 34 states have internal predecessors, (106), 16 states have call successors, (32), 8 states have call predecessors, (32), 12 states have return successors, (30), 16 states have call predecessors, (30), 15 states have call successors, (30) [2022-07-19 22:05:51,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:05:51,931 INFO L93 Difference]: Finished difference Result 124 states and 143 transitions. [2022-07-19 22:05:51,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-19 22:05:51,932 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 39 states have (on average 2.717948717948718) internal successors, (106), 34 states have internal predecessors, (106), 16 states have call successors, (32), 8 states have call predecessors, (32), 12 states have return successors, (30), 16 states have call predecessors, (30), 15 states have call successors, (30) Word has length 103 [2022-07-19 22:05:51,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:05:51,932 INFO L225 Difference]: With dead ends: 124 [2022-07-19 22:05:51,932 INFO L226 Difference]: Without dead ends: 0 [2022-07-19 22:05:51,934 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 107 SyntacticMatches, 4 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1136 ImplicationChecksByTransitivity, 11.9s TimeCoverageRelationStatistics Valid=295, Invalid=5107, Unknown=0, NotChecked=0, Total=5402 [2022-07-19 22:05:51,934 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 44 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 559 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 720 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 559 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 133 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-19 22:05:51,934 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 355 Invalid, 720 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 559 Invalid, 0 Unknown, 133 Unchecked, 0.4s Time] [2022-07-19 22:05:51,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-07-19 22:05:51,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-07-19 22:05:51,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 22:05:51,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-07-19 22:05:51,935 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 103 [2022-07-19 22:05:51,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:05:51,935 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-19 22:05:51,935 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 39 states have (on average 2.717948717948718) internal successors, (106), 34 states have internal predecessors, (106), 16 states have call successors, (32), 8 states have call predecessors, (32), 12 states have return successors, (30), 16 states have call predecessors, (30), 15 states have call successors, (30) [2022-07-19 22:05:51,936 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-07-19 22:05:51,936 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-07-19 22:05:51,937 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-19 22:05:51,959 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-19 22:05:52,147 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-07-19 22:05:52,149 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-07-19 22:05:52,261 INFO L895 garLoopResultBuilder]: At program point L6815(lines 6806 6816) the Hoare annotation is: (and (not (= |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~str~0#1.base| 0)) (= |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~str~0#1.offset| 0) (or (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| |ensure_string_is_allocated_bounded_length_~max_size#1|) (= (+ (- 16) |ensure_string_is_allocated_bounded_length_~max_size#1|) 0)) (not (= |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_#res#1.base| 0)) (< |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_#res#1.base| |#StackHeapBarrier|) (not (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| 16)) (< |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~str~0#1.base| |#StackHeapBarrier|) (= |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_#res#1.offset| 0)) [2022-07-19 22:05:52,261 INFO L899 garLoopResultBuilder]: For program point ensure_string_is_allocated_bounded_lengthEXIT(lines 6800 6804) no Hoare annotation was computed. [2022-07-19 22:05:52,261 INFO L895 garLoopResultBuilder]: At program point L6810(line 6810) the Hoare annotation is: (and (not (= |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~str~0#1.base| 0)) (= |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~str~0#1.offset| 0) (or (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| |ensure_string_is_allocated_bounded_length_~max_size#1|) (= (+ (- 16) |ensure_string_is_allocated_bounded_length_~max_size#1|) 0)) (not (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| 16)) (< |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~str~0#1.base| |#StackHeapBarrier|)) [2022-07-19 22:05:52,261 INFO L899 garLoopResultBuilder]: For program point L6807-1(line 6807) no Hoare annotation was computed. [2022-07-19 22:05:52,261 INFO L895 garLoopResultBuilder]: At program point L6807(line 6807) the Hoare annotation is: (let ((.cse0 (not (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| 16)))) (and (or (<= 0 (+ (* 18446744073709551616 (div (+ (* (- 1) |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~len#1|) 15) 18446744073709551616)) |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~len#1|)) .cse0) (= |old(#length)| |#length|) (= |old(#memory_real)| |#memory_real|) (= |#memory_int| |old(#memory_int)|) (or (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| |ensure_string_is_allocated_bounded_length_~max_size#1|) (= (+ (- 16) |ensure_string_is_allocated_bounded_length_~max_size#1|) 0)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (or .cse0 (let ((.cse1 (* 18446744073709551616 (div |ensure_string_is_allocated_bounded_length_~len~1#1| 18446744073709551616)))) (<= .cse1 (+ |ensure_string_is_allocated_bounded_length_~len~1#1| (* 18446744073709551616 (div (+ .cse1 15 (* (- 1) |ensure_string_is_allocated_bounded_length_~len~1#1|)) 18446744073709551616)))))) (= |old(#valid)| |#valid|))) [2022-07-19 22:05:52,261 INFO L899 garLoopResultBuilder]: For program point L6810-3(line 6810) no Hoare annotation was computed. [2022-07-19 22:05:52,261 INFO L895 garLoopResultBuilder]: At program point L6810-2(line 6810) the Hoare annotation is: (and (not (= |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~str~0#1.base| 0)) (= |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~str~0#1.offset| 0) (or (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| |ensure_string_is_allocated_bounded_length_~max_size#1|) (= (+ (- 16) |ensure_string_is_allocated_bounded_length_~max_size#1|) 0)) (not (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| 16)) (< |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~str~0#1.base| |#StackHeapBarrier|)) [2022-07-19 22:05:52,261 INFO L899 garLoopResultBuilder]: For program point L6810-1(lines 6810 6811) no Hoare annotation was computed. [2022-07-19 22:05:52,261 INFO L895 garLoopResultBuilder]: At program point L6802(line 6802) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |old(#memory_real)| |#memory_real|) (= |#memory_int| |old(#memory_int)|) (or (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| |ensure_string_is_allocated_bounded_length_~max_size#1|) (= (+ (- 16) |ensure_string_is_allocated_bounded_length_~max_size#1|) 0)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|)) [2022-07-19 22:05:52,261 INFO L895 garLoopResultBuilder]: At program point ensure_string_is_allocated_bounded_lengthENTRY(lines 6800 6804) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |old(#memory_real)| |#memory_real|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|)) [2022-07-19 22:05:52,261 INFO L899 garLoopResultBuilder]: For program point L6810-5(lines 6810 6811) no Hoare annotation was computed. [2022-07-19 22:05:52,261 INFO L899 garLoopResultBuilder]: For program point L6801-1(line 6801) no Hoare annotation was computed. [2022-07-19 22:05:52,261 INFO L895 garLoopResultBuilder]: At program point L6801(line 6801) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |old(#memory_real)| |#memory_real|) (= |#memory_int| |old(#memory_int)|) (or (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| |ensure_string_is_allocated_bounded_length_~max_size#1|) (= (+ (- 16) |ensure_string_is_allocated_bounded_length_~max_size#1|) 0)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|)) [2022-07-19 22:05:52,261 INFO L899 garLoopResultBuilder]: For program point L6802-1(line 6802) no Hoare annotation was computed. [2022-07-19 22:05:52,262 INFO L899 garLoopResultBuilder]: For program point ensure_string_is_allocated_bounded_lengthFINAL(lines 6800 6804) no Hoare annotation was computed. [2022-07-19 22:05:52,262 INFO L895 garLoopResultBuilder]: At program point bounded_mallocENTRY(lines 6882 6887) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) [2022-07-19 22:05:52,262 INFO L899 garLoopResultBuilder]: For program point bounded_mallocFINAL(lines 6882 6887) no Hoare annotation was computed. [2022-07-19 22:05:52,262 INFO L899 garLoopResultBuilder]: For program point bounded_mallocEXIT(lines 6882 6887) no Hoare annotation was computed. [2022-07-19 22:05:52,262 INFO L899 garLoopResultBuilder]: For program point L6883-1(lines 6883 6885) no Hoare annotation was computed. [2022-07-19 22:05:52,262 INFO L895 garLoopResultBuilder]: At program point L6883(lines 6883 6885) the Hoare annotation is: (and (= |bounded_malloc_#in~size| bounded_malloc_~size) (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) [2022-07-19 22:05:52,262 INFO L899 garLoopResultBuilder]: For program point nondet_boolFINAL(line 261) no Hoare annotation was computed. [2022-07-19 22:05:52,262 INFO L899 garLoopResultBuilder]: For program point nondet_boolEXIT(line 261) no Hoare annotation was computed. [2022-07-19 22:05:52,262 INFO L902 garLoopResultBuilder]: At program point nondet_boolENTRY(line 261) the Hoare annotation is: true [2022-07-19 22:05:52,262 INFO L902 garLoopResultBuilder]: At program point aws_string_bytesENTRY(lines 6242 6246) the Hoare annotation is: true [2022-07-19 22:05:52,262 INFO L899 garLoopResultBuilder]: For program point aws_string_bytesEXIT(lines 6242 6246) no Hoare annotation was computed. [2022-07-19 22:05:52,262 INFO L899 garLoopResultBuilder]: For program point aws_string_bytesFINAL(lines 6242 6246) no Hoare annotation was computed. [2022-07-19 22:05:52,262 INFO L902 garLoopResultBuilder]: At program point L6244-1(line 6244) the Hoare annotation is: true [2022-07-19 22:05:52,262 INFO L899 garLoopResultBuilder]: For program point L6244-2(line 6244) no Hoare annotation was computed. [2022-07-19 22:05:52,262 INFO L902 garLoopResultBuilder]: At program point L6244(line 6244) the Hoare annotation is: true [2022-07-19 22:05:52,262 INFO L899 garLoopResultBuilder]: For program point L211-2(lines 210 212) no Hoare annotation was computed. [2022-07-19 22:05:52,262 INFO L902 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 210 212) the Hoare annotation is: true [2022-07-19 22:05:52,262 INFO L899 garLoopResultBuilder]: For program point L211(line 211) no Hoare annotation was computed. [2022-07-19 22:05:52,262 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 210 212) no Hoare annotation was computed. [2022-07-19 22:05:52,262 INFO L899 garLoopResultBuilder]: For program point can_fail_allocatorFINAL(lines 6889 6891) no Hoare annotation was computed. [2022-07-19 22:05:52,262 INFO L899 garLoopResultBuilder]: For program point can_fail_allocatorEXIT(lines 6889 6891) no Hoare annotation was computed. [2022-07-19 22:05:52,263 INFO L902 garLoopResultBuilder]: At program point can_fail_allocatorENTRY(lines 6889 6891) the Hoare annotation is: true [2022-07-19 22:05:52,263 INFO L902 garLoopResultBuilder]: At program point aws_string_is_validENTRY(lines 6252 6257) the Hoare annotation is: true [2022-07-19 22:05:52,263 INFO L899 garLoopResultBuilder]: For program point L6256-2(line 6256) no Hoare annotation was computed. [2022-07-19 22:05:52,263 INFO L899 garLoopResultBuilder]: For program point L6256(line 6256) no Hoare annotation was computed. [2022-07-19 22:05:52,263 INFO L899 garLoopResultBuilder]: For program point L6256-5(line 6256) no Hoare annotation was computed. [2022-07-19 22:05:52,263 INFO L899 garLoopResultBuilder]: For program point aws_string_is_validFINAL(lines 6252 6257) no Hoare annotation was computed. [2022-07-19 22:05:52,263 INFO L899 garLoopResultBuilder]: For program point L6256-3(line 6256) no Hoare annotation was computed. [2022-07-19 22:05:52,263 INFO L899 garLoopResultBuilder]: For program point aws_string_is_validEXIT(lines 6252 6257) no Hoare annotation was computed. [2022-07-19 22:05:52,263 INFO L902 garLoopResultBuilder]: At program point aws_byte_cursor_is_validENTRY(lines 7368 7372) the Hoare annotation is: true [2022-07-19 22:05:52,263 INFO L899 garLoopResultBuilder]: For program point L7371(line 7371) no Hoare annotation was computed. [2022-07-19 22:05:52,263 INFO L899 garLoopResultBuilder]: For program point L7371-5(line 7371) no Hoare annotation was computed. [2022-07-19 22:05:52,263 INFO L899 garLoopResultBuilder]: For program point L7371-4(line 7371) no Hoare annotation was computed. [2022-07-19 22:05:52,263 INFO L899 garLoopResultBuilder]: For program point L7371-2(line 7371) no Hoare annotation was computed. [2022-07-19 22:05:52,263 INFO L899 garLoopResultBuilder]: For program point L7371-8(line 7371) no Hoare annotation was computed. [2022-07-19 22:05:52,263 INFO L899 garLoopResultBuilder]: For program point L7371-6(line 7371) no Hoare annotation was computed. [2022-07-19 22:05:52,263 INFO L899 garLoopResultBuilder]: For program point aws_byte_cursor_is_validEXIT(lines 7368 7372) no Hoare annotation was computed. [2022-07-19 22:05:52,263 INFO L899 garLoopResultBuilder]: For program point L7371-11(line 7371) no Hoare annotation was computed. [2022-07-19 22:05:52,263 INFO L899 garLoopResultBuilder]: For program point L7371-10(line 7371) no Hoare annotation was computed. [2022-07-19 22:05:52,263 INFO L899 garLoopResultBuilder]: For program point L7370(lines 7370 7371) no Hoare annotation was computed. [2022-07-19 22:05:52,263 INFO L899 garLoopResultBuilder]: For program point L7370-2(lines 7370 7371) no Hoare annotation was computed. [2022-07-19 22:05:52,263 INFO L899 garLoopResultBuilder]: For program point aws_byte_cursor_is_validFINAL(lines 7368 7372) no Hoare annotation was computed. [2022-07-19 22:05:52,263 INFO L899 garLoopResultBuilder]: For program point nondet_uint64_tEXIT(line 266) no Hoare annotation was computed. [2022-07-19 22:05:52,264 INFO L902 garLoopResultBuilder]: At program point nondet_uint64_tENTRY(line 266) the Hoare annotation is: true [2022-07-19 22:05:52,264 INFO L899 garLoopResultBuilder]: For program point nondet_uint64_tFINAL(line 266) no Hoare annotation was computed. [2022-07-19 22:05:52,264 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-07-19 22:05:52,264 INFO L899 garLoopResultBuilder]: For program point L7106-1(line 7106) no Hoare annotation was computed. [2022-07-19 22:05:52,265 INFO L899 garLoopResultBuilder]: For program point L9538-1(line 9538) no Hoare annotation was computed. [2022-07-19 22:05:52,265 INFO L899 garLoopResultBuilder]: For program point L7100-1(lines 7099 7112) no Hoare annotation was computed. [2022-07-19 22:05:52,265 INFO L895 garLoopResultBuilder]: At program point L7100(line 7100) the Hoare annotation is: false [2022-07-19 22:05:52,265 INFO L899 garLoopResultBuilder]: For program point L9518-1(line 9518) no Hoare annotation was computed. [2022-07-19 22:05:52,265 INFO L899 garLoopResultBuilder]: For program point L8240-2(line 8240) no Hoare annotation was computed. [2022-07-19 22:05:52,265 INFO L895 garLoopResultBuilder]: At program point L8240-1(line 8240) the Hoare annotation is: false [2022-07-19 22:05:52,265 INFO L895 garLoopResultBuilder]: At program point L9518-2(lines 9516 9519) the Hoare annotation is: false [2022-07-19 22:05:52,265 INFO L895 garLoopResultBuilder]: At program point L8240(line 8240) the Hoare annotation is: false [2022-07-19 22:05:52,265 INFO L899 garLoopResultBuilder]: For program point L8236-1(line 8236) no Hoare annotation was computed. [2022-07-19 22:05:52,265 INFO L895 garLoopResultBuilder]: At program point L8236(line 8236) the Hoare annotation is: false [2022-07-19 22:05:52,265 INFO L895 garLoopResultBuilder]: At program point L9518(line 9518) the Hoare annotation is: false [2022-07-19 22:05:52,265 INFO L895 garLoopResultBuilder]: At program point L9541(line 9541) the Hoare annotation is: false [2022-07-19 22:05:52,265 INFO L895 garLoopResultBuilder]: At program point L9541-1(line 9541) the Hoare annotation is: false [2022-07-19 22:05:52,265 INFO L899 garLoopResultBuilder]: For program point L9541-2(line 9541) no Hoare annotation was computed. [2022-07-19 22:05:52,265 INFO L899 garLoopResultBuilder]: For program point L7107-1(lines 7107 7109) no Hoare annotation was computed. [2022-07-19 22:05:52,265 INFO L895 garLoopResultBuilder]: At program point L7107(lines 7107 7109) the Hoare annotation is: false [2022-07-19 22:05:52,265 INFO L895 garLoopResultBuilder]: At program point L9543(line 9543) the Hoare annotation is: false [2022-07-19 22:05:52,265 INFO L899 garLoopResultBuilder]: For program point L9543-1(line 9543) no Hoare annotation was computed. [2022-07-19 22:05:52,265 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-07-19 22:05:52,265 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-07-19 22:05:52,265 INFO L899 garLoopResultBuilder]: For program point L9537(lines 9537 9545) no Hoare annotation was computed. [2022-07-19 22:05:52,266 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-07-19 22:05:52,266 INFO L899 garLoopResultBuilder]: For program point L7099(lines 7099 7112) no Hoare annotation was computed. [2022-07-19 22:05:52,266 INFO L895 garLoopResultBuilder]: At program point L9517(line 9517) the Hoare annotation is: false [2022-07-19 22:05:52,266 INFO L895 garLoopResultBuilder]: At program point L9517-1(line 9517) the Hoare annotation is: false [2022-07-19 22:05:52,266 INFO L899 garLoopResultBuilder]: For program point L9517-2(line 9517) no Hoare annotation was computed. [2022-07-19 22:05:52,266 INFO L895 garLoopResultBuilder]: At program point L8241(lines 8235 8242) the Hoare annotation is: false [2022-07-19 22:05:52,266 INFO L902 garLoopResultBuilder]: At program point L9546(line 9546) the Hoare annotation is: true [2022-07-19 22:05:52,266 INFO L899 garLoopResultBuilder]: For program point L9542-1(line 9542) no Hoare annotation was computed. [2022-07-19 22:05:52,266 INFO L895 garLoopResultBuilder]: At program point L7110(line 7110) the Hoare annotation is: false [2022-07-19 22:05:52,266 INFO L895 garLoopResultBuilder]: At program point L9540(line 9540) the Hoare annotation is: false [2022-07-19 22:05:52,266 INFO L895 garLoopResultBuilder]: At program point L9540-1(line 9540) the Hoare annotation is: false [2022-07-19 22:05:52,266 INFO L902 garLoopResultBuilder]: At program point L9538(line 9538) the Hoare annotation is: true [2022-07-19 22:05:52,266 INFO L899 garLoopResultBuilder]: For program point L9540-2(line 9540) no Hoare annotation was computed. [2022-07-19 22:05:52,266 INFO L895 garLoopResultBuilder]: At program point L7106(line 7106) the Hoare annotation is: false [2022-07-19 22:05:52,266 INFO L895 garLoopResultBuilder]: At program point L9542(line 9542) the Hoare annotation is: false [2022-07-19 22:05:52,266 INFO L899 garLoopResultBuilder]: For program point L7110-1(line 7110) no Hoare annotation was computed. [2022-07-19 22:05:52,266 INFO L899 garLoopResultBuilder]: For program point L223(line 223) no Hoare annotation was computed. [2022-07-19 22:05:52,266 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 222 224) the Hoare annotation is: true [2022-07-19 22:05:52,266 INFO L899 garLoopResultBuilder]: For program point L223-1(line 223) no Hoare annotation was computed. [2022-07-19 22:05:52,266 INFO L899 garLoopResultBuilder]: For program point L223-3(lines 222 224) no Hoare annotation was computed. [2022-07-19 22:05:52,266 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 222 224) no Hoare annotation was computed. [2022-07-19 22:05:52,267 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2022-07-19 22:05:52,269 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2022-07-19 22:05:52,270 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-19 22:05:52,310 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.07 10:05:52 BoogieIcfgContainer [2022-07-19 22:05:52,310 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-19 22:05:52,311 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-19 22:05:52,311 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-19 22:05:52,311 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-19 22:05:52,311 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 10:05:30" (3/4) ... [2022-07-19 22:05:52,313 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-07-19 22:05:52,318 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ensure_string_is_allocated_bounded_length [2022-07-19 22:05:52,318 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure bounded_malloc [2022-07-19 22:05:52,318 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_byte_cursor_is_valid [2022-07-19 22:05:52,318 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure nondet_uint64_t [2022-07-19 22:05:52,318 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure nondet_bool [2022-07-19 22:05:52,319 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_string_bytes [2022-07-19 22:05:52,319 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2022-07-19 22:05:52,319 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2022-07-19 22:05:52,319 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure can_fail_allocator [2022-07-19 22:05:52,319 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_string_is_valid [2022-07-19 22:05:52,329 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 127 nodes and edges [2022-07-19 22:05:52,330 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 57 nodes and edges [2022-07-19 22:05:52,330 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 26 nodes and edges [2022-07-19 22:05:52,331 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2022-07-19 22:05:52,336 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2022-07-19 22:05:52,337 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-07-19 22:05:52,337 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-07-19 22:05:52,338 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-07-19 22:05:52,359 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((!(str == 0) && str == 0) && (\old(max_size) == max_size || -16 + max_size == 0)) && !(\result == 0)) && \result < unknown-#StackHeapBarrier-unknown) && !(\old(max_size) == 16)) && str < unknown-#StackHeapBarrier-unknown) && \result == 0 [2022-07-19 22:05:52,635 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-19 22:05:52,635 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-19 22:05:52,636 INFO L158 Benchmark]: Toolchain (without parser) took 25466.48ms. Allocated memory was 100.7MB in the beginning and 440.4MB in the end (delta: 339.7MB). Free memory was 57.2MB in the beginning and 142.0MB in the end (delta: -84.8MB). Peak memory consumption was 255.1MB. Max. memory is 16.1GB. [2022-07-19 22:05:52,636 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 83.9MB. Free memory was 62.9MB in the beginning and 62.8MB in the end (delta: 28.4kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-19 22:05:52,636 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1787.61ms. Allocated memory was 100.7MB in the beginning and 127.9MB in the end (delta: 27.3MB). Free memory was 57.0MB in the beginning and 68.1MB in the end (delta: -11.0MB). Peak memory consumption was 61.0MB. Max. memory is 16.1GB. [2022-07-19 22:05:52,636 INFO L158 Benchmark]: Boogie Procedure Inliner took 166.46ms. Allocated memory is still 127.9MB. Free memory was 68.1MB in the beginning and 56.3MB in the end (delta: 11.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-19 22:05:52,637 INFO L158 Benchmark]: Boogie Preprocessor took 74.34ms. Allocated memory is still 127.9MB. Free memory was 56.3MB in the beginning and 49.1MB in the end (delta: 7.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-19 22:05:52,637 INFO L158 Benchmark]: RCFGBuilder took 1011.21ms. Allocated memory was 127.9MB in the beginning and 174.1MB in the end (delta: 46.1MB). Free memory was 49.1MB in the beginning and 89.9MB in the end (delta: -40.8MB). Peak memory consumption was 35.9MB. Max. memory is 16.1GB. [2022-07-19 22:05:52,637 INFO L158 Benchmark]: TraceAbstraction took 22096.43ms. Allocated memory was 174.1MB in the beginning and 440.4MB in the end (delta: 266.3MB). Free memory was 89.9MB in the beginning and 272.1MB in the end (delta: -182.2MB). Peak memory consumption was 85.2MB. Max. memory is 16.1GB. [2022-07-19 22:05:52,637 INFO L158 Benchmark]: Witness Printer took 324.57ms. Allocated memory is still 440.4MB. Free memory was 272.1MB in the beginning and 142.0MB in the end (delta: 130.0MB). Peak memory consumption was 130.0MB. Max. memory is 16.1GB. [2022-07-19 22:05:52,638 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 83.9MB. Free memory was 62.9MB in the beginning and 62.8MB in the end (delta: 28.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1787.61ms. Allocated memory was 100.7MB in the beginning and 127.9MB in the end (delta: 27.3MB). Free memory was 57.0MB in the beginning and 68.1MB in the end (delta: -11.0MB). Peak memory consumption was 61.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 166.46ms. Allocated memory is still 127.9MB. Free memory was 68.1MB in the beginning and 56.3MB in the end (delta: 11.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 74.34ms. Allocated memory is still 127.9MB. Free memory was 56.3MB in the beginning and 49.1MB in the end (delta: 7.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 1011.21ms. Allocated memory was 127.9MB in the beginning and 174.1MB in the end (delta: 46.1MB). Free memory was 49.1MB in the beginning and 89.9MB in the end (delta: -40.8MB). Peak memory consumption was 35.9MB. Max. memory is 16.1GB. * TraceAbstraction took 22096.43ms. Allocated memory was 174.1MB in the beginning and 440.4MB in the end (delta: 266.3MB). Free memory was 89.9MB in the beginning and 272.1MB in the end (delta: -182.2MB). Peak memory consumption was 85.2MB. Max. memory is 16.1GB. * Witness Printer took 324.57ms. Allocated memory is still 440.4MB. Free memory was 272.1MB in the beginning and 142.0MB in the end (delta: 130.0MB). Peak memory consumption was 130.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 11 procedures, 104 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 22.0s, OverallIterations: 7, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 564 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 533 mSDsluCounter, 3559 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 217 IncrementalHoareTripleChecker+Unchecked, 2892 mSDsCounter, 266 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2490 IncrementalHoareTripleChecker+Invalid, 2973 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 266 mSolverCounterUnsat, 667 mSDtfsCounter, 2490 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 506 GetRequests, 343 SyntacticMatches, 4 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1346 ImplicationChecksByTransitivity, 13.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=124occurred in iteration=4, InterpolantAutomatonStates: 73, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 17 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 39 LocationsWithAnnotation, 112 PreInvPairs, 117 NumberOfFragments, 277 HoareAnnotationTreeSize, 112 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 39 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 16.7s InterpolantComputationTime, 829 NumberOfCodeBlocks, 829 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 820 ConstructedInterpolants, 55 QuantifiedInterpolants, 5853 SizeOfPredicates, 52 NumberOfNonLiveVariables, 5361 ConjunctsInSsa, 168 ConjunctsInUnsatCore, 9 InterpolantComputations, 6 PerfectInterpolantSequences, 398/455 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 9516]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 8235]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 6806]: Loop Invariant Derived loop invariant: ((((((!(str == 0) && str == 0) && (\old(max_size) == max_size || -16 + max_size == 0)) && !(\result == 0)) && \result < unknown-#StackHeapBarrier-unknown) && !(\old(max_size) == 16)) && str < unknown-#StackHeapBarrier-unknown) && \result == 0 - InvariantResult [Line: 9546]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2022-07-19 22:05:52,692 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE