./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_hash_table_get_entry_count_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6c24879c 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_get_entry_count_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 846a565d6a742f245ca362c4e2fb63bb4d14b5e5473527f5da84e078cffb2df4 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 11:07:21,725 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 11:07:21,727 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 11:07:21,765 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 11:07:21,766 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 11:07:21,766 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 11:07:21,768 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 11:07:21,769 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 11:07:21,771 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 11:07:21,771 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 11:07:21,772 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 11:07:21,773 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 11:07:21,774 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 11:07:21,775 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 11:07:21,776 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 11:07:21,777 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 11:07:21,777 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 11:07:21,778 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 11:07:21,780 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 11:07:21,781 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 11:07:21,783 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 11:07:21,787 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 11:07:21,789 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 11:07:21,790 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 11:07:21,792 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 11:07:21,796 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 11:07:21,800 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 11:07:21,801 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 11:07:21,802 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 11:07:21,802 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 11:07:21,803 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 11:07:21,804 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 11:07:21,805 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 11:07:21,806 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 11:07:21,807 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 11:07:21,807 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 11:07:21,809 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 11:07:21,809 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 11:07:21,810 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 11:07:21,810 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 11:07:21,811 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 11:07:21,813 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 11:07:21,815 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-12 11:07:21,845 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 11:07:21,846 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 11:07:21,846 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 11:07:21,846 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 11:07:21,847 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 11:07:21,847 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 11:07:21,848 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 11:07:21,848 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 11:07:21,848 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 11:07:21,849 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 11:07:21,849 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 11:07:21,850 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 11:07:21,850 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 11:07:21,850 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 11:07:21,850 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 11:07:21,850 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 11:07:21,851 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 11:07:21,851 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 11:07:21,851 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 11:07:21,852 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 11:07:21,852 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 11:07:21,852 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 11:07:21,853 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 11:07:21,853 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 11:07:21,853 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 11:07:21,853 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 11:07:21,853 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 11:07:21,854 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 11:07:21,854 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 11:07:21,854 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 11:07:21,854 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 -> 846a565d6a742f245ca362c4e2fb63bb4d14b5e5473527f5da84e078cffb2df4 [2022-07-12 11:07:22,096 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 11:07:22,128 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 11:07:22,131 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 11:07:22,132 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 11:07:22,133 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 11:07:22,134 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_get_entry_count_harness.i [2022-07-12 11:07:22,196 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/242c82dfe/f3bcd9216a9b415c8825e9181b37b1e3/FLAG3a92a8267 [2022-07-12 11:07:22,951 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 11:07:22,952 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_hash_table_get_entry_count_harness.i [2022-07-12 11:07:22,994 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/242c82dfe/f3bcd9216a9b415c8825e9181b37b1e3/FLAG3a92a8267 [2022-07-12 11:07:23,185 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/242c82dfe/f3bcd9216a9b415c8825e9181b37b1e3 [2022-07-12 11:07:23,187 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 11:07:23,189 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 11:07:23,191 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 11:07:23,192 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 11:07:23,195 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 11:07:23,195 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 11:07:23" (1/1) ... [2022-07-12 11:07:23,196 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30c38a4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:07:23, skipping insertion in model container [2022-07-12 11:07:23,196 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 11:07:23" (1/1) ... [2022-07-12 11:07:23,203 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 11:07:23,319 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 11:07:23,605 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_get_entry_count_harness.i[4504,4517] [2022-07-12 11:07:23,615 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_get_entry_count_harness.i[4564,4577] [2022-07-12 11:07:24,596 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:07:24,598 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:07:24,599 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:07:24,599 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:07:24,602 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:07:24,630 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:07:24,637 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:07:24,639 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:07:24,640 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:07:24,641 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:07:24,646 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:07:24,647 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:07:24,647 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:07:25,069 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-07-12 11:07:25,072 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-07-12 11:07:25,072 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-07-12 11:07:25,073 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-07-12 11:07:25,074 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-07-12 11:07:25,075 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-07-12 11:07:25,075 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-07-12 11:07:25,076 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-07-12 11:07:25,077 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-07-12 11:07:25,078 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-07-12 11:07:25,221 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-07-12 11:07:25,462 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:07:25,463 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:07:25,496 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:07:25,497 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:07:25,504 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:07:25,504 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:07:25,524 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:07:25,525 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:07:25,527 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:07:25,528 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:07:25,528 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:07:25,528 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:07:25,529 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:07:25,567 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 11:07:25,604 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 11:07:25,625 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_get_entry_count_harness.i[4504,4517] [2022-07-12 11:07:25,626 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_get_entry_count_harness.i[4564,4577] [2022-07-12 11:07:25,660 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:07:25,661 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:07:25,661 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:07:25,662 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:07:25,662 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:07:25,669 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:07:25,670 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:07:25,672 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:07:25,673 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:07:25,674 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:07:25,674 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:07:25,675 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:07:25,675 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:07:25,704 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-07-12 11:07:25,704 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-07-12 11:07:25,705 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-07-12 11:07:25,706 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-07-12 11:07:25,707 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-07-12 11:07:25,707 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-07-12 11:07:25,710 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-07-12 11:07:25,710 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-07-12 11:07:25,711 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-07-12 11:07:25,711 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-07-12 11:07:25,735 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-07-12 11:07:25,853 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:07:25,853 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:07:25,858 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:07:25,859 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:07:25,861 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:07:25,862 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:07:25,873 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:07:25,873 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:07:25,874 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:07:25,874 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:07:25,875 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:07:25,875 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:07:25,876 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:07:25,891 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 11:07:26,134 INFO L208 MainTranslator]: Completed translation [2022-07-12 11:07:26,151 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:07:26 WrapperNode [2022-07-12 11:07:26,152 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 11:07:26,153 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 11:07:26,153 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 11:07:26,153 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 11:07:26,174 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:07:26" (1/1) ... [2022-07-12 11:07:26,327 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:07:26" (1/1) ... [2022-07-12 11:07:26,397 INFO L137 Inliner]: procedures = 774, calls = 2433, calls flagged for inlining = 68, calls inlined = 11, statements flattened = 608 [2022-07-12 11:07:26,398 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 11:07:26,400 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 11:07:26,400 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 11:07:26,401 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 11:07:26,409 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:07:26" (1/1) ... [2022-07-12 11:07:26,410 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:07:26" (1/1) ... [2022-07-12 11:07:26,424 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:07:26" (1/1) ... [2022-07-12 11:07:26,424 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:07:26" (1/1) ... [2022-07-12 11:07:26,455 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:07:26" (1/1) ... [2022-07-12 11:07:26,461 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:07:26" (1/1) ... [2022-07-12 11:07:26,478 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:07:26" (1/1) ... [2022-07-12 11:07:26,487 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 11:07:26,488 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 11:07:26,488 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 11:07:26,489 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 11:07:26,496 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:07:26" (1/1) ... [2022-07-12 11:07:26,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 11:07:26,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:07:26,528 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-12 11:07:26,543 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-12 11:07:26,573 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2022-07-12 11:07:26,573 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-12 11:07:26,573 INFO L130 BoogieDeclarations]: Found specification of procedure aws_raise_error [2022-07-12 11:07:26,573 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_raise_error [2022-07-12 11:07:26,573 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-07-12 11:07:26,574 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-07-12 11:07:26,574 INFO L130 BoogieDeclarations]: Found specification of procedure hash_table_state_is_valid [2022-07-12 11:07:26,574 INFO L138 BoogieDeclarations]: Found implementation of procedure hash_table_state_is_valid [2022-07-12 11:07:26,574 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-12 11:07:26,574 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 11:07:26,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-12 11:07:26,574 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 11:07:26,575 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 11:07:26,575 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2022-07-12 11:07:26,575 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2022-07-12 11:07:26,575 INFO L130 BoogieDeclarations]: Found specification of procedure aws_mul_size_checked [2022-07-12 11:07:26,576 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_mul_size_checked [2022-07-12 11:07:26,576 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-12 11:07:26,576 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_overflow_plus [2022-07-12 11:07:26,576 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_overflow_plus [2022-07-12 11:07:26,576 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-12 11:07:26,576 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2022-07-12 11:07:26,577 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2022-07-12 11:07:26,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-12 11:07:26,577 INFO L130 BoogieDeclarations]: Found specification of procedure aws_is_power_of_two [2022-07-12 11:07:26,577 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_is_power_of_two [2022-07-12 11:07:26,577 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 11:07:26,578 INFO L130 BoogieDeclarations]: Found specification of procedure aws_hash_table_get_entry_count [2022-07-12 11:07:26,578 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_hash_table_get_entry_count [2022-07-12 11:07:26,578 INFO L130 BoogieDeclarations]: Found specification of procedure hash_table_state_required_bytes [2022-07-12 11:07:26,578 INFO L138 BoogieDeclarations]: Found implementation of procedure hash_table_state_required_bytes [2022-07-12 11:07:26,578 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-12 11:07:26,579 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-12 11:07:26,579 INFO L130 BoogieDeclarations]: Found specification of procedure aws_hash_table_is_valid [2022-07-12 11:07:26,579 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_hash_table_is_valid [2022-07-12 11:07:26,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-12 11:07:26,579 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_overflow_mult [2022-07-12 11:07:26,580 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_overflow_mult [2022-07-12 11:07:26,580 INFO L130 BoogieDeclarations]: Found specification of procedure aws_add_size_checked [2022-07-12 11:07:26,580 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_add_size_checked [2022-07-12 11:07:26,580 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 11:07:26,883 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 11:07:26,886 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 11:07:27,575 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 11:07:27,585 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 11:07:27,585 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-12 11:07:27,588 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 11:07:27 BoogieIcfgContainer [2022-07-12 11:07:27,589 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 11:07:27,591 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 11:07:27,591 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 11:07:27,594 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 11:07:27,594 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 11:07:23" (1/3) ... [2022-07-12 11:07:27,595 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@457d2150 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 11:07:27, skipping insertion in model container [2022-07-12 11:07:27,595 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:07:26" (2/3) ... [2022-07-12 11:07:27,596 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@457d2150 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 11:07:27, skipping insertion in model container [2022-07-12 11:07:27,596 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 11:07:27" (3/3) ... [2022-07-12 11:07:27,597 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_hash_table_get_entry_count_harness.i [2022-07-12 11:07:27,609 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 11:07:27,610 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-12 11:07:27,664 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 11:07:27,674 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@26f01026, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@7055744b [2022-07-12 11:07:27,674 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-12 11:07:27,678 INFO L276 IsEmpty]: Start isEmpty. Operand has 115 states, 73 states have (on average 1.1506849315068493) internal successors, (84), 74 states have internal predecessors, (84), 26 states have call successors, (26), 14 states have call predecessors, (26), 14 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2022-07-12 11:07:27,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-07-12 11:07:27,692 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:07:27,693 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 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] [2022-07-12 11:07:27,693 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:07:27,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:07:27,699 INFO L85 PathProgramCache]: Analyzing trace with hash 2047836461, now seen corresponding path program 1 times [2022-07-12 11:07:27,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:07:27,707 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401759365] [2022-07-12 11:07:27,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:07:27,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:07:28,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:07:28,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:07:28,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:07:28,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 11:07:28,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:07:28,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 11:07:28,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:07:28,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 11:07:28,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:07:28,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 11:07:28,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:07:28,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401759365] [2022-07-12 11:07:28,365 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2022-07-12 11:07:28,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2113173585] [2022-07-12 11:07:28,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:07:28,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:07:28,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:07:28,368 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-12 11:07:28,369 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-12 11:07:28,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:07:28,882 INFO L263 TraceCheckSpWp]: Trace formula consists of 2325 conjuncts, 1 conjunts are in the unsatisfiable core [2022-07-12 11:07:28,890 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:07:28,928 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2022-07-12 11:07:28,930 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 11:07:28,930 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2113173585] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:07:28,931 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:07:28,931 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 11:07:28,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292030051] [2022-07-12 11:07:28,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:07:28,938 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-12 11:07:28,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:07:28,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-12 11:07:28,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 11:07:28,970 INFO L87 Difference]: Start difference. First operand has 115 states, 73 states have (on average 1.1506849315068493) internal successors, (84), 74 states have internal predecessors, (84), 26 states have call successors, (26), 14 states have call predecessors, (26), 14 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-12 11:07:29,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:07:29,015 INFO L93 Difference]: Finished difference Result 222 states and 274 transitions. [2022-07-12 11:07:29,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-12 11:07:29,017 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 106 [2022-07-12 11:07:29,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:07:29,026 INFO L225 Difference]: With dead ends: 222 [2022-07-12 11:07:29,027 INFO L226 Difference]: Without dead ends: 109 [2022-07-12 11:07:29,035 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 117 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-12 11:07:29,043 INFO L413 NwaCegarLoop]: 134 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, 134 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-12 11:07:29,044 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 11:07:29,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-07-12 11:07:29,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2022-07-12 11:07:29,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 68 states have (on average 1.1323529411764706) internal successors, (77), 69 states have internal predecessors, (77), 26 states have call successors, (26), 14 states have call predecessors, (26), 14 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2022-07-12 11:07:29,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 128 transitions. [2022-07-12 11:07:29,082 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 128 transitions. Word has length 106 [2022-07-12 11:07:29,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:07:29,082 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 128 transitions. [2022-07-12 11:07:29,083 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-12 11:07:29,083 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 128 transitions. [2022-07-12 11:07:29,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-07-12 11:07:29,085 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:07:29,086 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 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] [2022-07-12 11:07:29,127 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-12 11:07:29,319 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-12 11:07:29,320 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:07:29,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:07:29,320 INFO L85 PathProgramCache]: Analyzing trace with hash -637484239, now seen corresponding path program 1 times [2022-07-12 11:07:29,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:07:29,321 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636094286] [2022-07-12 11:07:29,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:07:29,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:07:29,439 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-12 11:07:29,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2032419094] [2022-07-12 11:07:29,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:07:29,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:07:29,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:07:29,442 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-12 11:07:29,444 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-12 11:07:29,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:07:29,988 INFO L263 TraceCheckSpWp]: Trace formula consists of 2325 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-12 11:07:29,993 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:07:30,053 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-07-12 11:07:30,054 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 11:07:30,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:07:30,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636094286] [2022-07-12 11:07:30,054 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-12 11:07:30,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2032419094] [2022-07-12 11:07:30,055 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2032419094] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:07:30,055 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:07:30,055 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 11:07:30,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984572385] [2022-07-12 11:07:30,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:07:30,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 11:07:30,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:07:30,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 11:07:30,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 11:07:30,059 INFO L87 Difference]: Start difference. First operand 109 states and 128 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (17), 3 states have call predecessors, (17), 2 states have call successors, (17) [2022-07-12 11:07:30,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:07:30,104 INFO L93 Difference]: Finished difference Result 211 states and 248 transitions. [2022-07-12 11:07:30,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 11:07:30,105 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (17), 3 states have call predecessors, (17), 2 states have call successors, (17) Word has length 106 [2022-07-12 11:07:30,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:07:30,107 INFO L225 Difference]: With dead ends: 211 [2022-07-12 11:07:30,110 INFO L226 Difference]: Without dead ends: 114 [2022-07-12 11:07:30,112 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 102 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-12 11:07:30,112 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 2 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 495 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 11:07:30,113 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 495 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 11:07:30,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-07-12 11:07:30,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2022-07-12 11:07:30,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 72 states have (on average 1.125) internal successors, (81), 73 states have internal predecessors, (81), 26 states have call successors, (26), 14 states have call predecessors, (26), 15 states have return successors, (26), 26 states have call predecessors, (26), 25 states have call successors, (26) [2022-07-12 11:07:30,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 133 transitions. [2022-07-12 11:07:30,126 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 133 transitions. Word has length 106 [2022-07-12 11:07:30,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:07:30,127 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 133 transitions. [2022-07-12 11:07:30,128 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (17), 3 states have call predecessors, (17), 2 states have call successors, (17) [2022-07-12 11:07:30,128 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 133 transitions. [2022-07-12 11:07:30,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-07-12 11:07:30,130 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:07:30,130 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 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] [2022-07-12 11:07:30,161 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-12 11:07:30,351 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-12 11:07:30,351 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:07:30,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:07:30,352 INFO L85 PathProgramCache]: Analyzing trace with hash -810988303, now seen corresponding path program 1 times [2022-07-12 11:07:30,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:07:30,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394481227] [2022-07-12 11:07:30,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:07:30,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:07:30,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:07:30,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:07:30,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:07:30,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 11:07:30,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:07:30,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 11:07:30,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:07:30,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 11:07:30,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:07:30,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 11:07:30,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:07:30,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:07:30,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:07:30,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:07:30,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:07:30,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:07:30,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:07:30,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 11:07:30,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:07:30,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-12 11:07:30,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:07:30,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:07:30,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:07:30,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-12 11:07:30,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:07:30,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-12 11:07:30,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:07:30,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-12 11:07:30,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:07:30,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:07:30,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:07:30,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:07:30,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:07:30,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:07:30,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:07:30,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-12 11:07:30,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:07:30,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-12 11:07:30,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:07:30,975 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2022-07-12 11:07:30,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:07:30,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394481227] [2022-07-12 11:07:30,976 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394481227] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:07:30,976 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:07:30,976 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-07-12 11:07:30,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262911067] [2022-07-12 11:07:30,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:07:30,977 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-12 11:07:30,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:07:30,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-12 11:07:30,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2022-07-12 11:07:30,978 INFO L87 Difference]: Start difference. First operand 114 states and 133 transitions. Second operand has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 10 states have internal predecessors, (50), 4 states have call successors, (17), 5 states have call predecessors, (17), 3 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) [2022-07-12 11:07:31,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:07:31,820 INFO L93 Difference]: Finished difference Result 220 states and 258 transitions. [2022-07-12 11:07:31,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-12 11:07:31,820 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 10 states have internal predecessors, (50), 4 states have call successors, (17), 5 states have call predecessors, (17), 3 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) Word has length 118 [2022-07-12 11:07:31,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:07:31,823 INFO L225 Difference]: With dead ends: 220 [2022-07-12 11:07:31,823 INFO L226 Difference]: Without dead ends: 130 [2022-07-12 11:07:31,824 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=102, Invalid=360, Unknown=0, NotChecked=0, Total=462 [2022-07-12 11:07:31,825 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 88 mSDsluCounter, 516 mSDsCounter, 0 mSdLazyCounter, 729 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 624 SdHoareTripleChecker+Invalid, 786 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 729 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-12 11:07:31,825 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 624 Invalid, 786 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 729 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-12 11:07:31,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-07-12 11:07:31,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 119. [2022-07-12 11:07:31,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 76 states have (on average 1.131578947368421) internal successors, (86), 78 states have internal predecessors, (86), 26 states have call successors, (26), 14 states have call predecessors, (26), 16 states have return successors, (27), 26 states have call predecessors, (27), 25 states have call successors, (27) [2022-07-12 11:07:31,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 139 transitions. [2022-07-12 11:07:31,844 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 139 transitions. Word has length 118 [2022-07-12 11:07:31,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:07:31,846 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 139 transitions. [2022-07-12 11:07:31,846 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 10 states have internal predecessors, (50), 4 states have call successors, (17), 5 states have call predecessors, (17), 3 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) [2022-07-12 11:07:31,846 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 139 transitions. [2022-07-12 11:07:31,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-07-12 11:07:31,850 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:07:31,851 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 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] [2022-07-12 11:07:31,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-12 11:07:31,851 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:07:31,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:07:31,852 INFO L85 PathProgramCache]: Analyzing trace with hash -367087629, now seen corresponding path program 1 times [2022-07-12 11:07:31,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:07:31,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648049473] [2022-07-12 11:07:31,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:07:31,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:07:31,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:07:32,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:07:32,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:07:32,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 11:07:32,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:07:32,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 11:07:32,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:07:32,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 11:07:32,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:07:32,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 11:07:32,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:07:32,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:07:32,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:07:32,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:07:32,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:07:32,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:07:32,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:07:32,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 11:07:32,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:07:32,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-12 11:07:32,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:07:32,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:07:32,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:07:32,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-12 11:07:32,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:07:32,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-12 11:07:32,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:07:32,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-12 11:07:32,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:07:32,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:07:32,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:07:32,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:07:32,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:07:32,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:07:32,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:07:32,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-12 11:07:32,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:07:32,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-12 11:07:32,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:07:32,312 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2022-07-12 11:07:32,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:07:32,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648049473] [2022-07-12 11:07:32,313 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648049473] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:07:32,313 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:07:32,313 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 11:07:32,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113494461] [2022-07-12 11:07:32,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:07:32,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 11:07:32,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:07:32,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 11:07:32,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-12 11:07:32,315 INFO L87 Difference]: Start difference. First operand 119 states and 139 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (17), 5 states have call predecessors, (17), 2 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2022-07-12 11:07:32,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:07:32,657 INFO L93 Difference]: Finished difference Result 227 states and 266 transitions. [2022-07-12 11:07:32,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 11:07:32,657 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (17), 5 states have call predecessors, (17), 2 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) Word has length 118 [2022-07-12 11:07:32,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:07:32,659 INFO L225 Difference]: With dead ends: 227 [2022-07-12 11:07:32,659 INFO L226 Difference]: Without dead ends: 125 [2022-07-12 11:07:32,660 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-07-12 11:07:32,661 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 98 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 11:07:32,661 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 363 Invalid, 372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 302 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-12 11:07:32,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2022-07-12 11:07:32,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 117. [2022-07-12 11:07:32,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 74 states have (on average 1.1081081081081081) internal successors, (82), 76 states have internal predecessors, (82), 26 states have call successors, (26), 14 states have call predecessors, (26), 16 states have return successors, (27), 26 states have call predecessors, (27), 25 states have call successors, (27) [2022-07-12 11:07:32,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 135 transitions. [2022-07-12 11:07:32,672 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 135 transitions. Word has length 118 [2022-07-12 11:07:32,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:07:32,672 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 135 transitions. [2022-07-12 11:07:32,673 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (17), 5 states have call predecessors, (17), 2 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2022-07-12 11:07:32,673 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 135 transitions. [2022-07-12 11:07:32,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-07-12 11:07:32,674 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:07:32,675 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 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] [2022-07-12 11:07:32,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-12 11:07:32,675 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:07:32,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:07:32,675 INFO L85 PathProgramCache]: Analyzing trace with hash 1450180354, now seen corresponding path program 1 times [2022-07-12 11:07:32,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:07:32,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887186686] [2022-07-12 11:07:32,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:07:32,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:07:32,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:07:32,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:07:32,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:07:32,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 11:07:32,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:07:32,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 11:07:32,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:07:32,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 11:07:32,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:07:32,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 11:07:32,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:07:32,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:07:32,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:07:32,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:07:32,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:07:32,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:07:32,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:07:32,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 11:07:32,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:07:32,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-12 11:07:32,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:07:32,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:07:32,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:07:32,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-12 11:07:32,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:07:32,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-12 11:07:32,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:07:33,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-12 11:07:33,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:07:33,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-12 11:07:33,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:07:33,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:07:33,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:07:33,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:07:33,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:07:33,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:07:33,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:07:33,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-07-12 11:07:33,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:07:33,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-12 11:07:33,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:07:33,077 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2022-07-12 11:07:33,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:07:33,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887186686] [2022-07-12 11:07:33,078 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887186686] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:07:33,078 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:07:33,078 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-12 11:07:33,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758062777] [2022-07-12 11:07:33,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:07:33,079 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 11:07:33,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:07:33,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 11:07:33,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-07-12 11:07:33,080 INFO L87 Difference]: Start difference. First operand 117 states and 135 transitions. Second operand has 10 states, 9 states have (on average 6.0) internal successors, (54), 7 states have internal predecessors, (54), 3 states have call successors, (18), 5 states have call predecessors, (18), 3 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) [2022-07-12 11:07:33,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:07:33,658 INFO L93 Difference]: Finished difference Result 220 states and 255 transitions. [2022-07-12 11:07:33,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-12 11:07:33,659 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.0) internal successors, (54), 7 states have internal predecessors, (54), 3 states have call successors, (18), 5 states have call predecessors, (18), 3 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) Word has length 124 [2022-07-12 11:07:33,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:07:33,660 INFO L225 Difference]: With dead ends: 220 [2022-07-12 11:07:33,660 INFO L226 Difference]: Without dead ends: 125 [2022-07-12 11:07:33,661 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-07-12 11:07:33,662 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 125 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 406 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 501 SdHoareTripleChecker+Invalid, 505 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-12 11:07:33,662 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 501 Invalid, 505 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 406 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-12 11:07:33,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2022-07-12 11:07:33,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 117. [2022-07-12 11:07:33,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 74 states have (on average 1.0945945945945945) internal successors, (81), 76 states have internal predecessors, (81), 26 states have call successors, (26), 14 states have call predecessors, (26), 16 states have return successors, (27), 26 states have call predecessors, (27), 25 states have call successors, (27) [2022-07-12 11:07:33,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 134 transitions. [2022-07-12 11:07:33,672 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 134 transitions. Word has length 124 [2022-07-12 11:07:33,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:07:33,672 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 134 transitions. [2022-07-12 11:07:33,672 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.0) internal successors, (54), 7 states have internal predecessors, (54), 3 states have call successors, (18), 5 states have call predecessors, (18), 3 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) [2022-07-12 11:07:33,673 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 134 transitions. [2022-07-12 11:07:33,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2022-07-12 11:07:33,674 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:07:33,674 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-07-12 11:07:33,674 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-12 11:07:33,675 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:07:33,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:07:33,675 INFO L85 PathProgramCache]: Analyzing trace with hash -407882531, now seen corresponding path program 1 times [2022-07-12 11:07:33,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:07:33,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875514067] [2022-07-12 11:07:33,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:07:33,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:07:34,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:07:34,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:07:34,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:07:34,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 11:07:34,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:07:34,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 11:07:34,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:07:34,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 11:07:34,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:07:34,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 11:07:34,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:07:34,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:07:34,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:07:34,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:07:34,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:07:34,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:07:34,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:07:34,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 11:07:34,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:07:34,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-12 11:07:34,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:07:34,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:07:34,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:07:34,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-12 11:07:34,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:07:34,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-12 11:07:34,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:07:34,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:07:34,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:07:34,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-12 11:07:34,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:07:34,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-12 11:07:34,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:07:34,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:07:34,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:07:34,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:07:34,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:07:34,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:07:34,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:07:34,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-12 11:07:34,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:07:34,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-12 11:07:34,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:07:34,383 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2022-07-12 11:07:34,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:07:34,383 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875514067] [2022-07-12 11:07:34,383 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875514067] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:07:34,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [898498469] [2022-07-12 11:07:34,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:07:34,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:07:34,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:07:34,385 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-12 11:07:34,397 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-12 11:07:34,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:07:34,812 INFO L263 TraceCheckSpWp]: Trace formula consists of 2387 conjuncts, 107 conjunts are in the unsatisfiable core [2022-07-12 11:07:34,820 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:07:34,933 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-12 11:07:34,933 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 11:07:34,933 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [898498469] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:07:34,934 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 11:07:34,934 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 12 [2022-07-12 11:07:34,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818034688] [2022-07-12 11:07:34,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:07:34,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 11:07:34,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:07:34,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 11:07:34,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2022-07-12 11:07:34,936 INFO L87 Difference]: Start difference. First operand 117 states and 134 transitions. Second operand has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 4 states have call successors, (22), 2 states have call predecessors, (22), 4 states have return successors, (21), 4 states have call predecessors, (21), 4 states have call successors, (21) [2022-07-12 11:07:35,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:07:35,048 INFO L93 Difference]: Finished difference Result 224 states and 255 transitions. [2022-07-12 11:07:35,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 11:07:35,049 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 4 states have call successors, (22), 2 states have call predecessors, (22), 4 states have return successors, (21), 4 states have call predecessors, (21), 4 states have call successors, (21) Word has length 129 [2022-07-12 11:07:35,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:07:35,050 INFO L225 Difference]: With dead ends: 224 [2022-07-12 11:07:35,050 INFO L226 Difference]: Without dead ends: 119 [2022-07-12 11:07:35,051 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 165 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-12 11:07:35,051 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 18 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 521 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 11:07:35,052 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 521 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 11:07:35,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-07-12 11:07:35,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2022-07-12 11:07:35,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 75 states have (on average 1.0933333333333333) internal successors, (82), 78 states have internal predecessors, (82), 26 states have call successors, (26), 14 states have call predecessors, (26), 17 states have return successors, (28), 26 states have call predecessors, (28), 25 states have call successors, (28) [2022-07-12 11:07:35,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 136 transitions. [2022-07-12 11:07:35,061 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 136 transitions. Word has length 129 [2022-07-12 11:07:35,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:07:35,061 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 136 transitions. [2022-07-12 11:07:35,062 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 4 states have call successors, (22), 2 states have call predecessors, (22), 4 states have return successors, (21), 4 states have call predecessors, (21), 4 states have call successors, (21) [2022-07-12 11:07:35,062 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 136 transitions. [2022-07-12 11:07:35,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-07-12 11:07:35,063 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:07:35,064 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 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] [2022-07-12 11:07:35,088 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-12 11:07:35,277 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:07:35,278 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:07:35,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:07:35,278 INFO L85 PathProgramCache]: Analyzing trace with hash 118090552, now seen corresponding path program 1 times [2022-07-12 11:07:35,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:07:35,279 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850841010] [2022-07-12 11:07:35,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:07:35,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:07:35,334 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-12 11:07:35,334 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1545969824] [2022-07-12 11:07:35,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:07:35,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:07:35,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:07:35,336 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-12 11:07:35,343 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-12 11:07:35,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:07:35,793 INFO L263 TraceCheckSpWp]: Trace formula consists of 2492 conjuncts, 21 conjunts are in the unsatisfiable core [2022-07-12 11:07:35,799 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:07:35,858 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 18 proven. 8 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2022-07-12 11:07:35,859 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 11:07:36,187 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2022-07-12 11:07:36,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:07:36,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850841010] [2022-07-12 11:07:36,188 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-12 11:07:36,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1545969824] [2022-07-12 11:07:36,188 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1545969824] provided 1 perfect and 1 imperfect interpolant sequences [2022-07-12 11:07:36,189 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 11:07:36,189 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 13 [2022-07-12 11:07:36,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725292266] [2022-07-12 11:07:36,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:07:36,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 11:07:36,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:07:36,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 11:07:36,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2022-07-12 11:07:36,191 INFO L87 Difference]: Start difference. First operand 119 states and 136 transitions. Second operand has 8 states, 8 states have (on average 8.625) internal successors, (69), 7 states have internal predecessors, (69), 3 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2022-07-12 11:07:36,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:07:36,276 INFO L93 Difference]: Finished difference Result 169 states and 190 transitions. [2022-07-12 11:07:36,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 11:07:36,277 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 7 states have internal predecessors, (69), 3 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) Word has length 135 [2022-07-12 11:07:36,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:07:36,278 INFO L225 Difference]: With dead ends: 169 [2022-07-12 11:07:36,278 INFO L226 Difference]: Without dead ends: 117 [2022-07-12 11:07:36,279 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 256 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2022-07-12 11:07:36,279 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 3 mSDsluCounter, 666 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 783 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 11:07:36,280 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 783 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 11:07:36,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2022-07-12 11:07:36,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 112. [2022-07-12 11:07:36,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 70 states have (on average 1.0714285714285714) internal successors, (75), 72 states have internal predecessors, (75), 26 states have call successors, (26), 14 states have call predecessors, (26), 15 states have return successors, (26), 25 states have call predecessors, (26), 25 states have call successors, (26) [2022-07-12 11:07:36,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 127 transitions. [2022-07-12 11:07:36,288 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 127 transitions. Word has length 135 [2022-07-12 11:07:36,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:07:36,288 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 127 transitions. [2022-07-12 11:07:36,289 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 7 states have internal predecessors, (69), 3 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2022-07-12 11:07:36,289 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 127 transitions. [2022-07-12 11:07:36,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2022-07-12 11:07:36,290 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:07:36,290 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-07-12 11:07:36,321 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-12 11:07:36,515 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:07:36,516 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:07:36,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:07:36,516 INFO L85 PathProgramCache]: Analyzing trace with hash -1559546925, now seen corresponding path program 1 times [2022-07-12 11:07:36,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:07:36,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483647057] [2022-07-12 11:07:36,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:07:36,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:07:36,574 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-12 11:07:36,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [739264212] [2022-07-12 11:07:36,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:07:36,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:07:36,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:07:36,576 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-12 11:07:36,577 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-12 11:07:37,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:07:37,117 INFO L263 TraceCheckSpWp]: Trace formula consists of 2597 conjuncts, 203 conjunts are in the unsatisfiable core [2022-07-12 11:07:37,128 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:07:37,155 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-12 11:07:37,372 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-12 11:07:37,373 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-12 11:07:37,407 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-07-12 11:07:37,776 INFO L356 Elim1Store]: treesize reduction 130, result has 17.2 percent of original size [2022-07-12 11:07:37,776 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 11 case distinctions, treesize of input 115 treesize of output 121 [2022-07-12 11:07:38,112 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 11:07:38,113 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-12 11:07:38,178 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:07:38,191 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-07-12 11:07:38,191 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 22 treesize of output 29 [2022-07-12 11:07:38,262 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 11 treesize of output 7 [2022-07-12 11:07:38,269 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 11:07:38,274 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:07:38,275 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:07:38,276 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2022-07-12 11:07:38,921 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:07:38,982 INFO L356 Elim1Store]: treesize reduction 126, result has 25.9 percent of original size [2022-07-12 11:07:38,982 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 38 treesize of output 65 [2022-07-12 11:07:39,109 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2022-07-12 11:07:39,116 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:07:39,117 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-07-12 11:07:39,125 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-12 11:07:39,229 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-07-12 11:07:39,310 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_820 (Array Int Int))) (= |c_#memory_int| (store |c_old(#memory_int)| |c_aws_mul_size_checked_#in~r#1.base| v_ArrVal_820))) (exists ((v_ArrVal_818 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.offset)| |c_aws_mul_size_checked_#in~r#1.base| v_ArrVal_818) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_819 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |c_aws_mul_size_checked_#in~r#1.base| v_ArrVal_819) |c_#memory_$Pointer$.base|))) is different from true [2022-07-12 11:07:39,443 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-07-12 11:07:39,511 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_822 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_aws_add_size_checked_#in~r#1.base| v_ArrVal_822))) (exists ((v_ArrVal_821 (Array Int Int))) (= (store |c_old(#memory_int)| |c_aws_add_size_checked_#in~r#1.base| v_ArrVal_821) |c_#memory_int|)) (exists ((v_ArrVal_823 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_aws_add_size_checked_#in~r#1.base| v_ArrVal_823)))) is different from true [2022-07-12 11:07:39,677 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:07:39,678 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:07:39,679 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2022-07-12 11:07:39,691 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:07:39,694 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-07-12 11:07:39,702 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:07:39,704 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:07:39,705 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 54 [2022-07-12 11:07:39,713 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:07:39,716 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:07:39,731 INFO L356 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2022-07-12 11:07:39,732 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 28 [2022-07-12 11:07:40,203 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 11:07:40,204 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 45 [2022-07-12 11:07:40,209 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 27 treesize of output 7 [2022-07-12 11:07:40,346 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 28 proven. 52 refuted. 0 times theorem prover too weak. 4 trivial. 6 not checked. [2022-07-12 11:07:40,346 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 11:07:41,141 INFO L356 Elim1Store]: treesize reduction 8, result has 77.1 percent of original size [2022-07-12 11:07:41,142 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 3574 treesize of output 3089 [2022-07-12 11:07:41,172 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 11:07:41,173 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 3062 treesize of output 2796 [2022-07-12 11:07:41,202 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 11:07:41,203 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 2774 treesize of output 2220 [2022-07-12 11:08:43,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:08:43,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483647057] [2022-07-12 11:08:43,017 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-12 11:08:43,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [739264212] [2022-07-12 11:08:43,017 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [739264212] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:08:43,017 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-07-12 11:08:43,017 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2022-07-12 11:08:43,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999121370] [2022-07-12 11:08:43,018 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-07-12 11:08:43,018 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-07-12 11:08:43,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:08:43,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-07-12 11:08:43,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=2003, Unknown=15, NotChecked=182, Total=2352 [2022-07-12 11:08:43,020 INFO L87 Difference]: Start difference. First operand 112 states and 127 transitions. Second operand has 41 states, 34 states have (on average 2.676470588235294) internal successors, (91), 35 states have internal predecessors, (91), 18 states have call successors, (24), 9 states have call predecessors, (24), 13 states have return successors, (23), 17 states have call predecessors, (23), 17 states have call successors, (23) [2022-07-12 11:08:43,373 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_820 (Array Int Int))) (= |c_#memory_int| (store |c_old(#memory_int)| |c_aws_mul_size_checked_#in~r#1.base| v_ArrVal_820))) (exists ((v_ArrVal_818 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.offset)| |c_aws_mul_size_checked_#in~r#1.base| v_ArrVal_818) |c_#memory_$Pointer$.offset|)) (exists ((|v___CPROVER_overflow_mult_~#c~1.base_73| Int) (v_ArrVal_806 Int)) (and (= (select |c_old(#valid)| |v___CPROVER_overflow_mult_~#c~1.base_73|) 0) (= |c_#valid| (store |c_old(#valid)| |v___CPROVER_overflow_mult_~#c~1.base_73| v_ArrVal_806)))) (exists ((v_ArrVal_819 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |c_aws_mul_size_checked_#in~r#1.base| v_ArrVal_819) |c_#memory_$Pointer$.base|))) is different from true [2022-07-12 11:08:43,616 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_822 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_aws_add_size_checked_#in~r#1.base| v_ArrVal_822))) (exists ((v_ArrVal_821 (Array Int Int))) (= (store |c_old(#memory_int)| |c_aws_add_size_checked_#in~r#1.base| v_ArrVal_821) |c_#memory_int|)) (exists ((|v___CPROVER_overflow_plus_~#c~0.base_19| Int)) (and (= |c_#valid| (store |c_old(#valid)| |v___CPROVER_overflow_plus_~#c~0.base_19| 0)) (= (select |c_old(#valid)| |v___CPROVER_overflow_plus_~#c~0.base_19|) 0))) (exists ((v_ArrVal_823 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_aws_add_size_checked_#in~r#1.base| v_ArrVal_823)))) is different from true [2022-07-12 11:08:44,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:08:44,486 INFO L93 Difference]: Finished difference Result 214 states and 239 transitions. [2022-07-12 11:08:44,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-07-12 11:08:44,487 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 34 states have (on average 2.676470588235294) internal successors, (91), 35 states have internal predecessors, (91), 18 states have call successors, (24), 9 states have call predecessors, (24), 13 states have return successors, (23), 17 states have call predecessors, (23), 17 states have call successors, (23) Word has length 141 [2022-07-12 11:08:44,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:08:44,489 INFO L225 Difference]: With dead ends: 214 [2022-07-12 11:08:44,489 INFO L226 Difference]: Without dead ends: 209 [2022-07-12 11:08:44,490 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 107 SyntacticMatches, 15 SemanticMatches, 65 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1231 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=262, Invalid=3640, Unknown=20, NotChecked=500, Total=4422 [2022-07-12 11:08:44,491 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 127 mSDsluCounter, 827 mSDsCounter, 0 mSdLazyCounter, 537 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 941 SdHoareTripleChecker+Invalid, 2321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 537 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1702 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-12 11:08:44,491 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 941 Invalid, 2321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 537 Invalid, 0 Unknown, 1702 Unchecked, 0.5s Time] [2022-07-12 11:08:44,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2022-07-12 11:08:44,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 198. [2022-07-12 11:08:44,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 128 states have (on average 1.0546875) internal successors, (135), 132 states have internal predecessors, (135), 40 states have call successors, (40), 26 states have call predecessors, (40), 29 states have return successors, (45), 39 states have call predecessors, (45), 39 states have call successors, (45) [2022-07-12 11:08:44,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 220 transitions. [2022-07-12 11:08:44,505 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 220 transitions. Word has length 141 [2022-07-12 11:08:44,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:08:44,505 INFO L495 AbstractCegarLoop]: Abstraction has 198 states and 220 transitions. [2022-07-12 11:08:44,506 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 34 states have (on average 2.676470588235294) internal successors, (91), 35 states have internal predecessors, (91), 18 states have call successors, (24), 9 states have call predecessors, (24), 13 states have return successors, (23), 17 states have call predecessors, (23), 17 states have call successors, (23) [2022-07-12 11:08:44,506 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 220 transitions. [2022-07-12 11:08:44,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2022-07-12 11:08:44,508 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:08:44,508 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-07-12 11:08:44,545 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-07-12 11:08:44,723 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:08:44,724 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:08:44,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:08:44,724 INFO L85 PathProgramCache]: Analyzing trace with hash -1247111653, now seen corresponding path program 1 times [2022-07-12 11:08:44,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:08:44,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388869481] [2022-07-12 11:08:44,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:08:44,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:08:44,810 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-12 11:08:44,810 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [314161920] [2022-07-12 11:08:44,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:08:44,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:08:44,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:08:44,812 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-12 11:08:44,813 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-12 11:08:45,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:08:45,317 INFO L263 TraceCheckSpWp]: Trace formula consists of 2601 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-12 11:08:45,321 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:08:45,354 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2022-07-12 11:08:45,354 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 11:08:45,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:08:45,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388869481] [2022-07-12 11:08:45,355 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-12 11:08:45,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [314161920] [2022-07-12 11:08:45,355 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [314161920] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:08:45,355 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:08:45,355 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 11:08:45,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877718270] [2022-07-12 11:08:45,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:08:45,357 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 11:08:45,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:08:45,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 11:08:45,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-12 11:08:45,358 INFO L87 Difference]: Start difference. First operand 198 states and 220 transitions. Second operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 6 states have internal predecessors, (80), 2 states have call successors, (23), 2 states have call predecessors, (23), 4 states have return successors, (23), 4 states have call predecessors, (23), 2 states have call successors, (23) [2022-07-12 11:08:45,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:08:45,399 INFO L93 Difference]: Finished difference Result 306 states and 342 transitions. [2022-07-12 11:08:45,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 11:08:45,399 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 6 states have internal predecessors, (80), 2 states have call successors, (23), 2 states have call predecessors, (23), 4 states have return successors, (23), 4 states have call predecessors, (23), 2 states have call successors, (23) Word has length 147 [2022-07-12 11:08:45,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:08:45,403 INFO L225 Difference]: With dead ends: 306 [2022-07-12 11:08:45,404 INFO L226 Difference]: Without dead ends: 191 [2022-07-12 11:08:45,404 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 141 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-12 11:08:45,407 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 2 mSDsluCounter, 609 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 734 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 11:08:45,407 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 734 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 11:08:45,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2022-07-12 11:08:45,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2022-07-12 11:08:45,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 124 states have (on average 1.0403225806451613) internal successors, (129), 127 states have internal predecessors, (129), 38 states have call successors, (38), 26 states have call predecessors, (38), 28 states have return successors, (42), 37 states have call predecessors, (42), 37 states have call successors, (42) [2022-07-12 11:08:45,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 209 transitions. [2022-07-12 11:08:45,428 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 209 transitions. Word has length 147 [2022-07-12 11:08:45,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:08:45,428 INFO L495 AbstractCegarLoop]: Abstraction has 191 states and 209 transitions. [2022-07-12 11:08:45,428 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 6 states have internal predecessors, (80), 2 states have call successors, (23), 2 states have call predecessors, (23), 4 states have return successors, (23), 4 states have call predecessors, (23), 2 states have call successors, (23) [2022-07-12 11:08:45,429 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 209 transitions. [2022-07-12 11:08:45,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2022-07-12 11:08:45,432 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:08:45,432 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-07-12 11:08:45,461 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-12 11:08:45,647 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:08:45,647 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:08:45,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:08:45,648 INFO L85 PathProgramCache]: Analyzing trace with hash -1135210311, now seen corresponding path program 1 times [2022-07-12 11:08:45,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:08:45,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92888061] [2022-07-12 11:08:45,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:08:45,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:08:45,709 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-12 11:08:45,710 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [72753820] [2022-07-12 11:08:45,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:08:45,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:08:45,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:08:45,711 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-12 11:08:45,713 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-12 11:08:46,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:08:46,208 INFO L263 TraceCheckSpWp]: Trace formula consists of 2601 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-12 11:08:46,212 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:08:46,245 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2022-07-12 11:08:46,245 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 11:08:46,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:08:46,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92888061] [2022-07-12 11:08:46,245 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-12 11:08:46,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [72753820] [2022-07-12 11:08:46,245 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [72753820] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:08:46,246 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:08:46,246 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 11:08:46,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273597005] [2022-07-12 11:08:46,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:08:46,246 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 11:08:46,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:08:46,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 11:08:46,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-12 11:08:46,247 INFO L87 Difference]: Start difference. First operand 191 states and 209 transitions. Second operand has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 6 states have internal predecessors, (72), 2 states have call successors, (21), 2 states have call predecessors, (21), 4 states have return successors, (21), 4 states have call predecessors, (21), 2 states have call successors, (21) [2022-07-12 11:08:46,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:08:46,287 INFO L93 Difference]: Finished difference Result 265 states and 283 transitions. [2022-07-12 11:08:46,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 11:08:46,288 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 6 states have internal predecessors, (72), 2 states have call successors, (21), 2 states have call predecessors, (21), 4 states have return successors, (21), 4 states have call predecessors, (21), 2 states have call successors, (21) Word has length 147 [2022-07-12 11:08:46,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:08:46,289 INFO L225 Difference]: With dead ends: 265 [2022-07-12 11:08:46,289 INFO L226 Difference]: Without dead ends: 153 [2022-07-12 11:08:46,290 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 141 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-12 11:08:46,291 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 2 mSDsluCounter, 590 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 711 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 11:08:46,291 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 711 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 11:08:46,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2022-07-12 11:08:46,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 150. [2022-07-12 11:08:46,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 98 states have (on average 1.030612244897959) internal successors, (101), 100 states have internal predecessors, (101), 28 states have call successors, (28), 23 states have call predecessors, (28), 23 states have return successors, (27), 26 states have call predecessors, (27), 27 states have call successors, (27) [2022-07-12 11:08:46,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 156 transitions. [2022-07-12 11:08:46,302 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 156 transitions. Word has length 147 [2022-07-12 11:08:46,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:08:46,304 INFO L495 AbstractCegarLoop]: Abstraction has 150 states and 156 transitions. [2022-07-12 11:08:46,304 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 6 states have internal predecessors, (72), 2 states have call successors, (21), 2 states have call predecessors, (21), 4 states have return successors, (21), 4 states have call predecessors, (21), 2 states have call successors, (21) [2022-07-12 11:08:46,304 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 156 transitions. [2022-07-12 11:08:46,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2022-07-12 11:08:46,306 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:08:46,306 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-07-12 11:08:46,335 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-12 11:08:46,527 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:08:46,527 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:08:46,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:08:46,528 INFO L85 PathProgramCache]: Analyzing trace with hash 1487179052, now seen corresponding path program 1 times [2022-07-12 11:08:46,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:08:46,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255989858] [2022-07-12 11:08:46,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:08:46,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:08:46,588 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-12 11:08:46,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [503164085] [2022-07-12 11:08:46,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:08:46,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:08:46,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:08:46,590 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-12 11:08:46,591 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-12 11:08:47,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:08:47,099 INFO L263 TraceCheckSpWp]: Trace formula consists of 2642 conjuncts, 242 conjunts are in the unsatisfiable core [2022-07-12 11:08:47,108 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:08:47,121 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-12 11:08:47,319 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-12 11:08:47,319 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-12 11:08:47,351 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-12 11:08:47,691 INFO L356 Elim1Store]: treesize reduction 183, result has 22.1 percent of original size [2022-07-12 11:08:47,692 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 74 treesize of output 105 [2022-07-12 11:08:47,978 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-12 11:08:48,049 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:08:48,060 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 11:08:48,061 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 26 [2022-07-12 11:08:48,141 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 11 treesize of output 7 [2022-07-12 11:08:48,152 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 11:08:48,159 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 25 treesize of output 25 [2022-07-12 11:08:48,794 INFO L356 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-07-12 11:08:48,794 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 29 treesize of output 37 [2022-07-12 11:08:48,905 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 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-12 11:08:48,913 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-07-12 11:08:48,918 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-12 11:08:49,009 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-07-12 11:08:49,087 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1339 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_aws_mul_size_checked_#in~r#1.base| v_ArrVal_1339))) (exists ((v_ArrVal_1337 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.offset)| |c_aws_mul_size_checked_#in~r#1.base| v_ArrVal_1337) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1338 (Array Int Int))) (= (store |c_old(#memory_int)| |c_aws_mul_size_checked_#in~r#1.base| v_ArrVal_1338) |c_#memory_int|))) is different from true [2022-07-12 11:08:49,200 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-07-12 11:08:49,248 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1340 (Array Int Int))) (= |c_#memory_int| (store |c_old(#memory_int)| |c_aws_add_size_checked_#in~r#1.base| v_ArrVal_1340))) (exists ((v_ArrVal_1341 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_aws_add_size_checked_#in~r#1.base| v_ArrVal_1341))) (exists ((v_ArrVal_1342 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_aws_add_size_checked_#in~r#1.base| v_ArrVal_1342)))) is different from true [2022-07-12 11:08:49,389 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:08:49,390 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:08:49,391 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 31 [2022-07-12 11:08:49,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:08:49,403 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:08:49,404 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 54 [2022-07-12 11:08:49,412 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:08:49,413 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-07-12 11:08:49,435 INFO L356 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2022-07-12 11:08:49,435 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 25 [2022-07-12 11:08:49,781 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2022-07-12 11:08:49,790 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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-12 11:08:49,797 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2022-07-12 11:08:49,969 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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-12 11:08:49,979 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2022-07-12 11:08:49,987 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2022-07-12 11:08:50,260 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 11:08:50,260 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 45 [2022-07-12 11:08:50,268 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 27 treesize of output 7 [2022-07-12 11:08:50,408 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 32 proven. 68 refuted. 0 times theorem prover too weak. 8 trivial. 6 not checked. [2022-07-12 11:08:50,408 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 11:08:50,893 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1348 (Array Int Int)) (v_ArrVal_1347 (Array Int Int)) (v_ArrVal_1346 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| v_ArrVal_1347))) (= (mod (select (select .cse0 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| v_ArrVal_1346) |c_ULTIMATE.start_aws_hash_table_get_entry_count_harness_~#table~0#1.base|) |c_ULTIMATE.start_aws_hash_table_get_entry_count_harness_~#table~0#1.offset|)) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| v_ArrVal_1348) |c_ULTIMATE.start_aws_hash_table_get_entry_count_harness_~#table~0#1.base|) |c_ULTIMATE.start_aws_hash_table_get_entry_count_harness_~#table~0#1.offset|) 48)) 18446744073709551616) (mod (select (select .cse0 |c_ULTIMATE.start_aws_hash_table_get_entry_count_harness_~state~14#1.base|) (+ |c_ULTIMATE.start_aws_hash_table_get_entry_count_harness_~state~14#1.offset| 48)) 18446744073709551616)))) is different from false [2022-07-12 11:08:50,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:08:50,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255989858] [2022-07-12 11:08:50,906 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-12 11:08:50,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [503164085] [2022-07-12 11:08:50,906 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [503164085] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:08:50,906 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-07-12 11:08:50,906 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2022-07-12 11:08:50,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32654133] [2022-07-12 11:08:50,906 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-07-12 11:08:50,907 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-07-12 11:08:50,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:08:50,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-07-12 11:08:50,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=1918, Unknown=12, NotChecked=270, Total=2352 [2022-07-12 11:08:50,909 INFO L87 Difference]: Start difference. First operand 150 states and 156 transitions. Second operand has 41 states, 35 states have (on average 2.657142857142857) internal successors, (93), 35 states have internal predecessors, (93), 18 states have call successors, (25), 9 states have call predecessors, (25), 12 states have return successors, (24), 17 states have call predecessors, (24), 17 states have call successors, (24) [2022-07-12 11:08:51,206 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1339 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_aws_mul_size_checked_#in~r#1.base| v_ArrVal_1339))) (exists ((v_ArrVal_1337 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.offset)| |c_aws_mul_size_checked_#in~r#1.base| v_ArrVal_1337) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1338 (Array Int Int))) (= (store |c_old(#memory_int)| |c_aws_mul_size_checked_#in~r#1.base| v_ArrVal_1338) |c_#memory_int|)) (exists ((|v___CPROVER_overflow_mult_~#c~1.base_89| Int) (v_ArrVal_1325 Int)) (and (= |c_#valid| (store |c_old(#valid)| |v___CPROVER_overflow_mult_~#c~1.base_89| v_ArrVal_1325)) (= (select |c_old(#valid)| |v___CPROVER_overflow_mult_~#c~1.base_89|) 0)))) is different from true [2022-07-12 11:08:52,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:08:52,477 INFO L93 Difference]: Finished difference Result 160 states and 164 transitions. [2022-07-12 11:08:52,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-07-12 11:08:52,478 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 35 states have (on average 2.657142857142857) internal successors, (93), 35 states have internal predecessors, (93), 18 states have call successors, (25), 9 states have call predecessors, (25), 12 states have return successors, (24), 17 states have call predecessors, (24), 17 states have call successors, (24) Word has length 148 [2022-07-12 11:08:52,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:08:52,479 INFO L225 Difference]: With dead ends: 160 [2022-07-12 11:08:52,479 INFO L226 Difference]: Without dead ends: 158 [2022-07-12 11:08:52,481 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 103 SyntacticMatches, 16 SemanticMatches, 72 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1398 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=320, Invalid=4501, Unknown=25, NotChecked=556, Total=5402 [2022-07-12 11:08:52,481 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 153 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 467 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 520 SdHoareTripleChecker+Invalid, 1869 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 467 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1318 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-12 11:08:52,481 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 520 Invalid, 1869 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 467 Invalid, 0 Unknown, 1318 Unchecked, 0.4s Time] [2022-07-12 11:08:52,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2022-07-12 11:08:52,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 146. [2022-07-12 11:08:52,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 96 states have (on average 1.03125) internal successors, (99), 97 states have internal predecessors, (99), 26 states have call successors, (26), 23 states have call predecessors, (26), 23 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2022-07-12 11:08:52,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 150 transitions. [2022-07-12 11:08:52,490 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 150 transitions. Word has length 148 [2022-07-12 11:08:52,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:08:52,491 INFO L495 AbstractCegarLoop]: Abstraction has 146 states and 150 transitions. [2022-07-12 11:08:52,491 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 35 states have (on average 2.657142857142857) internal successors, (93), 35 states have internal predecessors, (93), 18 states have call successors, (25), 9 states have call predecessors, (25), 12 states have return successors, (24), 17 states have call predecessors, (24), 17 states have call successors, (24) [2022-07-12 11:08:52,491 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 150 transitions. [2022-07-12 11:08:52,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2022-07-12 11:08:52,493 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:08:52,493 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-07-12 11:08:52,531 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-12 11:08:52,711 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-07-12 11:08:52,712 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:08:52,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:08:52,712 INFO L85 PathProgramCache]: Analyzing trace with hash -1907889842, now seen corresponding path program 1 times [2022-07-12 11:08:52,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:08:52,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170457510] [2022-07-12 11:08:52,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:08:52,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:08:52,772 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-12 11:08:52,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [890682563] [2022-07-12 11:08:52,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:08:52,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:08:52,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:08:52,774 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 11:08:52,776 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-12 11:08:53,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:08:53,288 INFO L263 TraceCheckSpWp]: Trace formula consists of 2630 conjuncts, 119 conjunts are in the unsatisfiable core [2022-07-12 11:08:53,294 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:08:53,311 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-12 11:08:53,520 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-12 11:08:53,520 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-12 11:08:53,543 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-12 11:08:53,826 INFO L356 Elim1Store]: treesize reduction 183, result has 22.1 percent of original size [2022-07-12 11:08:53,827 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 74 treesize of output 105 [2022-07-12 11:08:53,966 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-12 11:08:54,025 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:08:54,038 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 11:08:54,039 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 26 [2022-07-12 11:08:54,109 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 11:08:54,115 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 25 treesize of output 25 [2022-07-12 11:08:54,506 INFO L356 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-07-12 11:08:54,506 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 29 treesize of output 37 [2022-07-12 11:08:54,672 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1517 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_aws_mul_size_checked_#in~r#1.base| v_ArrVal_1517))) is different from true [2022-07-12 11:08:54,754 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1518 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_aws_add_size_checked_#in~r#1.base| v_ArrVal_1518))) is different from true [2022-07-12 11:08:54,820 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:08:54,821 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:08:54,821 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 29 [2022-07-12 11:08:54,845 INFO L356 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2022-07-12 11:08:54,845 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 25 [2022-07-12 11:10:03,970 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 19 proven. 70 refuted. 0 times theorem prover too weak. 4 trivial. 6 not checked. [2022-07-12 11:10:03,970 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 11:10:06,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:10:06,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170457510] [2022-07-12 11:10:06,929 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-12 11:10:06,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [890682563] [2022-07-12 11:10:06,929 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [890682563] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:10:06,929 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-07-12 11:10:06,929 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2022-07-12 11:10:06,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035915169] [2022-07-12 11:10:06,929 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-07-12 11:10:06,930 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-07-12 11:10:06,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:10:06,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-07-12 11:10:06,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=1127, Unknown=25, NotChecked=138, Total=1406 [2022-07-12 11:10:06,931 INFO L87 Difference]: Start difference. First operand 146 states and 150 transitions. Second operand has 32 states, 29 states have (on average 3.4482758620689653) internal successors, (100), 29 states have internal predecessors, (100), 14 states have call successors, (26), 9 states have call predecessors, (26), 12 states have return successors, (25), 15 states have call predecessors, (25), 13 states have call successors, (25) [2022-07-12 11:10:30,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:10:30,887 INFO L93 Difference]: Finished difference Result 176 states and 182 transitions. [2022-07-12 11:10:30,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-07-12 11:10:30,888 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 29 states have (on average 3.4482758620689653) internal successors, (100), 29 states have internal predecessors, (100), 14 states have call successors, (26), 9 states have call predecessors, (26), 12 states have return successors, (25), 15 states have call predecessors, (25), 13 states have call successors, (25) Word has length 154 [2022-07-12 11:10:30,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:10:30,889 INFO L225 Difference]: With dead ends: 176 [2022-07-12 11:10:30,889 INFO L226 Difference]: Without dead ends: 164 [2022-07-12 11:10:30,890 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 142 SyntacticMatches, 18 SemanticMatches, 56 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 744 ImplicationChecksByTransitivity, 96.0s TimeCoverageRelationStatistics Valid=237, Invalid=2791, Unknown=60, NotChecked=218, Total=3306 [2022-07-12 11:10:30,890 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 118 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 465 SdHoareTripleChecker+Invalid, 1440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1078 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 11:10:30,891 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 465 Invalid, 1440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 273 Invalid, 0 Unknown, 1078 Unchecked, 0.3s Time] [2022-07-12 11:10:30,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2022-07-12 11:10:30,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 163. [2022-07-12 11:10:30,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 108 states have (on average 1.0277777777777777) internal successors, (111), 109 states have internal predecessors, (111), 29 states have call successors, (29), 26 states have call predecessors, (29), 25 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2022-07-12 11:10:30,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 168 transitions. [2022-07-12 11:10:30,901 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 168 transitions. Word has length 154 [2022-07-12 11:10:30,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:10:30,902 INFO L495 AbstractCegarLoop]: Abstraction has 163 states and 168 transitions. [2022-07-12 11:10:30,902 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 29 states have (on average 3.4482758620689653) internal successors, (100), 29 states have internal predecessors, (100), 14 states have call successors, (26), 9 states have call predecessors, (26), 12 states have return successors, (25), 15 states have call predecessors, (25), 13 states have call successors, (25) [2022-07-12 11:10:30,902 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 168 transitions. [2022-07-12 11:10:30,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2022-07-12 11:10:30,904 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:10:30,904 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-07-12 11:10:30,934 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-07-12 11:10:31,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:10:31,124 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:10:31,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:10:31,124 INFO L85 PathProgramCache]: Analyzing trace with hash 444745877, now seen corresponding path program 1 times [2022-07-12 11:10:31,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:10:31,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227784799] [2022-07-12 11:10:31,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:10:31,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:10:31,177 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-12 11:10:31,178 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [976408525] [2022-07-12 11:10:31,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:10:31,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:10:31,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:10:31,180 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 11:10:31,180 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-12 11:10:31,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:10:31,659 INFO L263 TraceCheckSpWp]: Trace formula consists of 2675 conjuncts, 142 conjunts are in the unsatisfiable core [2022-07-12 11:10:31,666 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:10:31,676 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-12 11:10:31,911 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-12 11:10:31,911 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-12 11:10:31,946 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-12 11:10:32,259 INFO L356 Elim1Store]: treesize reduction 173, result has 26.4 percent of original size [2022-07-12 11:10:32,260 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-12 11:10:32,432 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-12 11:10:32,488 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:10:32,498 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 11:10:32,499 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 26 [2022-07-12 11:10:32,570 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 11:10:32,575 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 25 treesize of output 25 [2022-07-12 11:10:33,083 INFO L356 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-07-12 11:10:33,083 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 29 treesize of output 37 [2022-07-12 11:10:33,172 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2022-07-12 11:10:33,178 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-12 11:10:33,283 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-07-12 11:10:33,348 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1731 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |c_aws_mul_size_checked_#in~r#1.base| v_ArrVal_1731) |c_#memory_$Pointer$.base|)) is different from true [2022-07-12 11:10:33,442 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-07-12 11:10:33,477 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1732 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |c_aws_add_size_checked_#in~r#1.base| v_ArrVal_1732) |c_#memory_$Pointer$.base|)) is different from true [2022-07-12 11:10:33,562 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:10:33,575 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 11:10:33,575 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 40 [2022-07-12 11:10:33,595 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-07-12 11:10:33,595 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-07-12 11:10:52,501 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24 [2022-07-12 11:11:09,160 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24