./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_hash_table_create_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_hash_table_create_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 a871e941a14cf19147765419aa3746af2f9add859ed1f61f31f704f97208fdb0 --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-19 22:09:46,537 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-19 22:09:46,539 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-19 22:09:46,571 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-19 22:09:46,572 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-19 22:09:46,573 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-19 22:09:46,574 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-19 22:09:46,576 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-19 22:09:46,577 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-19 22:09:46,580 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-19 22:09:46,581 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-19 22:09:46,582 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-19 22:09:46,583 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-19 22:09:46,584 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-19 22:09:46,585 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-19 22:09:46,587 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-19 22:09:46,588 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-19 22:09:46,589 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-19 22:09:46,590 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-19 22:09:46,594 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-19 22:09:46,595 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-19 22:09:46,596 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-19 22:09:46,596 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-19 22:09:46,597 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-19 22:09:46,598 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-19 22:09:46,603 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-19 22:09:46,603 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-19 22:09:46,603 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-19 22:09:46,604 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-19 22:09:46,605 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-19 22:09:46,605 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-19 22:09:46,606 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-19 22:09:46,607 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-19 22:09:46,607 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-19 22:09:46,608 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-19 22:09:46,608 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-19 22:09:46,608 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-19 22:09:46,609 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-19 22:09:46,609 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-19 22:09:46,609 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-19 22:09:46,611 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-19 22:09:46,612 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-19 22:09:46,612 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:09:46,634 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-19 22:09:46,635 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-19 22:09:46,635 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-19 22:09:46,635 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-19 22:09:46,636 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-19 22:09:46,636 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-19 22:09:46,637 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-19 22:09:46,637 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-19 22:09:46,637 INFO L138 SettingsManager]: * Use SBE=true [2022-07-19 22:09:46,638 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-19 22:09:46,638 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-19 22:09:46,638 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-19 22:09:46,638 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-19 22:09:46,638 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-19 22:09:46,638 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-19 22:09:46,639 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-19 22:09:46,639 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-19 22:09:46,639 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-19 22:09:46,639 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-19 22:09:46,639 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-19 22:09:46,639 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-19 22:09:46,640 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 22:09:46,640 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-19 22:09:46,640 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-19 22:09:46,640 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-19 22:09:46,640 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-19 22:09:46,641 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-19 22:09:46,641 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-19 22:09:46,641 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-19 22:09:46,641 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-19 22:09:46,641 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 -> a871e941a14cf19147765419aa3746af2f9add859ed1f61f31f704f97208fdb0 [2022-07-19 22:09:46,831 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-19 22:09:46,848 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-19 22:09:46,850 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-19 22:09:46,850 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-19 22:09:46,851 INFO L275 PluginConnector]: CDTParser initialized [2022-07-19 22:09:46,852 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/aws-c-common/aws_hash_table_create_harness.i [2022-07-19 22:09:46,888 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e5a297747/a590bedfeac94ee5a5b345b84bb8ef46/FLAG56617844d [2022-07-19 22:09:47,501 INFO L306 CDTParser]: Found 1 translation units. [2022-07-19 22:09:47,502 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_hash_table_create_harness.i [2022-07-19 22:09:47,533 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e5a297747/a590bedfeac94ee5a5b345b84bb8ef46/FLAG56617844d [2022-07-19 22:09:47,620 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e5a297747/a590bedfeac94ee5a5b345b84bb8ef46 [2022-07-19 22:09:47,622 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-19 22:09:47,623 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-19 22:09:47,625 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-19 22:09:47,626 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-19 22:09:47,628 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-19 22:09:47,629 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 10:09:47" (1/1) ... [2022-07-19 22:09:47,630 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b95c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:09:47, skipping insertion in model container [2022-07-19 22:09:47,630 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 10:09:47" (1/1) ... [2022-07-19 22:09:47,635 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-19 22:09:47,738 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-19 22:09:48,022 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_hash_table_create_harness.i[4495,4508] [2022-07-19 22:09:48,029 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_hash_table_create_harness.i[4555,4568] [2022-07-19 22:09:48,692 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:09:48,697 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:09:48,698 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:09:48,699 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:09:48,699 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:09:48,713 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:09:48,714 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:09:48,715 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:09:48,719 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:09:48,721 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:09:48,721 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:09:48,722 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:09:48,722 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:09:48,941 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-07-19 22:09:48,942 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-07-19 22:09:48,943 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-07-19 22:09:48,944 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-07-19 22:09:48,945 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-07-19 22:09:48,945 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-07-19 22:09:48,945 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-07-19 22:09:48,946 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-07-19 22:09:48,946 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-07-19 22:09:48,947 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-07-19 22:09:49,050 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-07-19 22:09:49,295 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:09:49,295 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:09:49,314 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:09:49,316 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:09:49,321 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:09:49,321 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:09:49,333 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:09:49,334 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:09:49,336 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:09:49,336 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:09:49,336 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:09:49,337 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:09:49,337 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:09:49,366 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 22:09:49,397 INFO L203 MainTranslator]: Completed pre-run [2022-07-19 22:09:49,413 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_hash_table_create_harness.i[4495,4508] [2022-07-19 22:09:49,414 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_hash_table_create_harness.i[4555,4568] [2022-07-19 22:09:49,440 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:09:49,440 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:09:49,440 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:09:49,441 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:09:49,441 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:09:49,448 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:09:49,449 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:09:49,450 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:09:49,450 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:09:49,451 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:09:49,451 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:09:49,452 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:09:49,452 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:09:49,474 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-07-19 22:09:49,475 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-07-19 22:09:49,476 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-07-19 22:09:49,477 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-07-19 22:09:49,477 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-07-19 22:09:49,477 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-07-19 22:09:49,478 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-07-19 22:09:49,478 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-07-19 22:09:49,478 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-07-19 22:09:49,479 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-07-19 22:09:49,501 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-07-19 22:09:49,574 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:09:49,575 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:09:49,579 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:09:49,580 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:09:49,581 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:09:49,582 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:09:49,591 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:09:49,591 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:09:49,592 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:09:49,592 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:09:49,592 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:09:49,593 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:09:49,593 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:09:49,605 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 22:09:49,898 INFO L208 MainTranslator]: Completed translation [2022-07-19 22:09:49,899 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:09:49 WrapperNode [2022-07-19 22:09:49,899 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-19 22:09:49,900 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-19 22:09:49,900 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-19 22:09:49,900 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-19 22:09:49,905 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:09:49" (1/1) ... [2022-07-19 22:09:49,992 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:09:49" (1/1) ... [2022-07-19 22:09:50,067 INFO L137 Inliner]: procedures = 775, calls = 2489, calls flagged for inlining = 67, calls inlined = 21, statements flattened = 1294 [2022-07-19 22:09:50,068 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-19 22:09:50,069 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-19 22:09:50,069 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-19 22:09:50,069 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-19 22:09:50,075 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:09:49" (1/1) ... [2022-07-19 22:09:50,076 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:09:49" (1/1) ... [2022-07-19 22:09:50,087 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:09:49" (1/1) ... [2022-07-19 22:09:50,088 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:09:49" (1/1) ... [2022-07-19 22:09:50,130 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:09:49" (1/1) ... [2022-07-19 22:09:50,149 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:09:49" (1/1) ... [2022-07-19 22:09:50,161 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:09:49" (1/1) ... [2022-07-19 22:09:50,175 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-19 22:09:50,179 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-19 22:09:50,180 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-19 22:09:50,180 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-19 22:09:50,181 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:09:49" (1/1) ... [2022-07-19 22:09:50,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 22:09:50,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 22:09:50,212 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:09:50,272 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:09:50,288 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2022-07-19 22:09:50,288 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2022-07-19 22:09:50,288 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2022-07-19 22:09:50,289 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-19 22:09:50,289 INFO L130 BoogieDeclarations]: Found specification of procedure aws_raise_error [2022-07-19 22:09:50,289 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_raise_error [2022-07-19 22:09:50,289 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-07-19 22:09:50,289 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-07-19 22:09:50,289 INFO L130 BoogieDeclarations]: Found specification of procedure aws_hash_table_create [2022-07-19 22:09:50,289 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_hash_table_create [2022-07-19 22:09:50,289 INFO L130 BoogieDeclarations]: Found specification of procedure hash_table_state_is_valid [2022-07-19 22:09:50,289 INFO L138 BoogieDeclarations]: Found implementation of procedure hash_table_state_is_valid [2022-07-19 22:09:50,290 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-19 22:09:50,290 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-19 22:09:50,290 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-19 22:09:50,290 INFO L130 BoogieDeclarations]: Found specification of procedure s_emplace_item [2022-07-19 22:09:50,290 INFO L138 BoogieDeclarations]: Found implementation of procedure s_emplace_item [2022-07-19 22:09:50,290 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-19 22:09:50,291 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-19 22:09:50,291 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2022-07-19 22:09:50,291 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2022-07-19 22:09:50,291 INFO L130 BoogieDeclarations]: Found specification of procedure aws_mul_size_checked [2022-07-19 22:09:50,291 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_mul_size_checked [2022-07-19 22:09:50,291 INFO L130 BoogieDeclarations]: Found specification of procedure aws_mem_release [2022-07-19 22:09:50,291 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_mem_release [2022-07-19 22:09:50,291 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-19 22:09:50,291 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_overflow_plus [2022-07-19 22:09:50,292 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_overflow_plus [2022-07-19 22:09:50,292 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-19 22:09:50,292 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2022-07-19 22:09:50,292 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2022-07-19 22:09:50,292 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-19 22:09:50,292 INFO L130 BoogieDeclarations]: Found specification of procedure s_hash_for [2022-07-19 22:09:50,292 INFO L138 BoogieDeclarations]: Found implementation of procedure s_hash_for [2022-07-19 22:09:50,292 INFO L130 BoogieDeclarations]: Found specification of procedure aws_is_power_of_two [2022-07-19 22:09:50,293 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_is_power_of_two [2022-07-19 22:09:50,293 INFO L130 BoogieDeclarations]: Found specification of procedure s_update_template_size [2022-07-19 22:09:50,293 INFO L138 BoogieDeclarations]: Found implementation of procedure s_update_template_size [2022-07-19 22:09:50,293 INFO L130 BoogieDeclarations]: Found specification of procedure s_hash_keys_eq [2022-07-19 22:09:50,293 INFO L138 BoogieDeclarations]: Found implementation of procedure s_hash_keys_eq [2022-07-19 22:09:50,293 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_uninterpreted_equals [2022-07-19 22:09:50,294 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_uninterpreted_equals [2022-07-19 22:09:50,294 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-19 22:09:50,296 INFO L130 BoogieDeclarations]: Found specification of procedure aws_allocator_is_valid [2022-07-19 22:09:50,296 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_allocator_is_valid [2022-07-19 22:09:50,296 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2022-07-19 22:09:50,296 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_calloc [2022-07-19 22:09:50,297 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_calloc [2022-07-19 22:09:50,297 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2022-07-19 22:09:50,297 INFO L130 BoogieDeclarations]: Found specification of procedure hash_table_state_required_bytes [2022-07-19 22:09:50,297 INFO L138 BoogieDeclarations]: Found implementation of procedure hash_table_state_required_bytes [2022-07-19 22:09:50,298 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_uninterpreted_hasher [2022-07-19 22:09:50,302 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_uninterpreted_hasher [2022-07-19 22:09:50,302 INFO L130 BoogieDeclarations]: Found specification of procedure s_safe_eq_check [2022-07-19 22:09:50,302 INFO L138 BoogieDeclarations]: Found implementation of procedure s_safe_eq_check [2022-07-19 22:09:50,302 INFO L130 BoogieDeclarations]: Found specification of procedure s_find_entry [2022-07-19 22:09:50,302 INFO L138 BoogieDeclarations]: Found implementation of procedure s_find_entry [2022-07-19 22:09:50,302 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-19 22:09:50,302 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-19 22:09:50,303 INFO L130 BoogieDeclarations]: Found specification of procedure aws_hash_table_is_valid [2022-07-19 22:09:50,303 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_hash_table_is_valid [2022-07-19 22:09:50,303 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-19 22:09:50,303 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_allocator [2022-07-19 22:09:50,303 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_allocator [2022-07-19 22:09:50,303 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_overflow_mult [2022-07-19 22:09:50,303 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_overflow_mult [2022-07-19 22:09:50,303 INFO L130 BoogieDeclarations]: Found specification of procedure aws_add_size_checked [2022-07-19 22:09:50,303 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_add_size_checked [2022-07-19 22:09:50,304 INFO L130 BoogieDeclarations]: Found specification of procedure s_alloc_state [2022-07-19 22:09:50,304 INFO L138 BoogieDeclarations]: Found implementation of procedure s_alloc_state [2022-07-19 22:09:50,304 INFO L130 BoogieDeclarations]: Found specification of procedure uninterpreted_equals [2022-07-19 22:09:50,304 INFO L138 BoogieDeclarations]: Found implementation of procedure uninterpreted_equals [2022-07-19 22:09:50,304 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2022-07-19 22:09:50,304 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2022-07-19 22:09:50,304 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-19 22:09:50,649 INFO L234 CfgBuilder]: Building ICFG [2022-07-19 22:09:50,650 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-19 22:09:50,926 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##5: assume !true; [2022-07-19 22:09:50,964 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##10: assume !true; [2022-07-19 22:09:51,453 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##7: assume !true; [2022-07-19 22:09:51,453 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##29: assume !true; [2022-07-19 22:09:51,799 INFO L275 CfgBuilder]: Performing block encoding [2022-07-19 22:09:51,820 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-19 22:09:51,820 INFO L299 CfgBuilder]: Removed 11 assume(true) statements. [2022-07-19 22:09:51,822 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 10:09:51 BoogieIcfgContainer [2022-07-19 22:09:51,822 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-19 22:09:51,823 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-19 22:09:51,823 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-19 22:09:51,825 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-19 22:09:51,825 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.07 10:09:47" (1/3) ... [2022-07-19 22:09:51,826 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19d9b684 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 10:09:51, skipping insertion in model container [2022-07-19 22:09:51,826 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:09:49" (2/3) ... [2022-07-19 22:09:51,826 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19d9b684 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 10:09:51, skipping insertion in model container [2022-07-19 22:09:51,826 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 10:09:51" (3/3) ... [2022-07-19 22:09:51,827 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_hash_table_create_harness.i [2022-07-19 22:09:51,836 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-19 22:09:51,836 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-19 22:09:51,896 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-19 22:09:51,903 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@616cdab3, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@5166962e [2022-07-19 22:09:51,903 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-19 22:09:51,908 INFO L276 IsEmpty]: Start isEmpty. Operand has 349 states, 235 states have (on average 1.2723404255319148) internal successors, (299), 232 states have internal predecessors, (299), 86 states have call successors, (86), 30 states have call predecessors, (86), 30 states have return successors, (86), 86 states have call predecessors, (86), 86 states have call successors, (86) [2022-07-19 22:09:51,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-07-19 22:09:51,920 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:09:51,921 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 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, 1, 1, 1, 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:09:51,921 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:09:51,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:09:51,926 INFO L85 PathProgramCache]: Analyzing trace with hash -322226588, now seen corresponding path program 1 times [2022-07-19 22:09:51,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:09:51,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981439781] [2022-07-19 22:09:51,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:09:51,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:09:52,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:52,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:09:52,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:52,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 22:09:52,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:52,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 22:09:52,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:52,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 22:09:52,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:52,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-19 22:09:52,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:09:52,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981439781] [2022-07-19 22:09:52,381 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2022-07-19 22:09:52,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1689686457] [2022-07-19 22:09:52,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:09:52,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 22:09:52,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 22:09:52,405 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:09:52,407 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:09:52,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:52,953 INFO L263 TraceCheckSpWp]: Trace formula consists of 2485 conjuncts, 1 conjunts are in the unsatisfiable core [2022-07-19 22:09:52,964 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 22:09:52,992 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2022-07-19 22:09:52,993 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 22:09:52,994 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1689686457] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:09:52,994 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 22:09:52,994 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-19 22:09:52,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760180399] [2022-07-19 22:09:52,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:09:53,000 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-19 22:09:53,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:09:53,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-19 22:09:53,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 22:09:53,033 INFO L87 Difference]: Start difference. First operand has 349 states, 235 states have (on average 1.2723404255319148) internal successors, (299), 232 states have internal predecessors, (299), 86 states have call successors, (86), 30 states have call predecessors, (86), 30 states have return successors, (86), 86 states have call predecessors, (86), 86 states have call successors, (86) Second operand has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-07-19 22:09:53,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:09:53,074 INFO L93 Difference]: Finished difference Result 692 states and 983 transitions. [2022-07-19 22:09:53,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-19 22:09:53,076 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 124 [2022-07-19 22:09:53,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:09:53,085 INFO L225 Difference]: With dead ends: 692 [2022-07-19 22:09:53,085 INFO L226 Difference]: Without dead ends: 341 [2022-07-19 22:09:53,090 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 22:09:53,092 INFO L413 NwaCegarLoop]: 460 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 22:09:53,094 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 460 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 22:09:53,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2022-07-19 22:09:53,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 341. [2022-07-19 22:09:53,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 224 states have (on average 1.2544642857142858) internal successors, (281), 226 states have internal predecessors, (281), 86 states have call successors, (86), 30 states have call predecessors, (86), 30 states have return successors, (84), 84 states have call predecessors, (84), 84 states have call successors, (84) [2022-07-19 22:09:53,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 451 transitions. [2022-07-19 22:09:53,143 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 451 transitions. Word has length 124 [2022-07-19 22:09:53,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:09:53,144 INFO L495 AbstractCegarLoop]: Abstraction has 341 states and 451 transitions. [2022-07-19 22:09:53,144 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-07-19 22:09:53,145 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 451 transitions. [2022-07-19 22:09:53,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-07-19 22:09:53,146 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:09:53,147 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 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, 1, 1, 1, 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:09:53,169 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:09:53,352 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2022-07-19 22:09:53,353 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:09:53,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:09:53,353 INFO L85 PathProgramCache]: Analyzing trace with hash -672164438, now seen corresponding path program 1 times [2022-07-19 22:09:53,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:09:53,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448603142] [2022-07-19 22:09:53,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:09:53,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:09:53,424 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-19 22:09:53,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1125710807] [2022-07-19 22:09:53,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:09:53,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 22:09:53,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 22:09:53,440 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:09:53,441 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:09:53,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:53,907 INFO L263 TraceCheckSpWp]: Trace formula consists of 2485 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-19 22:09:53,912 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 22:09:54,057 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-07-19 22:09:54,057 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 22:09:54,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:09:54,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448603142] [2022-07-19 22:09:54,057 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-19 22:09:54,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1125710807] [2022-07-19 22:09:54,058 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1125710807] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:09:54,058 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 22:09:54,058 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-19 22:09:54,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878743883] [2022-07-19 22:09:54,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:09:54,059 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-19 22:09:54,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:09:54,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-19 22:09:54,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-19 22:09:54,059 INFO L87 Difference]: Start difference. First operand 341 states and 451 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 3 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2022-07-19 22:09:54,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:09:54,361 INFO L93 Difference]: Finished difference Result 668 states and 883 transitions. [2022-07-19 22:09:54,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-19 22:09:54,361 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 3 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) Word has length 124 [2022-07-19 22:09:54,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:09:54,364 INFO L225 Difference]: With dead ends: 668 [2022-07-19 22:09:54,364 INFO L226 Difference]: Without dead ends: 341 [2022-07-19 22:09:54,365 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-07-19 22:09:54,366 INFO L413 NwaCegarLoop]: 405 mSDtfsCounter, 465 mSDsluCounter, 779 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 465 SdHoareTripleChecker+Valid, 1184 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-19 22:09:54,366 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [465 Valid, 1184 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-19 22:09:54,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2022-07-19 22:09:54,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 341. [2022-07-19 22:09:54,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 224 states have (on average 1.25) internal successors, (280), 226 states have internal predecessors, (280), 86 states have call successors, (86), 30 states have call predecessors, (86), 30 states have return successors, (84), 84 states have call predecessors, (84), 84 states have call successors, (84) [2022-07-19 22:09:54,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 450 transitions. [2022-07-19 22:09:54,383 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 450 transitions. Word has length 124 [2022-07-19 22:09:54,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:09:54,384 INFO L495 AbstractCegarLoop]: Abstraction has 341 states and 450 transitions. [2022-07-19 22:09:54,384 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 3 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2022-07-19 22:09:54,384 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 450 transitions. [2022-07-19 22:09:54,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-07-19 22:09:54,385 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:09:54,399 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 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, 1, 1, 1, 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:09:54,437 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:09:54,619 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,SelfDestructingSolverStorable1 [2022-07-19 22:09:54,620 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:09:54,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:09:54,620 INFO L85 PathProgramCache]: Analyzing trace with hash 1014015400, now seen corresponding path program 1 times [2022-07-19 22:09:54,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:09:54,621 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057091109] [2022-07-19 22:09:54,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:09:54,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:09:54,702 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-19 22:09:54,702 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [516551085] [2022-07-19 22:09:54,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:09:54,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 22:09:54,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 22:09:54,703 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 22:09:54,704 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-19 22:09:55,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:55,167 INFO L263 TraceCheckSpWp]: Trace formula consists of 2490 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-19 22:09:55,171 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 22:09:55,188 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2022-07-19 22:09:55,188 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 22:09:55,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:09:55,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057091109] [2022-07-19 22:09:55,188 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-19 22:09:55,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [516551085] [2022-07-19 22:09:55,189 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [516551085] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:09:55,189 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 22:09:55,189 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-19 22:09:55,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168301266] [2022-07-19 22:09:55,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:09:55,189 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 22:09:55,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:09:55,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 22:09:55,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-19 22:09:55,190 INFO L87 Difference]: Start difference. First operand 341 states and 450 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (19), 3 states have call predecessors, (19), 2 states have call successors, (19) [2022-07-19 22:09:55,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:09:55,246 INFO L93 Difference]: Finished difference Result 678 states and 899 transitions. [2022-07-19 22:09:55,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 22:09:55,246 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (19), 3 states have call predecessors, (19), 2 states have call successors, (19) Word has length 124 [2022-07-19 22:09:55,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:09:55,249 INFO L225 Difference]: With dead ends: 678 [2022-07-19 22:09:55,249 INFO L226 Difference]: Without dead ends: 346 [2022-07-19 22:09:55,250 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-19 22:09:55,251 INFO L413 NwaCegarLoop]: 447 mSDtfsCounter, 2 mSDsluCounter, 1333 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1780 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 22:09:55,251 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1780 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 22:09:55,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2022-07-19 22:09:55,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 346. [2022-07-19 22:09:55,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 228 states have (on average 1.2456140350877194) internal successors, (284), 230 states have internal predecessors, (284), 86 states have call successors, (86), 30 states have call predecessors, (86), 31 states have return successors, (88), 85 states have call predecessors, (88), 84 states have call successors, (88) [2022-07-19 22:09:55,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 458 transitions. [2022-07-19 22:09:55,273 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 458 transitions. Word has length 124 [2022-07-19 22:09:55,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:09:55,273 INFO L495 AbstractCegarLoop]: Abstraction has 346 states and 458 transitions. [2022-07-19 22:09:55,274 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (19), 3 states have call predecessors, (19), 2 states have call successors, (19) [2022-07-19 22:09:55,274 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 458 transitions. [2022-07-19 22:09:55,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2022-07-19 22:09:55,275 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:09:55,275 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09:55,297 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-19 22:09:55,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 22:09:55,495 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:09:55,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:09:55,496 INFO L85 PathProgramCache]: Analyzing trace with hash 2006309942, now seen corresponding path program 1 times [2022-07-19 22:09:55,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:09:55,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811795645] [2022-07-19 22:09:55,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:09:55,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:09:55,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:55,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:09:55,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:55,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 22:09:55,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:55,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 22:09:55,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:55,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 22:09:55,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:55,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-19 22:09:55,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:55,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:09:55,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:55,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:09:55,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:55,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 22:09:55,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:55,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-19 22:09:55,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:55,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-19 22:09:55,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:55,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:09:55,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:55,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-19 22:09:55,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:55,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-19 22:09:55,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:55,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-19 22:09:55,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:55,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-19 22:09:55,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:55,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-19 22:09:55,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:55,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-19 22:09:55,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:55,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-19 22:09:55,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:55,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-19 22:09:55,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:55,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-07-19 22:09:55,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:55,924 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2022-07-19 22:09:55,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:09:55,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811795645] [2022-07-19 22:09:55,942 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811795645] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:09:55,943 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 22:09:55,943 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-07-19 22:09:55,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370964755] [2022-07-19 22:09:55,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:09:55,943 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-19 22:09:55,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:09:55,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-19 22:09:55,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2022-07-19 22:09:55,944 INFO L87 Difference]: Start difference. First operand 346 states and 458 transitions. Second operand has 13 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 9 states have internal predecessors, (61), 4 states have call successors, (23), 5 states have call predecessors, (23), 3 states have return successors, (20), 4 states have call predecessors, (20), 4 states have call successors, (20) [2022-07-19 22:09:59,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:09:59,200 INFO L93 Difference]: Finished difference Result 754 states and 1012 transitions. [2022-07-19 22:09:59,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-19 22:09:59,200 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 9 states have internal predecessors, (61), 4 states have call successors, (23), 5 states have call predecessors, (23), 3 states have return successors, (20), 4 states have call predecessors, (20), 4 states have call successors, (20) Word has length 130 [2022-07-19 22:09:59,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:09:59,203 INFO L225 Difference]: With dead ends: 754 [2022-07-19 22:09:59,203 INFO L226 Difference]: Without dead ends: 429 [2022-07-19 22:09:59,204 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2022-07-19 22:09:59,204 INFO L413 NwaCegarLoop]: 405 mSDtfsCounter, 284 mSDsluCounter, 1497 mSDsCounter, 0 mSdLazyCounter, 2335 mSolverCounterSat, 140 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 344 SdHoareTripleChecker+Valid, 1902 SdHoareTripleChecker+Invalid, 2475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 2335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-07-19 22:09:59,205 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [344 Valid, 1902 Invalid, 2475 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 2335 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2022-07-19 22:09:59,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2022-07-19 22:09:59,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 349. [2022-07-19 22:09:59,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 230 states have (on average 1.2434782608695651) internal successors, (286), 233 states have internal predecessors, (286), 86 states have call successors, (86), 30 states have call predecessors, (86), 32 states have return successors, (89), 85 states have call predecessors, (89), 84 states have call successors, (89) [2022-07-19 22:09:59,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 461 transitions. [2022-07-19 22:09:59,228 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 461 transitions. Word has length 130 [2022-07-19 22:09:59,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:09:59,229 INFO L495 AbstractCegarLoop]: Abstraction has 349 states and 461 transitions. [2022-07-19 22:09:59,229 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 9 states have internal predecessors, (61), 4 states have call successors, (23), 5 states have call predecessors, (23), 3 states have return successors, (20), 4 states have call predecessors, (20), 4 states have call successors, (20) [2022-07-19 22:09:59,229 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 461 transitions. [2022-07-19 22:09:59,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-07-19 22:09:59,243 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:09:59,244 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09:59,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-19 22:09:59,244 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:09:59,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:09:59,244 INFO L85 PathProgramCache]: Analyzing trace with hash -1092762838, now seen corresponding path program 1 times [2022-07-19 22:09:59,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:09:59,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780668679] [2022-07-19 22:09:59,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:09:59,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:09:59,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:59,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:09:59,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:59,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 22:09:59,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:59,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 22:09:59,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:59,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 22:09:59,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:59,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-19 22:09:59,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:59,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:09:59,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:59,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:09:59,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:59,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 22:09:59,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:59,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-19 22:09:59,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:59,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-19 22:09:59,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:59,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:09:59,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:59,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-19 22:09:59,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:59,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 22:09:59,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:59,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-19 22:09:59,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:59,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-19 22:09:59,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:59,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-19 22:09:59,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:59,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-19 22:09:59,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:59,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-19 22:09:59,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:59,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-19 22:09:59,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:59,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-19 22:09:59,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:59,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-19 22:09:59,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:59,629 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2022-07-19 22:09:59,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:09:59,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780668679] [2022-07-19 22:09:59,630 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1780668679] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 22:09:59,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [964881114] [2022-07-19 22:09:59,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:09:59,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 22:09:59,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 22:09:59,632 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 22:09:59,633 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-19 22:10:00,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:00,099 INFO L263 TraceCheckSpWp]: Trace formula consists of 2518 conjuncts, 23 conjunts are in the unsatisfiable core [2022-07-19 22:10:00,103 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 22:10:01,045 WARN L855 $PredicateComparison]: unable to prove that (or (exists ((aws_hash_table_is_valid_~map.base Int) (aws_hash_table_is_valid_~map.offset Int)) (not (= 0 (select (select |c_#memory_$Pointer$.offset| aws_hash_table_is_valid_~map.base) aws_hash_table_is_valid_~map.offset)))) (exists ((aws_hash_table_is_valid_~map.base Int) (aws_hash_table_is_valid_~map.offset Int)) (not (= (select (select |c_#memory_$Pointer$.base| aws_hash_table_is_valid_~map.base) aws_hash_table_is_valid_~map.offset) 0)))) is different from true [2022-07-19 22:10:07,177 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-07-19 22:10:07,178 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 22:10:07,178 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [964881114] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:10:07,178 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 22:10:07,178 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10] total 16 [2022-07-19 22:10:07,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566430865] [2022-07-19 22:10:07,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:10:07,179 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-19 22:10:07,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:10:07,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-19 22:10:07,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=175, Unknown=3, NotChecked=26, Total=240 [2022-07-19 22:10:07,180 INFO L87 Difference]: Start difference. First operand 349 states and 461 transitions. Second operand has 8 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 3 states have call successors, (24), 3 states have call predecessors, (24), 3 states have return successors, (21), 2 states have call predecessors, (21), 3 states have call successors, (21) [2022-07-19 22:10:07,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:10:07,632 INFO L93 Difference]: Finished difference Result 681 states and 900 transitions. [2022-07-19 22:10:07,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-19 22:10:07,636 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 3 states have call successors, (24), 3 states have call predecessors, (24), 3 states have return successors, (21), 2 states have call predecessors, (21), 3 states have call successors, (21) Word has length 136 [2022-07-19 22:10:07,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:10:07,638 INFO L225 Difference]: With dead ends: 681 [2022-07-19 22:10:07,638 INFO L226 Difference]: Without dead ends: 351 [2022-07-19 22:10:07,639 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=51, Invalid=222, Unknown=3, NotChecked=30, Total=306 [2022-07-19 22:10:07,640 INFO L413 NwaCegarLoop]: 444 mSDtfsCounter, 5 mSDsluCounter, 1964 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 2408 SdHoareTripleChecker+Invalid, 730 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 630 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-19 22:10:07,640 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 2408 Invalid, 730 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 100 Invalid, 0 Unknown, 630 Unchecked, 0.4s Time] [2022-07-19 22:10:07,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2022-07-19 22:10:07,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 351. [2022-07-19 22:10:07,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 232 states have (on average 1.2413793103448276) internal successors, (288), 234 states have internal predecessors, (288), 86 states have call successors, (86), 31 states have call predecessors, (86), 32 states have return successors, (89), 85 states have call predecessors, (89), 84 states have call successors, (89) [2022-07-19 22:10:07,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 463 transitions. [2022-07-19 22:10:07,653 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 463 transitions. Word has length 136 [2022-07-19 22:10:07,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:10:07,653 INFO L495 AbstractCegarLoop]: Abstraction has 351 states and 463 transitions. [2022-07-19 22:10:07,654 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 3 states have call successors, (24), 3 states have call predecessors, (24), 3 states have return successors, (21), 2 states have call predecessors, (21), 3 states have call successors, (21) [2022-07-19 22:10:07,654 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 463 transitions. [2022-07-19 22:10:07,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2022-07-19 22:10:07,655 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:10:07,655 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:07,677 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-19 22:10:07,875 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 22:10:07,875 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:10:07,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:10:07,876 INFO L85 PathProgramCache]: Analyzing trace with hash -1043141135, now seen corresponding path program 1 times [2022-07-19 22:10:07,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:10:07,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144291183] [2022-07-19 22:10:07,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:10:07,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:10:07,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:08,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:10:08,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:08,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 22:10:08,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:08,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 22:10:08,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:08,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 22:10:08,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:08,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-19 22:10:08,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:08,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:10:08,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:08,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:10:08,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:08,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 22:10:08,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:08,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-19 22:10:08,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:08,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-19 22:10:08,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:08,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:10:08,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:08,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-19 22:10:08,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:08,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 22:10:08,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:08,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:10:08,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:08,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-19 22:10:08,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:08,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-19 22:10:08,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:08,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-19 22:10:08,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:08,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-19 22:10:08,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:08,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-19 22:10:08,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:08,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-19 22:10:08,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:08,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-19 22:10:08,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:08,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-19 22:10:08,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:08,339 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2022-07-19 22:10:08,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:10:08,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144291183] [2022-07-19 22:10:08,340 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144291183] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:10:08,340 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 22:10:08,340 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-19 22:10:08,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507205903] [2022-07-19 22:10:08,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:10:08,341 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-19 22:10:08,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:10:08,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-19 22:10:08,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-07-19 22:10:08,342 INFO L87 Difference]: Start difference. First operand 351 states and 463 transitions. Second operand has 9 states, 8 states have (on average 8.5) internal successors, (68), 5 states have internal predecessors, (68), 3 states have call successors, (25), 5 states have call predecessors, (25), 3 states have return successors, (22), 3 states have call predecessors, (22), 2 states have call successors, (22) [2022-07-19 22:10:09,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:10:09,868 INFO L93 Difference]: Finished difference Result 739 states and 993 transitions. [2022-07-19 22:10:09,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-19 22:10:09,868 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 8.5) internal successors, (68), 5 states have internal predecessors, (68), 3 states have call successors, (25), 5 states have call predecessors, (25), 3 states have return successors, (22), 3 states have call predecessors, (22), 2 states have call successors, (22) Word has length 141 [2022-07-19 22:10:09,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:10:09,872 INFO L225 Difference]: With dead ends: 739 [2022-07-19 22:10:09,872 INFO L226 Difference]: Without dead ends: 433 [2022-07-19 22:10:09,873 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2022-07-19 22:10:09,874 INFO L413 NwaCegarLoop]: 413 mSDtfsCounter, 470 mSDsluCounter, 1146 mSDsCounter, 0 mSdLazyCounter, 1451 mSolverCounterSat, 380 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 524 SdHoareTripleChecker+Valid, 1559 SdHoareTripleChecker+Invalid, 1831 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 380 IncrementalHoareTripleChecker+Valid, 1451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-07-19 22:10:09,875 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [524 Valid, 1559 Invalid, 1831 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [380 Valid, 1451 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-07-19 22:10:09,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2022-07-19 22:10:09,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 353. [2022-07-19 22:10:09,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 233 states have (on average 1.240343347639485) internal successors, (289), 236 states have internal predecessors, (289), 86 states have call successors, (86), 31 states have call predecessors, (86), 33 states have return successors, (94), 85 states have call predecessors, (94), 84 states have call successors, (94) [2022-07-19 22:10:09,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 469 transitions. [2022-07-19 22:10:09,896 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 469 transitions. Word has length 141 [2022-07-19 22:10:09,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:10:09,896 INFO L495 AbstractCegarLoop]: Abstraction has 353 states and 469 transitions. [2022-07-19 22:10:09,897 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 8.5) internal successors, (68), 5 states have internal predecessors, (68), 3 states have call successors, (25), 5 states have call predecessors, (25), 3 states have return successors, (22), 3 states have call predecessors, (22), 2 states have call successors, (22) [2022-07-19 22:10:09,897 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 469 transitions. [2022-07-19 22:10:09,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2022-07-19 22:10:09,898 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:10:09,898 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:09,898 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-19 22:10:09,898 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:10:09,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:10:09,899 INFO L85 PathProgramCache]: Analyzing trace with hash 1171893452, now seen corresponding path program 1 times [2022-07-19 22:10:09,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:10:09,899 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083104377] [2022-07-19 22:10:09,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:10:09,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:10:10,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:10,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:10:10,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:10,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 22:10:10,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:10,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 22:10:10,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:10,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 22:10:10,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:10,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-19 22:10:10,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:10,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:10:10,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:10,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:10:10,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:10,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 22:10:10,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:10,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-19 22:10:10,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:10,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-19 22:10:10,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:10,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:10:10,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:10,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-19 22:10:10,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:10,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 22:10:10,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:10,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:10:10,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:10,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-19 22:10:10,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:10,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-19 22:10:10,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:10,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-19 22:10:10,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:10,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-19 22:10:10,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:10,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-19 22:10:10,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:10,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-19 22:10:10,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:10,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-19 22:10:10,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:10,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:10:10,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:10,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-19 22:10:10,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:10,348 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2022-07-19 22:10:10,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:10:10,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083104377] [2022-07-19 22:10:10,349 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083104377] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:10:10,349 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 22:10:10,349 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-19 22:10:10,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776513348] [2022-07-19 22:10:10,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:10:10,350 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-19 22:10:10,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:10:10,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-19 22:10:10,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-19 22:10:10,350 INFO L87 Difference]: Start difference. First operand 353 states and 469 transitions. Second operand has 8 states, 7 states have (on average 9.0) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (25), 5 states have call predecessors, (25), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2022-07-19 22:10:11,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:10:11,856 INFO L93 Difference]: Finished difference Result 441 states and 597 transitions. [2022-07-19 22:10:11,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-19 22:10:11,856 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 9.0) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (25), 5 states have call predecessors, (25), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 146 [2022-07-19 22:10:11,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:10:11,859 INFO L225 Difference]: With dead ends: 441 [2022-07-19 22:10:11,859 INFO L226 Difference]: Without dead ends: 439 [2022-07-19 22:10:11,859 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2022-07-19 22:10:11,860 INFO L413 NwaCegarLoop]: 419 mSDtfsCounter, 489 mSDsluCounter, 918 mSDsCounter, 0 mSdLazyCounter, 1136 mSolverCounterSat, 377 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 534 SdHoareTripleChecker+Valid, 1337 SdHoareTripleChecker+Invalid, 1513 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 377 IncrementalHoareTripleChecker+Valid, 1136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-07-19 22:10:11,860 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [534 Valid, 1337 Invalid, 1513 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [377 Valid, 1136 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-07-19 22:10:11,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2022-07-19 22:10:11,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 357. [2022-07-19 22:10:11,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 236 states have (on average 1.2372881355932204) internal successors, (292), 239 states have internal predecessors, (292), 86 states have call successors, (86), 32 states have call predecessors, (86), 34 states have return successors, (94), 85 states have call predecessors, (94), 84 states have call successors, (94) [2022-07-19 22:10:11,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 472 transitions. [2022-07-19 22:10:11,896 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 472 transitions. Word has length 146 [2022-07-19 22:10:11,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:10:11,896 INFO L495 AbstractCegarLoop]: Abstraction has 357 states and 472 transitions. [2022-07-19 22:10:11,896 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 9.0) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (25), 5 states have call predecessors, (25), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2022-07-19 22:10:11,897 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 472 transitions. [2022-07-19 22:10:11,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2022-07-19 22:10:11,898 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:10:11,898 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:11,898 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-19 22:10:11,898 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:10:11,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:10:11,899 INFO L85 PathProgramCache]: Analyzing trace with hash -1112780077, now seen corresponding path program 1 times [2022-07-19 22:10:11,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:10:11,899 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635556160] [2022-07-19 22:10:11,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:10:11,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:10:12,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:12,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:10:12,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:12,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 22:10:12,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:12,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 22:10:12,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:12,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 22:10:12,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:12,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-19 22:10:12,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:12,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:10:12,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:12,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:10:12,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:12,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 22:10:12,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:12,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-19 22:10:12,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:12,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-19 22:10:12,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:12,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:10:12,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:12,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-19 22:10:12,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:12,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 22:10:12,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:12,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:10:12,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:12,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-19 22:10:12,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:12,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-19 22:10:12,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:12,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-19 22:10:12,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:12,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-19 22:10:12,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:12,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-19 22:10:12,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:12,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-19 22:10:12,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:12,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-19 22:10:12,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:12,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:10:12,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:12,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-19 22:10:12,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:12,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-07-19 22:10:12,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:12,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-19 22:10:12,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:12,327 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2022-07-19 22:10:12,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:10:12,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635556160] [2022-07-19 22:10:12,328 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635556160] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:10:12,328 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 22:10:12,328 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-19 22:10:12,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904269782] [2022-07-19 22:10:12,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:10:12,329 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-19 22:10:12,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:10:12,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-19 22:10:12,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-19 22:10:12,330 INFO L87 Difference]: Start difference. First operand 357 states and 472 transitions. Second operand has 8 states, 7 states have (on average 10.285714285714286) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (27), 5 states have call predecessors, (27), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2022-07-19 22:10:14,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:10:14,337 INFO L93 Difference]: Finished difference Result 447 states and 603 transitions. [2022-07-19 22:10:14,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-19 22:10:14,338 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 10.285714285714286) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (27), 5 states have call predecessors, (27), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 159 [2022-07-19 22:10:14,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:10:14,340 INFO L225 Difference]: With dead ends: 447 [2022-07-19 22:10:14,340 INFO L226 Difference]: Without dead ends: 445 [2022-07-19 22:10:14,340 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2022-07-19 22:10:14,341 INFO L413 NwaCegarLoop]: 421 mSDtfsCounter, 249 mSDsluCounter, 1001 mSDsCounter, 0 mSdLazyCounter, 1331 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 1422 SdHoareTripleChecker+Invalid, 1460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 1331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-07-19 22:10:14,341 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [297 Valid, 1422 Invalid, 1460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 1331 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-07-19 22:10:14,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2022-07-19 22:10:14,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 362. [2022-07-19 22:10:14,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 239 states have (on average 1.2343096234309623) internal successors, (295), 243 states have internal predecessors, (295), 87 states have call successors, (87), 33 states have call predecessors, (87), 35 states have return successors, (95), 85 states have call predecessors, (95), 85 states have call successors, (95) [2022-07-19 22:10:14,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 477 transitions. [2022-07-19 22:10:14,355 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 477 transitions. Word has length 159 [2022-07-19 22:10:14,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:10:14,355 INFO L495 AbstractCegarLoop]: Abstraction has 362 states and 477 transitions. [2022-07-19 22:10:14,355 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 10.285714285714286) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (27), 5 states have call predecessors, (27), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2022-07-19 22:10:14,355 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 477 transitions. [2022-07-19 22:10:14,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2022-07-19 22:10:14,357 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:10:14,357 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:14,357 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-19 22:10:14,357 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:10:14,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:10:14,357 INFO L85 PathProgramCache]: Analyzing trace with hash -1110933035, now seen corresponding path program 1 times [2022-07-19 22:10:14,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:10:14,358 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924967351] [2022-07-19 22:10:14,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:10:14,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:10:14,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:14,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:10:14,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:14,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 22:10:14,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:14,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 22:10:14,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:14,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 22:10:14,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:14,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-19 22:10:14,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:14,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:10:14,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:14,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:10:14,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:14,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 22:10:14,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:14,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-19 22:10:14,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:14,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-19 22:10:14,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:14,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:10:14,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:14,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-19 22:10:14,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:14,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 22:10:14,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:14,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:10:14,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:14,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-19 22:10:14,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:14,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-19 22:10:14,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:14,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-19 22:10:14,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:14,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-19 22:10:14,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:14,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-19 22:10:14,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:14,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-19 22:10:14,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:14,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-19 22:10:14,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:14,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:10:14,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:14,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-19 22:10:14,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:14,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-07-19 22:10:14,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:14,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-19 22:10:14,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:14,763 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2022-07-19 22:10:14,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:10:14,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924967351] [2022-07-19 22:10:14,763 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924967351] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:10:14,763 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 22:10:14,764 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-19 22:10:14,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415745148] [2022-07-19 22:10:14,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:10:14,764 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-19 22:10:14,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:10:14,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-19 22:10:14,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-19 22:10:14,765 INFO L87 Difference]: Start difference. First operand 362 states and 477 transitions. Second operand has 8 states, 7 states have (on average 10.285714285714286) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (27), 5 states have call predecessors, (27), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2022-07-19 22:10:16,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:10:16,426 INFO L93 Difference]: Finished difference Result 450 states and 605 transitions. [2022-07-19 22:10:16,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-19 22:10:16,426 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 10.285714285714286) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (27), 5 states have call predecessors, (27), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 159 [2022-07-19 22:10:16,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:10:16,428 INFO L225 Difference]: With dead ends: 450 [2022-07-19 22:10:16,428 INFO L226 Difference]: Without dead ends: 448 [2022-07-19 22:10:16,429 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2022-07-19 22:10:16,429 INFO L413 NwaCegarLoop]: 424 mSDtfsCounter, 248 mSDsluCounter, 1014 mSDsCounter, 0 mSdLazyCounter, 1326 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 1438 SdHoareTripleChecker+Invalid, 1455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 1326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-07-19 22:10:16,429 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [295 Valid, 1438 Invalid, 1455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 1326 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-07-19 22:10:16,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2022-07-19 22:10:16,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 361. [2022-07-19 22:10:16,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 239 states have (on average 1.2343096234309623) internal successors, (295), 242 states have internal predecessors, (295), 86 states have call successors, (86), 33 states have call predecessors, (86), 35 states have return successors, (94), 85 states have call predecessors, (94), 84 states have call successors, (94) [2022-07-19 22:10:16,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 475 transitions. [2022-07-19 22:10:16,446 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 475 transitions. Word has length 159 [2022-07-19 22:10:16,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:10:16,446 INFO L495 AbstractCegarLoop]: Abstraction has 361 states and 475 transitions. [2022-07-19 22:10:16,446 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 10.285714285714286) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (27), 5 states have call predecessors, (27), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2022-07-19 22:10:16,447 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 475 transitions. [2022-07-19 22:10:16,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2022-07-19 22:10:16,448 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:10:16,448 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:16,448 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-19 22:10:16,449 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:10:16,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:10:16,449 INFO L85 PathProgramCache]: Analyzing trace with hash -1362509639, now seen corresponding path program 1 times [2022-07-19 22:10:16,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:10:16,449 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516681971] [2022-07-19 22:10:16,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:10:16,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:10:16,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:16,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:10:16,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:16,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 22:10:16,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:16,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 22:10:16,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:16,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 22:10:16,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:16,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-19 22:10:16,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:16,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:10:16,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:16,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:10:16,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:16,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 22:10:16,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:16,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-19 22:10:16,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:16,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-19 22:10:16,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:16,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:10:16,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:16,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-19 22:10:16,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:16,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 22:10:16,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:16,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:10:16,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:16,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-19 22:10:16,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:16,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-19 22:10:16,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:16,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-19 22:10:16,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:16,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-19 22:10:16,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:16,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-19 22:10:16,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:16,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-19 22:10:16,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:16,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-19 22:10:16,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:16,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:10:16,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:16,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:10:16,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:16,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-19 22:10:16,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:16,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-07-19 22:10:16,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:16,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2022-07-19 22:10:16,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:16,827 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2022-07-19 22:10:16,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:10:16,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516681971] [2022-07-19 22:10:16,827 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516681971] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:10:16,827 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 22:10:16,827 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-19 22:10:16,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292873123] [2022-07-19 22:10:16,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:10:16,829 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-19 22:10:16,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:10:16,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-19 22:10:16,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-07-19 22:10:16,829 INFO L87 Difference]: Start difference. First operand 361 states and 475 transitions. Second operand has 9 states, 8 states have (on average 10.125) internal successors, (81), 5 states have internal predecessors, (81), 4 states have call successors, (31), 6 states have call predecessors, (31), 1 states have return successors, (25), 3 states have call predecessors, (25), 3 states have call successors, (25) [2022-07-19 22:10:19,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:10:19,019 INFO L93 Difference]: Finished difference Result 805 states and 1098 transitions. [2022-07-19 22:10:19,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-19 22:10:19,020 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 10.125) internal successors, (81), 5 states have internal predecessors, (81), 4 states have call successors, (31), 6 states have call predecessors, (31), 1 states have return successors, (25), 3 states have call predecessors, (25), 3 states have call successors, (25) Word has length 178 [2022-07-19 22:10:19,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:10:19,022 INFO L225 Difference]: With dead ends: 805 [2022-07-19 22:10:19,022 INFO L226 Difference]: Without dead ends: 513 [2022-07-19 22:10:19,023 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2022-07-19 22:10:19,024 INFO L413 NwaCegarLoop]: 443 mSDtfsCounter, 634 mSDsluCounter, 1192 mSDsCounter, 0 mSdLazyCounter, 1521 mSolverCounterSat, 456 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 689 SdHoareTripleChecker+Valid, 1635 SdHoareTripleChecker+Invalid, 1977 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 456 IncrementalHoareTripleChecker+Valid, 1521 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-07-19 22:10:19,024 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [689 Valid, 1635 Invalid, 1977 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [456 Valid, 1521 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-07-19 22:10:19,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2022-07-19 22:10:19,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 402. [2022-07-19 22:10:19,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 402 states, 269 states have (on average 1.2490706319702602) internal successors, (336), 273 states have internal predecessors, (336), 96 states have call successors, (96), 34 states have call predecessors, (96), 36 states have return successors, (105), 94 states have call predecessors, (105), 94 states have call successors, (105) [2022-07-19 22:10:19,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 537 transitions. [2022-07-19 22:10:19,041 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 537 transitions. Word has length 178 [2022-07-19 22:10:19,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:10:19,041 INFO L495 AbstractCegarLoop]: Abstraction has 402 states and 537 transitions. [2022-07-19 22:10:19,042 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 10.125) internal successors, (81), 5 states have internal predecessors, (81), 4 states have call successors, (31), 6 states have call predecessors, (31), 1 states have return successors, (25), 3 states have call predecessors, (25), 3 states have call successors, (25) [2022-07-19 22:10:19,042 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 537 transitions. [2022-07-19 22:10:19,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2022-07-19 22:10:19,043 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:10:19,043 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:19,043 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-19 22:10:19,044 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:10:19,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:10:19,044 INFO L85 PathProgramCache]: Analyzing trace with hash 1099401581, now seen corresponding path program 1 times [2022-07-19 22:10:19,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:10:19,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654450414] [2022-07-19 22:10:19,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:10:19,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:10:19,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:19,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:10:19,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:19,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 22:10:19,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:19,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 22:10:19,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:19,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 22:10:19,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:19,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-19 22:10:19,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:19,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:10:19,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:19,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:10:19,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:19,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 22:10:19,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:19,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-19 22:10:19,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:19,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-19 22:10:19,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:19,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:10:19,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:19,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-19 22:10:19,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:19,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 22:10:19,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:19,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:10:19,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:19,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-19 22:10:19,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:19,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-19 22:10:19,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:19,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-19 22:10:19,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:19,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-19 22:10:19,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:19,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-19 22:10:19,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:19,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-19 22:10:19,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:19,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-19 22:10:19,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:19,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:10:19,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:19,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:10:19,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:19,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-19 22:10:19,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:19,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-19 22:10:19,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:19,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-07-19 22:10:19,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:19,578 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2022-07-19 22:10:19,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:10:19,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654450414] [2022-07-19 22:10:19,579 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654450414] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:10:19,579 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 22:10:19,579 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-07-19 22:10:19,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817255492] [2022-07-19 22:10:19,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:10:19,580 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-19 22:10:19,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:10:19,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-19 22:10:19,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2022-07-19 22:10:19,581 INFO L87 Difference]: Start difference. First operand 402 states and 537 transitions. Second operand has 14 states, 14 states have (on average 5.5) internal successors, (77), 8 states have internal predecessors, (77), 6 states have call successors, (31), 8 states have call predecessors, (31), 2 states have return successors, (25), 4 states have call predecessors, (25), 3 states have call successors, (25) [2022-07-19 22:10:22,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:10:22,610 INFO L93 Difference]: Finished difference Result 1011 states and 1427 transitions. [2022-07-19 22:10:22,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-19 22:10:22,610 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.5) internal successors, (77), 8 states have internal predecessors, (77), 6 states have call successors, (31), 8 states have call predecessors, (31), 2 states have return successors, (25), 4 states have call predecessors, (25), 3 states have call successors, (25) Word has length 174 [2022-07-19 22:10:22,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:10:22,615 INFO L225 Difference]: With dead ends: 1011 [2022-07-19 22:10:22,615 INFO L226 Difference]: Without dead ends: 691 [2022-07-19 22:10:22,617 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=116, Invalid=534, Unknown=0, NotChecked=0, Total=650 [2022-07-19 22:10:22,617 INFO L413 NwaCegarLoop]: 449 mSDtfsCounter, 573 mSDsluCounter, 2508 mSDsCounter, 0 mSdLazyCounter, 3260 mSolverCounterSat, 350 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 625 SdHoareTripleChecker+Valid, 2957 SdHoareTripleChecker+Invalid, 3610 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 350 IncrementalHoareTripleChecker+Valid, 3260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-07-19 22:10:22,617 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [625 Valid, 2957 Invalid, 3610 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [350 Valid, 3260 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2022-07-19 22:10:22,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 691 states. [2022-07-19 22:10:22,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 691 to 449. [2022-07-19 22:10:22,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 449 states, 303 states have (on average 1.2607260726072607) internal successors, (382), 308 states have internal predecessors, (382), 105 states have call successors, (105), 37 states have call predecessors, (105), 40 states have return successors, (118), 103 states have call predecessors, (118), 103 states have call successors, (118) [2022-07-19 22:10:22,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 605 transitions. [2022-07-19 22:10:22,640 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 605 transitions. Word has length 174 [2022-07-19 22:10:22,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:10:22,641 INFO L495 AbstractCegarLoop]: Abstraction has 449 states and 605 transitions. [2022-07-19 22:10:22,641 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.5) internal successors, (77), 8 states have internal predecessors, (77), 6 states have call successors, (31), 8 states have call predecessors, (31), 2 states have return successors, (25), 4 states have call predecessors, (25), 3 states have call successors, (25) [2022-07-19 22:10:22,641 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 605 transitions. [2022-07-19 22:10:22,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2022-07-19 22:10:22,643 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:10:22,643 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:22,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-19 22:10:22,643 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:10:22,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:10:22,644 INFO L85 PathProgramCache]: Analyzing trace with hash -73198679, now seen corresponding path program 1 times [2022-07-19 22:10:22,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:10:22,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129725682] [2022-07-19 22:10:22,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:10:22,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:10:22,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:22,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:10:22,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:22,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 22:10:22,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:22,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 22:10:22,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:22,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 22:10:22,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:22,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-19 22:10:22,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:22,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:10:22,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:22,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:10:22,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:22,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 22:10:22,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:22,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-19 22:10:22,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:22,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-19 22:10:22,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:22,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:10:22,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:22,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-19 22:10:22,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:22,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 22:10:22,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:22,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:10:22,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:22,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-19 22:10:22,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:22,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-19 22:10:22,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:22,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-19 22:10:22,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:22,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-19 22:10:22,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:22,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-19 22:10:22,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:22,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-19 22:10:22,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:22,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-19 22:10:22,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:22,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:10:22,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:23,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:10:23,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:23,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:10:23,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:23,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-19 22:10:23,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:23,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-19 22:10:23,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:23,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2022-07-19 22:10:23,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:23,059 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2022-07-19 22:10:23,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:10:23,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129725682] [2022-07-19 22:10:23,060 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129725682] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:10:23,060 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 22:10:23,060 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-19 22:10:23,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994425892] [2022-07-19 22:10:23,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:10:23,062 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-19 22:10:23,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:10:23,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-19 22:10:23,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-07-19 22:10:23,063 INFO L87 Difference]: Start difference. First operand 449 states and 605 transitions. Second operand has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 5 states have internal predecessors, (78), 3 states have call successors, (27), 6 states have call predecessors, (27), 3 states have return successors, (26), 2 states have call predecessors, (26), 3 states have call successors, (26) [2022-07-19 22:10:27,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:10:27,563 INFO L93 Difference]: Finished difference Result 861 states and 1191 transitions. [2022-07-19 22:10:27,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-19 22:10:27,564 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 5 states have internal predecessors, (78), 3 states have call successors, (27), 6 states have call predecessors, (27), 3 states have return successors, (26), 2 states have call predecessors, (26), 3 states have call successors, (26) Word has length 172 [2022-07-19 22:10:27,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:10:27,566 INFO L225 Difference]: With dead ends: 861 [2022-07-19 22:10:27,566 INFO L226 Difference]: Without dead ends: 583 [2022-07-19 22:10:27,567 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2022-07-19 22:10:27,567 INFO L413 NwaCegarLoop]: 435 mSDtfsCounter, 359 mSDsluCounter, 1148 mSDsCounter, 0 mSdLazyCounter, 1600 mSolverCounterSat, 193 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 418 SdHoareTripleChecker+Valid, 1583 SdHoareTripleChecker+Invalid, 1793 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 193 IncrementalHoareTripleChecker+Valid, 1600 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2022-07-19 22:10:27,568 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [418 Valid, 1583 Invalid, 1793 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [193 Valid, 1600 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2022-07-19 22:10:27,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2022-07-19 22:10:27,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 449. [2022-07-19 22:10:27,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 449 states, 303 states have (on average 1.2475247524752475) internal successors, (378), 308 states have internal predecessors, (378), 105 states have call successors, (105), 37 states have call predecessors, (105), 40 states have return successors, (118), 103 states have call predecessors, (118), 103 states have call successors, (118) [2022-07-19 22:10:27,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 601 transitions. [2022-07-19 22:10:27,599 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 601 transitions. Word has length 172 [2022-07-19 22:10:27,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:10:27,599 INFO L495 AbstractCegarLoop]: Abstraction has 449 states and 601 transitions. [2022-07-19 22:10:27,599 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 5 states have internal predecessors, (78), 3 states have call successors, (27), 6 states have call predecessors, (27), 3 states have return successors, (26), 2 states have call predecessors, (26), 3 states have call successors, (26) [2022-07-19 22:10:27,599 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 601 transitions. [2022-07-19 22:10:27,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2022-07-19 22:10:27,600 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:10:27,601 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:27,601 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-19 22:10:27,601 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:10:27,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:10:27,601 INFO L85 PathProgramCache]: Analyzing trace with hash 1732239655, now seen corresponding path program 1 times [2022-07-19 22:10:27,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:10:27,602 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265028206] [2022-07-19 22:10:27,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:10:27,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:10:27,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:27,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:10:27,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:27,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 22:10:27,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:27,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 22:10:27,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:27,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 22:10:27,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:27,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-19 22:10:27,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:27,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:10:27,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:27,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:10:27,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:27,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 22:10:27,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:27,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-19 22:10:27,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:27,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-19 22:10:27,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:27,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:10:27,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:27,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-19 22:10:27,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:27,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 22:10:27,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:27,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:10:27,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:27,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-19 22:10:27,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:27,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-19 22:10:27,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:27,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-19 22:10:27,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:27,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-19 22:10:27,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:27,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-19 22:10:27,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:27,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-19 22:10:27,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:27,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-19 22:10:27,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:27,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:10:27,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:27,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:10:27,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:27,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:10:27,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:27,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-19 22:10:27,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:28,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-19 22:10:28,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:28,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2022-07-19 22:10:28,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:28,037 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2022-07-19 22:10:28,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:10:28,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265028206] [2022-07-19 22:10:28,037 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265028206] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:10:28,037 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 22:10:28,037 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-19 22:10:28,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599917232] [2022-07-19 22:10:28,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:10:28,038 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-19 22:10:28,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:10:28,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-19 22:10:28,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-07-19 22:10:28,039 INFO L87 Difference]: Start difference. First operand 449 states and 601 transitions. Second operand has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (27), 6 states have call predecessors, (27), 3 states have return successors, (26), 3 states have call predecessors, (26), 2 states have call successors, (26) [2022-07-19 22:10:32,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:10:32,423 INFO L93 Difference]: Finished difference Result 784 states and 1122 transitions. [2022-07-19 22:10:32,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-19 22:10:32,424 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (27), 6 states have call predecessors, (27), 3 states have return successors, (26), 3 states have call predecessors, (26), 2 states have call successors, (26) Word has length 172 [2022-07-19 22:10:32,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:10:32,443 INFO L225 Difference]: With dead ends: 784 [2022-07-19 22:10:32,445 INFO L226 Difference]: Without dead ends: 709 [2022-07-19 22:10:32,446 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2022-07-19 22:10:32,446 INFO L413 NwaCegarLoop]: 467 mSDtfsCounter, 469 mSDsluCounter, 1212 mSDsCounter, 0 mSdLazyCounter, 1493 mSolverCounterSat, 329 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 532 SdHoareTripleChecker+Valid, 1679 SdHoareTripleChecker+Invalid, 1822 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 329 IncrementalHoareTripleChecker+Valid, 1493 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2022-07-19 22:10:32,447 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [532 Valid, 1679 Invalid, 1822 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [329 Valid, 1493 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2022-07-19 22:10:32,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 709 states. [2022-07-19 22:10:32,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 709 to 457. [2022-07-19 22:10:32,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 457 states, 309 states have (on average 1.2427184466019416) internal successors, (384), 314 states have internal predecessors, (384), 105 states have call successors, (105), 37 states have call predecessors, (105), 42 states have return successors, (122), 105 states have call predecessors, (122), 103 states have call successors, (122) [2022-07-19 22:10:32,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 611 transitions. [2022-07-19 22:10:32,502 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 611 transitions. Word has length 172 [2022-07-19 22:10:32,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:10:32,503 INFO L495 AbstractCegarLoop]: Abstraction has 457 states and 611 transitions. [2022-07-19 22:10:32,503 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (27), 6 states have call predecessors, (27), 3 states have return successors, (26), 3 states have call predecessors, (26), 2 states have call successors, (26) [2022-07-19 22:10:32,503 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 611 transitions. [2022-07-19 22:10:32,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2022-07-19 22:10:32,505 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:10:32,505 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:32,505 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-19 22:10:32,505 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:10:32,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:10:32,505 INFO L85 PathProgramCache]: Analyzing trace with hash -1482232862, now seen corresponding path program 1 times [2022-07-19 22:10:32,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:10:32,506 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363080732] [2022-07-19 22:10:32,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:10:32,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:10:32,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:32,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:10:32,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:32,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 22:10:32,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:32,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 22:10:32,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:32,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 22:10:32,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:32,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-19 22:10:32,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:32,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:10:32,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:32,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:10:32,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:32,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 22:10:32,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:32,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-19 22:10:32,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:32,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-19 22:10:32,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:32,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:10:32,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:32,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-19 22:10:32,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:32,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 22:10:32,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:32,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:10:32,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:32,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-19 22:10:32,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:32,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-19 22:10:32,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:32,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-19 22:10:32,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:32,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-19 22:10:32,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:32,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-19 22:10:32,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:32,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-19 22:10:32,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:32,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-19 22:10:32,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:33,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:10:33,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:33,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:10:33,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:33,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-19 22:10:33,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:33,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-19 22:10:33,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:33,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-07-19 22:10:33,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:33,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2022-07-19 22:10:33,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:33,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2022-07-19 22:10:33,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:33,214 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2022-07-19 22:10:33,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:10:33,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363080732] [2022-07-19 22:10:33,215 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363080732] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 22:10:33,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2077592142] [2022-07-19 22:10:33,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:10:33,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 22:10:33,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 22:10:33,236 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 22:10:33,293 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-19 22:10:33,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:33,817 INFO L263 TraceCheckSpWp]: Trace formula consists of 2784 conjuncts, 49 conjunts are in the unsatisfiable core [2022-07-19 22:10:33,821 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 22:10:33,839 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-19 22:10:33,841 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-19 22:10:33,949 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 56 proven. 2 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2022-07-19 22:10:33,949 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 22:10:34,310 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 201 trivial. 0 not checked. [2022-07-19 22:10:34,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2077592142] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 22:10:34,310 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 22:10:34,310 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12, 13] total 19 [2022-07-19 22:10:34,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465404123] [2022-07-19 22:10:34,311 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 22:10:34,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-19 22:10:34,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:10:34,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-19 22:10:34,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2022-07-19 22:10:34,312 INFO L87 Difference]: Start difference. First operand 457 states and 611 transitions. Second operand has 19 states, 16 states have (on average 6.4375) internal successors, (103), 14 states have internal predecessors, (103), 10 states have call successors, (42), 7 states have call predecessors, (42), 5 states have return successors, (33), 6 states have call predecessors, (33), 8 states have call successors, (33) [2022-07-19 22:10:38,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:10:38,235 INFO L93 Difference]: Finished difference Result 966 states and 1329 transitions. [2022-07-19 22:10:38,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-19 22:10:38,235 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 6.4375) internal successors, (103), 14 states have internal predecessors, (103), 10 states have call successors, (42), 7 states have call predecessors, (42), 5 states have return successors, (33), 6 states have call predecessors, (33), 8 states have call successors, (33) Word has length 178 [2022-07-19 22:10:38,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:10:38,239 INFO L225 Difference]: With dead ends: 966 [2022-07-19 22:10:38,239 INFO L226 Difference]: Without dead ends: 615 [2022-07-19 22:10:38,240 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 436 GetRequests, 401 SyntacticMatches, 4 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=151, Invalid=905, Unknown=0, NotChecked=0, Total=1056 [2022-07-19 22:10:38,241 INFO L413 NwaCegarLoop]: 419 mSDtfsCounter, 507 mSDsluCounter, 2926 mSDsCounter, 0 mSdLazyCounter, 3946 mSolverCounterSat, 342 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 557 SdHoareTripleChecker+Valid, 3345 SdHoareTripleChecker+Invalid, 4288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 342 IncrementalHoareTripleChecker+Valid, 3946 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2022-07-19 22:10:38,241 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [557 Valid, 3345 Invalid, 4288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [342 Valid, 3946 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2022-07-19 22:10:38,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2022-07-19 22:10:38,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 473. [2022-07-19 22:10:38,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 473 states, 316 states have (on average 1.2373417721518987) internal successors, (391), 321 states have internal predecessors, (391), 113 states have call successors, (113), 38 states have call predecessors, (113), 43 states have return successors, (128), 113 states have call predecessors, (128), 111 states have call successors, (128) [2022-07-19 22:10:38,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 632 transitions. [2022-07-19 22:10:38,262 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 632 transitions. Word has length 178 [2022-07-19 22:10:38,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:10:38,262 INFO L495 AbstractCegarLoop]: Abstraction has 473 states and 632 transitions. [2022-07-19 22:10:38,263 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 6.4375) internal successors, (103), 14 states have internal predecessors, (103), 10 states have call successors, (42), 7 states have call predecessors, (42), 5 states have return successors, (33), 6 states have call predecessors, (33), 8 states have call successors, (33) [2022-07-19 22:10:38,263 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 632 transitions. [2022-07-19 22:10:38,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2022-07-19 22:10:38,264 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:10:38,264 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:38,287 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-19 22:10:38,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-07-19 22:10:38,483 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:10:38,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:10:38,484 INFO L85 PathProgramCache]: Analyzing trace with hash -801809861, now seen corresponding path program 1 times [2022-07-19 22:10:38,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:10:38,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533543377] [2022-07-19 22:10:38,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:10:38,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:10:38,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:38,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:10:38,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:38,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 22:10:38,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:38,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 22:10:38,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:38,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 22:10:38,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:38,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-19 22:10:38,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:38,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:10:38,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:38,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:10:38,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:38,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 22:10:38,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:38,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-19 22:10:38,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:38,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-19 22:10:38,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:38,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:10:38,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:38,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-19 22:10:38,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:38,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 22:10:38,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:38,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:10:38,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:38,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-19 22:10:38,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:38,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-19 22:10:38,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:38,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-19 22:10:38,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:38,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-19 22:10:38,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:38,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-19 22:10:38,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:38,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-19 22:10:38,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:38,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-19 22:10:38,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:38,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:10:38,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:38,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:10:38,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:38,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-19 22:10:38,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:38,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-07-19 22:10:38,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:39,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2022-07-19 22:10:39,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:39,009 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2022-07-19 22:10:39,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:10:39,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533543377] [2022-07-19 22:10:39,009 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533543377] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:10:39,009 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 22:10:39,010 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-07-19 22:10:39,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043155343] [2022-07-19 22:10:39,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:10:39,011 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-19 22:10:39,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:10:39,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-19 22:10:39,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2022-07-19 22:10:39,011 INFO L87 Difference]: Start difference. First operand 473 states and 632 transitions. Second operand has 15 states, 15 states have (on average 5.4) internal successors, (81), 9 states have internal predecessors, (81), 6 states have call successors, (31), 8 states have call predecessors, (31), 2 states have return successors, (25), 4 states have call predecessors, (25), 3 states have call successors, (25) [2022-07-19 22:10:42,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:10:42,597 INFO L93 Difference]: Finished difference Result 1059 states and 1490 transitions. [2022-07-19 22:10:42,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-19 22:10:42,598 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.4) internal successors, (81), 9 states have internal predecessors, (81), 6 states have call successors, (31), 8 states have call predecessors, (31), 2 states have return successors, (25), 4 states have call predecessors, (25), 3 states have call successors, (25) Word has length 178 [2022-07-19 22:10:42,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:10:42,601 INFO L225 Difference]: With dead ends: 1059 [2022-07-19 22:10:42,601 INFO L226 Difference]: Without dead ends: 738 [2022-07-19 22:10:42,602 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=140, Invalid=672, Unknown=0, NotChecked=0, Total=812 [2022-07-19 22:10:42,602 INFO L413 NwaCegarLoop]: 449 mSDtfsCounter, 449 mSDsluCounter, 2851 mSDsCounter, 0 mSdLazyCounter, 3618 mSolverCounterSat, 194 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 501 SdHoareTripleChecker+Valid, 3300 SdHoareTripleChecker+Invalid, 3812 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 194 IncrementalHoareTripleChecker+Valid, 3618 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-07-19 22:10:42,603 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [501 Valid, 3300 Invalid, 3812 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [194 Valid, 3618 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2022-07-19 22:10:42,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 738 states. [2022-07-19 22:10:42,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 738 to 494. [2022-07-19 22:10:42,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 494 states, 327 states have (on average 1.2324159021406729) internal successors, (403), 332 states have internal predecessors, (403), 121 states have call successors, (121), 40 states have call predecessors, (121), 45 states have return successors, (138), 121 states have call predecessors, (138), 119 states have call successors, (138) [2022-07-19 22:10:42,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 662 transitions. [2022-07-19 22:10:42,626 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 662 transitions. Word has length 178 [2022-07-19 22:10:42,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:10:42,627 INFO L495 AbstractCegarLoop]: Abstraction has 494 states and 662 transitions. [2022-07-19 22:10:42,627 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.4) internal successors, (81), 9 states have internal predecessors, (81), 6 states have call successors, (31), 8 states have call predecessors, (31), 2 states have return successors, (25), 4 states have call predecessors, (25), 3 states have call successors, (25) [2022-07-19 22:10:42,627 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 662 transitions. [2022-07-19 22:10:42,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2022-07-19 22:10:42,629 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:10:42,630 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:42,630 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-19 22:10:42,630 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:10:42,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:10:42,630 INFO L85 PathProgramCache]: Analyzing trace with hash 1914549499, now seen corresponding path program 1 times [2022-07-19 22:10:42,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:10:42,631 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049644449] [2022-07-19 22:10:42,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:10:42,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:10:42,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:42,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:10:42,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:42,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 22:10:42,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:42,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 22:10:42,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:42,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 22:10:42,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:42,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-19 22:10:42,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:42,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:10:42,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:42,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:10:42,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:42,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 22:10:42,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:42,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-19 22:10:42,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:42,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-19 22:10:42,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:42,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:10:42,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:42,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-19 22:10:42,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:42,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 22:10:42,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:42,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:10:42,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:42,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-19 22:10:42,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:42,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-19 22:10:42,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:42,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-19 22:10:42,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:42,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-19 22:10:42,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:42,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-19 22:10:42,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:42,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-19 22:10:42,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:42,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-19 22:10:42,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:42,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:10:42,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:42,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:10:42,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:42,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:10:42,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:42,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-19 22:10:42,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:42,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-19 22:10:42,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:42,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2022-07-19 22:10:42,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:42,975 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2022-07-19 22:10:42,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:10:42,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049644449] [2022-07-19 22:10:42,976 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049644449] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:10:42,976 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 22:10:42,976 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-19 22:10:42,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293306716] [2022-07-19 22:10:42,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:10:42,977 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-19 22:10:42,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:10:42,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-19 22:10:42,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-19 22:10:42,977 INFO L87 Difference]: Start difference. First operand 494 states and 662 transitions. Second operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (27), 6 states have call predecessors, (27), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2022-07-19 22:10:46,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:10:46,225 INFO L93 Difference]: Finished difference Result 908 states and 1252 transitions. [2022-07-19 22:10:46,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-19 22:10:46,225 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (27), 6 states have call predecessors, (27), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 174 [2022-07-19 22:10:46,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:10:46,249 INFO L225 Difference]: With dead ends: 908 [2022-07-19 22:10:46,250 INFO L226 Difference]: Without dead ends: 630 [2022-07-19 22:10:46,250 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-07-19 22:10:46,251 INFO L413 NwaCegarLoop]: 445 mSDtfsCounter, 283 mSDsluCounter, 721 mSDsCounter, 0 mSdLazyCounter, 1012 mSolverCounterSat, 160 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 SdHoareTripleChecker+Valid, 1166 SdHoareTripleChecker+Invalid, 1172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 160 IncrementalHoareTripleChecker+Valid, 1012 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-07-19 22:10:46,251 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [336 Valid, 1166 Invalid, 1172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [160 Valid, 1012 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2022-07-19 22:10:46,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2022-07-19 22:10:46,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 496. [2022-07-19 22:10:46,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 496 states, 329 states have (on average 1.2310030395136777) internal successors, (405), 334 states have internal predecessors, (405), 121 states have call successors, (121), 40 states have call predecessors, (121), 45 states have return successors, (138), 121 states have call predecessors, (138), 119 states have call successors, (138) [2022-07-19 22:10:46,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 664 transitions. [2022-07-19 22:10:46,282 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 664 transitions. Word has length 174 [2022-07-19 22:10:46,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:10:46,282 INFO L495 AbstractCegarLoop]: Abstraction has 496 states and 664 transitions. [2022-07-19 22:10:46,282 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (27), 6 states have call predecessors, (27), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2022-07-19 22:10:46,283 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 664 transitions. [2022-07-19 22:10:46,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2022-07-19 22:10:46,284 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:10:46,284 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 5, 5, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:46,284 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-19 22:10:46,284 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:10:46,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:10:46,285 INFO L85 PathProgramCache]: Analyzing trace with hash -167187636, now seen corresponding path program 1 times [2022-07-19 22:10:46,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:10:46,285 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619070537] [2022-07-19 22:10:46,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:10:46,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:10:46,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:47,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:10:47,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:47,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 22:10:47,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:47,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 22:10:47,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:47,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 22:10:47,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:47,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-19 22:10:47,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:47,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:10:47,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:47,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:10:47,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:47,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 22:10:47,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:47,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-19 22:10:47,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:47,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-19 22:10:47,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:47,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:10:47,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:47,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-19 22:10:47,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:47,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 22:10:47,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:47,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:10:47,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:47,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-19 22:10:47,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:47,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-19 22:10:47,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:47,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-19 22:10:47,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:47,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-19 22:10:47,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:47,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-19 22:10:47,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:47,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-19 22:10:47,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:47,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-19 22:10:47,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:47,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:10:47,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:47,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:10:47,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:47,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-19 22:10:47,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:47,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-19 22:10:47,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:47,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:10:47,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:47,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2022-07-19 22:10:47,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:47,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2022-07-19 22:10:47,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:47,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2022-07-19 22:10:47,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:47,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:10:47,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:47,255 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2022-07-19 22:10:47,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:10:47,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619070537] [2022-07-19 22:10:47,255 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619070537] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 22:10:47,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [294544400] [2022-07-19 22:10:47,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:10:47,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 22:10:47,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 22:10:47,272 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 22:10:47,300 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-19 22:10:47,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:47,920 INFO L263 TraceCheckSpWp]: Trace formula consists of 2844 conjuncts, 65 conjunts are in the unsatisfiable core [2022-07-19 22:10:47,926 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 22:10:48,016 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2022-07-19 22:10:48,016 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 22:10:48,016 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [294544400] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:10:48,016 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 22:10:48,016 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 12 [2022-07-19 22:10:48,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003897412] [2022-07-19 22:10:48,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:10:48,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-19 22:10:48,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:10:48,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-19 22:10:48,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2022-07-19 22:10:48,018 INFO L87 Difference]: Start difference. First operand 496 states and 664 transitions. Second operand has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 states have internal predecessors, (85), 4 states have call successors, (31), 2 states have call predecessors, (31), 4 states have return successors, (27), 4 states have call predecessors, (27), 4 states have call successors, (27) [2022-07-19 22:10:48,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:10:48,248 INFO L93 Difference]: Finished difference Result 985 states and 1317 transitions. [2022-07-19 22:10:48,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-19 22:10:48,249 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 states have internal predecessors, (85), 4 states have call successors, (31), 2 states have call predecessors, (31), 4 states have return successors, (27), 4 states have call predecessors, (27), 4 states have call successors, (27) Word has length 188 [2022-07-19 22:10:48,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:10:48,252 INFO L225 Difference]: With dead ends: 985 [2022-07-19 22:10:48,253 INFO L226 Difference]: Without dead ends: 498 [2022-07-19 22:10:48,255 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 242 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-07-19 22:10:48,257 INFO L413 NwaCegarLoop]: 418 mSDtfsCounter, 30 mSDsluCounter, 1974 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 2392 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-19 22:10:48,257 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 2392 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-19 22:10:48,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2022-07-19 22:10:48,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 498. [2022-07-19 22:10:48,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 498 states, 330 states have (on average 1.2303030303030302) internal successors, (406), 336 states have internal predecessors, (406), 121 states have call successors, (121), 40 states have call predecessors, (121), 46 states have return successors, (139), 121 states have call predecessors, (139), 119 states have call successors, (139) [2022-07-19 22:10:48,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 498 states and 666 transitions. [2022-07-19 22:10:48,315 INFO L78 Accepts]: Start accepts. Automaton has 498 states and 666 transitions. Word has length 188 [2022-07-19 22:10:48,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:10:48,315 INFO L495 AbstractCegarLoop]: Abstraction has 498 states and 666 transitions. [2022-07-19 22:10:48,315 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 states have internal predecessors, (85), 4 states have call successors, (31), 2 states have call predecessors, (31), 4 states have return successors, (27), 4 states have call predecessors, (27), 4 states have call successors, (27) [2022-07-19 22:10:48,315 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 666 transitions. [2022-07-19 22:10:48,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2022-07-19 22:10:48,317 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:10:48,317 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 5, 5, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:48,339 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-19 22:10:48,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-07-19 22:10:48,539 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:10:48,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:10:48,539 INFO L85 PathProgramCache]: Analyzing trace with hash 464786715, now seen corresponding path program 1 times [2022-07-19 22:10:48,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:10:48,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077491657] [2022-07-19 22:10:48,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:10:48,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:10:48,586 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-19 22:10:48,587 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1944594233] [2022-07-19 22:10:48,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:10:48,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 22:10:48,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 22:10:48,589 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 22:10:48,590 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-19 22:12:49,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:49,261 INFO L263 TraceCheckSpWp]: Trace formula consists of 2949 conjuncts, 389 conjunts are in the unsatisfiable core [2022-07-19 22:12:49,271 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 22:12:49,287 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 6 treesize of output 5 [2022-07-19 22:12:49,574 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-19 22:12:49,574 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-19 22:12:49,648 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-19 22:12:49,779 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 13 treesize of output 9 [2022-07-19 22:12:49,889 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-07-19 22:12:50,025 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 13 treesize of output 9 [2022-07-19 22:12:50,306 INFO L356 Elim1Store]: treesize reduction 173, result has 26.4 percent of original size [2022-07-19 22:12:50,307 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 15 case distinctions, treesize of input 93 treesize of output 134 [2022-07-19 22:12:51,729 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-19 22:12:52,335 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 119 proven. 15 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2022-07-19 22:12:52,335 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 22:12:53,853 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3350 (Array Int Int)) (v_ArrVal_3351 (Array Int Int)) (v_ArrVal_3349 (Array Int Int))) (< (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base| v_ArrVal_3351) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base| v_ArrVal_3350) |c_ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.base|) |c_ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.offset|)) (+ 40 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base| v_ArrVal_3349) |c_ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.base|) |c_ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.offset|))) 18446744073709551616) 2)) is different from false [2022-07-19 22:12:53,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:12:53,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077491657] [2022-07-19 22:12:53,860 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-19 22:12:53,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1944594233] [2022-07-19 22:12:53,861 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1944594233] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 22:12:53,861 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-07-19 22:12:53,861 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2022-07-19 22:12:53,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391443192] [2022-07-19 22:12:53,861 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-07-19 22:12:53,861 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-07-19 22:12:53,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:12:53,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-07-19 22:12:53,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=2101, Unknown=1, NotChecked=92, Total=2352 [2022-07-19 22:12:53,862 INFO L87 Difference]: Start difference. First operand 498 states and 666 transitions. Second operand has 34 states, 27 states have (on average 3.5185185185185186) internal successors, (95), 25 states have internal predecessors, (95), 11 states have call successors, (32), 6 states have call predecessors, (32), 10 states have return successors, (28), 10 states have call predecessors, (28), 11 states have call successors, (28) [2022-07-19 22:12:55,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:12:55,713 INFO L93 Difference]: Finished difference Result 1034 states and 1367 transitions. [2022-07-19 22:12:55,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-07-19 22:12:55,713 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 27 states have (on average 3.5185185185185186) internal successors, (95), 25 states have internal predecessors, (95), 11 states have call successors, (32), 6 states have call predecessors, (32), 10 states have return successors, (28), 10 states have call predecessors, (28), 11 states have call successors, (28) Word has length 194 [2022-07-19 22:12:55,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:12:55,715 INFO L225 Difference]: With dead ends: 1034 [2022-07-19 22:12:55,715 INFO L226 Difference]: Without dead ends: 530 [2022-07-19 22:12:55,717 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 221 SyntacticMatches, 5 SemanticMatches, 48 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 783 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=167, Invalid=2188, Unknown=1, NotChecked=94, Total=2450 [2022-07-19 22:12:55,717 INFO L413 NwaCegarLoop]: 435 mSDtfsCounter, 19 mSDsluCounter, 5466 mSDsCounter, 0 mSdLazyCounter, 585 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 5901 SdHoareTripleChecker+Invalid, 3311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 585 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2724 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-07-19 22:12:55,717 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 5901 Invalid, 3311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 585 Invalid, 0 Unknown, 2724 Unchecked, 1.7s Time] [2022-07-19 22:12:55,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2022-07-19 22:12:55,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 528. [2022-07-19 22:12:55,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 528 states, 350 states have (on average 1.22) internal successors, (427), 355 states have internal predecessors, (427), 125 states have call successors, (125), 48 states have call predecessors, (125), 52 states have return successors, (144), 124 states have call predecessors, (144), 123 states have call successors, (144) [2022-07-19 22:12:55,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 696 transitions. [2022-07-19 22:12:55,772 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 696 transitions. Word has length 194 [2022-07-19 22:12:55,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:12:55,772 INFO L495 AbstractCegarLoop]: Abstraction has 528 states and 696 transitions. [2022-07-19 22:12:55,772 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 27 states have (on average 3.5185185185185186) internal successors, (95), 25 states have internal predecessors, (95), 11 states have call successors, (32), 6 states have call predecessors, (32), 10 states have return successors, (28), 10 states have call predecessors, (28), 11 states have call successors, (28) [2022-07-19 22:12:55,772 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 696 transitions. [2022-07-19 22:12:55,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2022-07-19 22:12:55,773 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:12:55,773 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 5, 5, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:55,889 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-19 22:12:55,995 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 22:12:55,996 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:12:55,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:12:55,996 INFO L85 PathProgramCache]: Analyzing trace with hash 554039209, now seen corresponding path program 1 times [2022-07-19 22:12:55,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:12:55,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120351410] [2022-07-19 22:12:55,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:12:55,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:12:56,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:56,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:12:56,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:56,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 22:12:56,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:56,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 22:12:56,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:56,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 22:12:56,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:56,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-19 22:12:56,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:56,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:12:56,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:56,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:12:56,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:56,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 22:12:56,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:56,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-19 22:12:56,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:56,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:12:56,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:56,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-19 22:12:56,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:56,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-19 22:12:56,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:56,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:12:56,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:56,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-19 22:12:56,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:56,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 22:12:56,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:56,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:12:56,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:56,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-19 22:12:56,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:56,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-19 22:12:56,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:56,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-19 22:12:56,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:56,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-19 22:12:56,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:56,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-19 22:12:56,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:56,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-19 22:12:56,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:56,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-19 22:12:56,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:56,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:12:56,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:56,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:12:56,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:56,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-19 22:12:56,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:56,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2022-07-19 22:12:56,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:56,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:12:56,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:56,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2022-07-19 22:12:56,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:56,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2022-07-19 22:12:56,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:56,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2022-07-19 22:12:56,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:56,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:12:56,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:56,378 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 249 trivial. 0 not checked. [2022-07-19 22:12:56,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:12:56,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120351410] [2022-07-19 22:12:56,379 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120351410] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:12:56,379 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 22:12:56,379 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-19 22:12:56,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501867372] [2022-07-19 22:12:56,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:12:56,381 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-19 22:12:56,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:12:56,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-19 22:12:56,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-07-19 22:12:56,382 INFO L87 Difference]: Start difference. First operand 528 states and 696 transitions. Second operand has 10 states, 10 states have (on average 8.3) internal successors, (83), 6 states have internal predecessors, (83), 2 states have call successors, (33), 5 states have call predecessors, (33), 4 states have return successors, (29), 4 states have call predecessors, (29), 2 states have call successors, (29) [2022-07-19 22:12:58,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:12:58,271 INFO L93 Difference]: Finished difference Result 1126 states and 1527 transitions. [2022-07-19 22:12:58,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-19 22:12:58,271 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.3) internal successors, (83), 6 states have internal predecessors, (83), 2 states have call successors, (33), 5 states have call predecessors, (33), 4 states have return successors, (29), 4 states have call predecessors, (29), 2 states have call successors, (29) Word has length 200 [2022-07-19 22:12:58,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:12:58,274 INFO L225 Difference]: With dead ends: 1126 [2022-07-19 22:12:58,274 INFO L226 Difference]: Without dead ends: 637 [2022-07-19 22:12:58,276 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2022-07-19 22:12:58,276 INFO L413 NwaCegarLoop]: 419 mSDtfsCounter, 241 mSDsluCounter, 1449 mSDsCounter, 0 mSdLazyCounter, 1895 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 1868 SdHoareTripleChecker+Invalid, 2019 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 1895 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-07-19 22:12:58,277 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [289 Valid, 1868 Invalid, 2019 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 1895 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-07-19 22:12:58,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2022-07-19 22:12:58,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 533. [2022-07-19 22:12:58,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 533 states, 354 states have (on average 1.2175141242937852) internal successors, (431), 359 states have internal predecessors, (431), 125 states have call successors, (125), 48 states have call predecessors, (125), 53 states have return successors, (146), 125 states have call predecessors, (146), 123 states have call successors, (146) [2022-07-19 22:12:58,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 702 transitions. [2022-07-19 22:12:58,308 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 702 transitions. Word has length 200 [2022-07-19 22:12:58,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:12:58,308 INFO L495 AbstractCegarLoop]: Abstraction has 533 states and 702 transitions. [2022-07-19 22:12:58,309 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.3) internal successors, (83), 6 states have internal predecessors, (83), 2 states have call successors, (33), 5 states have call predecessors, (33), 4 states have return successors, (29), 4 states have call predecessors, (29), 2 states have call successors, (29) [2022-07-19 22:12:58,309 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 702 transitions. [2022-07-19 22:12:58,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2022-07-19 22:12:58,310 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:12:58,310 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 5, 5, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:58,310 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-19 22:12:58,310 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:12:58,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:12:58,311 INFO L85 PathProgramCache]: Analyzing trace with hash -769130113, now seen corresponding path program 1 times [2022-07-19 22:12:58,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:12:58,311 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038823494] [2022-07-19 22:12:58,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:12:58,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:12:58,388 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-19 22:12:58,402 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1216784471] [2022-07-19 22:12:58,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:12:58,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 22:12:58,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 22:12:58,416 INFO L229 MonitoredProcess]: Starting monitored process 9 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:12:58,476 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-19 22:12:59,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:59,140 INFO L263 TraceCheckSpWp]: Trace formula consists of 2953 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-19 22:12:59,144 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 22:12:59,170 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 170 trivial. 0 not checked. [2022-07-19 22:12:59,171 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 22:12:59,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:12:59,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038823494] [2022-07-19 22:12:59,171 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-19 22:12:59,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1216784471] [2022-07-19 22:12:59,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1216784471] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:12:59,171 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 22:12:59,171 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-19 22:12:59,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14088145] [2022-07-19 22:12:59,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:12:59,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-19 22:12:59,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:12:59,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-19 22:12:59,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-19 22:12:59,172 INFO L87 Difference]: Start difference. First operand 533 states and 702 transitions. Second operand has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 6 states have internal predecessors, (90), 2 states have call successors, (33), 2 states have call predecessors, (33), 4 states have return successors, (29), 4 states have call predecessors, (29), 2 states have call successors, (29) [2022-07-19 22:12:59,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:12:59,194 INFO L93 Difference]: Finished difference Result 551 states and 719 transitions. [2022-07-19 22:12:59,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-19 22:12:59,195 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 6 states have internal predecessors, (90), 2 states have call successors, (33), 2 states have call predecessors, (33), 4 states have return successors, (29), 4 states have call predecessors, (29), 2 states have call successors, (29) Word has length 200 [2022-07-19 22:12:59,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:12:59,195 INFO L225 Difference]: With dead ends: 551 [2022-07-19 22:12:59,195 INFO L226 Difference]: Without dead ends: 0 [2022-07-19 22:12:59,197 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-19 22:12:59,197 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 2 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 22:12:59,197 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 301 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 22:12:59,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-07-19 22:12:59,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-07-19 22:12:59,198 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:12:59,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-07-19 22:12:59,198 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 200 [2022-07-19 22:12:59,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:12:59,198 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-19 22:12:59,198 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 6 states have internal predecessors, (90), 2 states have call successors, (33), 2 states have call predecessors, (33), 4 states have return successors, (29), 4 states have call predecessors, (29), 2 states have call successors, (29) [2022-07-19 22:12:59,198 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-07-19 22:12:59,198 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-07-19 22:12:59,200 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-19 22:12:59,226 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-19 22:12:59,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 22:12:59,421 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-07-19 22:13:01,018 INFO L902 garLoopResultBuilder]: At program point L7342(line 7342) the Hoare annotation is: true [2022-07-19 22:13:01,019 INFO L899 garLoopResultBuilder]: For program point uninterpreted_equalsFINAL(lines 7331 7345) no Hoare annotation was computed. [2022-07-19 22:13:01,019 INFO L899 garLoopResultBuilder]: For program point L7339-1(line 7339) no Hoare annotation was computed. [2022-07-19 22:13:01,019 INFO L902 garLoopResultBuilder]: At program point L7339(line 7339) the Hoare annotation is: true [2022-07-19 22:13:01,019 INFO L899 garLoopResultBuilder]: For program point L7342-3(line 7342) no Hoare annotation was computed. [2022-07-19 22:13:01,019 INFO L899 garLoopResultBuilder]: For program point L7341-2(lines 7341 7343) no Hoare annotation was computed. [2022-07-19 22:13:01,019 INFO L902 garLoopResultBuilder]: At program point L7342-2(line 7342) the Hoare annotation is: true [2022-07-19 22:13:01,019 INFO L899 garLoopResultBuilder]: For program point L7341(lines 7341 7343) no Hoare annotation was computed. [2022-07-19 22:13:01,019 INFO L902 garLoopResultBuilder]: At program point L7342-1(line 7342) the Hoare annotation is: true [2022-07-19 22:13:01,019 INFO L899 garLoopResultBuilder]: For program point uninterpreted_equalsEXIT(lines 7331 7345) no Hoare annotation was computed. [2022-07-19 22:13:01,019 INFO L899 garLoopResultBuilder]: For program point L7335-1(line 7335) no Hoare annotation was computed. [2022-07-19 22:13:01,019 INFO L902 garLoopResultBuilder]: At program point L7335(line 7335) the Hoare annotation is: true [2022-07-19 22:13:01,019 INFO L902 garLoopResultBuilder]: At program point L7337-1(line 7337) the Hoare annotation is: true [2022-07-19 22:13:01,019 INFO L902 garLoopResultBuilder]: At program point uninterpreted_equalsENTRY(lines 7331 7345) the Hoare annotation is: true [2022-07-19 22:13:01,019 INFO L902 garLoopResultBuilder]: At program point L7337(line 7337) the Hoare annotation is: true [2022-07-19 22:13:01,019 INFO L899 garLoopResultBuilder]: For program point L6944-1(lines 6944 6946) no Hoare annotation was computed. [2022-07-19 22:13:01,019 INFO L895 garLoopResultBuilder]: At program point L6944(lines 6944 6946) the Hoare annotation is: (or (not (< 0 |#StackHeapBarrier|)) (forall ((|aux_div_v_ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1_BEFORE_CALL_5_104| Int) (|aux_mod_v_ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1_BEFORE_CALL_5_104| Int) (|v_ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base_BEFORE_CALL_3| Int)) (or (not (<= 0 |aux_mod_v_ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1_BEFORE_CALL_5_104|)) (not (<= |aux_mod_v_ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1_BEFORE_CALL_5_104| 4)) (not (= (+ (* |aux_div_v_ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1_BEFORE_CALL_5_104| 442721857769029238784) (* |aux_mod_v_ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1_BEFORE_CALL_5_104| 24)) (+ 29629528 (select (select |#memory_int| |v_ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base_BEFORE_CALL_3|) 0)))))) (and (= |bounded_malloc_#in~size| bounded_malloc_~size) (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))) [2022-07-19 22:13:01,019 INFO L895 garLoopResultBuilder]: At program point bounded_mallocENTRY(lines 6943 6948) the Hoare annotation is: (or (not (< 0 |#StackHeapBarrier|)) (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) (forall ((|aux_div_v_ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1_BEFORE_CALL_5_104| Int) (|aux_mod_v_ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1_BEFORE_CALL_5_104| Int) (|v_ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base_BEFORE_CALL_3| Int)) (or (not (<= 0 |aux_mod_v_ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1_BEFORE_CALL_5_104|)) (not (<= |aux_mod_v_ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1_BEFORE_CALL_5_104| 4)) (not (= (+ (* |aux_div_v_ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1_BEFORE_CALL_5_104| 442721857769029238784) (* |aux_mod_v_ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1_BEFORE_CALL_5_104| 24)) (+ 29629528 (select (select |#memory_int| |v_ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base_BEFORE_CALL_3|) 0))))))) [2022-07-19 22:13:01,019 INFO L899 garLoopResultBuilder]: For program point bounded_mallocFINAL(lines 6943 6948) no Hoare annotation was computed. [2022-07-19 22:13:01,020 INFO L899 garLoopResultBuilder]: For program point bounded_mallocEXIT(lines 6943 6948) no Hoare annotation was computed. [2022-07-19 22:13:01,020 INFO L902 garLoopResultBuilder]: At program point __CPROVER_uninterpreted_equalsENTRY(line 239) the Hoare annotation is: true [2022-07-19 22:13:01,020 INFO L899 garLoopResultBuilder]: For program point __CPROVER_uninterpreted_equalsFINAL(line 239) no Hoare annotation was computed. [2022-07-19 22:13:01,020 INFO L899 garLoopResultBuilder]: For program point __CPROVER_uninterpreted_equalsEXIT(line 239) no Hoare annotation was computed. [2022-07-19 22:13:01,020 INFO L899 garLoopResultBuilder]: For program point __CPROVER_uninterpreted_hasherEXIT(line 238) no Hoare annotation was computed. [2022-07-19 22:13:01,020 INFO L902 garLoopResultBuilder]: At program point __CPROVER_uninterpreted_hasherENTRY(line 238) the Hoare annotation is: true [2022-07-19 22:13:01,020 INFO L899 garLoopResultBuilder]: For program point __CPROVER_uninterpreted_hasherFINAL(line 238) no Hoare annotation was computed. [2022-07-19 22:13:01,020 INFO L899 garLoopResultBuilder]: For program point L10008-3(line 10008) no Hoare annotation was computed. [2022-07-19 22:13:01,020 INFO L902 garLoopResultBuilder]: At program point L10008-4(line 10008) the Hoare annotation is: true [2022-07-19 22:13:01,020 INFO L899 garLoopResultBuilder]: For program point L10008-5(line 10008) no Hoare annotation was computed. [2022-07-19 22:13:01,020 INFO L902 garLoopResultBuilder]: At program point aws_hash_table_is_validENTRY(lines 10006 10009) the Hoare annotation is: true [2022-07-19 22:13:01,020 INFO L899 garLoopResultBuilder]: For program point L10008(line 10008) no Hoare annotation was computed. [2022-07-19 22:13:01,020 INFO L899 garLoopResultBuilder]: For program point L10008-2(line 10008) no Hoare annotation was computed. [2022-07-19 22:13:01,020 INFO L899 garLoopResultBuilder]: For program point L10008-7(line 10008) no Hoare annotation was computed. [2022-07-19 22:13:01,020 INFO L899 garLoopResultBuilder]: For program point aws_hash_table_is_validEXIT(lines 10006 10009) no Hoare annotation was computed. [2022-07-19 22:13:01,020 INFO L899 garLoopResultBuilder]: For program point aws_hash_table_is_validFINAL(lines 10006 10009) no Hoare annotation was computed. [2022-07-19 22:13:01,020 INFO L899 garLoopResultBuilder]: For program point nondet_boolFINAL(line 261) no Hoare annotation was computed. [2022-07-19 22:13:01,020 INFO L899 garLoopResultBuilder]: For program point nondet_boolEXIT(line 261) no Hoare annotation was computed. [2022-07-19 22:13:01,020 INFO L902 garLoopResultBuilder]: At program point nondet_boolENTRY(line 261) the Hoare annotation is: true [2022-07-19 22:13:01,020 INFO L899 garLoopResultBuilder]: For program point L7130(lines 7130 7134) no Hoare annotation was computed. [2022-07-19 22:13:01,020 INFO L899 garLoopResultBuilder]: For program point aws_mem_releaseEXIT(lines 7122 7135) no Hoare annotation was computed. [2022-07-19 22:13:01,020 INFO L902 garLoopResultBuilder]: At program point L7126(lines 7126 7128) the Hoare annotation is: true [2022-07-19 22:13:01,021 INFO L902 garLoopResultBuilder]: At program point aws_mem_releaseENTRY(lines 7122 7135) the Hoare annotation is: true [2022-07-19 22:13:01,021 INFO L899 garLoopResultBuilder]: For program point L7130-2(lines 7122 7135) no Hoare annotation was computed. [2022-07-19 22:13:01,021 INFO L899 garLoopResultBuilder]: For program point L7123-1(lines 7123 7125) no Hoare annotation was computed. [2022-07-19 22:13:01,021 INFO L902 garLoopResultBuilder]: At program point L7123(lines 7123 7125) the Hoare annotation is: true [2022-07-19 22:13:01,021 INFO L899 garLoopResultBuilder]: For program point L7126-1(lines 7126 7128) no Hoare annotation was computed. [2022-07-19 22:13:01,021 INFO L895 garLoopResultBuilder]: At program point hash_table_state_required_bytesENTRY(lines 10119 10131) the Hoare annotation is: (or (not (< 0 |#StackHeapBarrier|)) (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)|) (= ~tl_last_error~0 |old(~tl_last_error~0)|) (= |old(#valid)| |#valid|))) [2022-07-19 22:13:01,021 INFO L899 garLoopResultBuilder]: For program point hash_table_state_required_bytesEXIT(lines 10119 10131) no Hoare annotation was computed. [2022-07-19 22:13:01,021 INFO L899 garLoopResultBuilder]: For program point L10126-1(line 10126) no Hoare annotation was computed. [2022-07-19 22:13:01,021 INFO L899 garLoopResultBuilder]: For program point L10126-2(lines 10126 10128) no Hoare annotation was computed. [2022-07-19 22:13:01,021 INFO L895 garLoopResultBuilder]: At program point L10122(line 10122) the Hoare annotation is: (or (and (= |old(#memory_real)| |#memory_real|) (= |#memory_int| |old(#memory_int)|) (= hash_table_state_required_bytes_~required_bytes.offset |hash_table_state_required_bytes_#in~required_bytes.offset|) (= (select |old(#valid)| |hash_table_state_required_bytes_~#elemsize~0.base|) 0) (= hash_table_state_required_bytes_~size |hash_table_state_required_bytes_#in~size|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (exists ((v_ArrVal_3300 Int)) (= (store |old(#valid)| |hash_table_state_required_bytes_~#elemsize~0.base| v_ArrVal_3300) |#valid|)) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ~tl_last_error~0 |old(~tl_last_error~0)|) (= hash_table_state_required_bytes_~required_bytes.base |hash_table_state_required_bytes_#in~required_bytes.base|) (= |hash_table_state_required_bytes_~#elemsize~0.offset| 0)) (not (< 0 |#StackHeapBarrier|))) [2022-07-19 22:13:01,021 INFO L895 garLoopResultBuilder]: At program point L10126(line 10126) the Hoare annotation is: (or (not (< 0 |#StackHeapBarrier|)) (and (= (* |hash_table_state_required_bytes_#in~size| 24) |hash_table_state_required_bytes_#t~mem1324|) (= hash_table_state_required_bytes_~required_bytes.offset |hash_table_state_required_bytes_#in~required_bytes.offset|) (= (select |old(#valid)| |hash_table_state_required_bytes_~#elemsize~0.base|) 0) (exists ((|v___CPROVER_overflow_mult_~#c~1.base_81| Int) (v_ArrVal_3300 Int) (v_ArrVal_3301 Int)) (let ((.cse0 (store |old(#valid)| |hash_table_state_required_bytes_~#elemsize~0.base| v_ArrVal_3300))) (and (= (store .cse0 |v___CPROVER_overflow_mult_~#c~1.base_81| v_ArrVal_3301) |#valid|) (= (select .cse0 |v___CPROVER_overflow_mult_~#c~1.base_81|) 0)))) (= ~tl_last_error~0 |old(~tl_last_error~0)|) (= hash_table_state_required_bytes_~required_bytes.base |hash_table_state_required_bytes_#in~required_bytes.base|))) [2022-07-19 22:13:01,021 INFO L899 garLoopResultBuilder]: For program point hash_table_state_required_bytesFINAL(lines 10119 10131) no Hoare annotation was computed. [2022-07-19 22:13:01,021 INFO L899 garLoopResultBuilder]: For program point L10122-1(line 10122) no Hoare annotation was computed. [2022-07-19 22:13:01,021 INFO L899 garLoopResultBuilder]: For program point L10122-2(lines 10122 10124) no Hoare annotation was computed. [2022-07-19 22:13:01,021 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-07-19 22:13:01,021 INFO L902 garLoopResultBuilder]: At program point L6940(lines 6934 6941) the Hoare annotation is: true [2022-07-19 22:13:01,021 INFO L902 garLoopResultBuilder]: At program point L6936-2(line 6936) the Hoare annotation is: true [2022-07-19 22:13:01,021 INFO L899 garLoopResultBuilder]: For program point L6936-1(line 6936) no Hoare annotation was computed. [2022-07-19 22:13:01,021 INFO L902 garLoopResultBuilder]: At program point L6936(line 6936) the Hoare annotation is: true [2022-07-19 22:13:01,021 INFO L899 garLoopResultBuilder]: For program point L6937-1(lines 6937 6939) no Hoare annotation was computed. [2022-07-19 22:13:01,021 INFO L902 garLoopResultBuilder]: At program point L6937(lines 6937 6939) the Hoare annotation is: true [2022-07-19 22:13:01,022 INFO L899 garLoopResultBuilder]: For program point L6936-3(line 6936) no Hoare annotation was computed. [2022-07-19 22:13:01,022 INFO L899 garLoopResultBuilder]: For program point can_fail_callocEXIT(lines 6954 6958) no Hoare annotation was computed. [2022-07-19 22:13:01,022 INFO L899 garLoopResultBuilder]: For program point L6955-1(lines 6955 6957) no Hoare annotation was computed. [2022-07-19 22:13:01,022 INFO L902 garLoopResultBuilder]: At program point can_fail_callocENTRY(lines 6954 6958) the Hoare annotation is: true [2022-07-19 22:13:01,022 INFO L902 garLoopResultBuilder]: At program point L6955(line 6955) the Hoare annotation is: true [2022-07-19 22:13:01,022 INFO L899 garLoopResultBuilder]: For program point can_fail_callocFINAL(lines 6954 6958) no Hoare annotation was computed. [2022-07-19 22:13:01,022 INFO L899 garLoopResultBuilder]: For program point L6955-3(lines 6955 6957) no Hoare annotation was computed. [2022-07-19 22:13:01,022 INFO L902 garLoopResultBuilder]: At program point L2657(lines 2637 2658) the Hoare annotation is: true [2022-07-19 22:13:01,022 INFO L899 garLoopResultBuilder]: For program point L9210(lines 9210 9212) no Hoare annotation was computed. [2022-07-19 22:13:01,022 INFO L899 garLoopResultBuilder]: For program point L9202(lines 9202 9204) no Hoare annotation was computed. [2022-07-19 22:13:01,022 INFO L899 garLoopResultBuilder]: For program point L9210-2(lines 9210 9212) no Hoare annotation was computed. [2022-07-19 22:13:01,022 INFO L899 garLoopResultBuilder]: For program point L2643-1(line 2643) no Hoare annotation was computed. [2022-07-19 22:13:01,022 INFO L902 garLoopResultBuilder]: At program point L2643(line 2643) the Hoare annotation is: true [2022-07-19 22:13:01,022 INFO L899 garLoopResultBuilder]: For program point L9196(lines 9196 9198) no Hoare annotation was computed. [2022-07-19 22:13:01,022 INFO L899 garLoopResultBuilder]: For program point L9196-2(lines 9196 9198) no Hoare annotation was computed. [2022-07-19 22:13:01,022 INFO L899 garLoopResultBuilder]: For program point L2642(lines 2642 2644) no Hoare annotation was computed. [2022-07-19 22:13:01,022 INFO L899 garLoopResultBuilder]: For program point L2638(lines 2638 2641) no Hoare annotation was computed. [2022-07-19 22:13:01,022 INFO L899 garLoopResultBuilder]: For program point s_update_template_sizeEXIT(lines 9193 9218) no Hoare annotation was computed. [2022-07-19 22:13:01,022 INFO L902 garLoopResultBuilder]: At program point s_update_template_sizeENTRY(lines 9193 9218) the Hoare annotation is: true [2022-07-19 22:13:01,022 INFO L899 garLoopResultBuilder]: For program point s_update_template_sizeFINAL(lines 9193 9218) no Hoare annotation was computed. [2022-07-19 22:13:01,022 INFO L899 garLoopResultBuilder]: For program point aws_allocator_is_validFINAL(lines 6984 6987) no Hoare annotation was computed. [2022-07-19 22:13:01,022 INFO L902 garLoopResultBuilder]: At program point L6986(line 6986) the Hoare annotation is: true [2022-07-19 22:13:01,022 INFO L902 garLoopResultBuilder]: At program point aws_allocator_is_validENTRY(lines 6984 6987) the Hoare annotation is: true [2022-07-19 22:13:01,023 INFO L899 garLoopResultBuilder]: For program point L6986-1(line 6986) no Hoare annotation was computed. [2022-07-19 22:13:01,023 INFO L899 garLoopResultBuilder]: For program point aws_allocator_is_validEXIT(lines 6984 6987) no Hoare annotation was computed. [2022-07-19 22:13:01,023 INFO L902 garLoopResultBuilder]: At program point L9150-1(line 9150) the Hoare annotation is: true [2022-07-19 22:13:01,023 INFO L902 garLoopResultBuilder]: At program point s_hash_keys_eqENTRY(lines 9147 9155) the Hoare annotation is: true [2022-07-19 22:13:01,023 INFO L899 garLoopResultBuilder]: For program point L9150-2(line 9150) no Hoare annotation was computed. [2022-07-19 22:13:01,023 INFO L899 garLoopResultBuilder]: For program point s_hash_keys_eqEXIT(lines 9147 9155) no Hoare annotation was computed. [2022-07-19 22:13:01,023 INFO L902 garLoopResultBuilder]: At program point L9153(line 9153) the Hoare annotation is: true [2022-07-19 22:13:01,023 INFO L902 garLoopResultBuilder]: At program point L9154-1(line 9154) the Hoare annotation is: true [2022-07-19 22:13:01,023 INFO L899 garLoopResultBuilder]: For program point L9153-1(line 9153) no Hoare annotation was computed. [2022-07-19 22:13:01,023 INFO L899 garLoopResultBuilder]: For program point L9154-2(line 9154) no Hoare annotation was computed. [2022-07-19 22:13:01,023 INFO L902 garLoopResultBuilder]: At program point L9154-3(line 9154) the Hoare annotation is: true [2022-07-19 22:13:01,023 INFO L902 garLoopResultBuilder]: At program point L9150(line 9150) the Hoare annotation is: true [2022-07-19 22:13:01,023 INFO L899 garLoopResultBuilder]: For program point L9154-4(lines 9147 9155) no Hoare annotation was computed. [2022-07-19 22:13:01,023 INFO L899 garLoopResultBuilder]: For program point aws_mul_size_checkedEXIT(lines 2586 2594) no Hoare annotation was computed. [2022-07-19 22:13:01,023 INFO L899 garLoopResultBuilder]: For program point L2498-1(lines 2498 2499) no Hoare annotation was computed. [2022-07-19 22:13:01,023 INFO L899 garLoopResultBuilder]: For program point aws_mul_size_checkedFINAL(lines 2586 2594) no Hoare annotation was computed. [2022-07-19 22:13:01,023 INFO L895 garLoopResultBuilder]: At program point aws_mul_size_checkedENTRY(lines 2586 2594) the Hoare annotation is: (or (not (< 0 |#StackHeapBarrier|)) (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)|) (= ~tl_last_error~0 |old(~tl_last_error~0)|) (= |old(#valid)| |#valid|))) [2022-07-19 22:13:01,023 INFO L895 garLoopResultBuilder]: At program point L2501(lines 2497 2502) the Hoare annotation is: (or (and (= |old(#memory_real)| |#memory_real|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (<= (+ |aws_mul_size_checked_aws_mul_u64_checked_#res#1| 1) 0)) (not (< 0 |#StackHeapBarrier|)) (and (= (* |aws_mul_size_checked_#in~b#1| |aws_mul_size_checked_#in~a#1|) (select (select |#memory_int| |aws_mul_size_checked_#in~r#1.base|) |aws_mul_size_checked_#in~r#1.offset|)) (= ~tl_last_error~0 |old(~tl_last_error~0)|) (exists ((|v___CPROVER_overflow_mult_~#c~1.base_81| Int) (v_ArrVal_3301 Int)) (and (= (store |old(#valid)| |v___CPROVER_overflow_mult_~#c~1.base_81| v_ArrVal_3301) |#valid|) (= (select |old(#valid)| |v___CPROVER_overflow_mult_~#c~1.base_81|) 0))) (= |aws_mul_size_checked_aws_mul_u64_checked_#res#1| 0))) [2022-07-19 22:13:01,023 INFO L895 garLoopResultBuilder]: At program point L2498(line 2498) the Hoare annotation is: (or (not (< 0 |#StackHeapBarrier|)) (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)|) (= |aws_mul_size_checked_aws_mul_u64_checked_~r#1.base| |aws_mul_size_checked_#in~r#1.base|) (= ~tl_last_error~0 |old(~tl_last_error~0)|) (= |aws_mul_size_checked_#in~a#1| |aws_mul_size_checked_aws_mul_u64_checked_~a#1|) (= |aws_mul_size_checked_#in~b#1| |aws_mul_size_checked_aws_mul_u64_checked_~b#1|) (= |old(#valid)| |#valid|) (= |aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset| |aws_mul_size_checked_#in~r#1.offset|))) [2022-07-19 22:13:01,023 INFO L899 garLoopResultBuilder]: For program point L2499-1(line 2499) no Hoare annotation was computed. [2022-07-19 22:13:01,024 INFO L895 garLoopResultBuilder]: At program point L2499(line 2499) the Hoare annotation is: (or (not (< 0 |#StackHeapBarrier|)) (and (= |old(#memory_real)| |#memory_real|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ~tl_last_error~0 |old(~tl_last_error~0)|))) [2022-07-19 22:13:01,024 INFO L899 garLoopResultBuilder]: For program point nondet_uint64_tEXIT(line 266) no Hoare annotation was computed. [2022-07-19 22:13:01,024 INFO L902 garLoopResultBuilder]: At program point nondet_uint64_tENTRY(line 266) the Hoare annotation is: true [2022-07-19 22:13:01,024 INFO L899 garLoopResultBuilder]: For program point nondet_uint64_tFINAL(line 266) no Hoare annotation was computed. [2022-07-19 22:13:01,024 INFO L899 garLoopResultBuilder]: For program point L9115(line 9115) no Hoare annotation was computed. [2022-07-19 22:13:01,024 INFO L902 garLoopResultBuilder]: At program point L9115-1(lines 9100 9116) the Hoare annotation is: true [2022-07-19 22:13:01,024 INFO L899 garLoopResultBuilder]: For program point L9115-2(lines 9100 9116) no Hoare annotation was computed. [2022-07-19 22:13:01,024 INFO L902 garLoopResultBuilder]: At program point L9101(line 9101) the Hoare annotation is: true [2022-07-19 22:13:01,024 INFO L902 garLoopResultBuilder]: At program point L9101-1(line 9101) the Hoare annotation is: true [2022-07-19 22:13:01,024 INFO L899 garLoopResultBuilder]: For program point L9101-2(line 9101) no Hoare annotation was computed. [2022-07-19 22:13:01,024 INFO L902 garLoopResultBuilder]: At program point L7373-1(lines 7369 7374) the Hoare annotation is: true [2022-07-19 22:13:01,024 INFO L899 garLoopResultBuilder]: For program point L7373(line 7373) no Hoare annotation was computed. [2022-07-19 22:13:01,024 INFO L899 garLoopResultBuilder]: For program point L9085(lines 9085 9093) no Hoare annotation was computed. [2022-07-19 22:13:01,024 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-07-19 22:13:01,024 INFO L899 garLoopResultBuilder]: For program point L9112(lines 9112 9114) no Hoare annotation was computed. [2022-07-19 22:13:01,024 INFO L902 garLoopResultBuilder]: At program point s_hash_forENTRY(lines 9100 9116) the Hoare annotation is: true [2022-07-19 22:13:01,024 INFO L902 garLoopResultBuilder]: At program point L7370(lines 7370 7372) the Hoare annotation is: true [2022-07-19 22:13:01,024 INFO L899 garLoopResultBuilder]: For program point L9104(lines 9104 9109) no Hoare annotation was computed. [2022-07-19 22:13:01,024 INFO L899 garLoopResultBuilder]: For program point s_hash_forEXIT(lines 9100 9116) no Hoare annotation was computed. [2022-07-19 22:13:01,024 INFO L902 garLoopResultBuilder]: At program point L7370-1(lines 7370 7372) the Hoare annotation is: true [2022-07-19 22:13:01,024 INFO L895 garLoopResultBuilder]: At program point __CPROVER_overflow_plusENTRY(lines 248 251) the Hoare annotation is: (or (not (< 0 |#StackHeapBarrier|)) (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))) [2022-07-19 22:13:01,025 INFO L899 garLoopResultBuilder]: For program point __CPROVER_overflow_plusFINAL(lines 248 251) no Hoare annotation was computed. [2022-07-19 22:13:01,025 INFO L899 garLoopResultBuilder]: For program point __CPROVER_overflow_plusEXIT(lines 248 251) no Hoare annotation was computed. [2022-07-19 22:13:01,025 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-07-19 22:13:01,025 INFO L899 garLoopResultBuilder]: For program point L-1-2(line -1) no Hoare annotation was computed. [2022-07-19 22:13:01,025 INFO L902 garLoopResultBuilder]: At program point L7356-1(lines 7348 7357) the Hoare annotation is: true [2022-07-19 22:13:01,025 INFO L899 garLoopResultBuilder]: For program point L7356(line 7356) no Hoare annotation was computed. [2022-07-19 22:13:01,025 INFO L902 garLoopResultBuilder]: At program point L7350(lines 7350 7352) the Hoare annotation is: true [2022-07-19 22:13:01,025 INFO L902 garLoopResultBuilder]: At program point L7287(lines 7280 7288) the Hoare annotation is: true [2022-07-19 22:13:01,025 INFO L902 garLoopResultBuilder]: At program point L7353(lines 7353 7355) the Hoare annotation is: true [2022-07-19 22:13:01,025 INFO L899 garLoopResultBuilder]: For program point ##fun~$Pointer$~X~$Pointer$~TO~intFINAL(line -1) no Hoare annotation was computed. [2022-07-19 22:13:01,025 INFO L899 garLoopResultBuilder]: For program point L7284(lines 7284 7286) no Hoare annotation was computed. [2022-07-19 22:13:01,025 INFO L902 garLoopResultBuilder]: At program point L7350-1(lines 7350 7352) the Hoare annotation is: true [2022-07-19 22:13:01,025 INFO L902 garLoopResultBuilder]: At program point L7281-1(lines 7281 7283) the Hoare annotation is: true [2022-07-19 22:13:01,025 INFO L902 garLoopResultBuilder]: At program point L7281(lines 7281 7283) the Hoare annotation is: true [2022-07-19 22:13:01,025 INFO L899 garLoopResultBuilder]: For program point ##fun~$Pointer$~X~$Pointer$~TO~intEXIT(line -1) no Hoare annotation was computed. [2022-07-19 22:13:01,025 INFO L902 garLoopResultBuilder]: At program point L262(line 262) the Hoare annotation is: true [2022-07-19 22:13:01,025 INFO L902 garLoopResultBuilder]: At program point ##fun~$Pointer$~X~$Pointer$~TO~intENTRY(line -1) the Hoare annotation is: true [2022-07-19 22:13:01,025 INFO L899 garLoopResultBuilder]: For program point aws_hash_table_createEXIT(lines 9516 9580) no Hoare annotation was computed. [2022-07-19 22:13:01,025 INFO L899 garLoopResultBuilder]: For program point L9533(lines 9533 9539) no Hoare annotation was computed. [2022-07-19 22:13:01,025 INFO L899 garLoopResultBuilder]: For program point L9504(lines 9504 9507) no Hoare annotation was computed. [2022-07-19 22:13:01,025 INFO L899 garLoopResultBuilder]: For program point L9546(lines 9546 9561) no Hoare annotation was computed. [2022-07-19 22:13:01,025 INFO L902 garLoopResultBuilder]: At program point L9571(line 9571) the Hoare annotation is: true [2022-07-19 22:13:01,025 INFO L899 garLoopResultBuilder]: For program point L9571-1(line 9571) no Hoare annotation was computed. [2022-07-19 22:13:01,026 INFO L902 garLoopResultBuilder]: At program point L9513(lines 9484 9514) the Hoare annotation is: true [2022-07-19 22:13:01,026 INFO L899 garLoopResultBuilder]: For program point L9546-2(lines 9546 9561) no Hoare annotation was computed. [2022-07-19 22:13:01,026 INFO L899 garLoopResultBuilder]: For program point L9534-2(lines 9534 9536) no Hoare annotation was computed. [2022-07-19 22:13:01,026 INFO L899 garLoopResultBuilder]: For program point L9534(lines 9534 9536) no Hoare annotation was computed. [2022-07-19 22:13:01,026 INFO L902 garLoopResultBuilder]: At program point L9493(line 9493) the Hoare annotation is: true [2022-07-19 22:13:01,026 INFO L899 garLoopResultBuilder]: For program point L9493-1(line 9493) no Hoare annotation was computed. [2022-07-19 22:13:01,026 INFO L899 garLoopResultBuilder]: For program point L9493-2(lines 9493 9495) no Hoare annotation was computed. [2022-07-19 22:13:01,026 INFO L902 garLoopResultBuilder]: At program point L9497(line 9497) the Hoare annotation is: true [2022-07-19 22:13:01,026 INFO L899 garLoopResultBuilder]: For program point L9497-1(line 9497) no Hoare annotation was computed. [2022-07-19 22:13:01,026 INFO L902 garLoopResultBuilder]: At program point L9489(line 9489) the Hoare annotation is: true [2022-07-19 22:13:01,026 INFO L899 garLoopResultBuilder]: For program point L9489-1(line 9489) no Hoare annotation was computed. [2022-07-19 22:13:01,026 INFO L899 garLoopResultBuilder]: For program point L9489-2(lines 9489 9491) no Hoare annotation was computed. [2022-07-19 22:13:01,026 INFO L899 garLoopResultBuilder]: For program point L9543-2(lines 9543 9545) no Hoare annotation was computed. [2022-07-19 22:13:01,026 INFO L902 garLoopResultBuilder]: At program point L9506(line 9506) the Hoare annotation is: true [2022-07-19 22:13:01,026 INFO L902 garLoopResultBuilder]: At program point L9543(line 9543) the Hoare annotation is: true [2022-07-19 22:13:01,026 INFO L899 garLoopResultBuilder]: For program point L9543-1(line 9543) no Hoare annotation was computed. [2022-07-19 22:13:01,026 INFO L899 garLoopResultBuilder]: For program point L9502-1(lines 9502 9508) no Hoare annotation was computed. [2022-07-19 22:13:01,026 INFO L899 garLoopResultBuilder]: For program point L9531(line 9531) no Hoare annotation was computed. [2022-07-19 22:13:01,026 INFO L899 garLoopResultBuilder]: For program point L9502-3(lines 9502 9508) no Hoare annotation was computed. [2022-07-19 22:13:01,026 INFO L899 garLoopResultBuilder]: For program point L9498(lines 9498 9500) no Hoare annotation was computed. [2022-07-19 22:13:01,026 INFO L902 garLoopResultBuilder]: At program point L9502-4(lines 9502 9508) the Hoare annotation is: true [2022-07-19 22:13:01,026 INFO L899 garLoopResultBuilder]: For program point L9506-1(line 9506) no Hoare annotation was computed. [2022-07-19 22:13:01,026 INFO L902 garLoopResultBuilder]: At program point aws_hash_table_createENTRY(lines 9516 9580) the Hoare annotation is: true [2022-07-19 22:13:01,027 INFO L899 garLoopResultBuilder]: For program point aws_hash_table_createFINAL(lines 9516 9580) no Hoare annotation was computed. [2022-07-19 22:13:01,027 INFO L902 garLoopResultBuilder]: At program point L9527-2(lines 9527 9529) the Hoare annotation is: true [2022-07-19 22:13:01,027 INFO L902 garLoopResultBuilder]: At program point L9523(line 9523) the Hoare annotation is: true [2022-07-19 22:13:01,027 INFO L899 garLoopResultBuilder]: For program point L9523-1(line 9523) no Hoare annotation was computed. [2022-07-19 22:13:01,027 INFO L899 garLoopResultBuilder]: For program point L9502-5(lines 9502 9508) no Hoare annotation was computed. [2022-07-19 22:13:01,027 INFO L899 garLoopResultBuilder]: For program point L9527(lines 9527 9529) no Hoare annotation was computed. [2022-07-19 22:13:01,027 INFO L899 garLoopResultBuilder]: For program point L9548(lines 9548 9551) no Hoare annotation was computed. [2022-07-19 22:13:01,027 INFO L899 garLoopResultBuilder]: For program point L9573(lines 9573 9575) no Hoare annotation was computed. [2022-07-19 22:13:01,027 INFO L899 garLoopResultBuilder]: For program point L9573-2(lines 9573 9575) no Hoare annotation was computed. [2022-07-19 22:13:01,027 INFO L902 garLoopResultBuilder]: At program point L9511(line 9511) the Hoare annotation is: true [2022-07-19 22:13:01,027 INFO L899 garLoopResultBuilder]: For program point L9511-1(line 9511) no Hoare annotation was computed. [2022-07-19 22:13:01,027 INFO L902 garLoopResultBuilder]: At program point hash_table_state_is_validENTRY(lines 10017 10064) the Hoare annotation is: true [2022-07-19 22:13:01,027 INFO L902 garLoopResultBuilder]: At program point L10045(line 10045) the Hoare annotation is: true [2022-07-19 22:13:01,027 INFO L899 garLoopResultBuilder]: For program point L10045-1(line 10045) no Hoare annotation was computed. [2022-07-19 22:13:01,027 INFO L899 garLoopResultBuilder]: For program point hash_table_state_is_validEXIT(lines 10017 10064) no Hoare annotation was computed. [2022-07-19 22:13:01,027 INFO L899 garLoopResultBuilder]: For program point hash_table_state_is_validFINAL(lines 10017 10064) no Hoare annotation was computed. [2022-07-19 22:13:01,027 INFO L899 garLoopResultBuilder]: For program point L10019(lines 10019 10023) no Hoare annotation was computed. [2022-07-19 22:13:01,027 INFO L899 garLoopResultBuilder]: For program point L9131(lines 9131 9139) no Hoare annotation was computed. [2022-07-19 22:13:01,027 INFO L902 garLoopResultBuilder]: At program point s_safe_eq_checkENTRY(lines 9121 9142) the Hoare annotation is: true [2022-07-19 22:13:01,027 INFO L899 garLoopResultBuilder]: For program point L9125(lines 9125 9129) no Hoare annotation was computed. [2022-07-19 22:13:01,027 INFO L902 garLoopResultBuilder]: At program point L9141(line 9141) the Hoare annotation is: true [2022-07-19 22:13:01,027 INFO L899 garLoopResultBuilder]: For program point L9141-1(line 9141) no Hoare annotation was computed. [2022-07-19 22:13:01,028 INFO L899 garLoopResultBuilder]: For program point s_safe_eq_checkFINAL(lines 9121 9142) no Hoare annotation was computed. [2022-07-19 22:13:01,028 INFO L899 garLoopResultBuilder]: For program point s_safe_eq_checkEXIT(lines 9121 9142) no Hoare annotation was computed. [2022-07-19 22:13:01,028 INFO L902 garLoopResultBuilder]: At program point L9173(line 9173) the Hoare annotation is: true [2022-07-19 22:13:01,028 INFO L899 garLoopResultBuilder]: For program point L9173-1(line 9173) no Hoare annotation was computed. [2022-07-19 22:13:01,028 INFO L899 garLoopResultBuilder]: For program point L9173-2(lines 9173 9177) no Hoare annotation was computed. [2022-07-19 22:13:01,028 INFO L902 garLoopResultBuilder]: At program point s_alloc_stateENTRY(lines 9171 9190) the Hoare annotation is: true [2022-07-19 22:13:01,028 INFO L902 garLoopResultBuilder]: At program point L7018(line 7018) the Hoare annotation is: true [2022-07-19 22:13:01,028 INFO L902 garLoopResultBuilder]: At program point L7020(lines 7001 7021) the Hoare annotation is: true [2022-07-19 22:13:01,028 INFO L899 garLoopResultBuilder]: For program point L7016-1(line 7016) no Hoare annotation was computed. [2022-07-19 22:13:01,028 INFO L902 garLoopResultBuilder]: At program point L7016(line 7016) the Hoare annotation is: true [2022-07-19 22:13:01,028 INFO L899 garLoopResultBuilder]: For program point L7018-1(line 7018) no Hoare annotation was computed. [2022-07-19 22:13:01,028 INFO L902 garLoopResultBuilder]: At program point L7010(line 7010) the Hoare annotation is: true [2022-07-19 22:13:01,028 INFO L899 garLoopResultBuilder]: For program point L7010-2(lines 7010 7014) no Hoare annotation was computed. [2022-07-19 22:13:01,028 INFO L899 garLoopResultBuilder]: For program point s_alloc_stateEXIT(lines 9171 9190) no Hoare annotation was computed. [2022-07-19 22:13:01,028 INFO L899 garLoopResultBuilder]: For program point L7010-1(line 7010) no Hoare annotation was computed. [2022-07-19 22:13:01,028 INFO L902 garLoopResultBuilder]: At program point L7002(line 7002) the Hoare annotation is: true [2022-07-19 22:13:01,028 INFO L899 garLoopResultBuilder]: For program point L7004-1(line 7004) no Hoare annotation was computed. [2022-07-19 22:13:01,028 INFO L902 garLoopResultBuilder]: At program point L7004(line 7004) the Hoare annotation is: true [2022-07-19 22:13:01,028 INFO L899 garLoopResultBuilder]: For program point L9182(lines 9182 9186) no Hoare annotation was computed. [2022-07-19 22:13:01,028 INFO L899 garLoopResultBuilder]: For program point L7002-2(line 7002) no Hoare annotation was computed. [2022-07-19 22:13:01,028 INFO L902 garLoopResultBuilder]: At program point L7002-1(line 7002) the Hoare annotation is: true [2022-07-19 22:13:01,028 INFO L899 garLoopResultBuilder]: For program point L7017-2(lines 7017 7019) no Hoare annotation was computed. [2022-07-19 22:13:01,028 INFO L899 garLoopResultBuilder]: For program point L7017(lines 7017 7019) no Hoare annotation was computed. [2022-07-19 22:13:01,028 INFO L899 garLoopResultBuilder]: For program point s_alloc_stateFINAL(lines 9171 9190) no Hoare annotation was computed. [2022-07-19 22:13:01,029 INFO L902 garLoopResultBuilder]: At program point L9437-1(line 9437) the Hoare annotation is: true [2022-07-19 22:13:01,029 INFO L899 garLoopResultBuilder]: For program point L9437-2(line 9437) no Hoare annotation was computed. [2022-07-19 22:13:01,029 INFO L902 garLoopResultBuilder]: At program point L9437-3(lines 9437 9439) the Hoare annotation is: true [2022-07-19 22:13:01,029 INFO L902 garLoopResultBuilder]: At program point L9478-5(lines 9433 9482) the Hoare annotation is: true [2022-07-19 22:13:01,029 INFO L899 garLoopResultBuilder]: For program point L9478-6(lines 9478 9481) no Hoare annotation was computed. [2022-07-19 22:13:01,029 INFO L902 garLoopResultBuilder]: At program point L9462-2(lines 9448 9476) the Hoare annotation is: true [2022-07-19 22:13:01,029 INFO L899 garLoopResultBuilder]: For program point L9462(lines 9462 9475) no Hoare annotation was computed. [2022-07-19 22:13:01,029 INFO L902 garLoopResultBuilder]: At program point s_emplace_itemENTRY(lines 9430 9482) the Hoare annotation is: true [2022-07-19 22:13:01,029 INFO L899 garLoopResultBuilder]: For program point s_emplace_itemFINAL(lines 9430 9482) no Hoare annotation was computed. [2022-07-19 22:13:01,029 INFO L902 garLoopResultBuilder]: At program point L9434(line 9434) the Hoare annotation is: true [2022-07-19 22:13:01,029 INFO L902 garLoopResultBuilder]: At program point L9434-1(line 9434) the Hoare annotation is: true [2022-07-19 22:13:01,029 INFO L899 garLoopResultBuilder]: For program point L9434-2(line 9434) no Hoare annotation was computed. [2022-07-19 22:13:01,029 INFO L899 garLoopResultBuilder]: For program point L9464(lines 9464 9466) no Hoare annotation was computed. [2022-07-19 22:13:01,029 INFO L899 garLoopResultBuilder]: For program point L9464-2(lines 9464 9466) no Hoare annotation was computed. [2022-07-19 22:13:01,029 INFO L899 garLoopResultBuilder]: For program point s_emplace_itemEXIT(lines 9430 9482) no Hoare annotation was computed. [2022-07-19 22:13:01,029 INFO L899 garLoopResultBuilder]: For program point L9448-1(lines 9448 9476) no Hoare annotation was computed. [2022-07-19 22:13:01,029 INFO L899 garLoopResultBuilder]: For program point L9436(lines 9436 9440) no Hoare annotation was computed. [2022-07-19 22:13:01,029 INFO L899 garLoopResultBuilder]: For program point L9436-1(lines 9436 9440) no Hoare annotation was computed. [2022-07-19 22:13:01,029 INFO L899 garLoopResultBuilder]: For program point L9478-1(line 9478) no Hoare annotation was computed. [2022-07-19 22:13:01,029 INFO L902 garLoopResultBuilder]: At program point L9478-3(line 9478) the Hoare annotation is: true [2022-07-19 22:13:01,029 INFO L899 garLoopResultBuilder]: For program point L9478-4(line 9478) no Hoare annotation was computed. [2022-07-19 22:13:01,029 INFO L899 garLoopResultBuilder]: For program point L9478(line 9478) no Hoare annotation was computed. [2022-07-19 22:13:01,029 INFO L899 garLoopResultBuilder]: For program point L9338(lines 9338 9340) no Hoare annotation was computed. [2022-07-19 22:13:01,030 INFO L899 garLoopResultBuilder]: For program point L9330(lines 9330 9332) no Hoare annotation was computed. [2022-07-19 22:13:01,030 INFO L899 garLoopResultBuilder]: For program point L9338-2(lines 9338 9340) no Hoare annotation was computed. [2022-07-19 22:13:01,030 INFO L899 garLoopResultBuilder]: For program point L9388(lines 9388 9396) no Hoare annotation was computed. [2022-07-19 22:13:01,030 INFO L899 garLoopResultBuilder]: For program point L9330-2(lines 9330 9332) no Hoare annotation was computed. [2022-07-19 22:13:01,030 INFO L899 garLoopResultBuilder]: For program point L9372(lines 9372 9375) no Hoare annotation was computed. [2022-07-19 22:13:01,030 INFO L899 garLoopResultBuilder]: For program point s_find_entryFINAL(lines 9321 9346) no Hoare annotation was computed. [2022-07-19 22:13:01,030 INFO L899 garLoopResultBuilder]: For program point s_find_entryEXIT(lines 9321 9346) no Hoare annotation was computed. [2022-07-19 22:13:01,030 INFO L902 garLoopResultBuilder]: At program point s_find_entryENTRY(lines 9321 9346) the Hoare annotation is: true [2022-07-19 22:13:01,030 INFO L899 garLoopResultBuilder]: For program point L9377-4(lines 9377 9380) no Hoare annotation was computed. [2022-07-19 22:13:01,030 INFO L899 garLoopResultBuilder]: For program point L9402(lines 9402 9404) no Hoare annotation was computed. [2022-07-19 22:13:01,030 INFO L899 garLoopResultBuilder]: For program point L9377(line 9377) no Hoare annotation was computed. [2022-07-19 22:13:01,030 INFO L902 garLoopResultBuilder]: At program point L9377-1(line 9377) the Hoare annotation is: true [2022-07-19 22:13:01,030 INFO L899 garLoopResultBuilder]: For program point L9377-2(line 9377) no Hoare annotation was computed. [2022-07-19 22:13:01,030 INFO L902 garLoopResultBuilder]: At program point L9406(lines 9348 9407) the Hoare annotation is: true [2022-07-19 22:13:01,030 INFO L902 garLoopResultBuilder]: At program point L9365-2(lines 9365 9399) the Hoare annotation is: true [2022-07-19 22:13:01,030 INFO L899 garLoopResultBuilder]: For program point L9365-3(lines 9365 9399) no Hoare annotation was computed. [2022-07-19 22:13:01,030 INFO L899 garLoopResultBuilder]: For program point L9402-2(lines 9402 9404) no Hoare annotation was computed. [2022-07-19 22:13:01,030 INFO L899 garLoopResultBuilder]: For program point L9337-4(lines 9337 9343) no Hoare annotation was computed. [2022-07-19 22:13:01,030 INFO L899 garLoopResultBuilder]: For program point L9337(line 9337) no Hoare annotation was computed. [2022-07-19 22:13:01,030 INFO L902 garLoopResultBuilder]: At program point L9337-1(line 9337) the Hoare annotation is: true [2022-07-19 22:13:01,030 INFO L899 garLoopResultBuilder]: For program point L9337-2(line 9337) no Hoare annotation was computed. [2022-07-19 22:13:01,031 INFO L899 garLoopResultBuilder]: For program point L9329(lines 9329 9335) no Hoare annotation was computed. [2022-07-19 22:13:01,031 INFO L899 garLoopResultBuilder]: For program point L211-2(lines 210 212) no Hoare annotation was computed. [2022-07-19 22:13:01,031 INFO L902 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 210 212) the Hoare annotation is: true [2022-07-19 22:13:01,031 INFO L899 garLoopResultBuilder]: For program point L211(line 211) no Hoare annotation was computed. [2022-07-19 22:13:01,031 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 210 212) no Hoare annotation was computed. [2022-07-19 22:13:01,031 INFO L895 garLoopResultBuilder]: At program point aws_raise_errorENTRY(lines 1988 1999) the Hoare annotation is: (or (not (< 0 |#StackHeapBarrier|)) (= ~tl_last_error~0 |old(~tl_last_error~0)|)) [2022-07-19 22:13:01,031 INFO L899 garLoopResultBuilder]: For program point aws_raise_errorFINAL(lines 1988 1999) no Hoare annotation was computed. [2022-07-19 22:13:01,031 INFO L899 garLoopResultBuilder]: For program point L7385(lines 7385 7387) no Hoare annotation was computed. [2022-07-19 22:13:01,034 INFO L899 garLoopResultBuilder]: For program point aws_raise_errorEXIT(lines 1988 1999) no Hoare annotation was computed. [2022-07-19 22:13:01,034 INFO L899 garLoopResultBuilder]: For program point can_fail_allocatorFINAL(lines 6950 6952) no Hoare annotation was computed. [2022-07-19 22:13:01,034 INFO L899 garLoopResultBuilder]: For program point can_fail_allocatorEXIT(lines 6950 6952) no Hoare annotation was computed. [2022-07-19 22:13:01,049 INFO L902 garLoopResultBuilder]: At program point can_fail_allocatorENTRY(lines 6950 6952) the Hoare annotation is: true [2022-07-19 22:13:01,049 INFO L895 garLoopResultBuilder]: At program point __CPROVER_overflow_multENTRY(lines 253 256) the Hoare annotation is: (or (not (< 0 |#StackHeapBarrier|)) (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))) [2022-07-19 22:13:01,049 INFO L899 garLoopResultBuilder]: For program point __CPROVER_overflow_multEXIT(lines 253 256) no Hoare annotation was computed. [2022-07-19 22:13:01,050 INFO L899 garLoopResultBuilder]: For program point __CPROVER_overflow_multFINAL(lines 253 256) no Hoare annotation was computed. [2022-07-19 22:13:01,050 INFO L899 garLoopResultBuilder]: For program point aws_is_power_of_twoFINAL(lines 2626 2631) no Hoare annotation was computed. [2022-07-19 22:13:01,050 INFO L899 garLoopResultBuilder]: For program point aws_is_power_of_twoEXIT(lines 2626 2631) no Hoare annotation was computed. [2022-07-19 22:13:01,050 INFO L902 garLoopResultBuilder]: At program point aws_is_power_of_twoENTRY(lines 2626 2631) the Hoare annotation is: true [2022-07-19 22:13:01,050 INFO L895 garLoopResultBuilder]: At program point L2545(lines 2541 2546) the Hoare annotation is: (let ((.cse0 (< 0 |#StackHeapBarrier|))) (let ((.cse1 (or (and (= ~tl_last_error~0 |old(~tl_last_error~0)|) .cse0) (and (= |old(#memory_real)| |#memory_real|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) .cse0)))) (or (not .cse0) (and (<= (+ |aws_add_size_checked_aws_add_u64_checked_#res#1| 1) 0) .cse1) (and (= (select (select |#memory_int| |aws_add_size_checked_#in~r#1.base|) |aws_add_size_checked_#in~r#1.offset|) (+ |aws_add_size_checked_#in~b#1| |aws_add_size_checked_#in~a#1|)) .cse1 (exists ((|v___CPROVER_overflow_mult_~#c~1.base_81| Int) (v_ArrVal_3301 Int)) (and (= (store |old(#valid)| |v___CPROVER_overflow_mult_~#c~1.base_81| v_ArrVal_3301) |#valid|) (= (select |old(#valid)| |v___CPROVER_overflow_mult_~#c~1.base_81|) 0))))))) [2022-07-19 22:13:01,050 INFO L895 garLoopResultBuilder]: At program point aws_add_size_checkedENTRY(lines 2613 2621) the Hoare annotation is: (or (not (< 0 |#StackHeapBarrier|)) (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)|) (= ~tl_last_error~0 |old(~tl_last_error~0)|) (= |old(#valid)| |#valid|))) [2022-07-19 22:13:01,050 INFO L895 garLoopResultBuilder]: At program point L2542(line 2542) the Hoare annotation is: (or (not (< 0 |#StackHeapBarrier|)) (and (= |aws_add_size_checked_#in~b#1| |aws_add_size_checked_aws_add_u64_checked_~b#1|) (= |old(#length)| |#length|) (= |old(#memory_real)| |#memory_real|) (= |#memory_int| |old(#memory_int)|) (= |aws_add_size_checked_#in~r#1.base| |aws_add_size_checked_aws_add_u64_checked_~r#1.base|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |aws_add_size_checked_#in~r#1.offset| |aws_add_size_checked_aws_add_u64_checked_~r#1.offset|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ~tl_last_error~0 |old(~tl_last_error~0)|) (= |old(#valid)| |#valid|) (= |aws_add_size_checked_#in~a#1| |aws_add_size_checked_aws_add_u64_checked_~a#1|))) [2022-07-19 22:13:01,050 INFO L899 garLoopResultBuilder]: For program point L2543-1(line 2543) no Hoare annotation was computed. [2022-07-19 22:13:01,051 INFO L895 garLoopResultBuilder]: At program point L2543(line 2543) the Hoare annotation is: (or (not (< 0 |#StackHeapBarrier|)) (and (= |old(#memory_real)| |#memory_real|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ~tl_last_error~0 |old(~tl_last_error~0)|))) [2022-07-19 22:13:01,051 INFO L899 garLoopResultBuilder]: For program point L2542-1(lines 2542 2543) no Hoare annotation was computed. [2022-07-19 22:13:01,051 INFO L899 garLoopResultBuilder]: For program point aws_add_size_checkedFINAL(lines 2613 2621) no Hoare annotation was computed. [2022-07-19 22:13:01,051 INFO L899 garLoopResultBuilder]: For program point aws_add_size_checkedEXIT(lines 2613 2621) no Hoare annotation was computed. [2022-07-19 22:13:01,051 INFO L899 garLoopResultBuilder]: For program point L6815-1(line 6815) no Hoare annotation was computed. [2022-07-19 22:13:01,051 INFO L895 garLoopResultBuilder]: At program point L6815(line 6815) the Hoare annotation is: (and (= |ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.offset| 0) (not (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base| |ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.base|)) (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.base|) 1) (< |#StackHeapBarrier| |ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.base|) (= (select |#valid| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base|) 1) (<= (mod |ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1| 18446744073709551616) 4) (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.base| |ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.base|) (< 0 |#StackHeapBarrier|) (= |ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.offset| |ULTIMATE.start_ensure_allocated_hash_table_~map#1.offset|)) [2022-07-19 22:13:01,051 INFO L895 garLoopResultBuilder]: At program point L6811-1(line 6811) the Hoare annotation is: (and (= |ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.base|) 1) (< |#StackHeapBarrier| |ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.base|) (<= (mod |ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1| 18446744073709551616) 4) (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.base| |ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.base|) (< 0 |#StackHeapBarrier|) (= |ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.offset| |ULTIMATE.start_ensure_allocated_hash_table_~map#1.offset|)) [2022-07-19 22:13:01,051 INFO L895 garLoopResultBuilder]: At program point L6811(line 6811) the Hoare annotation is: (and (= |ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.offset| 0) (= |ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries#1| 4) (= (select |#valid| |ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.base|) 1) (< |#StackHeapBarrier| |ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.base|) (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.base| |ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.base|) (< 0 |#StackHeapBarrier|) (= |ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.offset| |ULTIMATE.start_ensure_allocated_hash_table_~map#1.offset|)) [2022-07-19 22:13:01,052 INFO L902 garLoopResultBuilder]: At program point L10176(line 10176) the Hoare annotation is: true [2022-07-19 22:13:01,052 INFO L899 garLoopResultBuilder]: For program point L6815-3(line 6815) no Hoare annotation was computed. [2022-07-19 22:13:01,052 INFO L895 garLoopResultBuilder]: At program point L6815-2(line 6815) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.offset| 0)) (.cse1 (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.base| |ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.base|)) (.cse2 (< 0 |#StackHeapBarrier|)) (.cse3 (= |ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.offset| |ULTIMATE.start_ensure_allocated_hash_table_~map#1.offset|))) (or (and .cse0 (<= (+ |ULTIMATE.start_ensure_allocated_hash_table_#t~ret550#1| 1) 0) (< 1 |ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.base|) .cse1 .cse2 .cse3) (and .cse0 (not (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base| |ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.base|)) (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.offset| 0) (= (+ 29629528 (select (select |#memory_int| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base|) |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.offset|)) (* |ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1| 24)) (= (select |#valid| |ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.base|) 1) (< |#StackHeapBarrier| |ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.base|) (= (select |#valid| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base|) 1) (<= (mod |ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1| 18446744073709551616) 4) .cse1 (= |ULTIMATE.start_ensure_allocated_hash_table_#t~ret550#1| 0) .cse2 .cse3))) [2022-07-19 22:13:01,052 INFO L899 garLoopResultBuilder]: For program point L10135-2(line 10135) no Hoare annotation was computed. [2022-07-19 22:13:01,052 INFO L899 garLoopResultBuilder]: For program point L6840-1(line 6840) no Hoare annotation was computed. [2022-07-19 22:13:01,052 INFO L899 garLoopResultBuilder]: For program point L10164(line 10164) no Hoare annotation was computed. [2022-07-19 22:13:01,052 INFO L895 garLoopResultBuilder]: At program point L6840(line 6840) the Hoare annotation is: false [2022-07-19 22:13:01,052 INFO L895 garLoopResultBuilder]: At program point L10164-2(line 10164) the Hoare annotation is: false [2022-07-19 22:13:01,052 INFO L895 garLoopResultBuilder]: At program point L10135(line 10135) the Hoare annotation is: false [2022-07-19 22:13:01,052 INFO L895 garLoopResultBuilder]: At program point L10135-1(line 10135) the Hoare annotation is: false [2022-07-19 22:13:01,053 INFO L895 garLoopResultBuilder]: At program point L10156-1(lines 10156 10157) the Hoare annotation is: false [2022-07-19 22:13:01,053 INFO L899 garLoopResultBuilder]: For program point L10164-3(line 10164) no Hoare annotation was computed. [2022-07-19 22:13:01,053 INFO L899 garLoopResultBuilder]: For program point L10160(lines 10160 10174) no Hoare annotation was computed. [2022-07-19 22:13:01,053 INFO L899 garLoopResultBuilder]: For program point L10160-1(lines 10160 10174) no Hoare annotation was computed. [2022-07-19 22:13:01,053 INFO L895 garLoopResultBuilder]: At program point L10173(line 10173) the Hoare annotation is: false [2022-07-19 22:13:01,053 INFO L899 garLoopResultBuilder]: For program point L6816-1(line 6816) no Hoare annotation was computed. [2022-07-19 22:13:01,053 INFO L899 garLoopResultBuilder]: For program point L10173-1(line 10173) no Hoare annotation was computed. [2022-07-19 22:13:01,053 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-07-19 22:13:01,053 INFO L895 garLoopResultBuilder]: At program point L6816(line 6816) the Hoare annotation is: (let ((.cse0 (select |#memory_int| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base|))) (and (= |ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.offset| 0) (not (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base| |ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.base|)) (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.offset| 0) (= (select .cse0 0) |ULTIMATE.start_ensure_allocated_hash_table_#t~mem551#1|) (= (+ 29629528 (select .cse0 |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.offset|)) (* |ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1| 24)) (= (select |#valid| |ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.base|) 1) (< |#StackHeapBarrier| |ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.base|) (= (select |#valid| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base|) 1) (<= (mod |ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1| 18446744073709551616) 4) (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.base| |ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.base|) (< 0 |#StackHeapBarrier|) (= |ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.offset| |ULTIMATE.start_ensure_allocated_hash_table_~map#1.offset|))) [2022-07-19 22:13:01,054 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-07-19 22:13:01,054 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-07-19 22:13:01,054 INFO L899 garLoopResultBuilder]: For program point L6812-1(line 6812) no Hoare annotation was computed. [2022-07-19 22:13:01,054 INFO L895 garLoopResultBuilder]: At program point L6812(line 6812) the Hoare annotation is: (and (= |ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.base|) 1) (< |#StackHeapBarrier| |ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.base|) (<= (mod |ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1| 18446744073709551616) 4) (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.base| |ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.base|) (< 0 |#StackHeapBarrier|) (= |ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.offset| |ULTIMATE.start_ensure_allocated_hash_table_~map#1.offset|)) [2022-07-19 22:13:01,054 INFO L899 garLoopResultBuilder]: For program point L10132(lines 10132 10175) no Hoare annotation was computed. [2022-07-19 22:13:01,054 INFO L899 garLoopResultBuilder]: For program point L6841-1(line 6841) no Hoare annotation was computed. [2022-07-19 22:13:01,054 INFO L895 garLoopResultBuilder]: At program point L6841(line 6841) the Hoare annotation is: false [2022-07-19 22:13:01,054 INFO L895 garLoopResultBuilder]: At program point L6833(lines 6831 6834) the Hoare annotation is: false [2022-07-19 22:13:01,054 INFO L899 garLoopResultBuilder]: For program point L10161(lines 10161 10167) no Hoare annotation was computed. [2022-07-19 22:13:01,055 INFO L899 garLoopResultBuilder]: For program point L10161-2(lines 10160 10172) no Hoare annotation was computed. [2022-07-19 22:13:01,055 INFO L895 garLoopResultBuilder]: At program point L10141(line 10141) the Hoare annotation is: false [2022-07-19 22:13:01,055 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-07-19 22:13:01,055 INFO L899 garLoopResultBuilder]: For program point L10141-1(line 10141) no Hoare annotation was computed. [2022-07-19 22:13:01,055 INFO L895 garLoopResultBuilder]: At program point L10170(line 10170) the Hoare annotation is: false [2022-07-19 22:13:01,055 INFO L899 garLoopResultBuilder]: For program point L6809(lines 6809 6819) no Hoare annotation was computed. [2022-07-19 22:13:01,055 INFO L895 garLoopResultBuilder]: At program point L10162(line 10162) the Hoare annotation is: false [2022-07-19 22:13:01,055 INFO L895 garLoopResultBuilder]: At program point L10170-1(line 10170) the Hoare annotation is: false [2022-07-19 22:13:01,055 INFO L899 garLoopResultBuilder]: For program point L10170-2(line 10170) no Hoare annotation was computed. [2022-07-19 22:13:01,055 INFO L899 garLoopResultBuilder]: For program point L10154(lines 10154 10155) no Hoare annotation was computed. [2022-07-19 22:13:01,056 INFO L899 garLoopResultBuilder]: For program point L10162-1(line 10162) no Hoare annotation was computed. [2022-07-19 22:13:01,056 INFO L899 garLoopResultBuilder]: For program point L10154-2(lines 10154 10158) no Hoare annotation was computed. [2022-07-19 22:13:01,056 INFO L899 garLoopResultBuilder]: For program point L10154-3(lines 10154 10158) no Hoare annotation was computed. [2022-07-19 22:13:01,056 INFO L895 garLoopResultBuilder]: At program point L10138(line 10138) the Hoare annotation is: false [2022-07-19 22:13:01,056 INFO L895 garLoopResultBuilder]: At program point L6810(line 6810) the Hoare annotation is: (and (= |ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.offset| 0) (= |ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries#1| 4) (= (select |#valid| |ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.base|) 1) (< |#StackHeapBarrier| |ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.base|) (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.base| |ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.base|) (< 0 |#StackHeapBarrier|) (= |ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.offset| |ULTIMATE.start_ensure_allocated_hash_table_~map#1.offset|)) [2022-07-19 22:13:01,056 INFO L895 garLoopResultBuilder]: At program point L6843(lines 6837 6844) the Hoare annotation is: false [2022-07-19 22:13:01,056 INFO L899 garLoopResultBuilder]: For program point L6839-1(line 6839) no Hoare annotation was computed. [2022-07-19 22:13:01,056 INFO L895 garLoopResultBuilder]: At program point L6839(line 6839) the Hoare annotation is: false [2022-07-19 22:13:01,056 INFO L899 garLoopResultBuilder]: For program point L6810-1(line 6810) no Hoare annotation was computed. [2022-07-19 22:13:01,057 INFO L899 garLoopResultBuilder]: For program point L10138-1(line 10138) no Hoare annotation was computed. [2022-07-19 22:13:01,057 INFO L899 garLoopResultBuilder]: For program point L10159-2(line 10159) no Hoare annotation was computed. [2022-07-19 22:13:01,057 INFO L895 garLoopResultBuilder]: At program point L10159(line 10159) the Hoare annotation is: false [2022-07-19 22:13:01,057 INFO L895 garLoopResultBuilder]: At program point L10159-1(line 10159) the Hoare annotation is: false [2022-07-19 22:13:01,057 INFO L899 garLoopResultBuilder]: For program point L223(line 223) no Hoare annotation was computed. [2022-07-19 22:13:01,057 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 222 224) the Hoare annotation is: true [2022-07-19 22:13:01,057 INFO L899 garLoopResultBuilder]: For program point L223-1(line 223) no Hoare annotation was computed. [2022-07-19 22:13:01,057 INFO L899 garLoopResultBuilder]: For program point L223-3(lines 222 224) no Hoare annotation was computed. [2022-07-19 22:13:01,057 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 222 224) no Hoare annotation was computed. [2022-07-19 22:13:01,058 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2022-07-19 22:13:01,060 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 22:13:01,061 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-19 22:13:01,070 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 22:13:01,071 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 22:13:01,072 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 22:13:01,072 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 22:13:01,073 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_3301,QUANTIFIED] [2022-07-19 22:13:01,073 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_81,QUANTIFIED] [2022-07-19 22:13:01,073 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_81,QUANTIFIED] [2022-07-19 22:13:01,077 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 22:13:01,077 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 22:13:01,077 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 22:13:01,077 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 22:13:01,077 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_3301,QUANTIFIED] [2022-07-19 22:13:01,078 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_81,QUANTIFIED] [2022-07-19 22:13:01,078 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_81,QUANTIFIED] [2022-07-19 22:13:01,083 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 22:13:01,083 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 22:13:01,083 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 22:13:01,083 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 22:13:01,084 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 22:13:01,084 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 22:13:01,084 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 22:13:01,084 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 22:13:01,084 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_3301,QUANTIFIED] [2022-07-19 22:13:01,084 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_81,QUANTIFIED] [2022-07-19 22:13:01,084 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_81,QUANTIFIED] [2022-07-19 22:13:01,085 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 22:13:01,085 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 22:13:01,085 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 22:13:01,085 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 22:13:01,086 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 22:13:01,086 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 22:13:01,086 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 22:13:01,086 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 22:13:01,086 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_3301,QUANTIFIED] [2022-07-19 22:13:01,086 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_81,QUANTIFIED] [2022-07-19 22:13:01,086 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_81,QUANTIFIED] [2022-07-19 22:13:01,087 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.07 10:13:01 BoogieIcfgContainer [2022-07-19 22:13:01,087 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-19 22:13:01,088 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-19 22:13:01,088 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-19 22:13:01,088 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-19 22:13:01,088 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 10:09:51" (3/4) ... [2022-07-19 22:13:01,092 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-07-19 22:13:01,096 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure uninterpreted_equals [2022-07-19 22:13:01,098 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure bounded_malloc [2022-07-19 22:13:01,098 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __CPROVER_uninterpreted_equals [2022-07-19 22:13:01,098 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __CPROVER_uninterpreted_hasher [2022-07-19 22:13:01,098 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_hash_table_is_valid [2022-07-19 22:13:01,098 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure nondet_bool [2022-07-19 22:13:01,098 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_mem_release [2022-07-19 22:13:01,098 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure hash_table_state_required_bytes [2022-07-19 22:13:01,099 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure can_fail_calloc [2022-07-19 22:13:01,099 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure s_update_template_size [2022-07-19 22:13:01,099 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_allocator_is_valid [2022-07-19 22:13:01,099 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure s_hash_keys_eq [2022-07-19 22:13:01,099 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_mul_size_checked [2022-07-19 22:13:01,099 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure nondet_uint64_t [2022-07-19 22:13:01,099 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure s_hash_for [2022-07-19 22:13:01,099 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __CPROVER_overflow_plus [2022-07-19 22:13:01,099 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2022-07-19 22:13:01,099 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_hash_table_create [2022-07-19 22:13:01,099 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure hash_table_state_is_valid [2022-07-19 22:13:01,100 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure s_safe_eq_check [2022-07-19 22:13:01,100 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure s_alloc_state [2022-07-19 22:13:01,100 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure s_emplace_item [2022-07-19 22:13:01,100 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure s_find_entry [2022-07-19 22:13:01,100 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2022-07-19 22:13:01,100 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_raise_error [2022-07-19 22:13:01,100 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure can_fail_allocator [2022-07-19 22:13:01,100 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __CPROVER_overflow_mult [2022-07-19 22:13:01,100 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_is_power_of_two [2022-07-19 22:13:01,100 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_add_size_checked [2022-07-19 22:13:01,101 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2022-07-19 22:13:01,124 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 256 nodes and edges [2022-07-19 22:13:01,129 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 105 nodes and edges [2022-07-19 22:13:01,130 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 39 nodes and edges [2022-07-19 22:13:01,132 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2022-07-19 22:13:01,133 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2022-07-19 22:13:01,134 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-07-19 22:13:01,135 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-07-19 22:13:01,136 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-07-19 22:13:01,157 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((\old(unknown-#memory_real-unknown) == unknown-#memory_real-unknown && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && \result + 1 <= 0) || !(0 < unknown-#StackHeapBarrier-unknown)) || (((\old(b) * \old(a) == unknown-#memory_int-unknown[r][r] && tl_last_error == \old(tl_last_error)) && (\exists v___CPROVER_overflow_mult_~#c~1.base_81 : int, v_ArrVal_3301 : int :: \old(\valid)[v___CPROVER_overflow_mult_~#c~1.base_81 := v_ArrVal_3301] == \valid && \old(\valid)[v___CPROVER_overflow_mult_~#c~1.base_81] == 0)) && \result == 0) [2022-07-19 22:13:01,159 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (!(0 < unknown-#StackHeapBarrier-unknown) || (\result + 1 <= 0 && ((tl_last_error == \old(tl_last_error) && 0 < unknown-#StackHeapBarrier-unknown) || ((((\old(unknown-#memory_real-unknown) == unknown-#memory_real-unknown && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && 0 < unknown-#StackHeapBarrier-unknown)))) || ((unknown-#memory_int-unknown[r][r] == \old(b) + \old(a) && ((tl_last_error == \old(tl_last_error) && 0 < unknown-#StackHeapBarrier-unknown) || ((((\old(unknown-#memory_real-unknown) == unknown-#memory_real-unknown && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && 0 < unknown-#StackHeapBarrier-unknown))) && (\exists v___CPROVER_overflow_mult_~#c~1.base_81 : int, v_ArrVal_3301 : int :: \old(\valid)[v___CPROVER_overflow_mult_~#c~1.base_81 := v_ArrVal_3301] == \valid && \old(\valid)[v___CPROVER_overflow_mult_~#c~1.base_81] == 0)) [2022-07-19 22:13:01,421 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-19 22:13:01,421 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-19 22:13:01,422 INFO L158 Benchmark]: Toolchain (without parser) took 193798.76ms. Allocated memory was 115.3MB in the beginning and 687.9MB in the end (delta: 572.5MB). Free memory was 77.4MB in the beginning and 474.6MB in the end (delta: -397.1MB). Peak memory consumption was 174.5MB. Max. memory is 16.1GB. [2022-07-19 22:13:01,422 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 115.3MB. Free memory is still 70.7MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-19 22:13:01,422 INFO L158 Benchmark]: CACSL2BoogieTranslator took 2273.90ms. Allocated memory was 115.3MB in the beginning and 213.9MB in the end (delta: 98.6MB). Free memory was 77.1MB in the beginning and 146.1MB in the end (delta: -69.0MB). Peak memory consumption was 161.1MB. Max. memory is 16.1GB. [2022-07-19 22:13:01,423 INFO L158 Benchmark]: Boogie Procedure Inliner took 168.32ms. Allocated memory is still 213.9MB. Free memory was 146.1MB in the beginning and 131.4MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-07-19 22:13:01,423 INFO L158 Benchmark]: Boogie Preprocessor took 109.75ms. Allocated memory is still 213.9MB. Free memory was 131.4MB in the beginning and 119.9MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-19 22:13:01,423 INFO L158 Benchmark]: RCFGBuilder took 1642.53ms. Allocated memory was 213.9MB in the beginning and 371.2MB in the end (delta: 157.3MB). Free memory was 119.9MB in the beginning and 251.8MB in the end (delta: -131.9MB). Peak memory consumption was 58.9MB. Max. memory is 16.1GB. [2022-07-19 22:13:01,423 INFO L158 Benchmark]: TraceAbstraction took 189264.26ms. Allocated memory was 371.2MB in the beginning and 687.9MB in the end (delta: 316.7MB). Free memory was 251.8MB in the beginning and 605.6MB in the end (delta: -353.9MB). Peak memory consumption was 369.7MB. Max. memory is 16.1GB. [2022-07-19 22:13:01,423 INFO L158 Benchmark]: Witness Printer took 333.76ms. Allocated memory is still 687.9MB. Free memory was 605.6MB in the beginning and 474.6MB in the end (delta: 131.1MB). Peak memory consumption was 130.0MB. Max. memory is 16.1GB. [2022-07-19 22:13:01,424 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 115.3MB. Free memory is still 70.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 2273.90ms. Allocated memory was 115.3MB in the beginning and 213.9MB in the end (delta: 98.6MB). Free memory was 77.1MB in the beginning and 146.1MB in the end (delta: -69.0MB). Peak memory consumption was 161.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 168.32ms. Allocated memory is still 213.9MB. Free memory was 146.1MB in the beginning and 131.4MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Preprocessor took 109.75ms. Allocated memory is still 213.9MB. Free memory was 131.4MB in the beginning and 119.9MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * RCFGBuilder took 1642.53ms. Allocated memory was 213.9MB in the beginning and 371.2MB in the end (delta: 157.3MB). Free memory was 119.9MB in the beginning and 251.8MB in the end (delta: -131.9MB). Peak memory consumption was 58.9MB. Max. memory is 16.1GB. * TraceAbstraction took 189264.26ms. Allocated memory was 371.2MB in the beginning and 687.9MB in the end (delta: 316.7MB). Free memory was 251.8MB in the beginning and 605.6MB in the end (delta: -353.9MB). Peak memory consumption was 369.7MB. Max. memory is 16.1GB. * Witness Printer took 333.76ms. Allocated memory is still 687.9MB. Free memory was 605.6MB in the beginning and 474.6MB in the end (delta: 131.1MB). Peak memory consumption was 130.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_3301,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_81,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_81,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_3301,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_81,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_81,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_3301,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_81,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_81,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_3301,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_81,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_81,QUANTIFIED] * 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 31 procedures, 349 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 189.2s, OverallIterations: 20, TraceHistogramMax: 10, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 39.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.6s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6481 SdHoareTripleChecker+Valid, 37.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5778 mSDsluCounter, 39617 SdHoareTripleChecker+Invalid, 33.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 3354 IncrementalHoareTripleChecker+Unchecked, 31348 mSDsCounter, 3346 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 27014 IncrementalHoareTripleChecker+Invalid, 33714 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3346 mSolverCounterUnsat, 8269 mSDtfsCounter, 27014 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2509 GetRequests, 2204 SyntacticMatches, 9 SemanticMatches, 296 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1277 ImplicationChecksByTransitivity, 12.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=533occurred in iteration=19, InterpolantAutomatonStates: 236, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 20 MinimizatonAttempts, 1777 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 134 LocationsWithAnnotation, 3531 PreInvPairs, 3569 NumberOfFragments, 914 HoareAnnotationTreeSize, 3531 FomulaSimplifications, 91488 FormulaSimplificationTreeSizeReduction, 0.8s HoareSimplificationTime, 134 FomulaSimplificationsInter, 2116 FormulaSimplificationTreeSizeReductionInter, 0.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.6s SsaConstructionTime, 123.8s SatisfiabilityAnalysisTime, 18.2s InterpolantComputationTime, 3877 NumberOfCodeBlocks, 3877 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 3907 ConstructedInterpolants, 52 QuantifiedInterpolants, 8228 SizeOfPredicates, 74 NumberOfNonLiveVariables, 21508 ConjunctsInSsa, 546 ConjunctsInUnsatCore, 24 InterpolantComputations, 18 PerfectInterpolantSequences, 4500/4558 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: 6934]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 9448]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 10176]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 9502]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7348]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 262]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7369]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 9365]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6831]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 9154]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2637]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6837]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 7280]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 9348]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2497]: Loop Invariant [2022-07-19 22:13:01,446 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 22:13:01,447 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 22:13:01,447 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 22:13:01,447 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 22:13:01,447 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_3301,QUANTIFIED] [2022-07-19 22:13:01,447 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_81,QUANTIFIED] [2022-07-19 22:13:01,448 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_81,QUANTIFIED] [2022-07-19 22:13:01,449 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 22:13:01,449 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 22:13:01,449 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 22:13:01,449 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 22:13:01,449 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_3301,QUANTIFIED] [2022-07-19 22:13:01,449 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_81,QUANTIFIED] [2022-07-19 22:13:01,449 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_81,QUANTIFIED] Derived loop invariant: (((((\old(unknown-#memory_real-unknown) == unknown-#memory_real-unknown && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && \result + 1 <= 0) || !(0 < unknown-#StackHeapBarrier-unknown)) || (((\old(b) * \old(a) == unknown-#memory_int-unknown[r][r] && tl_last_error == \old(tl_last_error)) && (\exists v___CPROVER_overflow_mult_~#c~1.base_81 : int, v_ArrVal_3301 : int :: \old(\valid)[v___CPROVER_overflow_mult_~#c~1.base_81 := v_ArrVal_3301] == \valid && \old(\valid)[v___CPROVER_overflow_mult_~#c~1.base_81] == 0)) && \result == 0) - InvariantResult [Line: 2541]: Loop Invariant [2022-07-19 22:13:01,450 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 22:13:01,450 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 22:13:01,451 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 22:13:01,451 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 22:13:01,451 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 22:13:01,451 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 22:13:01,451 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 22:13:01,451 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 22:13:01,451 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_3301,QUANTIFIED] [2022-07-19 22:13:01,451 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_81,QUANTIFIED] [2022-07-19 22:13:01,452 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_81,QUANTIFIED] [2022-07-19 22:13:01,452 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 22:13:01,452 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 22:13:01,452 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 22:13:01,452 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 22:13:01,453 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 22:13:01,453 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 22:13:01,454 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 22:13:01,454 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 22:13:01,454 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_3301,QUANTIFIED] [2022-07-19 22:13:01,454 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_81,QUANTIFIED] [2022-07-19 22:13:01,454 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_81,QUANTIFIED] Derived loop invariant: (!(0 < unknown-#StackHeapBarrier-unknown) || (\result + 1 <= 0 && ((tl_last_error == \old(tl_last_error) && 0 < unknown-#StackHeapBarrier-unknown) || ((((\old(unknown-#memory_real-unknown) == unknown-#memory_real-unknown && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && 0 < unknown-#StackHeapBarrier-unknown)))) || ((unknown-#memory_int-unknown[r][r] == \old(b) + \old(a) && ((tl_last_error == \old(tl_last_error) && 0 < unknown-#StackHeapBarrier-unknown) || ((((\old(unknown-#memory_real-unknown) == unknown-#memory_real-unknown && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && 0 < unknown-#StackHeapBarrier-unknown))) && (\exists v___CPROVER_overflow_mult_~#c~1.base_81 : int, v_ArrVal_3301 : int :: \old(\valid)[v___CPROVER_overflow_mult_~#c~1.base_81 := v_ArrVal_3301] == \valid && \old(\valid)[v___CPROVER_overflow_mult_~#c~1.base_81] == 0)) - InvariantResult [Line: 7001]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 9484]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 9437]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2022-07-19 22:13:01,610 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE